CN114629892A - Work comment method, system, electronic device and storage medium - Google Patents

Work comment method, system, electronic device and storage medium Download PDF

Info

Publication number
CN114629892A
CN114629892A CN202210200029.9A CN202210200029A CN114629892A CN 114629892 A CN114629892 A CN 114629892A CN 202210200029 A CN202210200029 A CN 202210200029A CN 114629892 A CN114629892 A CN 114629892A
Authority
CN
China
Prior art keywords
work
target
hash value
parameter
verified
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210200029.9A
Other languages
Chinese (zh)
Other versions
CN114629892B (en
Inventor
匡立中
邵羽
曾磊
李伟
詹士潇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Qulian Technology Co Ltd
Original Assignee
Hangzhou Qulian Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Qulian Technology Co Ltd filed Critical Hangzhou Qulian Technology Co Ltd
Priority to CN202210200029.9A priority Critical patent/CN114629892B/en
Publication of CN114629892A publication Critical patent/CN114629892A/en
Application granted granted Critical
Publication of CN114629892B publication Critical patent/CN114629892B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/13—File access structures, e.g. distributed indices
    • G06F16/137—Hash-based
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/60—Digital content management, e.g. content distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
    • H04L2463/121—Timestamp

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The application relates to a method, a system, electronic equipment and a storage medium for commenting works, which are applied to the technical field of data processing, wherein the method comprises the following steps: obtaining information to be reviewed of a target work, wherein the information to be reviewed comprises review content; determining a parameter to be verified based on the file list of the target work, wherein the parameter to be verified indicates the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work. The comment data display method and device solve the problem that comment data cannot be normally displayed on a client side or the comment data is lost once a comment system fails due to the adoption of a centralized comment system in the prior art.

Description

Work comment method, system, electronic device and storage medium
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method, a system, an electronic device, and a storage medium for commenting a work.
Background
With the rapid development of the internet in recent years, more and more multimedia works such as videos, novels and the like are presented in the public view. Taking a video as an example, when a user watches a public movie and television work in an offline video, comments with different time stamps on the movie and television work need to be loaded so as to perform man-machine interaction.
In the related art, there may not be a unified playing platform for videos distributed over a wide area network, and therefore, centralized review systems are adopted.
However, once the comment system fails, the centralized comment system may cause that the comment data cannot be displayed normally on the client or the comment data is lost.
Disclosure of Invention
The application provides a method and a system for commenting a work, electronic equipment and a storage medium, which are used for solving the problem that once a comment system fails, comment data cannot be normally displayed on a client side or the comment data is lost by adopting a centralized comment system in the prior art.
In a first aspect, an embodiment of the present application provides a method for commenting a work, which is applied to a target node of a blockchain, and the method includes:
obtaining information to be reviewed of a target work, wherein the information to be reviewed comprises review content;
determining a parameter to be verified based on the file list of the target work, wherein the parameter to be verified indicates the real existence of the target work;
judging whether the parameter to be verified meets a preset verification condition or not;
and if so, storing the comment content into the intelligent contract of the target work.
Optionally, the determining a parameter to be verified based on the file list of the target work includes:
sending the file list to a user side so that the user side determines a hash value set based on the file list;
generating a verification factor for the target work;
sending the verification factor to a user side so that the user side can determine a verification intermediate value based on the hash value set and the verification factor, and sending the verification intermediate value to the target node;
and acquiring the verification intermediate value, and determining the parameter to be verified according to the hash value set and the verification intermediate value.
Optionally, the file list includes at least one piece of work file segment; determining a set of hash values based on the file list, including:
calculating a first hash value of each segment of the work file;
determining the set of first hash values as the set of hash values.
Optionally, the to-be-verified parameter includes the hash value set and the verification intermediate value, and the verification intermediate value includes a combined hash value determined based on the hash value set, and a verification intermediate value determined based on the verification factor, the combined hash value, and the hash value set:
the judging whether the parameter to be verified meets the preset verification condition comprises the following steps:
calculating a second hash value of the verification factor and the verification intermediate value;
judging whether the number of decimal digits of the combined hash value and the second hash value is the same;
and if the verification result is the same, determining that the preset verification condition is met.
Optionally, the determining the merged hash value based on the hash value set includes:
digitizing each first hash value in the hash value set to obtain a digitized hash value of each first hash value;
determining the sum of the digitized hash values as the merged hash value.
Optionally, the method further includes:
acquiring target query parameters of a target work, wherein the target query parameters comprise a target work name or a target work hash value;
determining an intelligent contract of the target work corresponding to the target query parameter from a corresponding relation between the query parameter pre-stored in the block chain and the intelligent contract of the work;
and obtaining comment data of the target work, which is stored in the intelligent contract of the target work.
In a second aspect, an embodiment of the present application provides a method for commenting a work, which is applied to a user side, and the method includes:
acquiring information to be evaluated, and sending the information to be evaluated to a target node of a block chain; determining a parameter to be verified based on the file list of the target work corresponding to the information to be evaluated, wherein the parameter to be verified indicates the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
In a third aspect, an embodiment of the present application provides a work review system, including: a user terminal and a target node of a block chain;
the user side is used for acquiring information to be evaluated and sending the information to be evaluated to a target node of the block chain;
the target node is used for determining parameters to be verified based on the file list of the target work, and the parameters to be verified indicate the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
In a fourth aspect, an embodiment of the present application provides an electronic device, including: the system comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus; the memory for storing a computer program;
the processor is configured to execute the program stored in the memory to implement the method for commenting a work according to the first aspect or the second aspect.
In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a processor, the computer program implements the work review method of the first aspect or the second aspect.
Compared with the prior art, the technical scheme provided by the embodiment of the application has the following advantages: according to the method provided by the embodiment of the application, the information to be evaluated of the target work is obtained, and the information to be evaluated comprises the comment content; determining a parameter to be verified based on the file list of the target work, wherein the parameter to be verified indicates the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work. Therefore, the comment content is stored in the block chain, the stored comment content is verified, the true existence of the comment content is guaranteed, and the condition that data are lost due to the failure of a comment system can be avoided when comments are acquired subsequently on the basis of the decentralized feature of the block chain.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
FIG. 1 is a flow diagram of a method for reviewing a work provided by an embodiment of the present application;
FIG. 2 is a flow diagram of a method of reviewing a work provided by another embodiment of the present application;
FIG. 3 is a block diagram of a work review system provided in an embodiment of the present application;
fig. 4 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Before further detailed description of the embodiments of the present invention, terms and expressions referred to in the embodiments of the present invention are described, and the terms and expressions referred to in the embodiments of the present invention are applicable to the following explanations.
A Block chain (Blockchain) is an encrypted, chained storage structure of transactions formed from blocks (blocks).
Intelligent Contracts (Smart Contracts), also known as chain codes (chaincodes) or application codes, are programs deployed in nodes of a blockchain network, and the nodes execute the intelligent Contracts called in received transactions to update or query key-value data of a state database. The intelligent contract program is not only a computer program that can be automatically executed: it is itself a system participant. It responds to the received information, it can receive and store the value, and it can also send the information and value out.
An embodiment of the present application provides a method for commenting a work, which may be applied to any form of electronic device, such as a terminal or a server where a target node of a block chain is located. As shown in fig. 1, the method for commenting a work includes:
step 101, obtaining information to be evaluated of a target work, wherein the information to be evaluated comprises comment content.
In some embodiments, when a user wants to comment on a target work, comment content is input at a position corresponding to a certain comment timestamp of the target work at a user side, so that information to be commented is generated, and the information to be commented is uploaded, so that a target node corresponding to the user side on a block chain acquires the information to be commented.
The information to be reviewed may be, but is not limited to, review content, and a corresponding review timestamp of the review content in the target work.
Step 102, determining parameters to be verified based on the file list of the target work, wherein the parameters to be verified indicate the real existence of the target work.
In some embodiments, after obtaining the information to be evaluated, the target node obtains a file list of the target work from the intelligent contract, and then determines the parameter to be verified based on the file list, so as to determine the true existence of the target work based on the parameter to be verified.
The actual existence of the target work refers to whether the target work really exists at the user end.
In an optional embodiment, the determining a parameter to be verified based on the file list of the target work includes:
sending the file list to a user side so that the user side determines a hash value set based on the file list; generating a verification factor for the target work; sending the verification factor to a user side so that the user side can determine a verification intermediate value based on the hash value set and the verification factor, and sending the verification intermediate value to the target node; and acquiring the verification intermediate value, and determining the parameter to be verified according to the hash value set and the verification intermediate value.
In some embodiments, after obtaining the information to be evaluated, the target node performs processing based on a file list of the target work, sends the file list to the user side through interaction with the user side, and determines the hash value set based on the file list by the user side. The target node randomly generates a verification factor when the information to be commented is obtained, the verification factor is sent back to the user side, the user side calculates according to the hash value set and the verification factor to obtain a verification intermediate value, and the verification intermediate value calculated by the user side can prove that the calculated amount exists at the user side so as to determine that the target work exists at the user side. Therefore, the calculated verification intermediate value is sent to the target node, and the target node determines the to-be-verified parameters based on the verification intermediate value and the hash value set.
For example, the parameter to be verified may be a character string composed of a hash value set and the verification intermediate value.
The verification factor may be a character string randomly generated by the target node after the information to be evaluated is acquired. By means of randomly generating the verification factor, when the subsequent user side calculates according to the hash value set and the verification factor, certain calculation difficulty can be achieved, and the situations that malicious comments, unanimous comments or uploading errors are caused due to data stealing are avoided.
Further, determining a set of hash values based on the file list includes:
calculating a first hash value of each segment of the work file; determining the set of first hash values as the set of hash values.
After the target node acquires the information to be evaluated, the target work is determined according to the comment timestamp in the information to be evaluated, and then the file list of the target work is determined from the block chain. Since the pieces of the work file in the file list are in a range format, a hash function with range additivity, such as RollingHash, can be used when calculating the first hash value.
Specifically, the merged hash value determined based on the set of hash values includes:
digitizing each first hash value in the hash value set to obtain a digitized hash value of each first hash value; determining the sum of the digitized hash values as the merged hash value.
In some embodiments, the manner of digitizing the first hash value may be to calculate a decimal value according to an algorithm of a K system (the value of K is determined by a maximum letter generated by the hash algorithm, for example, the generated maximum letter is Z, then a 36 system is adopted, where the 36 system refers to 10 characters in total from 0 to 9, 26 characters in total from a to Z, and the number of the two character sets is 36), so as to obtain the digitized hash value. Further, the obtained digitized hash values are added to obtain a combined hash value.
Further, after the merged hash value is obtained at the user side, a verification intermediate value can be calculated according to the verification factor sent by the target node, the hash value set and the merged hash value. Wherein the verification intermediate value can satisfy the calculated verification factor and a second hash value of the verification intermediate value, and is the same as the decimal digit of the merged hash value.
And 103, judging whether the parameter to be verified meets a preset verification condition, if so, executing step 104, and if not, executing step 105.
In some embodiments, after determining the parameter to be verified, the parameter to be verified may be verified, and whether the target work is real or not may be determined by determining whether the parameter to be verified satisfies a preset verification condition.
In an optional embodiment, the parameter to be verified includes the hash value set and the verification intermediate value, and the hash value set includes a merged hash value:
the judging whether the parameter to be verified meets a preset verification condition includes:
calculating a second hash value of the verification factor and the verification intermediate value; judging whether the quantity of decimal digits of the combined hash value is the same as that of the second hash value or not; and if the parameters are the same, determining that the parameters to be verified meet preset verification conditions.
In some embodiments, the parameter to be verified includes a verification intermediate value and a merged hash value, and therefore, by determining whether the verification factor and the second hash value of the verification intermediate value are the same as the decimal digit of the merged hash value, if so, it is determined that the parameter to be verified satisfies the preset verification condition.
And 104, storing the comment content into the intelligent contract of the target work.
And 105, discarding the comment content.
In some embodiments, when the parameter to be verified meets a preset verification condition, that is, when the target work is real-time, the comment content is stored in the intelligent contract, so that the comment content is linked. Furthermore, after the comment content is linked, the condition of data loss caused by the failure of a comment system can be avoided when comments are acquired subsequently based on the decentralized feature of the block chain.
Further, a contract on the blockchain mainly records all comment related information of a certain work, and related information of the work, such as: a work name, a work hash value, etc. All works in the block chain are managed by one contract, and the corresponding relation between the work name, the work hash value and the intelligent contract of the work is established, so that other information can be determined according to any one of the corresponding relations.
In an optional embodiment, the method of reviewing a work further comprises:
acquiring target query parameters of a target work, wherein the target query parameters comprise a target work name or a target work hash value; determining an intelligent contract of the target work corresponding to the target query parameter from a corresponding relation between the query parameter pre-stored in the block chain and the intelligent contract of the work; and obtaining comment data of the target work, which is stored in the intelligent contract of the target work.
In some embodiments, a user may input a target work name of a target work at a user side, or calculate a work hash value of the target work at the user side, so as to determine an intelligent contract of the work corresponding to the target work name or the work hash value in a corresponding relationship, thereby obtaining comment data of the target work from the intelligent contract.
Further, after storing the review content to the smart contract, the method further comprises:
acquiring the hash value set of the target work determined by other target nodes, and sending the hash value set to the user side so that the user side can recalculate a new combined hash value according to the hash value set; acquiring a merged hash value set of the target work in a block chain, and determining a target merged hash value in the merged hash value set, wherein the target merged hash value is the merged hash value with the largest merged hash value ratio in the merged hash value set; if the new merged hash value is the same as the target merged hash value, the comment content storage state is kept, and if the new merged hash value is different from the target merged hash value, the comment content is determined to be invalid and the comment content is deleted.
Therefore, the accuracy of the comment content is guaranteed by auditing the comment content.
In a specific embodiment, in the method for commenting a work, a plurality of nodes are configured on a blockchain, and the following calculation program is configured in an intelligent contract of each node:
1. and (3) obtaining comments: get () → List ((timestamp). Returned is a list of timestamps and comments.
2. Pre-commenting: precomment (timestamp, comment) → (id, factor, list), (offset)), comment timestamp of the video work needing to call comments before comments and comment content before comments are called, and then the method returns comment id, comment factor (namely the verification factor), video file deviation amount offset (namely the file list), wherein offset is a composite amount, composed of (L)i,Ri) Two quantities, wherein i represents the number of fragments of the work file into which the movie work is divided.
3. And (4) commenting: comment interface, and the required parameters are Comment id, Comment content, movie and television work timestamp, and verify (i.e. the above-mentioned parameters to be verified). A boolean value is returned as to whether the comment was successful.
In practical application, for convenience of management, the hash value of the movie file (conventional hash algorithm, such as MD5, sha256 and the like) is HiThe name of the work N, subscript is introduced here to distinguish the same movie work of different file formats, resolutions, bit rates, etc.
Let block chain contract be CiContracts mainly record all comment-related information of a certain work, CiIs different fromThe subscript i corresponds to different works. Mainly comprising key-value pairs of timestamp → comments, followed by rating of the scores of the different comments, i.e. by introducing a rating to the comments themselves, where the rating of each comment is SkAnd k is a subscript of the comment.
All movies on a chain are managed by a contract, denoted IC, for the processing of indexing of large-scale works, mainly recording works (N, H)i,Ci) And (H)i,N,Ci) Relationships, for quick queries of works, N may be the same, and different similar authors are added to distinguish.
Specifically, the method for commenting the works comprises the following steps:
first, a work publisher creates a contract CiAnd simultaneously issuing N, HiAnd adding (N, H) to the ICi,Ci) And (H)i,N,Ci)。
Secondly, the user side obtains comments, and the two methods are as follows:
1. searching IC by N to obtain Ci；
2. Local (i.e. user-side) to file HiThen find Ci；
User side acquisition CiAnd then, obtaining all comments corresponding to the level by the Get method of the corresponding contract.
Thirdly, commenting different timestamps of the movie and television works by the user:
1. target node is at CiGet PreCommment up to get (id, factor, list (offset)).
The id may be generated in a block chain in a self-increment manner or a random manner as long as the id does not conflict with other ids. The factor is also a character string randomly generated by the inside of the contract according to the global state of the block chain.
2. After the user side acquires the list (offset), the user first needs to calculate the file offset of the local video file, L is from the list (offset)iTo RiWeak Hash ofi(i.e., the set of hash values described above) (e.g., a hash function such as RollingHash with span additivity).
3. The target node is to WeakHashiDigitalizing, and calculating a value T under a decimal system according to an algorithm of a K (the value of the K is determined by a maximum letter generated by a Hash algorithm, for example, if the generated maximum letter is Z, a 36-system is adopted) systemi(i.e., the digitized hash value described above). Let WeakHash be T1+T2+...+Tlen(List(offset))(i.e., the merged hash value described above).
4. After the user side acquires the factor, a new string factor Y (i.e., the verification intermediate value) is locally calculated, so that the decimal value digit T' of Md5(factor + Y) (i.e., the second hash value) or the hash function hash (factor + Y) is the same as the meakhash (+ the number is a string connection symbol). For example, the maximum number of bits of T12311 and T '11156 is all 1 (i.e., the first, fourth, and fifth bits of T12311, and T' 11156), and if the maximum number of bits is the same, the minimum value is taken.
5. Thus, the target node acquires the WeakHash and Y. The target node calls the Comment, attaches the id obtained by the precompute as the entry of the id of the Comment, and the verify adopts WeakHash: y: WeakHash1：WeakHash2：...：WeakHashlen(List(offset))Is transmitted in, with a colon in the middle. The mechanism mainly prevents the cases of irrigation comments (namely malicious comments, meaningless comments and the like), so that the client needs to be proved to be calculated and have certain calculation workload, and the client has a target work file.
6. After receiving the parameters, the contract Comment can quickly verify the relationship pair of the factor and the verify through the above process. If so, it is stored inside the contract. Otherwise, the comment is discarded.
Furthermore, as a film writer can take out a verified result regularly, whether the relation between the WeakHash and the original work in the comment is correct or not can be judged quickly, and the verification speed can be high because the interval weak Hash is adopted. As long as all (L) stored in the memory is taken out firsti,Ri) Then, the characters are sequenced from small to large, and the characters can be read in sequenceAnd (5) verifying the piece. And then periodically delete some comments of the wrong conclusion.
If the work is a work without the supervision of an author, a voting mode can be adopted, during each calculation of the WeakHash, precompement takes out offset values calculated by other users to be calculated again by users of new comments, votes are used for selecting the value of the votes exceeding the general WeakHash as a correct conclusion, and if the result is incorrect, the comments are invalid and are filtered.
Based on the same concept, the embodiment of the present application provides a method for commenting a work, and specific implementation of the method may refer to the description in the embodiment of the method, and repeated details are omitted, as shown in fig. 2, the method may be applied to any type of electronic device, such as a terminal or a server corresponding to a user side. The method mainly comprises the following steps:
step 201, obtaining information to be evaluated, and sending the information to be evaluated to a target node of a block chain; determining a parameter to be verified based on the file list of the target work corresponding to the information to be evaluated, wherein the parameter to be verified indicates the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
Based on the same concept, the embodiment of the present application provides a system for reviewing a work, and the specific implementation of the system may refer to the description of the method embodiment section, and repeated descriptions are omitted, as shown in fig. 3, the system mainly includes: a user end 301 and a target node 302 of a block chain;
the user side is used for acquiring information to be evaluated and sending the information to be evaluated to a target node of the block chain;
the target node is used for determining parameters to be verified based on the file list of the target works corresponding to the information to be reviewed, and the parameters to be verified indicate the real existence of the target works; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
Based on the same concept, an embodiment of the present application further provides an electronic device, as shown in fig. 4, the electronic device mainly includes: a processor 401, a memory 402 and a communication bus 403, wherein the processor 401 and the memory 402 communicate with each other through the communication bus 403. The memory 402 stores a program executable by the processor 401, and the processor 401 executes the program stored in the memory 402, so as to implement the following steps:
obtaining information to be reviewed of a target work, wherein the information to be reviewed comprises review content;
determining a parameter to be verified based on the file list of the target work, wherein the parameter to be verified indicates the real existence of the target work;
judging whether the parameter to be verified meets a preset verification condition or not;
and if so, storing the comment content into the intelligent contract of the target work.
Or the like, or, alternatively,
acquiring information to be evaluated, and sending the information to be evaluated to a target node of a block chain; determining a parameter to be verified based on the file list of the target work corresponding to the information to be evaluated, wherein the parameter to be verified indicates the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
The communication bus 403 mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus 403 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 4, but this does not indicate only one bus or one type of bus.
The Memory 402 may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Alternatively, the memory may be at least one memory device located remotely from the aforementioned processor 401.
The Processor 401 may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), etc., and may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic devices, discrete gates or transistor logic devices, and discrete hardware components.
In still another embodiment of the present application, there is also provided a computer-readable storage medium having stored therein a computer program which, when run on a computer, causes the computer to execute the work review method described in the above-described embodiment.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wirelessly (e.g., infrared, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that includes one or more of the available media. The available media may be magnetic media (e.g., floppy disks, hard disks, tapes, etc.), optical media (e.g., DVDs), or semiconductor media (e.g., solid state drives), among others.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The foregoing are merely exemplary embodiments of the present invention, which enable those skilled in the art to understand or practice the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A method for commenting a work, applied to a target node of a blockchain, the method comprising:
obtaining information to be reviewed of a target work, wherein the information to be reviewed comprises review content;
determining a parameter to be verified based on the file list of the target work, wherein the parameter to be verified indicates the real existence of the target work;
judging whether the parameter to be verified meets a preset verification condition or not;
and if so, storing the comment content into the intelligent contract of the target work.
2. The work review method of claim 1, wherein determining parameters to be verified based on the file list of the target work comprises:
sending the file list to a user side so that the user side determines a hash value set based on the file list;
generating a verification factor for the target work;
sending the verification factor to a user side so that the user side can determine a verification intermediate value based on the hash value set and the verification factor, and sending the verification intermediate value to the target node;
and acquiring the verification intermediate value, and determining the parameter to be verified according to the hash value set and the verification intermediate value.
3. A work review method as claimed in claim 2, wherein the file list includes at least one piece of work file segments, and wherein said determining a set of hash values based on the file list comprises:
calculating a first hash value of each segment of the work file;
determining the set of first hash values as the set of hash values.
4. A work review method according to claim 3, wherein the parameters to be validated include the set of hash values and the validation intermediate value, the validation intermediate value including a consolidated hash value determined based on the set of hash values, and a validation intermediate value determined based on the validation factor, the consolidated hash value, and the set of hash values:
the judging whether the parameter to be verified meets a preset verification condition includes:
calculating a second hash value of the verification factor and the verification intermediate value;
judging whether the number of decimal digits of the combined hash value and the second hash value is the same;
and if the verification conditions are the same, determining that the preset verification conditions are met.
5. A work review method according to claim 4 wherein the determining a merged hash value based on the set of hash values includes:
digitizing each first hash value in the hash value set to obtain a digitized hash value of each first hash value;
determining the sum of the digitized hash values as the merged hash value.
6. A method of commenting a work according to claim 1, further comprising:
acquiring target query parameters of a target work, wherein the target query parameters comprise a target work name or a target work hash value;
determining an intelligent contract of the target work corresponding to the target query parameter from a corresponding relation between the query parameter pre-stored in the block chain and the intelligent contract of the work;
and obtaining comment data of the target work, which is stored in the intelligent contract of the target work.
7. A method for commenting a work, which is applied to a user side, the method comprising:
acquiring information to be evaluated, and sending the information to be evaluated to a target node of a block chain; enabling the target node to determine a parameter to be verified based on the file list of the target work corresponding to the information to be evaluated, wherein the parameter to be verified indicates the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
8. A work review system, comprising: a user terminal and a target node of a block chain;
the user side is used for acquiring information to be evaluated and sending the information to be evaluated to a target node of the block chain;
the target node is used for determining the number of parameters to be verified based on the file list of the target work corresponding to the information to be evaluated, and the parameters to be verified indicate the real existence of the target work; judging whether the parameter to be verified meets a preset verification condition or not; and if so, storing the comment content into the intelligent contract of the target work.
9. An electronic device, comprising: the system comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus; the memory for storing a computer program;
the processor, executing a program stored in the memory, implementing the work review method of any of claims 1-6 or 7.
10. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the work review method of any of claims 1-6 or 7.
CN202210200029.9A 2022-03-02 2022-03-02 Work comment method, system, electronic device and storage medium Active CN114629892B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210200029.9A CN114629892B (en) 2022-03-02 2022-03-02 Work comment method, system, electronic device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210200029.9A CN114629892B (en) 2022-03-02 2022-03-02 Work comment method, system, electronic device and storage medium

Publications (2)

Publication Number Publication Date
CN114629892A true CN114629892A (en) 2022-06-14
CN114629892B CN114629892B (en) 2024-05-03

Family

ID=81899202

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210200029.9A Active CN114629892B (en) 2022-03-02 2022-03-02 Work comment method, system, electronic device and storage medium

Country Status (1)

Country Link
CN (1) CN114629892B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109447630A (en) * 2018-09-10 2019-03-08 北京安易信科技有限公司 A kind of block chain building method and system for supporting conglomerate more to apply
CN110992031A (en) * 2019-12-02 2020-04-10 联想(北京)有限公司 Data processing method and device
CN113256289A (en) * 2021-05-17 2021-08-13 网易（杭州）网络有限公司 Block chain judging method and device and electronic equipment
WO2021174499A1 (en) * 2020-03-05 2021-09-10 合肥达朴汇联科技有限公司 Blockchain-based data verification method, apparatus and system
US20210383073A1 (en) * 2020-06-03 2021-12-09 Hon Hai Precision Industry Co., Ltd. Comment management method, server and readable storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109447630A (en) * 2018-09-10 2019-03-08 北京安易信科技有限公司 A kind of block chain building method and system for supporting conglomerate more to apply
CN110992031A (en) * 2019-12-02 2020-04-10 联想(北京)有限公司 Data processing method and device
WO2021174499A1 (en) * 2020-03-05 2021-09-10 合肥达朴汇联科技有限公司 Blockchain-based data verification method, apparatus and system
US20210383073A1 (en) * 2020-06-03 2021-12-09 Hon Hai Precision Industry Co., Ltd. Comment management method, server and readable storage medium
CN113256289A (en) * 2021-05-17 2021-08-13 网易（杭州）网络有限公司 Block chain judging method and device and electronic equipment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
周雨晗;尚泽昊;耿晓晗;: "基于区块链的手机APP点评系统", 数码世界, no. 12 *
唐晓婷;吴爱华;曾卫明;: "不一致数据库中基于用户语义模板的评论可信度计算", 燕山大学学报, no. 06 *

Also Published As

Publication number Publication date
CN114629892B (en) 2024-05-03

Similar Documents

Publication Publication Date Title
CN109428886B (en) Method and system for review verification and trustworthiness scoring via blockchain
US11823178B2 (en) Optimization of high volume transaction performance on a blockchain
US20180357683A1 (en) Rating data management
US20230289336A1 (en) Systems, devices, and methods for tracking creation and modification of digital records
US9160640B1 (en) Collecting client-side performance metrics and latencies
CN116432247A (en) Infringement evidence method and device based on blockchain
KR102384575B1 (en) Author verifying apparatus / method using decentralized network and self-sovereign id
US20220029787A1 (en) Citation and Attribution Management Methods and Systems
CN112800129A (en) Block state updating method, device and system and electronic equipment
US11829411B2 (en) Data recovery method and apparatus, electronic device, and storage medium
CN115237853A (en) Data query method and device, electronic equipment and storage medium
US10158650B1 (en) Token verification from incremental inputs
CN113326165A (en) Data processing method and device based on block chain and computer readable storage medium
US20230388136A1 (en) Merkle proof entity
US10853359B1 (en) Data log stream processing using probabilistic data structures
CN112699799A (en) Face recognition method, device, equipment and storage medium based on block chain
CN114629892A (en) Work comment method, system, electronic device and storage medium
CN110858211B (en) Data storage method, device and system and storage medium
CN111294613A (en) Video processing method, client and server
Li et al. Profiling entities over time in the presence of unreliable sources
CN114996348A (en) User portrait generation method and device, electronic equipment and storage medium
US20220029814A1 (en) Non-transitory computer-readable storage medium, information processing method, and information processing apparatus
CN105245380B (en) Message propagation mode identification method and device
JP2023547715A (en) merkle proof entity
CN115033187B (en) Big data based analysis management method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant