ConsensusLetter: B
What is Byzantine Fault Tolerance (BFT)?
Definitive Definition
Byzantine Fault Tolerance (BFT) is the property of a distributed computer network to reach correct consensus even when some participating nodes fail, disconnect, or act maliciously with contradictory information.
In-Depth Architectural & Economic Analysis
Named after the Byzantine Generals Problem in computer science, BFT systems can tolerate up to one-third (33%) of network nodes being compromised or malicious while still guaranteeing ledger consistency and finality.
Core Characteristics & Mechanism
- Guarantees safety and liveness under adversarial network conditions.
- Forms the algorithmic foundation for Tendermint, Solana Tower BFT, and Ethereum Casper.
- Requires 2/3+ supermajority agreement among validators to achieve finality.
Practical Application Scenario:
Cosmos Hub uses Tendermint BFT to finalize blocks in ~6 seconds with instant mathematical finality.
Primary Sources & Formal Specifications (E-E-A-T)
- The Byzantine Generals Problem— Leslie Lamport, Robert Shostak, Marshall Pease (ACM) (1982-07-01)
Related Glossary Entries in Consensus
Bitcoin (BTC)
Bitcoin is the first decentralized, peer-to-peer digital currency, created in 2008 by pseudonymous author Satoshi Nakamoto. Operating on a cryptographic Proof-of-Work blockchain with a programmatic hard cap of 21 million coins, it enables trustless global monetary settlement without financial intermediaries.
Bitcoin Halving
The Bitcoin Halving is a programmatic event hardcoded into the Bitcoin protocol that cuts the block reward (subsidy) issued to miners by exactly 50% every 210,000 blocks (approximately every 4 years), steadily reducing new Bitcoin supply issuance until the 21M cap is reached.
Hashrate
Hashrate is the total computational processing power dedicated by mining rigs worldwide to securing, validating transactions on, and mining new blocks on a Proof-of-Work blockchain network like Bitcoin.