▎Loyal Wingman
Byzantine Fault Tolerance/ BFT
Property of agreeing despite arbitrary, including malicious, node behavior.
Definition
BFT systems tolerate up to f faulty nodes among 3f+1 with classical PBFT-class protocols, providing agreement even when adversaries inject false messages. In contested swarms, BFT-class assumptions are relevant for hardening world-model fusion against spoofed sensor reports and compromised peers.
Reference attributes
- Lower bound
- n ≥ 3f + 1 nodes
- Common protocols
- PBFT, HotStuff, Tendermint
Related terms
#distributed#security