practical Byzantine Fault Tolerance(pBFT) - GeeksforGeeks
A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.
practical Byzantine Fault Tolerance(pBFT) - GeeksforGeeks Courses Tutorials Interview Prep CN Tutorial Interview Questions Quizzes Gate OSI Model TCP-IP Network Security COA TOC Compiler Design DBMS practical Byzantine Fault Tolerance(pBFT) Last Updated : 11 Jul, 2025 Practical Byzantine Fault Tolerance is a consensus algorithm introduced in the late 90s by Barbara Liskov and Miguel Castro. pBFT was designed to work efficiently in asynchronous(no upper bound on when the response to the request will be received) systems. It is optimized for low overhead time. Its goal was to solve many problems
saved by
related reading
- Byzantine fault - Wikipediaen.wikipedia.org
- Let’s take a crack at understanding distributed consensuspreethikasireddy.com
- Making CRDTs Byzantine Fault Tolerant - Martin Kleppmannmartin.kleppmann.com
- Tower BFT: Solana’s High Performance Implementation of PBFT | by Anatoly Yakovenko | Solana | Mediummedium.com
- MonadBFT - Monad Documentationdocs.monad.xyz
- Building a BFT JSON CRDTjzhao.xyz
- What is the difference between PBFT, Tendermint, HotStuff, and HotStuff-2?decentralizedthoughts.github.io
- What Are Peer-to-Peer (P2P) Networks?academy.binance.com
- GitHub - davidrusu/bft-crdts: Byzantine Fault Tolerant CRDT's and other Eventually Consistent Algorithms · GitHubgithub.com
- Students' Guide to Raft :: Jon Gjengsetthesquareplanet.com
- A Distributed Systems Reading Listferd.ca
- Raft Consensus Algorithmraft.github.io