We demonstrate a deterministic Byzantine consensus algorithm with synchronous operation in partial synchrony. It is naturally leaderless, tolerates any number of $ f<n/2 $ Byzantine processes with 2 rounds of exchange of originator-only signed messages, and terminates within a bounded interval of time. The algorithm is resilient to transient faults and asynchrony in a fraction of links with known size per number of faulty processes. It circumvents asynchronous and faulty links with 3-hop epidemic dissemination. Key finding: the resilience to asynchrony of links and the enabled by it leaderless consensus in partial synchrony ensure algorithm operation with simultaneous validity, safety, and bounded liveness.

翻译：我们展示了一种在部分同步条件下实现同步操作的确定性拜占庭共识算法。该算法天然无领导者，可容忍任意数量 $ f<n/2 $ 的拜占庭进程，仅需两轮源自原始发送者的签名消息交换，即可在有限时间间隔内终止。算法对瞬态故障及因故障进程数量确定的部分链路异步性具有鲁棒性。通过3跳流行病传播规避异步及故障链路。关键发现：链路异步性的鲁棒性及其所支撑的部分同步下的无领导者共识，确保了算法同时具备有效性、安全性和有界活性。