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 two 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, as 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 的拜占庭进程，仅需两轮仅含发起者签名消息的交换即可完成，并在有界时间间隔内终止。该算法对瞬时故障及部分链路中的异步性具有鲁棒性（可根据每个故障进程数量已知的链路规模进行适配），通过三跳流行病传播机制规避异步与故障链路。核心发现：链路异步容忍性及其所支撑的部分同步中免领导者共识机制，确保了算法同时满足即时有效性、安全性与有界活性。