Byzantine Generals Problem
Tags: distributed consensus, trust minimization
What it is (in the 21ideas framing)
The Byzantine generals problem is a classic formulation in distributed systems: how can participants agree on true state when they do not know or trust each other, and when some actors may lie or fail?
Sovereignty Through Mathematics states plainly: in the author’s view, the Bitcoin blockchain’s job under consensus rules is to solve this problem — enabling trust-minimized agreement on valid information flowing through the network.
The same chapter cautions: “blockchain” alone does not guarantee decentralization; Bitcoin is the substantive innovation — treat generic blockchain marketing skeptically.
Source: raw/Books/Suverenitet-posredstvom-matematiki/chapter-8.md
How Bitcoin maps to it
Bitcoin combines:
- Explicit rules (script, signatures, inflation schedule, etc.) every full node can enforce locally
- Proof of Work to make one global ordering expensive to forge
- Economic alignment so rewriting deep history costs more than honest mining under normal assumptions
See proof-of-work, governance, and double-spend for the operational details.
Sources
Related Terms
Glossary | Proof of Work | governance | double spend | blockchain
Related Pages
- bitcoin — system overview
- proof-of-work — Sybil resistance and ordering
- double-spend — the monetary-specific attack
- decentralization — why “no leader” is hard
- sovereignty-through-mathematics — full book context