Fast Byzantine Fault Tolerance (FBFT) is the consensus protocol of the Harmony blockchain, a sharded proof-of-stake network whose native token is ONE. It is a variant of Practical Byzantine Fault Tolerance (PBFT), the classic algorithm that lets a group of nodes agree on a block even if just under a third of them are faulty or malicious, the condition known as Byzantine fault tolerance.
In standard PBFT every node sends messages to every other node, so traffic grows with the square of the number of participants. FBFT reduces this by having a leader collect votes from validators and combine them into a single aggregate BLS signature, which it then broadcasts. Validators check one signature instead of many, so communication grows roughly in proportion to the number of nodes. Each shard runs its own instance of the protocol, and blocks reach finality once enough signatures are collected, rather than after several confirmations.
Ref 1070001171