Proof-of-work method and device

Abstract

The invention discloses a proof-of-work method and device, related to the technical field of data processing. The proof-of-work method and device is used to solve the problems in the prior art that the selection efficiency of selecting an accounting node is low and the computing resources of each node is occupied overly in a block chain system adopting the traditional proof-of-work mechanism. Theproof-of-work method comprises the following steps: finding a second hash value matching a first hash value in a preset rainbow table according to the first hash value corresponding to a current blockwhen the current block sent by a first accounting node is received; sending the second hash value is to a plurality of other nodes, and receiving the second hash values sent by other nodes; and confirming the second hash value which has the minimum editing distance with the first hash value in a plurality of second hash values through a preset algorithm, and confirming the node corresponding to the second hash value as a second accounting node, so that the second accounting node generates the next block. The proof-of-work method and device is applicable to the process of selecting the accounting node under the block chain system.

Description

technical field [0001] The invention relates to the technical field of data processing, in particular to a workload proof method and device. Background technique [0002] Blockchain Technology (Blockchain Technology, BT) is a decentralized distributed storage technology, which is widely used in the financial field due to its advantages of decentralization, transparent transaction process, non-tamperable information, and traceability. Under the blockchain system using the traditional proof of work mechanism (Proof of Work, POW), each node in the network will generate its own Coinbase transaction and other transactions to be packaged into the block to form a transaction list, which is calculated through the Merkle Tree algorithm The Merkle Root Hash corresponding to the transaction list, and the Merkle Root Hash and other related fields form the block header for Hash operation. When a node changes the value of the random number (ie nonce) in the block header, the calculated re...

AI Technical Summary

Problems solved by technology

[0003] In the process of implementing the present invention, the inventor found that in the prior art, when each node in the network competes for bookkeeping rights, in order to make the calculated result value less than the target value in the current network, each node needs to constantly change the block header Therefore, each node needs to perform a large number of calculations, which leads to low efficiency in selecting bookkeeping nodes under the blockchain system using the traditional proof-of-work mechanism, and excessively occupies the computing resources of each node.

Images