1. The Byzantine Generals Problem & Nakamoto Consensus

For decades, computer scientists grappled with the Byzantine Generals Problem: how can independent actors reach consensus over an adversarial network without trusting a central coordinator?

Satoshi Nakamoto solved this not through cryptography alone, but by coupling cryptography with economic incentives. In Nakamoto Consensus, nodes follow the chain with the most accumulated Proof-of-Work (the 'Longest Chain Rule').

By requiring miners to expend real-world thermodynamic energy, creating an alternative historical ledger becomes exponentially more expensive than cooperating with the network. An attacker attempting to reverse a transaction must outpace the combined computational power of all honest participants worldwide.