We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/General Science/The Byzantine Generals Problem

Checking your access to this record.

Abstract & Overview

Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system.This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city.Communicating only by messenger, the generals must agree upon a common battle plan.However, one or more of them may be traitors who will try to confuse the others.The problem is to find an algorithm to ensure that the loyal generals will reach agreement.It is shown that, using only oral messages, this problem is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.With unforgeable written messages, the problem is solvable for any number of generals and possible traitors.Applications of the solutions to reliable computer systems are then discussed.

Cite this record

Leslie Lamport, Robert E. Shostak, Marshall C. Pease (1982). The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3). https://doi.org/10.1145/357172.357176

Copy in another style

Lamport, L., Shostak, R. E., & Pease, M. C. (1982). The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3). https://doi.org/10.1145/357172.357176
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.