This paper presents Banyan, the first rotating leader state machine replication (SMR) protocol that allows transactions to be confirmed in just a single round-trip time in the Byzantine fault tolerance (BFT) setting. Based on minimal alterations to the Internet Computer Consensus (ICC) protocol and with negligible communication overhead, we introduce a novel dual mode mechanism that enables optimal block finalization latency in the fast path. Crucially, the modes of operation are integrated, such that even if the fast path is not effective, no penalties are incurred. Moreover, our algorithm maintains the core attributes of the ICC protocol it is based on, including optimistic responsiveness and rotating leaders without the necessity for a view-change protocol. We prove the correctness of our protocol and provide an open-source implementation of it. Banyan is compared to its predecessor ICC, as well as other well known BFT protocols, in a globally distributed wide-area network. Our evaluation reveals that Banyan reduces latency by up to 30% compared to state-of-the-art protocols, without requiring additional security assumptions.

翻译：本文提出了Banyan，这是首个在拜占庭容错（BFT）场景下仅需单次往返时延即可确认交易的轮换领导者状态机复制（SMR）协议。基于对互联网计算机共识（ICC）协议的最小化修改及可忽略的通信开销，我们引入了一种新颖的双模机制，可在快速路径中实现最优区块最终确认延迟。关键在于两种操作模式被有机整合，即使快速路径失效也不会产生性能惩罚。此外，我们的算法保留了所基于的ICC协议的核心特性，包括乐观响应性和无需视图变更协议的轮换领导者机制。我们证明了协议的正确性并提供了开源实现。通过在全球化分布式广域网中将Banyan与其前身ICC及其他知名BFT协议进行比较，评估表明Banyan在无需额外安全假设的情况下，相比最先进协议可降低高达30%的延迟。