HoneyBadger BFT Consensus
R&D consensus model
While the team has extensively researched a working implementation of HoneyBadger BFT consensus, this will likely not proceed as consensus will instead be provided by the Gnosis Beacon Chain. Artifacts on the research are below.
Our Honey Badger BFT and Threshold Cryptography implementations have both undergone extensive security audits to ensure safety and cryptographic integrity. The results are available here
For more information on this implementation please see the HoneyBadgerBFT Github repo.
The Honey Badger consensus algorithm allows nodes in a distributed, potentially asynchronous environment to achieve agreement on transactions. The agreement process does not require a leader node, tolerates corrupted nodes, and makes progress in adverse network conditions.
Honey Badger is Byzantine Fault Tolerant. The protocol can reach consensus with a number of failed nodes f (including complete takeover by an attacker), as long as the total number N of nodes is greater than 3 * f.
Honey Badger is asynchronous. It does not make timing assumptions about message delivery. An adversary can control network scheduling and delay messages without impacting consensus.
The following articles explain much more about HBBFT and how it works.
Export as PDF
Copy link