Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916331256807424 |
|---|---|
| author | Antunes, Diogo S. Oliveira, Afonso N. Breda, André Franco, Matheus Guilherme Moniz, Henrique Rodrigues, Rodrigo |
| author_facet | Antunes, Diogo S. Oliveira, Afonso N. Breda, André Franco, Matheus Guilherme Moniz, Henrique Rodrigues, Rodrigo |
| contents | Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge of asynchronous BFT protocols, which use randomization to remove the need for bounds on message delivery times, making them more resilient to adverse network conditions. However, existing research proposals still fall short of gaining practical adoption, plausibly because they are not able to combine good performance with a simple design that can be readily understood and adopted. In this paper, we present Alea-BFT, a simple and highly efficient asynchronous BFT protocol, which is gaining practical adoption, namely in Ethereum distributed validators. Alea-BFT brings the key design insight from classical protocols of concentrating part of the work on a single designated replica and incorporates this principle in a simple two-stage pipelined design, with an efficient broadcast led by the designated replica, followed by an inexpensive binary agreement. The evaluation of our research prototype implementation and two real-world integrations in cryptocurrency ecosystems shows excellent performance, improving on the fastest protocol (Dumbo-NG) in terms of latency and displaying good performance under faults. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_14538 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance Antunes, Diogo S. Oliveira, Afonso N. Breda, André Franco, Matheus Guilherme Moniz, Henrique Rodrigues, Rodrigo Distributed, Parallel, and Cluster Computing C.2.4; D.4.5 Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge of asynchronous BFT protocols, which use randomization to remove the need for bounds on message delivery times, making them more resilient to adverse network conditions. However, existing research proposals still fall short of gaining practical adoption, plausibly because they are not able to combine good performance with a simple design that can be readily understood and adopted. In this paper, we present Alea-BFT, a simple and highly efficient asynchronous BFT protocol, which is gaining practical adoption, namely in Ethereum distributed validators. Alea-BFT brings the key design insight from classical protocols of concentrating part of the work on a single designated replica and incorporates this principle in a simple two-stage pipelined design, with an efficient broadcast led by the designated replica, followed by an inexpensive binary agreement. The evaluation of our research prototype implementation and two real-world integrations in cryptocurrency ecosystems shows excellent performance, improving on the fastest protocol (Dumbo-NG) in terms of latency and displaying good performance under faults. |
| title | Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance |
| topic | Distributed, Parallel, and Cluster Computing C.2.4; D.4.5 |
| url | https://arxiv.org/abs/2407.14538 |