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.
翻译：我们引入了FnF-BFT, 这是一种由zantine 错误容忍度国家机器复制协议, 用于同步期间与理论性能界限部分同步的模式。 通过允许所有复制品作为领导者并独立地提出请求, FnF-BFT 将请求的执行平行化。 领导平行化在整个网络上分配负荷 -- 通过克服单一铅瓶增加吞吐量。 我们进一步使用历史数据确保运行良好的复制品处于指挥状态。 FnF- BFT 的通信复杂性在同步期间的复制品数量中是线性化的,因此与最新协议具有竞争力。 最后, 我们与FnF- BFT一起, 我们引入了一种BFT协议, 保证在真正由 ⁇ 袭击造成的稳定的网络条件下, 在稳定的网络条件下, 在稳定的网络条件下, 在真正通过“ 阻力” 攻击的情况下, 执行\ prot outperforps( state- the- the) Hottfopul's byput comput, 尤其是作为复制品的增加, 展示\ protraction's 显著提高缩缩缩能力。
相关内容
微信扫码咨询专知VIP会员