Parallel and Distributed Systems Group

Computer Science Department of Telecom SudParis

Cordial Miners: Fast and Efficient Consensus for Every Eventuality

Reading group: Mikhail Anoprenko presented "Cordial Miners: Fast and Efficient Consensus for Every Eventuality" (DISC'23) at Amphi 4 the 20/10/2023 at 10h30.


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 2× 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.