# Hashgraph

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This article was considered for deletion at Wikipedia on October 28 2017. This is a backup of Wikipedia:Hashgraph. All of its AfDs can be found at Wikipedia:Special:PrefixIndex/Wikipedia:Articles_for_deletion/Hashgraph, the first at Wikipedia:Wikipedia:Articles_for_deletion/Hashgraph. Purge

The "hashgraph" is a data structure using a patented[1][2][3] algorithm developed by Professor Leemon Baird. The hashgraph stores and updates information which allows a distributed and decentralised community to reach consensus between nodes/members in a fast (250,000 transactions per second)[4] and secure (Strong Form Byzantine Fault Tolerant) way with mathematically proven fairness in the absolute ordering of transactions.

The data structure is a directed acyclic graph, where each vertex contains the hash of its two parent vertices.[5] A hashgraph is updated by gossip where each member repeatedly chooses another member at random who gives them all the events that they don't yet know.

The hashgraph utilizes a protocol called "gossip about gossip" for information sharing. This means that part of the information transferred between members is an abbreviated history of how members have spoken to other members.

The information stored in a hashgraph is a history of how everyone gossiped. When Alice tells Bob everything she knows during a gossip sync, Bob creates a new block or "event" which commemorates the occurrence. The event becomes a vertex in the graph containing Bob's most recent event, the hash of Alice's most recent event, a timestamp, along with any new transactions that Bob wants to create at that moment. Combined, the hashgraph is the set of all known events. The hashgraph was first proposed in a white paper by Leemon Baird titled "The Swirlds Hashgraph Consensus Algorithm: Fair, Fast, Byzantine Fault Tolerance".[6]