Byzantine Generals Problem
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
A group of generals besieging a city must act in unison (all attack or all retreat) to win. However, generals can only communicate via messengers, and some generals may be traitors (deliberately sending false messages). How to reach agreement (consensus) in the presence of traitors and unreliable communication? -
SCAFFOLDING EFFECT
Reduce cognitive load
The cornerstone of collaboration in zero-trust environments. - This is the core problem solved by blockchain and Bitcoin. In the absence of a centralized authority (the emperor), how to prevent bad actors from undermining the system? The answer is proof-of-work (PoW) or high-redundancy verification. In the workplace, if you suspect there are "traitors" (blamers/saboteurs) in your team, the only way...
Anchor fast decisions
The Byzantine Generals Problem uses the metaphor of generals coordinating an attack via messengers to illustrate how to achieve reliable consensus in the presence of traitors (unreliable or malicious nodes). It is a classic challenge in distributed consensus.
MINIMUM ACTION
In progress 0/2Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Byzantine_faultverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS