Cordial Miners: Fast and Efficient Consensus for Every Eventuality

Idit Keidar, Oded Naor, Ouri Poupko, Ehud Shapiro

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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

Original languageEnglish
Title of host publication37th International Symposium on Distributed Computing, DISC 2023
EditorsRotem Oshman
ISBN (Electronic)9783959773010
DOIs
StatePublished - 1 Oct 2023
Event37th International Symposium on Distributed Computing, DISC 2023 - L'Aquila, Italy
Duration: 10 Oct 202312 Oct 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume281

Conference

Conference37th International Symposium on Distributed Computing, DISC 2023
Country/TerritoryItaly
CityL'Aquila
Period10/10/2312/10/23

Keywords

  • Blockchain
  • Blocklace
  • Byzantine Fault Tolerance
  • Consensus
  • Cordial Dissemination
  • DAG
  • State Machine Replication

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Cordial Miners: Fast and Efficient Consensus for Every Eventuality'. Together they form a unique fingerprint.

Cite this