User:Blearn/Hashgraph
Original Article (deleted)[edit]
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".[4]
New Article[edit]
Hashgraph is a patented[1][2][3] distributed consensus algorithm that utilizes a novel concept of "virtual voting"[6][7]. Hashgraph can serve as a distributed ledger able to reach consensus between nodes/members in a fast (100,000's of transactions per second) and secure (Strong Form Byzantine Fault Tolerant) way with mathematically proven fairness in the absolute ordering of transactions.[8]
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 and gives them all the events that they don't yet know.
List of Hashgraph Implementations[edit]
Potential RSes[edit]
See also[edit]
References[edit]
- ^ a b United States Patent: 9646029 - Methods and apparatus for a distributed database within a network, May 9, 2017, retrieved 2017-08-26
{{citation}}: Unknown parameter|inventor-first=ignored (help); Unknown parameter|inventor-last=ignored (help) - ^ a b United States Patent: 9529923 - Methods and apparatus for a distributed database within a network, December 27, 2016, retrieved 2017-08-26
{{citation}}: Unknown parameter|inventor-first=ignored (help); Unknown parameter|inventor-last=ignored (help) - ^ a b United States Patent: 9390154 - Methods and apparatus for a distributed database within a network, July 12, 2016, retrieved 2017-08-26
{{citation}}: Unknown parameter|inventor-first=ignored (help); Unknown parameter|inventor-last=ignored (help) - ^ a b Baird, Leemon (May 31, 2016). "The Swirlds Hashgraph Consensus Algorithm: Fair, Fast, Byzantine Fault Tolerance" (PDF). Swirlds Tech Report.
- ^ a b "A New Approach to Consensus: Swirlds HashGraph". SAMMANTICS. Retrieved 2017-08-26.
- ^ "Hashgraph Achieves Consensus Without Proof of Work". Merkle.
- ^ "Swirlds and CULedger Collaborate to Deliver High Performance, Secure, Distributed Applications to Credit Unions". Business Wire.
Cite error: A list-defined reference named "dzone20171106" is not used in the content (see the help page).
Cite error: A list-defined reference named "zdnet20170914" is not used in the content (see the help page).
Cite error: A list-defined reference named "theblockchain20170917" is not used in the content (see the help page).