Nakamoto Consensus

Nakamoto Consensus is the mechanism Bitcoin introduced for reaching agreement in an open network: combine proof of work with a simple rule that nodes always follow the chain with the most accumulated work. Anyone may join or leave at any time, no one needs permission or an identity, and honesty is enforced economically — building on the heaviest chain is profitable, while attacking it means burning real electricity for coins whose value the attack undermines.

Its breakthrough was solving Byzantine agreement without a fixed list of voters. Earlier consensus protocols required knowing who the participants were; Satoshi Nakamoto's design instead lets raw computation stand in for identity, so "one CPU, one vote" replaces a membership roll. When the chain briefly forks — say two miners find blocks simultaneously — nodes simply wait, and whichever branch attracts the next block becomes the heaviest chain, which the whole network converges on. The abandoned block is discarded and its transactions return to the pending pool.

A consequence is probabilistic finality: a transaction is never absolutely final, but reversing it after six confirmations would require out-mining the entire honest network for an hour, which is why deep confirmations are treated as settlement. A common misconception is that the rule is "longest chain wins"; it is actually the chain with the most cumulative difficulty, which usually but not necessarily has the most blocks. Nakamoto Consensus underpins Bitcoin, Litecoin, Dogecoin, Monero, and most other proof-of-work chains.