Iterative Approximate Byzantine Consensus (IABC) is a fundamental problem of fault-tolerant distributed computing where machines seek to achieve approximate consensus to arbitrary exactness in the presence of Byzantine failures. We present a novel algorithm for this problem, named Relay-IABC, which relies on the usage of a multi-hop relayed messaging system and crytographically secure message signatures. The use of signatures and relays allows the strict necessary network conditions of traditional IABC algorithms to be circumvented. In addition, we show evidence that Relay-IABC achieves faster convergence than traditional algorithms even under these strict network conditions with both theoretical analysis and experimental results.

翻译：使用多希望传输信息系统和加密加密信息签名,使用签名和转发系统可以绕过传统的互联网算法的严格必要网络条件。此外,我们证明,即使在这些严格的网络条件下,在理论分析和实验结果两方面,Relay-IABC也比传统算法更快地实现趋同。