论文标题
FNF-BFT：探索BFT协议的性能限制
FnF-BFT: Exploring Performance Limits of BFT Protocols
论文作者
论文摘要
我们介绍了FNF-BFT，这是一种平行领导者拜占庭式耐受性状态机器复制方案，用于在同步过程中具有理论性能界限的部分同步模型。通过允许所有副本充当领导者并独立提出请求，FNF-BFT并行将请求执行。领导者并行化在整个网络上分配负载 - 通过克服单领导者瓶颈来增加吞吐量。我们进一步使用历史数据来确保执行良好的复制品。 FNF-BFT的通信复杂性在同步过程中的复制品数量中是线性的，因此与最新协议竞争。最后，使用FNF-BFT，我们引入了一个BFT协议，并在真正的拜占庭攻击下在稳定的网络条件下提供性能保证。 \ prot的原型实现胜过（最先进的）热门吞吐量，尤其是随着副本的增加，展示\ prot的显着改善的缩放功能。
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 a BFT protocol with performance guarantees in stable network conditions under truly byzantine attacks. A prototype implementation of \prot outperforms (state-of-the-art) HotStuff's throughput, especially as replicas increase, showcasing \prot's significantly improved scaling capabilities.
