The bitcoin transactions bitcoin transactions

The hazard bonus problem is a fundamental aspect of block checks in the Bitcoin network. It refers to the challenge to determine the input value for a specific output shash in a transaction with 2 entries without knowing the corresponding hash before the advance.

What is a transaction at 2 entries?

In Bitcoin, transactions are 2 input transactions, which means that two entries are required: a sender and a recipient. The sender provides the recipient with a certain amount of bitcoin (often called “Satoshis” and at the same time offers its own single Gabère value (for example, a clear identification or a non -criprytrographian parameter). This transaction is verified by Bitcoin Node To ensure that it corresponds to the rules and restrictions on the network.

Hash-prime problem

When checking a transaction at 2 entries, the Bitcoin node has rebuilt the hash preparation of the transaction from the input value provided. In other words, given the transaction with a shash h 'output, we must find an input value' X so that:

H = M + X '

"M" The signing of the sender for the transaction and "X" is the entry value of the recipient.

What is the prime mage hash for a 2 -barrel transaction?

To solve this problem, Bitcoin nodes use a combination of hash functions and pre-computation tables to reconstruct the prime hash). Especially you:

• 1. Pre-comprehension of the hash values ​​for all possible inputsX(0 to 255) and the output of Hashes H.

• Use these pre-tailled hash values ​​to create a table of "candidates".

• When verifying a transaction, the node has reconstructed the primitive hash position by determining an input valueX ‘in the list of candidates which corresponds to the specified output hash.

The challenge can be resolved

The most important point of view here is that the Bitcoin node has already prepared and recorded the hash values ​​for all possible inputs X 'and the output of Hashes H;. This allows you to quickly reconstruct the premium hatching wire by finding an input value X which corresponds to the specified output hash.

diploma

In summary, we can say that the premail problem of the hash is an essential aspect of checking blocks in Bitcoin transactions. Pre-compose and record the hash values ​​for all possible inputs X Xand the output of Hashes H, Bitcoin nodes can quickly reconstruct the hash preparation transactions and check 2 input transactions, without calculation or in -depth chopping table search to require require.

Code example

Here is an example of how a bitcoin knot could rebuild the hash prime wire:

C

// Preliminary computing Haash values ​​for all possible inputs X (0-255)

Uint256 [256] in advance.

// …

};

// Create a list of input values ​​candidates that correspond to each problem -hash h

uint256 [] candidatinputs = {

// …

};

// Reconnect the hash exploitation by finding an input value x in the list of candidates which corresponds to the chopping of the specified h

Uint256 hash prime) = 0;

For (uint256 i = 0; i <256; i ++) {

if (prevalence [i] == h) {

Hash prime) = i;

to break;

}

}

“ ‘

Note: this is a simplified example, and real implementation can vary depending on the specific requirements of the Bitcoin node.