FnF-BFT: Exploring Performance Limits of BFT Protocols
2 visualizzazioni
Passa al primo messaggio da leggere
Dionysis Zindros
30 mar 2021, 17:12:2030/03/21
a decr...@googlegroups.com
Tomorrow, Wednesday, March 31, 2021, 03:00 PM UTC, Lioba Heimbach from ETH Zurich will present "FnF-BFT: Exploring Performance Limits of BFT Protocols".
Abstract: We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during synchrony. By allowing all replicas to act as leaders and propose requests independently, FnF-BFT parallelizes the execution of requests. Leader parallelization distributes the load over the entire network – increasing throughput by overcoming the single-leader bottleneck. We further use historical data to ensure that well-performing replicas are in command. FnF-BFT’s communication complexity is linear in the number of replicas during synchrony and thus competitive with state-of-the-art protocols. Finally, with FnF-BFT, we introduce the first BFT protocol with performance guarantees in stable network conditions under truly byzantine attacks. A prototype implementation of FnF-BFT outperforms (state-of-the-art) HotStuff’s throughput, especially as replicas increase, showcasing FnF-BFT’s significantly improved scaling capabilities.
Join here: https://zoom.us/j/95967912472?pwd=MHNHNlppNnJXT2JXRHNjNFJuZEpWZz09
Password: GC7QRm
More seminars: https://decrypto.org/seminar
Abstract: We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during synchrony. By allowing all replicas to act as leaders and propose requests independently, FnF-BFT parallelizes the execution of requests. Leader parallelization distributes the load over the entire network – increasing throughput by overcoming the single-leader bottleneck. We further use historical data to ensure that well-performing replicas are in command. FnF-BFT’s communication complexity is linear in the number of replicas during synchrony and thus competitive with state-of-the-art protocols. Finally, with FnF-BFT, we introduce the first BFT protocol with performance guarantees in stable network conditions under truly byzantine attacks. A prototype implementation of FnF-BFT outperforms (state-of-the-art) HotStuff’s throughput, especially as replicas increase, showcasing FnF-BFT’s significantly improved scaling capabilities.
Join here: https://zoom.us/j/95967912472?pwd=MHNHNlppNnJXT2JXRHNjNFJuZEpWZz09
Password: GC7QRm
More seminars: https://decrypto.org/seminar
Rispondi a tutti
Rispondi all'autore
Inoltra
0 nuovi messaggi