Proof of Work

Bitcoin miners assemble a candidate block and repeatedly hash variations of its header. A block is eligible when the resulting hash, interpreted numerically, is below the current target. Because secure hashes are unpredictable, miners cannot solve the puzzle directly; they perform many trials.

The winning hash is easy for every full node to verify. Producing it is expensive in aggregate, while checking it requires very little computation.

A miner changes the nonce and other adjustable header-related values, hashes the header, and compares the result with the target. If the hash is too large, it tries again. A lower target represents a smaller set of acceptable hashes and therefore more expected work.

Bitcoin periodically adjusts difficulty so average block production remains near its protocol target despite changes in total hash rate.

Two miners can find valid blocks close together, creating a temporary fork. Nodes eventually prefer the valid branch with the greatest accumulated proof of work under Bitcoin's chain-selection rule. Miners then build on that branch, making the competitor less likely to catch up.

Nodes count work only after verifying that each candidate block is valid.

Miners incur equipment and electricity costs. Accepted blocks can earn the block subsidy and transaction fees. A miner that creates an invalid block receives no protocol reward from honest nodes because the block is rejected. The incentive is therefore to spend resources on blocks that satisfy validation rules.

Security depends on hash-rate distribution, energy economics, hardware availability, and the value an attacker might gain.

Dominant hash power can potentially reorganize recent history, censor transactions, or double-spend the attacker's own payments under certain conditions. It does not reveal private keys, authorize arbitrary spending from other wallets, or let invalid coin issuance pass honest full-node validation.

Hash power influences ordering among valid histories; it does not replace every protocol rule.

Proof of work separates block creation from block verification by making proposal expensive but checking inexpensive. A miner builds a candidate header and repeatedly changes values that affect its hash. The candidate succeeds only when the resulting hash is numerically below the current target. Because a cryptographic hash behaves unpredictably for new inputs, the miner cannot directly calculate the winning nonce; it performs many trials.

The network does not trust the miner's claim that work was done. Every validating node can hash the submitted header and verify the target condition quickly. Nodes also verify the block's transactions and all other consensus rules. A valid proof of work is therefore necessary but not sufficient for block acceptance.

Security comes from accumulated work over history. To replace a confirmed block, an attacker must produce an alternative valid chain and accumulate enough work to overtake the accepted branch while honest miners continue extending it. This does not make reversal mathematically impossible, which is why confirmations are a risk-management concept rather than a deterministic guarantee.

Difficulty adjustment is what prevents rising hardware capacity from permanently shrinking the target block interval. By periodically changing the target, the protocol tries to keep block production near its designed pace despite changes in total hash rate.

1. Why must miners try many candidate header hashes instead of directly solving for the winning nonce?

2. What does a validating node check after a miner announces a new block?

3. Explain the difference between a valid proof of work and a fully valid block.

4. Why does rewriting an old block require work on later blocks too?

5. What problem does difficulty adjustment solve?

6. Correct this statement: “The chain with the most blocks always wins in Bitcoin.”