TY - GEN
T1 - Cordial Miners
T2 - 37th International Symposium on Distributed Computing, DISC 2023
AU - Keidar, Idit
AU - Naor, Oded
AU - Poupko, Ouri
AU - Shapiro, Ehud
N1 - Publisher Copyright: © Idit Keidar, Oded Naor, Ouri Poupko, and Ehud Shapiro; licensed under Creative Commons License CC-BY 4.0.
PY - 2023/10/1
Y1 - 2023/10/1
N2 - 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.
AB - 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.
KW - Blockchain
KW - Blocklace
KW - Byzantine Fault Tolerance
KW - Consensus
KW - Cordial Dissemination
KW - DAG
KW - State Machine Replication
UR - https://www.scopus.com/pages/publications/85175347342
U2 - 10.4230/LIPIcs.DISC.2023.26
DO - 10.4230/LIPIcs.DISC.2023.26
M3 - Conference contribution
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 37th International Symposium on Distributed Computing, DISC 2023
A2 - Oshman, Rotem
Y2 - 10 October 2023 through 12 October 2023
ER -