Federated Byzantine Fault Tolerance (FBFT) is a consensus mechanism in which each node independently selects a trusted subset of peers—its quorum slice—forming overlapping quorums that propagate agreement without requiring global participation or expensive proof-of-work computation. Unlike classic BFT protocols that demand a fixed, known validator set, FBFT allows open membership: any node may join by declaring its quorum slices, and safety is guaranteed as long as quorum intersections contain at least one correct node. FBFT underpins the Stellar Consensus Protocol (SCP), enabling low-latency, high-throughput cross-border payment settlement with safety and liveness properties derived from quorum-intersection analysis.
Semantic Classification
Content
Federated Byzantine Fault Tolerance — content pending enrichment.