Two Generals' Problem
Version 1.0.0 · Updated 2026-07-28
CORE DEFINITION
In computing, the Two Generals' Problem (or Chinese Generals Problem) is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the timing of an attack.
SCAFFOLDING EFFECT
Reduce cognitive load
In computing, the Two Generals' Problem (or Chinese Generals Problem) is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the timing of an attack.
Anchor fast decisions
On an unreliable channel, the sender can never be certain that the receiver has received the message, because the acknowledgment itself must be sent back over the same unreliable channel, leading to infinite recursion. Formally, it can be proven that no matter how many rounds of acknowledgment, it is impossible to achieve a consensus that both parties are 100% certain of—this is an unsolvable problem (related to but distinct from the Byzantine Generals Problem, which also introduces malicious nodes).
MINIMUM ACTION
In progress 0/5Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Two_Generals%27_Problemverified
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.