Work load proof method and device

Abstract

The invention discloses a workload proof method and device, which relate to the technical field of data processing. In order to solve the problem in the prior art, under the block chain system adopting the traditional workload proof mechanism, the selection efficiency of bookkeeping nodes is low. And the problem of excessively occupying the computing resources of each node. The method of the present invention includes: when receiving the current block sent by the first accounting node, according to the first hash value corresponding to the current block, searching for the second hash matching the first hash value in the preset rainbow table Hash value; send the second hash value to multiple other nodes, and receive the second hash value sent by each other node; determine the edit between the multiple second hash values ​​and the first hash value through a preset algorithm The second hash value with the smallest distance is determined, and the node corresponding to the second hash value is determined as the second bookkeeping node, so that the second bookkeeping node can generate the next block. The present invention is applicable to the process of selecting bookkeeping nodes 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