Cordial Miners: Fast and Efficient Consensus for Every Eventuality
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929241300402176 |
|---|---|
| author | Keidar, Idit Naor, Oded Poupko, Ouri Shapiro, Ehud |
| author_facet | Keidar, Idit Naor, Oded Poupko, Ouri Shapiro, Ehud |
| contents | 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 2X 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_09174 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Cordial Miners: Fast and Efficient Consensus for Every Eventuality Keidar, Idit Naor, Oded Poupko, Ouri Shapiro, Ehud Distributed, Parallel, and Cluster Computing Multiagent Systems Networking and Internet Architecture 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 2X 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. |
| title | Cordial Miners: Fast and Efficient Consensus for Every Eventuality |
| topic | Distributed, Parallel, and Cluster Computing Multiagent Systems Networking and Internet Architecture |
| url | https://arxiv.org/abs/2205.09174 |