In this paper we extend the Multidimensional Byzantine Agreement (MBA) Protocol arXiv:2105.13487v2, a leaderless Byzantine agreement for vectors of arbitrary values, into the \emph{Cob} protocol, that works in Asynchronous Gossiping (AG) networks. This generalization allows the consensus process to be run by an incomplete network of nodes provided with (non-synchronized) same-speed clocks. Not all nodes are active in every step, so the network size does not hamper the efficiency, as long as the gossiping broadcast delivers the messages to every node in reasonable time. These network assumptions model more closely real-life communication channels, so the Cob protocol may be applicable to a variety of practical problems, such as blockchain platforms implementing sharding. The Cob protocol has the same Bernoulli-like distribution that upper bounds the number of steps required as the MBA protocol, and we prove its correctness and security assuming a supermajority of honest nodes in the network.
翻译:在本文中,我们将《多层面拜占庭协议协议协议》的ArXiv:2105.13487v2号扩展为在Asynchronous Gossiping(AG)网络中运作的“Asyncronous Gossiping (AG) ” 协议,将《多层面拜占庭协议(MBA) 协议》 协议的arXiv: 2105. 134877v2号扩展为在Asynchronous Gossiping (AG) 网络中运作的“ ” 协议。 通过这种普遍化,共识进程可以由提供(非同步的)相同速度时钟的不完整节点网络运行。 并非所有节点都在每一个步骤中发挥作用,因此只要流言的广播在合理时间内将信息传送到每个节点,网络的规模就不会妨碍效率。 这些网络假设模型更接近真实的通信渠道,因此 Cob协议可能适用于各种实际问题,例如实施碎片平台。 Cob协议的分布与Bernoulli相似,与MBOPA协议所要求的步骤数量具有上上限的分布相同,我们证明它是否正确和安全假定网络中诚实节点的超级多数。