No, the theorem by Fisher, Lynch, and Patterson (FLP) proved that a consensus algorithm has to make random choices in order to be aBFT. That’s why hashgraph makes random choices within the algorithm. As do all aBFT consensus algorithms.

Answers to the most frequently asked questions about Hedera Hashgraph.

No, the theorem by Fisher, Lynch, and Patterson (FLP) proved that a consensus algorithm has to make random choices in order to be aBFT. That’s why hashgraph makes random choices within the algorithm. As do all aBFT consensus algorithms.

Looking for another answer? Ask our team and community on the Hashgraph.org forums.

Join Community
Got any technical questions? Hedera Hashgraph developers hang out on Discord.

Let's Go