Satoshi's Synthesis
In October 2008 a pseudonymous author, Satoshi Nakamoto, published a 9-page whitepaper: “Bitcoin: A Peer-to-Peer Electronic Cash System.” On 3 January 2009, the first block (the genesis block) was mined, and the network went live. This page is the payoff of all of Part 0: the one idea that made it work.
The breakthrough, in one sentence
Section titled “The breakthrough, in one sentence”Make influence expensive via Proof of Work, and define “truth” as the transaction history with the most accumulated computational work behind it.
That’s it. This is called Nakamoto consensus. Everything else in Bitcoin is machinery built to implement and protect this idea.
Why this one idea defeats both obstacles
Section titled “Why this one idea defeats both obstacles”Recall the two problems from earlier. Nakamoto consensus solves them together:
It defeats Sybil attacks
Section titled “It defeats Sybil attacks”Votes are not counted per identity (which would be free to fake). They’re counted per unit of computational work — and computation costs real electricity and hardware. You can spin up a million fake nodes, but you cannot fake a million CPUs’ worth of energy. Influence is now tied to a scarce, real-world resource. This is exactly the “make influence expensive and unforgeable” requirement, delivered by Hashcash-style Proof of Work.
One-CPU-one-vote, not one-IP-one-vote.
(More precisely it’s one-hash-one-vote: influence tracks hashing power, not the number of machines — and in practice ASICs and mining pools concentrate that power, a real centralizing pressure we examine in Mining Pools.)
It achieves Byzantine agreement (probabilistically)
Section titled “It achieves Byzantine agreement (probabilistically)”Honest participants always extend the chain with the most accumulated work (the “longest” chain, weighted by difficulty). To rewrite history, an attacker would have to redo all the work of the blocks they want to change and out-pace the entire honest network going forward. As more blocks pile on top of a transaction, reversing it becomes exponentially more expensive — so agreement isn’t perfectly instant, but it becomes practically certain with time.
The synthesis, visualized
Section titled “The synthesis, visualized” Hashcash → Proof of Work makes influence COST real energy ┐ b-money/bit gold → everyone holds a chained, ordered ledger ├─► NAKAMOTO "longest chain" → truth = the chain with the most work ┘ CONSENSUS (Byzantine- AND Sybil-resistant, with no central authority)What you now understand
Section titled “What you now understand”You can now state the whole why of Bitcoin:
- Money is a shared ledger (agreement on who owns what).
- Digital coins suffer the double-spend problem because data is copyable.
- A central keeper fixes that but reintroduces censorship, inflation, failure, and coercion.
- Removing the keeper runs into the Byzantine and Sybil problems.
- Decades of predecessors built the pieces but never the keystone.
- Nakamoto consensus is the keystone: expensive, unforgeable influence + most-work-is-truth.
Where we go next
Section titled “Where we go next”To understand how this actually runs, we now build the machinery from the ground up, in dependency order:
- Cryptography — hashing (the fingerprints and the “work”), public keys & signatures (ownership), Merkle trees (efficient commitment).
- Transactions & UTXOs — what a coin is and how it moves.
- Blocks & the blockchain — how transactions get bundled and chained.
- Proof of Work & mining — how new blocks are made and how the “most work” rule plays out.
Start with Part 1 · Cryptographic Foundations →
Check your understanding
Section titled “Check your understanding”- State Nakamoto consensus in one sentence.
- Exactly how does tying votes to computation defeat Sybil attacks?
- Why does a transaction become more final as blocks are added on top of it?
- Why is “probabilistic” consensus good enough for money, when experts had been chasing perfect instant consensus?
Show answers
- Make influence expensive via Proof of Work, and define “truth” as the transaction history with the most accumulated computational work behind it. That single rule is Nakamoto consensus.
- Votes are counted per unit of computational work, not per identity. You can fake a million nodes for free, but you cannot fake a million CPUs’ worth of electricity and hardware — so influence is tied to a scarce, real-world resource (“one-CPU-one-vote,” more precisely one-hash-one-vote). That delivers the “make influence expensive and unforgeable” requirement.
- Honest nodes always build on the chain with the most accumulated work, so reversing a buried transaction means redoing all the work of every block on top of it and out-racing the entire honest network going forward. Each new block makes that exponentially more expensive, so finality climbs toward certainty as blocks pile up (≈6 blocks / ~1 hour is treated as settled).
- Because money doesn’t need a guarantee at the instant of payment — it needs consensus that is exponentially expensive to break, and that’s what stacking blocks delivers (a probability rocketing toward 100%). That conceptual leap — you don’t need perfect, instant consensus, only consensus that’s ruinous to overturn — is exactly what experts had missed.