 |
April 17, 2018, 05:32:14 AM |
|
The core idea of the workload proof is that the nodes are selected according to the ratio of the random selection node to a certain resource, which no one can monopolize. For example, if this resource is computing power, we call it the Proof of Work. Or this resource could be the possession of some kind of currency, which we call Proof of Stake.
Bitcoins are solved by the hash function to prove the workload. Any node that proposes and creates a block wants to make the next piece, and the node must find a number (called a temporary random number). Before the temporary random number, sequence of the hash value and to fill in the list of block trading connected, form a whole string of characters, and then use hash function to calculate the whole string of characters in the output value, the output value at the right moment to fall in a relative to the hash function of small targets in all possible output range.
Typically a block will contain a series of transactions proposed by the node. Furthermore, the block will also contain a hash pointer to the preorder block (the hash pointer here is a broad concept). This hash value is used as an ID for requesting other nodes on the network to find the block, and then to verify it after obtaining the block.
In addition, the block contains a temporary random number. Moderate the idea is to increase the difficulty of the temporary random number found to meet the requirements, which including temporary random Numbers of the whole block of the hash value together, if the output in the form of a specific. If the hash function fits the puzzle, the only way to solve the hash puzzle is to try enough temporary random Numbers until they succeed.
|
