Threshold logical clocks abstract asynchronous networks to enable simpler consensus protocols achieving constant expected rounds for fail-stop nodes without common coins.
Blockmania: from Block DAGs to Consensus
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
Blockmania is a byzantine consensus protocol. Nodes emit blocks forming a directed acyclic graph (block DAG) that is subsequently interpreted by each node separately to ensure consensus with safety, liveness and finality. The resulting system has communication complexity $O(N^2)$ even in the worse case, and very low constant factors --- as compared to $O(N^4)$ for PBFT; it is leaderless; and network operations do not depend on the composition of the quorum or node stake. This makes Blockmania very efficient (leading to over 400K transactions per second on a wide area network), and ideal for dynamic membership and flexible and non-interrupted proof-of-stake protocols. A X-Blockmania variant, has $O(N)$ communication cost but also higher latency $O(\log N)$.
citation-role summary
background 1
citation-polarity summary
years
2019 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
SybilQuorum uses social trust networks to bootstrap value and transaction systems in open ledgers while thwarting Sybil attacks, evaluated as a secure Federated Byzantine Agreement System.
citing papers explorer
-
Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus
Threshold logical clocks abstract asynchronous networks to enable simpler consensus protocols achieving constant expected rounds for fail-stop nodes without common coins.
-
SybilQuorum: Open Distributed Ledgers Through Trust Networks
SybilQuorum uses social trust networks to bootstrap value and transaction systems in open ledgers while thwarting Sybil attacks, evaluated as a secure Federated Byzantine Agreement System.