August 2018
Beginner to intermediate
94 pages
2h 37m
English
The approach that allowed for Byzantine fault-tolerant applications with low overhead was Practical Byzantine Fault Tolerance (PBFT). PBFT was first proposed by Miguel Castro and Barbara Liskov in 1999. PBFT can process an enormous number of direct P2P messages with minimal latency. To be able to tolerate f faults in the system, PBFT needs 3f + 1 replicas. So, PBFT uses the concept of primary and secondary replicas, where the secondary replicas automatically check the sanity and liveness of decisions taken by the primary, and can collectively switch to a new primary if the primary is found to be compromised. Each node maintains an internal state. Upon receiving a message, the respective node uses the message, ...
Read now
Unlock full access