Asynchronous Byzantine Fault Tolerance (aBFT)
Asynchronous Byzantine Fault Tolerance (aBFT) is an enhanced consensus mechanism derived from Byzantine Fault Tolerance (BFT) that resolves the Byzantine General’s Fault problem in a unique manner. It achieves independent consensus among nodes by utilizing a two-thirds supermajority and a two-stage block confirmation process. During the initial stage, a proposal is made for the last irreversible block (LIB), and in the subsequent stage, the LIB is finalized, rendering it irreversible. Notably, aBFT operates in a leaderless manner, removing the requirement for a singular node to lead block creation and finalization. This leaderless approach contributes to a network that is both faster and more secure. Numerous networks, such as Fantom, Hedera Hashgraph, and others, implement diverse adaptations of aBFT.