This chapter examines the machinery that allows a network of mutually suspicious strangers to agree on a single shared history without anyone in charge — the part of Web3 where the deepest engineering, the largest energy bills, and the loudest political arguments all converge. Building on the distributed-systems problem set out in Chapter 10, Distributed Systems, Trust, and the Byzantine Generals Problem, and the blockchain data structure of Chapter 11, The Blockchain, we now ask the operational question those chapters set up but did not resolve: when there is no boss, how does the network decide what is true? The two dominant answers — proof of work and proof of stake — embody different bets about how to make honesty cheaper than cheating, and the choice between them is where much of the environmental and ideological debate about Web3 actually lives.
Invite 3 friends to subscribe and this chapter opens here.
Your invite link
In plain terms
imagine a pub quiz with no quizmaster. Everyone has paper, anyone can propose the answer to a question, and there is no authority to declare the official result. You would need some agreed rule for whose answer counts — and that rule would have to work even if some players are cheats trying to write down whatever benefits them. A consensus mechanism is that rule, for a ledger of money and data instead of quiz answers.
the deep trick of a public blockchain is to make votes expensive. If casting a vote were free, anyone could vote a million times under fake names and seize control. So the system demands that each unit of influence be backed by something genuinely scarce — either burned-up electricity (proof of work) or locked-up money (proof of stake). Cheating then means paying a real price.
proof of work is a lottery in which you buy tickets by doing useless arithmetic very fast. Each guess is a ticket; the more electricity you burn making guesses, the more tickets you hold, and the more likely you are to win the right to write the next page of the ledger — and collect the reward that comes with it. Crucially, while finding a winning guess is staggeringly hard, checking someone else's winning guess takes a single instant, so the rest of the network can instantly verify the winner did the work.
if proof of work is a lottery where tickets are bought with electricity, proof of stake is a system where the referees post a cash bond before they are allowed to officiate. The more you bond, the more often you are picked to call the plays — but if you cheat, the bond is taken from you. Honesty is enforced not by making cheating expensive to attempt, but by making it expensive to get caught.
slashing is the stick that replaces the energy bill. In proof of work, attacking the network is deterred because it would cost a fortune in electricity. In proof of stake, it is deterred because the network can reach into the attacker's locked-up funds and destroy them. The security still has a price tag — it is just denominated in confiscatable capital rather than consumed kilowatt-hours.
the two systems answer the same question — how do strangers agree without a boss? — but pay for the answer in different currencies. Proof of work pays in energy; proof of stake pays in locked-up money. Each accepts a characteristic risk: proof of work risks an environmental and hardware-centralization problem; proof of stake risks a wealth-concentration and "too new to fully trust" problem. There is no free lunch, only a choice of bill.
Ethereum did not launch a new blockchain and ask everyone to move. It kept the same ledger, the same balances, the same applications running, and replaced only the underlying method by which the network agrees on new blocks — like changing a car's engine from petrol to electric while it is driving down the motorway, with the same passengers in the same seats.
delegated and nominated proof of stake are both ways of saying "not everyone can or wants to run a validator, so let token holders pick who does." They differ in design — DPoS elects a small fixed roster of producers; NPoS lets many validators run but has ordinary holders vouch for them and share their fate. Both buy efficiency or accessibility at some cost to the ideal of everyone-validates decentralization.
"finality" is the answer to "when is my transaction truly permanent?" Bitcoin answers "never quite, but the odds of reversal shrink toward zero as you wait." BFT-style systems answer "at a specific moment, once two-thirds of the validators have signed off — and after that, reversing it would require provable cheating that gets the cheaters slashed." The first is like ink that dries slowly but never fully sets; the second like a notarized signature that is binding the instant it is witnessed.
What the chapter covers
- What a consensus mechanism is, and why it is hard
- Proof of work: security by burning electricity
- Proof of stake: security by locking up money
- The comparison, at a glance
- The Merge: Ethereum changes engines in mid-flight
- A brief tour of the variants
- The trilemma, and why design choices are political
- Synthesis
Terms explained in this chapter
The full chapter is in the book.
Buy the full bookGet Chapter 8 free
Subscribe and Chapter 8, on cryptography, opens for you on this site. Invite friends and the rest of Part III opens too.
One email to confirm, then Web3 in plain terms, a free seven-day email course, and an occasional note about the book. Unsubscribe any time.