Transcription of THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, …
{{id}} {{{paragraph}}}
Example: bankruptcy
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.
THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM - SWIRLDS-TR-2016-01 3 thatsomeblocksareminedproperly,butdiscardedanyway. Italsomeansthatit is necessary to slow down how fast blocks are mined, so that the community can
Loading..
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: