Asynchronous Byzantine Fault Tolerance (aBFT)

Asynchronous Byzantine Fault Tolerance (aBFT) is a consensus mechanism that improves on traditional Byzantine Fault Tolerance (BFT) consensus by solving the Byzantine General’s Fault in a novel way. Nodes can reach consensus independently using aBFT by using a two-stage block confirmation process with a two-thirds supermajority. The first stage proposes a final irreversible block (LIB), which is then finalized to make the block irreversible. With no independent leading node responsible for block creation and finalization, ABFT consensus is considered leaderless, resulting in a faster and more secure network. aBFT is used in the Fantom and Hedera Hashgraph protocols, as well as other networks.