We demonstrate a deterministic Byzantine consensus algorithm with synchronous performance in partial synchrony and naturally leaderless operation. Each message is authenticated only with the digital signature of its creator and resilience to any number of tolerated Byzantine processes requires two communication rounds. The algorithm terminates within a bounded interval of time. It is resilient to transient link faults and asynchrony in a fraction of links with a known distinct size per actual number of faulty processes - links asynchrony and faults are circumvented with up to 3-hop epidemic dissemination. Key finding: resilience to asynchrony of links and the enabled by it leaderless consensus ensure algorithm operation with simultaneous validity, safety, and bounded liveness.

翻译：我们提出了一种确定性拜占庭共识算法，该算法在部分同步环境下具有同步性能，并以去中心化方式自然运行。每条消息仅通过其创建者的数字签名进行认证，且对任意数量的容忍拜占庭进程的鲁棒性仅需两轮通信即可实现。算法在有限时间间隔内终止。它能抵御瞬态链路故障和部分链路的异步问题——异步链路和故障可通过最多三跳的流行病传播机制加以规避。关键发现：对链路异步的鲁棒性以及由此实现的去中心化共识，确保了算法在同时满足有效性、安全性和有界活性条件下的运行。