Practical Byzantine Fault Tolerance (PBFT) is a consensus algorithm for permissioned environments that allows a number of faulty nodes f<n/3. It does not rely o

Practical Byzantine Fault Tolerance (PBFT) is a consensus algorithm for permissioned environments that allows a number of faulty nodes f<n/3. It does not rely on synchrony for correctness and it is safe against Byzantine faults (when f<n/3). It is used in BFS (PBFT for NFS) and in hyperledger fabric, to name the first two that came in my mind. http://zoo.cs.yale.edu/classes/cs426/2012/bib/castro02practical.pdf http://zoo.cs.yale.edu/classes/cs426/2012/bib/castro02practi...