digest
Short Summary
Main recommendation: Bitcoin miners solve the proof-of-work puzzle by repeatedly hashing a candidate block header with the SHA-256 algorithm while changing a randomly chosen nonce until the resulting hash has enough leading zeros. The video explains that the puzzle is solved by brute-force guessing rather than by any shortcut, and that the difficulty rises with the number of required zeros.
Key Points
- SHA-256 takes data of any size and produces a 256-bit "fingerprint" that cannot be predicted from the input, so a valid solution can only be found by trying many inputs.
- The block header is 80 bytes and includes the Merkle root of the block's transactions (including the coinbase transaction), a timestamp, and the hash of the previous block, which links the block into the chain.
- The nonce is a number the miner varies, starting from a random choice, to change the header's hash output on each attempt.
- A valid solution requires a hash with a set number of leading zeros, and only a very small fraction of the possible 256-bit outputs qualify.
- Difficulty increases with the number of required zeros, and miners must perform enormous numbers of hashes (quadrillions in the speaker's example) to have a realistic chance of success.
Details Worth Noting
- Concrete instructions:
- Take the 80-byte block header from the candidate block. It contains the Merkle root of the transactions, the timestamp, and the hash of the previous (parent) block.
- Select a nonce (start with a random number) and insert it into the block header.
- Hash the entire block header with SHA-256 to produce a 256-bit hash.
- Check whether the hash has the required number of leading zeros. If it does, the puzzle is solved.
- If it does not, increment or change the nonce, hash the header again, and repeat until a valid hash is found, which may never happen if the miner is too slow.
- The Merkle root summarizes all transactions in the block, so changing any transaction changes the header and therefore the hash.
- Because the previous block's hash is included in the header, altering an earlier block would change every hash after it, which is how the blocks are chained together.
- The speaker notes that a miner hashing too slowly may never find a solution, so hashing speed (hash rate) directly affects the chance of winning.
Bottom Line
Mining is a brute-force search: miners keep changing the nonce and hashing the block header until they happen to produce a hash with enough leading zeros, and the required zeros set how hard that search is.
