Orthrus：通过并发部分排序交易加速多BFT共识（扩展版）
Orthrus: Accelerating Multi-BFT Consensus through Concurrent Partial Ordering of Transactions (Extended Version)
AI总结：
本文提出Multi-BFT协议Orthrus，通过部分排序加速交易确认并为需要严格排序的交易保留全局排序，结合交易划分与托管机制确保一致性与高并发，在广域网实验中延迟最高降低87%。
摘要：
多拜占庭容错（Multi-BFT）共识允许多个共识实例并行运行，解决了经典BFT共识中固有的领导者瓶颈问题。然而，Multi-BFT共识的全局排序强制执行严格的交易串行序列，带来了额外的确认延迟，并限制了并发性。在本文中，我们提出了Orthrus，这是一种Multi-BFT协议，它通过部分排序加速交易确认，同时为需要更严格排序的交易保留全局排序。为此，Orthrus策略性地划分交易以最大化并发性并确保一致性。此外，它引入了托管机制来管理部分排序和全局排序交易之间的交互。我们通过在真实环境下的广泛实验评估了Orthrus，在WAN和LAN环境中部署了128个副本。研究结果表明，与现有的Multi-BFT协议相比，在WAN中延迟最多降低了87%。
英文摘要：
Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus enforces a strict serialized sequence of transactions, imposing additional confirmation latency and also limiting concurrency. In this paper, we introduce Orthrus, a Multi-BFT protocol that accelerates transaction confirmation through partial ordering while reserving global ordering for transactions requiring stricter sequencing. To this end, Orthrus strategically partitions transactions to maximize concurrency and ensure consistency. Additionally, it incorporates an escrow mechanism to manage interactions between partially and globally ordered transactions. We evaluated Orthrus through extensive experiments in realistic settings, deploying 128 replicas in WAN and LAN environments. Our findings demonstrate latency reductions of up to 87% in WAN compared to existing Multi-BFT protocols.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
