Scope note: Practical Byzantine Fault Tolerance (PBFT) is a service-replication protocol introduced by Miguel Castro and Barbara Liskov in their 1999 OSDI paper. PBFT is not a generic name for every Byzantine-tolerant system, and it is not a permissionless blockchain protocol. This page explains the original paper rather than assuming modern systems share all of its implementation details.
The problem PBFT addresses
In state-machine replication, several replicas run the same service and must process requests in a consistent order. The challenge is that some replicas may behave arbitrarily: lie, send different messages to different participants, or stop responding. Such behavior is called a Byzantine fault.
PBFT has a clear fault bound. If f replicas may be faulty, the system needs at least 3f + 1 replicas to preserve safety and, under a network timing condition, make progress. The protocol therefore cannot guarantee safety if Byzantine replicas exceed one third of the group. This formula alone does not prove that a blockchain is secure: membership selection, authentication keys, and correlated failures matter too.
How the three phases work
PBFT uses a primary replica to propose the order of requests for a view, or leadership round. During normal operation, replicas exchange three kinds of messages:
- Pre-prepare: the primary assigns a sequence number to a request and distributes its proposal.
- Prepare: replicas signal that they saw the same proposal for that view, sequence number, and request.
- Commit: after enough matching prepare evidence exists, replicas confirm the order they will execute.
Replicas use quorums, generally 2f + 1 matching messages in a group of 3f + 1, so Byzantine participants alone cannot form a valid decision. Once a request is safe to execute, replicas process it in the same order and send replies to the client. PBFT also has a view-change protocol: if the primary stalls or fails, replicas can move to another primary while preserving requests that already have the required evidence.
Safety and progress are different guarantees
A central PBFT idea is that safety does not require a known upper bound on message delivery time: a slow network should not make honest replicas accept conflicting results. Progress does need messages eventually to arrive quickly enough relative to the protocol timeouts. If delays continue to grow without bound, PBFT does not promise that clients will keep receiving replies.
The paper also evaluated a Byzantine-fault-tolerant NFS file service. In the benchmark and software environment they tested, it was about 3% slower than an unreplicated NFS service during normal operation. That is a 1999 result for a particular implementation and workload, not a performance estimate for a modern blockchain.
Limits and blockchain relevance
PBFT assumes a known replica group; the paper does not define open network membership or stake-based validator selection. Its multi-round messages between replicas also grow more costly as the group grows, so the original design targets a controlled group rather than thousands of open participants. The one-third fault bound, authentication, and diversity of implementations all need to be considered together.
Later blockchain consensus protocols developed their own BFT designs and assumptions. HotStuff, for example, changes the communication pattern; it is a separate protocol, not simply PBFT under a new name. PBFT remains useful as a concrete way to understand quorums, request ordering, leader changes, and the distinction between safety and liveness.
Social Media Sentiment
One small r/CryptoCurrency thread in March 2026 compared a new blockchain’s quorum with the classical BFT threshold. It asked whether satisfying the threshold alone proves BFT behavior in practice, and replies disagreed about how the term should be applied. The thread concerns a particular system rather than PBFT itself, so it is too limited to establish broad community sentiment. Quorum and BFT discussion on r/CryptoCurrency.
Last updated: 2026-10
Sources
- Castro, M., & Liskov, B. (1999). Practical Byzantine Fault Tolerance, OSDI ’99. Official USENIX conference record — confirms the paper’s authors, date, abstract, and USENIX copyright notice.
- Castro, M., & Liskov, B. (1999). Practical Byzantine Fault Tolerance, MIT CSAIL-hosted OSDI paper — the original model, 3f + 1 fault bound, three message phases, view changes, and NFS experiment.
- Yin, M. et al. (2018). HotStuff: BFT Consensus in the Lens of Blockchain — a later BFT protocol with its own communication design, included here for comparison rather than as PBFT.