Cordial Miners: Blocklace-Based Ordering Consensus Protocols for Every Eventuality

05/18/2022
by   Idit Keidar, et al.
0

Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with optimal instances for asynchrony and eventual synchrony. Their efficiency – almost half the latency of state-of-the-art DAG-based protocols – stems from not using reliable broadcast as a building block. Rather, Cordial Miners use the blocklace – a partially-ordered generalization of the totally-ordered blockchain – for all algorithmic tasks required for ordering consensus: Dissemination, equivocation-exclusion, and ordering.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2022

Phalanx: A Practical Byzantine Ordered Consensus Protocol

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for...
research
12/12/2019

From Hashgraph to a Family of Atomic Broadcast Algorithms

The goal of this article is to extend the ideas concerning Bracha-Toueg ...
research
05/05/2023

Flash: An Asynchronous Payment System with Good-Case Linear Communication Complexity

While the original purpose of blockchains was to realize a payment syste...
research
10/25/2022

Musings on the HashGraph Protocol: Its Security and Its Limitations

The HashGraph Protocol is a Byzantine fault tolerant atomic broadcast pr...
research
04/14/2023

Chop Chop: Byzantine Atomic Broadcast to the Network Limit

At the heart of state machine replication, the celebrated technique enab...
research
01/15/2023

V-Guard: An Efficient Permissioned Blockchain for Achieving Consensus under Dynamic Memberships in V2X Networks

This paper presents V-Guard, a new permissioned blockchain that achieves...
research
05/12/2022

From Weakly-terminating Binary Agreement and Reliable Broadcast to Atomic Broadcast

We present a novel and simple solution to Atomic Broadcast (AB). We redu...

Please sign up or login with your details

Forgot password? Click here to reset