Loading...
In 2008, an anonymous developer named Satoshi Nakamoto published a 9-page whitepaper solving a problem that had stumped computer scientists for decades: how do strangers trust each other without a central authority? The Byzantine Generals Problem—named after a 1982 thought experiment by Lamport, Shostak, and Pease—imagined generals surrounding a city who must coordinate an attack but can't trust their messengers. Any voting scheme fails if enough generals lie. Nakamoto's insight was brutally elegant: make lying expensive. In Bitcoin's design, miners compete to solve SHA-256 hash puzzles, burning real electricity—roughly 150 terawatt-hours per year by 2024, comparable to Poland's entire consumption. The first miner to find a valid hash earns a block reward (originally 50 BTC, halved ever...
Popular framing: Bitcoin works because of cryptography and clever code.
Structural analysis: Proof-of-work is mechanism design: burning electricity is an unfakeable costly signal, and the >50% hashpower requirement makes fraud cost more than any potential reward. Each miner faces a game-theoretic choice every block, and honesty is the dominant strategy at the resulting Nash equilibrium — trust comes from incentive geometry, not from trusting any participant.
Focusing on energy consumption or ideological utility obscures the deeper question: whether the mechanism design remains incentive-compatible as its parameters change over time. Halvings are pre-programmed shocks to the payoff matrix — the popular debate treats them as marketing events while the structural question is whether the equilibrium survives the transition from subsidy-dominated to fee-dominated miner revenue.
