Hedera uses a gossip protocol, in which the participants don’t just gossip about transactions - they also gossip about gossip. By adding information about their previous gossip to every current gossip message, participants are able to jointly build a hashgraph reflecting the history of all of the gossip events. Participants then analyze that shared history in order to determine a consensus timestamp for all transactions. The Byzantine agreement mechanism participants use is called virtual voting. Alice's computer does not send Bob's computer a vote over the internet, about what order the transactions were received. Instead, Bob calculates what vote Alice would have sent, based on his knowledge of what Alice knows, and when she learned it, according to the history in the hashgraph. This yields fair Byzantine agreement on a total order for all transactions, with very little communication overhead beyond the transactions themselves.
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?