DAG it off: Latency Prefers No Common Coins
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908564811939840 |
|---|---|
| author | Amores-Sesar, Ignacio Grøndal, Viktor Holmgård, Adam Ottendal, Mads |
| author_facet | Amores-Sesar, Ignacio Grøndal, Viktor Holmgård, Adam Ottendal, Mads |
| contents | We introduce Black Marlin, the first Directed Acyclic Graph (DAG)-based Byzantine atomic broadcast protocol in a partially synchronous setting that successfully forgoes the reliable broadcast and common coin primitives while delivering transactions every round. Black Marlin achieves the optimal latency of 3 rounds of communication (4.25 with Byzantine faults) while maintaining optimal communication and amortized communication complexities. We present a formal security analysis of the protocol, accompanied by empirical evidence that Black Marlin outperforms state-of-the-art DAG-based protocols in both throughput and latency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_14716 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | DAG it off: Latency Prefers No Common Coins Amores-Sesar, Ignacio Grøndal, Viktor Holmgård, Adam Ottendal, Mads Distributed, Parallel, and Cluster Computing We introduce Black Marlin, the first Directed Acyclic Graph (DAG)-based Byzantine atomic broadcast protocol in a partially synchronous setting that successfully forgoes the reliable broadcast and common coin primitives while delivering transactions every round. Black Marlin achieves the optimal latency of 3 rounds of communication (4.25 with Byzantine faults) while maintaining optimal communication and amortized communication complexities. We present a formal security analysis of the protocol, accompanied by empirical evidence that Black Marlin outperforms state-of-the-art DAG-based protocols in both throughput and latency. |
| title | DAG it off: Latency Prefers No Common Coins |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2508.14716 |