Opening The Byzantine Generals Problem
The Byzantine Generals Problem
- Length
- 11 min
- Level
- Undergraduate
- Recorded
- University of Cambridge2020
Chapter 1 of 3: The Byzantine generals problem
The Byzantine generals problem asks how distributed nodes can agree when some of them actively lie. Kleppmann starts from the two generals problem, keeps reliable message delivery, and replaces unreliable links with malicious participants. A three-general scenario shows that an honest recipient cannot tell a lying commander from a lying intermediary, which yields the bound of generals to tolerate traitors. Digital signatures then let parties prove authorship, easing the problem without removing it. Session 18 of the Cambridge undergraduate Distributed Systems course, it assumes the two generals problem and closes on practical Byzantine behaviour and the origin of the name.
Your comment is kept while you sign up.Sign in
Kleppmann shows why three generals cannot tolerate one traitor, and why generals are needed to tolerate .
The Byzantine generals problem asks how distributed nodes can agree when some of them actively lie. Kleppmann starts from the two generals problem, keeps reliable message delivery, and replaces unreliable links with malicious participants. A three-general scenario shows that an honest recipient cannot tell a lying commander from a lying intermediary, which yields the bound of generals to tolerate traitors. Digital signatures then let parties prove authorship, easing the problem without removing it. Session 18 of the Cambridge undergraduate Distributed Systems course, it assumes the two generals problem and closes on practical Byzantine behaviour and the origin of the name.
This lecture
Lecture 18 of 21 of Distributed Systems.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.