Cordial Miners: Fast and Efficient Consensus for Every Eventuality

TL;DR

Cordial Miners introduce a family of Byzantine Atomic Broadcast protocols that significantly improve latency and complexity by leveraging the blocklace data structure, applicable in asynchronous and eventual synchrony settings.

Contribution

They present a novel protocol family that enhances efficiency and latency in Byzantine consensus using the blocklace, eliminating the need for Reliable Broadcast.

Findings

Almost 2X latency improvement over state-of-the-art DAG protocols

Achieves optimal O(n) good-case complexity

Uses blocklace for core consensus components

Abstract

Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block. Rather, Cordial Miners use the blocklace -- a partially-ordered counterpart of the totally-ordered blockchain data structure -- to implement the three algorithmic components of consensus: Dissemination, equivocation-exclusion, and ordering.