Paper 2024/472
Sailfish: Towards Improving Latency of DAG-based BFT
Abstract
Existing DAG-based BFT protocols exhibit long latency to commit decisions. The primary reason for such a long latency is having a leader every 2 or more “rounds”. Even under honest leaders, these protocols require two or more reliable broadcast (RBC) instances to commit the proposal submitted by the leader (leader vertex), and additional RBCs to commit other proposals (non-leader vertices). In this work, we present Sailfish, the first DAG-based BFT that supports a leader vertex in each round. Under honest leaders, Sailfish maintains a commit latency of one RBC round plus $1\delta$ to commit the leader vertex (where $\delta$ is the actual transmission latency of a message) and only an additional RBC round to commit non-leader vertices.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- DAG-based BFTSMRpartial synchrony
- Contact author(s)
-
n shrestha @ supraoracles com
aniket @ purdue edu
kartik @ cs duke edu - History
- 2024-03-22: approved
- 2024-03-20: received
- See all versions
- Short URL
- https://ia.cr/2024/472
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/472,
author = {Nibesh Shrestha and Aniket Kate and Kartik Nayak},
title = {Sailfish: Towards Improving Latency of DAG-based BFT},
howpublished = {Cryptology ePrint Archive, Paper 2024/472},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/472}},
url = {https://eprint.iacr.org/2024/472}
}
