Blockmania: from Block DAGs to Consensus

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)$.

References in corpus (1)

• LinBFT: Linear-Communication Byzantine Fault Tolerance for Public Blockchains

Cited by in corpus (13)

• SoK: DAG-based Consensus Protocols
• Embedding a Deterministic BFT Protocol in a Block DAG
• Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
• OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems
• Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes
• StakeDag: Stake-based Consensus For Scalable Trustless Systems
• Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus
• StairDag: Cross-DAG Validation For Scalable BFT Consensus
• SybilQuorum: Open Distributed Ledgers Through Trust Networks
• Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks
• Lachesis: Scalable Asynchronous BFT on DAG Streams
• Scaling Distributed Ledgers and Privacy-Preserving Applications
• StreamNet: A DAG System with Streaming Graph Computing