View source for Byzantine Fault Tolerance (BFT)

* Explanation from [https://medium.com/loom-network/understanding-blockchain-fundamentals-part-1-byzantine-fault-tolerance-245f46fe8419 this post]:
''Byzantine Fault Tolerance (BFT) is highly technical in nature (like the other consensus algorithms presented); a good explanation can be [https://en.wikipedia.org/wiki/Byzantine_fault_tolerance found here]. In general, the BFT consensus algorithms employed by cryptocurrency projects allow generals (validators) to each manage the state of a chain and share messages between each other to arrive at the correct transaction record and to ensure honesty. Again, this topic is fairly nuanced and further additional information regarding the problem and implementation details can be [https://medium.com/loom-network/understanding-blockchain-fundamentals-part-1-byzantine-fault-tolerance-245f46fe8419 found here]. BFT is notably implemented by [[Ripple (XRP)|Ripple]] (where validators are pre-selected by the Ripple foundation) and [[Stellar Lumens (XLM)|Stellar]] (where anyone can be a validator and trust is established by the community). BFT is advantageous because it presents scalability and low cost transactions, but [[Delegated Proof of Stake (DPoS)|DPoS]] introduces a component of centralisation.''
* For a comparison between [[PBFT]], [[Tendermint]], [[SBFT]] and [[HotStuff]] [https://ittaiab.github.io/2019-06-23-what-is-the-difference-between/ look here]. 
# ''PBFT. The gold standard for BFT SMR. Highly recommend to see [https://ttv.mit.edu/videos/16444-practical-byzantine-fault-tolerance this video] of Barbara Liskov from 2001. Here is the PBFT [http://www.pmg.csail.mit.edu/bft/ project page].''
# ''Tendermint. A modern BFT algorithm that also uses [[peer-to-peer]] gossip protocol among [[nodes]]. [https://github.com/tendermint/tendermint Here is] the [[github]] repository.''
# ''[https://research.vmware.com/files/attachments/0/0/0/0/0/7/2/sbft_scaling_up_byzantine_fault_tolerance_5_.pdf SBFT]. A BFT system that builds on PBFT for better scalability and best-case [[latency]]. [https://github.com/vmware/concord-bft Here is] a [[github]] repository that implements the SBFT protocol.''
# ''HotStuff. A new BFT protocol that provides both linearity and responsiveness[https://developers.libra.org/docs/assets/papers/libra-consensus-state-machine-replication-in-the-libra-blockchain.pdf . The recent] [[Libra|LibraBFT]] is based on HotStuff.'' 
* From [https://medium.com/coinbundle/consensus-algorithms-dfa4f355259d this post]:'' ''
"''Well, [https://blockonomi.com/practical-byzantine-fault-tolerance/ Byzantine Fault Tolerance] is the ability of a distributed computer network to function as desired and correctly reach a sufficient consensus despite malicious components (nodes) of the system failing or propagating incorrect information to other peers. The main objective is to defend against any catastrophic system failures by [https://medium.com/loom-network/understanding-blockchain-fundamentals-part-1-byzantine-fault-tolerance-245f46fe8419 mitigating the influence that these malicious nodes may have] on the correct function of the network. As a result, the right and correct [[consensus]] is reached by the honest [[nodes]] which are still in the system.''

''Circling back to the Byzantine Generals’ Problem, which is what set this system in motion, there have been many specifications and improvements made to the overall algorithm since the overarching problem has been studied and analyzed for years now. [http://pmg.csail.mit.edu/papers/osdi99.pdf Practical Byzantine Fault Tolerance (pBFT)] is one of these optimizations and was introduced by [http://pmg.csail.mit.edu/papers/osdi99.pdf Miguel Castro and Barbara Liskov] in an academic paper in 1999 titled “[http://pmg.csail.mit.edu/papers/osdi99.pdf Practical Byzantine Fault Tolerance].” It aims to improve upon original BFT consensus mechanisms and has been implemented and enhanced in several modern distributed computer systems, including some popular [[blockchain]] platforms."''[[Category:Jargon/Various]]