@inproceedings{82ee7918152a4e8c850e4b2172a774ab,
title = "Cordial Miners: Fast and Efficient Consensus for Every Eventuality",
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.",
keywords = "Blockchain, Blocklace, Byzantine Fault Tolerance, Consensus, Cordial Dissemination, DAG, State Machine Replication",
author = "Idit Keidar and Oded Naor and Ouri Poupko and Ehud Shapiro",
note = "Publisher Copyright: {\textcopyright} Idit Keidar, Oded Naor, Ouri Poupko, and Ehud Shapiro; licensed under Creative Commons License CC-BY 4.0.; 37th International Symposium on Distributed Computing, DISC 2023 ; Conference date: 10-10-2023 Through 12-10-2023",
year = "2023",
month = oct,
day = "1",
doi = "10.4230/LIPIcs.DISC.2023.26",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Rotem Oshman",
booktitle = "37th International Symposium on Distributed Computing, DISC 2023",
address = "Germany",
}