Practical Byzantine Fault Tolerance
Miguel Castro, Barbara Liskov
Abstract
The paper by Castro and Liskov introduces the Practical Byzantine Fault Tolerance (PBFT) algorithm, a landmark contribution to distributed systems. Addressing the limitations of earlier theoretical models, PBFT provides a high-performance solution for state machine replication in asynchronous environments, assuming no more than one-third of nodes are malicious. The protocol utilizes a primary-backup architecture and a three-phase commit process—pre-prepare, prepare, and commit—to ensure safety and liveness. Unlike previous BFT implementations that incurred massive performance penalties, PBFT demonstrated that Byzantine fault tolerance could be achieved with sub-millisecond latency for typical client-server operations. By optimizing communication overhead and handling view changes efficiently, the authors bridged the gap between theoretical distributed systems research and real-world system resilience. Its influence on modern blockchain architecture is immense, as it serves as the foundational reference point for permissioned distributed ledgers and early private blockchain networks seeking to maintain transaction integrity despite node compromise.
Key Findings
- 1PBFT achieves state machine replication despite Byzantine failures in asynchronous networks.
- 2The protocol maintains liveness and safety as long as f nodes are faulty in a system of 3f+1 nodes.
- 3Performance optimization is achieved by minimizing communication stages during normal operation.
- 4The view change mechanism allows for robust recovery from primary node failure.
Topics
Citation
BibTeX
@misc{practicalbyzantine1999,
title = {Practical Byzantine Fault Tolerance},
author = {Miguel Castro and Barbara Liskov},
year = {1999},
howpublished = {\url{http://pmg.csail.mit.edu/papers/osdi99.pdf}},
}Knowledge Explorer
Explore Related Concepts
See how Practical Byzantine Fault Tolerance connects to glossary terms, books, and other research in the Knowledge Graph.