License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2023.26
URN: urn:nbn:de:0030-drops-191525
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19152/
Keidar, Idit ;
Naor, Oded ;
Poupko, Ouri ;
Shapiro, Ehud
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.
BibTeX - Entry
@InProceedings{keidar_et_al:LIPIcs.DISC.2023.26,
author = {Keidar, Idit and Naor, Oded and Poupko, Ouri and Shapiro, Ehud},
title = {{Cordial Miners: Fast and Efficient Consensus for Every Eventuality}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {26:1--26:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19152},
URN = {urn:nbn:de:0030-drops-191525},
doi = {10.4230/LIPIcs.DISC.2023.26},
annote = {Keywords: Byzantine Fault Tolerance, State Machine Replication, DAG, Consensus, Blockchain, Blocklace, Cordial Dissemination}
}
Keywords: |
|
Byzantine Fault Tolerance, State Machine Replication, DAG, Consensus, Blockchain, Blocklace, Cordial Dissemination |
Collection: |
|
37th International Symposium on Distributed Computing (DISC 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
05.10.2023 |