The Weak Byzantine Generals Problem

  title={The Weak Byzantine Generals Problem},
  author={Leslie Lamport},
  journal={J. ACM},
  • L. Lamport
  • Published 1 July 1983
  • Computer Science
  • J. ACM
The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an "incorrect" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case of the weaker problem. It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only ff fewer than one-third of the processes may fad. Unlike the onginal problem, an approximate… 
The Byzantine Generals Strike Again
  • D. Dolev
  • Computer Science
    J. Algorithms
  • 1982
Byzantine Generals and Transaction Commit Protocols
It is shown that even under the assumption that a process can fail only by “crashing”—failing to send any more messages—a solution to this problem that can tolerate k failures must, in the worst case, require at least k + 1 message-passing delays.
Is byzantine agreement useful in a distributed database?
It is argued that the main application of this protocol is in the distribution of input transactions to a fully replicated database system, and other database uses, such as for transaction commit, message broadcast, and object location, may be limited.
The Failure Discovery problem
This work defines a simple variant of the Byzantine agreement problem, called the Failure Discovery problem, and shows how a protocol for FD can be extended to one for BA, with no message overhead in the failure-free runs.
Applications of Byzantine agreement in database systems
This paper presents an overview of the failure model used for Byzantine agreement, and of the protocol itself, and investigates applications of Byzantine agreement protocols in the more common failure environment where processors are assumed to halt after a failure.
Frugal Byzantine Computing
This work approaches Byzantine computing in a frugal manner and motivates the use of Consistent Broadcast – rather than Reliable Broadcast – as a key primitive for reaching agreement for solving consensus with Byzantine failures.
Agreement under Faulty Interfaces
Degradable Byzantine agreement
The proposed degradable agreement approach achieves traditional agreement up to m faults and a degraded form of agreementUp to u faults, which allows fault-free receivers to agree on at most two different values.
Easy impossibility proofs for distributed consensus problems
Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in
The Distributed Firing Squad Problem (Preliminary Version)
In this paper the design assumption of simultaneous starts is justified and algorithms to solve the associated synchronization are provided.


The Byzantine Generals Problem
It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Reaching Agreement in the Presence of Faults
It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.
Notes on Data Base Operating Systems
  • J. Gray
  • Computer Science
    Advanced Course: Operating Systems
  • 1978
This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.
-n: the number of processes
  • -n: the number of processes
  • 1981
the set of message paths from 0 to/--sequences in II ending in L --IItk): set of message paths of length _< k in II
  • the set of message paths from 0 to/--sequences in II ending in L --IItk): set of message paths of length _< k in II
-II: the set of message paths from ()--sequences in P* beginning with 0
  • -II: the set of message paths from ()--sequences in P* beginning with 0
*: the set of finite sequences of processes
  • *: the set of finite sequences of processes
The Byzantine Generals Problem Trans Prog
  • Lang. Syst
  • 1982