January 2019
Beginner to intermediate
372 pages
11h 17m
English
The PBFT consensus algorithm was proposed by Miguel Castro and Barbara Liskov as a practical solution to the Byzantine generals' problem in distributed systems. It achieves consensus among nodes with a voting mechanism if the state changes. This algorithm requires at least 3f+1 nodes in a system of f failing nodes. PBFT poses an overall overhead of about 3% to the system, which is a great improvement on the PoW consensus-based systems. Scaling PBFT in terms of nodes is still a challenge, as it will result in a greater overhead as the number of nodes increases.
The Hyperledger Fabric project uses the PBFT protocol to achieve high transaction throughput in a permissioned blockchain.
Read now
Unlock full access