Blockmania: from Block DAGs to Consensus

09/05/2018
by   George Danezis, et al.
0

Blockmania is a byzantine consensus protocol. Nodes emit blocks forming a directed acyclic graph (block DAG). The block DAG 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 ideal for dynamic membership and flexible and non-interrupted proof-of-stake protocols. X-Blockmania, has O(N) communication cost but also higher latency O( N).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2018

OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems

This paper introduces a new family of consensus protocols, namely Laches...
research
09/29/2021

Fast B4B: Fast BFT for Blockchains

Low latency is one of the desired properties for partially synchronous B...
research
06/25/2019

A Permit-Based Optimistic Byzantine Ledger

PermitBFT solves the byzantine consensus problem for n nodes tolerating ...
research
02/19/2020

The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems

Federated Byzantine Agreement Systems (FBASs) are a fascinating new para...
research
04/13/2020

A Hierarchical Model for Fast Distributed Consensus in Dynamic Networks

We present two new consensus algorithms for dynamic networks. The first,...
research
01/06/2021

Highway: Efficient Consensus with Flexible Finality

There has been recently a lot of progress in designing efficient partial...
research
11/24/2021

Securing Proof-of-Stake Nakamoto Consensus Under Bandwidth Constraint

Satoshi Nakamoto's Proof-of-Work (PoW) longest chain (LC) protocol was a...

Please sign up or login with your details

Forgot password? Click here to reset