HoneyBadger BFT (HBBFT) is a consensus protocol described in a 2016 paper by Andrew Miller and colleagues, presented at the ACM Conference on Computer and Communications Security. It belongs to the family of asynchronous Byzantine fault tolerance (aBFT) protocols: it can reach agreement among a fixed group of nodes, even if just under one-third of them are faulty or malicious, without assuming that messages arrive within any time limit. Earlier practical designs such as PBFT depend on timeouts and can stall when the network is slow or under attack.
In each round, every node proposes a batch of transactions, encrypted with a threshold scheme so that no one can censor it on sight; the nodes then agree on which batches to include and decrypt them together. Erasure coding keeps bandwidth manageable. Because it needs a known membership, HBBFT suits permissioned blockchains and proof-of-authority networks, and open-source implementations were built for such systems.
Ref 1070001193