Hashgraph is a new kind of consensus mechanism, based on gossip about gossip and virtual voting. Previous generations of voting systems go back decades and achieve definitive consensus, but are very slow. Hashgraph’s innovation is in virtual voting, which provides all the guarantees associated with voting (which proof-of-work doesn't provide), but is incredibly efficient because the network doesn’t actually send any votes over the internet.
- Categories
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 proof-of-work?
- 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?
