Transcription of THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, …
{{id}} {{{paragraph}}}
Example: quiz answers
THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, …
THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, FAST, BYZANTINE fault TOLERANCELEEMON BAIRDMAY 31, 2016 SWIRLDS TECH REPORT new system, theSwirlds HASHGRAPH CONSENSUS algorithm, is pro-posed for replicated state machines with guaranteed Byzantine fault achievesfairness, in the sense that it is difficult for an attacker to manip-ulate which of two transactions will be chosen to be first in the consensusorder. It has complete asynchrony, no leaders, no round robin, no proof-of-work, eventual CONSENSUS with probability one, and high speed in the absenceof faults. It is based on a gossip protocol, in which the participants don tjust gossip about transactions. Theygossip about gossip. They jointly build ahashgraphreflecting all of the gossip events. This allows Byzantine agreementto be achieved throughvirtual voting. Alice does not send Bob a vote overthe Internet.
the swirlds hashgraph consensus algorithm: fair, fast, byzantine fault tolerance leemonbaird may31,2016 swirldstechreportswirlds-tr-2016-01 abstract.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: