Nakamoto Consensus

Nakamoto Consensus is the method Bitcoin uses to let anonymous computers agree on one transaction history. Miners compete to add blocks through proof of work, and nodes follow the valid chain with the most accumulated work.

Miners bundle pending transactions into a block and race to find a hash that meets the network's difficulty target, a search that takes enormous trial-and-error computing. The first to succeed broadcasts the block, and each node checks that it follows the rules before building on it. If two valid blocks appear at once, the chain briefly splits. Nodes then keep the branch with the greatest cumulative proof of work, loosely called the longest chain, and the other branch is abandoned.

For users, this explains why a payment becomes more secure over time instead of being final instantly. Finality is probabilistic: each new block built on top of a transaction makes reversing it more costly. For example, a payment in a block that later gets abandoned returns to the mempool and must be included again. Once several blocks sit on top of it, rewriting it would mean redoing all that work. Recipients decide how many confirmations to wait for based on the amount at stake, and practices vary.

A common misconception is that a transaction is irreversible the moment it appears in a block. Another is that only an attacker with over half the hash rate can cause trouble. A majority could reorganise recent blocks and double-spend, but research shows that strategies such as selfish mining can give an advantage with less. Hash rate also does not let miners change the rules, because nodes reject invalid blocks no matter how much work they contain.

Learn more

Related terms