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.
Articles in this section
- How much bandwidth overhead does gossip about gossip add to messages?
- Have any non-Carnegie Mellon professors or academics verified hashgraph as asynchronous Byzantine fault tolerant (ABFT)?
- Who generates the timestamp on a transaction?
- What is 'gossip about gossip and 'virtual voting'?
- Why was hashgraph invented?
- Is the hashgraph consensus algorithm patented?
- How can hashgraph deliver consensus without PoW?
- How efficient is the hashgraph consensus algorithm?
- Does the FLP theorem say aBFT consensus is impossible?
- Where can I find more information about the hashgraph Coq proof?