Lemonshark: Asynchronous DAG-BFT With Early Finality
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914536126152704 |
|---|---|
| author | Hu, Michael Yiqing Yan, Alvin Hong Yao Yihan, Yang Xiang, Liu Jialin, Li |
| author_facet | Hu, Michael Yiqing Yan, Alvin Hong Yao Yihan, Yang Xiang, Liu Jialin, Li |
| contents | DAG-Rider popularized a new paradigm of DAG-BFT protocols, separating dissemination from consensus: all nodes disseminate transactions as blocks that reference previously known blocks, while consensus is reached by electing certain blocks as leaders. This design yields high throughput but confers optimal latency only to leader blocks; non-leader blocks cannot be committed independently.
We present Lemonshark, an asynchronous DAG-BFT protocol that reinterprets the DAG at a transactional level and identifies conditions where commitment is sufficient -- but not necessary -- for safe results, enabling nodes to finalize transactions before official commitment, without compromising correctness. Compared to the state-of-the-art asynchronous BFT protocol, Lemonshark reduces latency by up to 65\%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_03974 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Lemonshark: Asynchronous DAG-BFT With Early Finality Hu, Michael Yiqing Yan, Alvin Hong Yao Yihan, Yang Xiang, Liu Jialin, Li Distributed, Parallel, and Cluster Computing DAG-Rider popularized a new paradigm of DAG-BFT protocols, separating dissemination from consensus: all nodes disseminate transactions as blocks that reference previously known blocks, while consensus is reached by electing certain blocks as leaders. This design yields high throughput but confers optimal latency only to leader blocks; non-leader blocks cannot be committed independently. We present Lemonshark, an asynchronous DAG-BFT protocol that reinterprets the DAG at a transactional level and identifies conditions where commitment is sufficient -- but not necessary -- for safe results, enabling nodes to finalize transactions before official commitment, without compromising correctness. Compared to the state-of-the-art asynchronous BFT protocol, Lemonshark reduces latency by up to 65\%. |
| title | Lemonshark: Asynchronous DAG-BFT With Early Finality |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2604.03974 |