Live briefing
Everything about Two Generals' Problem
Thought experiment
In computing, the Two 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 time to launch an attack, while knowing that any messenger they send could be captured. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Two Generals' ProblemA 5-minute orientation
- Pick up a classic book: Two Gentlemen of VeronaThe most-reprinted book on the subject
- Read the landmark paper: The Simplified Two Generals Problem for Communication Immutability and Security Over Multiple Heterogeneous ChannelsCited 1 times
- Go sideways: Consensus (computer science)A closely related topic
- Go sideways: Byzantine faultA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Two Gentlemen of VeronaWilliam Shakespeare · 1632
Looking Backward, 2000-1887Edward Bellamy · 1888
Looking BackwardEdward Bellamy · 2007
Looking backwardEdward Bellamy · 1906
Mathematical nonparametric statisticsEdward B. Manoukian · 1986- 📕Looking backward, 2000-1887Edward Bellamy · 2009
- 📕Integrability, Quantization, and GeometryI. M. Krichever · 2021
Looking backward, 2000-1887Edward Bellamy · 1982
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Consensus (computer science) A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes…
- Byzantine fault A Byzantine fault is a condition of a system, particularly a distributed computing system, where a fault occurs such that different symptoms are presented…
- Paxos (computer science) In computer science, Paxos is a family of protocols for solving consensus in a network of unreliable or fallible processors. Consensus is the process of…
- Leader election In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers…
- Lamport timestamp The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different…
- Two-phase commit protocol In transaction processing, databases, and computer networking, the two-phase commit protocol (2PC, tupac) is a type of atomic commitment protocol (ACP)…
- Quantum Byzantine agreement Byzantine fault tolerant protocols are algorithms that are robust to arbitrary types of failures in distributed algorithms. The Byzantine agreement protocol…
- Atomic commit In the field of computer science, an atomic commit is an operation that applies a set of distinct changes as a single operation. If the changes are applied…