Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.08771 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912614277185536 |
|---|---|
| author | Shoup, Victor Sliwinski, Jakub Vonlanthen, Yann |
| author_facet | Shoup, Victor Sliwinski, Jakub Vonlanthen, Yann |
| contents | We present Kudzu, a high-throughput atomic broadcast protocol with an integrated fast path. Our contribution is based on the combination of two lines of work. Firstly, our protocol achieves finality in just two rounds of communication if all but $p$ out of $n = 3f + 2p + 1$ participating replicas behave correctly, where $f$ is the number of Byzantine faults that are tolerated. Due to the seamless integration of the fast path, even in the presence of more than $p$ faults, our protocol maintains state-of-the-art characteristics. Secondly, our protocol utilizes the bandwidth of participating replicas in a balanced way, alleviating the bottleneck at the leader, and thus enabling high throughput. This is achieved by disseminating blocks using erasure codes. Despite combining a novel set of advantages, Kudzu is remarkably simple: intricacies such as progress certificates, complex view changes, and speculative execution are avoided. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_08771 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Kudzu: Fast and Simple High-Throughput BFT Shoup, Victor Sliwinski, Jakub Vonlanthen, Yann Distributed, Parallel, and Cluster Computing Cryptography and Security We present Kudzu, a high-throughput atomic broadcast protocol with an integrated fast path. Our contribution is based on the combination of two lines of work. Firstly, our protocol achieves finality in just two rounds of communication if all but $p$ out of $n = 3f + 2p + 1$ participating replicas behave correctly, where $f$ is the number of Byzantine faults that are tolerated. Due to the seamless integration of the fast path, even in the presence of more than $p$ faults, our protocol maintains state-of-the-art characteristics. Secondly, our protocol utilizes the bandwidth of participating replicas in a balanced way, alleviating the bottleneck at the leader, and thus enabling high throughput. This is achieved by disseminating blocks using erasure codes. Despite combining a novel set of advantages, Kudzu is remarkably simple: intricacies such as progress certificates, complex view changes, and speculative execution are avoided. |
| title | Kudzu: Fast and Simple High-Throughput BFT |
| topic | Distributed, Parallel, and Cluster Computing Cryptography and Security |
| url | https://arxiv.org/abs/2505.08771 |