Byzantine Fault Tolerance (BFT)

Byzantine Fault Tolerance (BFT) is the ability of a distributed network to keep agreeing on a single, correct history even when some participants crash, lie or act maliciously. BFT consensus protocols typically tolerate up to just under one-third faulty validators.

BFT is named after the Byzantine Generals Problem, a thought experiment in which generals must agree on a battle plan by messenger while some of them may be traitors sending conflicting messages. In a blockchain, the generals are nodes or validators. A "Byzantine" fault is any misbehaviour, from going silent to deliberately lying. Classical BFT protocols, such as PBFT and Tendermint (now CometBFT), run rounds of voting among a known set of validators. A decision counts once more than two-thirds of them, or of their voting stake, agree. Such protocols stay safe as long as fewer than one-third of participants are faulty.

For users, the practical result is fast, deterministic finality. On a Cosmos chain running CometBFT, a validator proposes a block, and the others prevote and then precommit on it. Once more than two-thirds of voting power precommits, the block is final and cannot be reverted. There is no need to wait for several confirmations, as on Bitcoin.

BFT does not mean a network is unbreakable. If a third or more of voting power goes offline, a classical BFT chain stops producing blocks. If more than a third acts maliciously, it can potentially finalise conflicting blocks, which is why many such chains slash validators caught double-signing. BFT is also a property, not just one family of protocols. Bitcoin's Nakamoto consensus tolerates Byzantine behaviour too, but its finality is probabilistic rather than immediate.

Learn more

Related terms