Are you interested in Hashgraph? Join the community!
Join India’s first Hashgraph community, in Trivandrum.
Everyone is welcome to join – Experts, Developers, Speculators, Investors, Newbies, and everyone in between.
A new system, the Swirlds hashgraph consensus algorithm, is proposed for replicated state machines with guaranteed Byzantine fault tolerance. It achieves fairness, in the sense that it is difficult for an attacker to manipulate which of two transactions will be chosen to be first in the consensus order. It has complete asynchrony, no leaders, no round robin, no proof-of work, eventual consensus with probability one, and high speed in the absence of faults. It is based on a gossip protocol, in which the participants don’t just gossip about transactions. They gossip about gossip. They jointly build a hashgraph reflecting all of the gossip events. This allows Byzantine agreement to be achieved through virtual voting.
•Introduction to Hashgraph Consensus
•Fundamentals of Gossip to Gossip Protocol
•Walkthrough on Swirlds and Babble IO
•Demo on a 4 node Hashgraph implementation
What to bring