Crisis develops a parameterized family of signature-free algorithms for probabilistically achieving total order in high-entropy unstructured P2P networks with near-optimal communication efficiency.
(2016) The Swirlds hashgraph con- sensus algorithm: Fair, fast, Byzantine fault tolerance, Swrirlds tech report, SWIRLDS-TR- 2016-01
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks
Crisis develops a parameterized family of signature-free algorithms for probabilistically achieving total order in high-entropy unstructured P2P networks with near-optimal communication efficiency.