In this paper we extend the \emph{Multidimensional Byzantine Agreement (MBA) Protocol}, a {leaderless} Byzantine agreement for lists of arbitrary values, into a protocol suitable for wide gossiping networks: \emph{Cob}. 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. Cob has the same Bernoulli-like distribution that upper-bounds the number of steps as the MBA protocol. We prove its correctness and security assuming a supermajority of honest nodes in the network, and compare its performance with Algorand.
翻译:在本文中,我们扩展了用于任意价值清单的{无铅}Byzantine协议(MBA)协议的\emph{MDLOD Byzantine协议},将其扩展为适合广泛八卦网络的议定书:\emph{Cob}。这种概括化使得协商一致进程能够由一个不完整的节点网络运行,该网络提供(非同步的)相同速度时钟。并非所有节点都在每一步都活动,因此网络规模不会影响效率,只要八卦广播在合理时间内将信息传送到每个节点。这些网络假设模拟更接近真实的通信渠道,因此 Cob 协议可能适用于各种实际问题,例如实施裁剪的块链平台。 Cob 有着与 Bernoulli 相似的分布, 与 MBA 协议一样, 与 Bernoulli 一样的分布与 Bernoulli 协议一样, 。 我们证明了它是否正确和安全地假定网络中诚实节点的绝大多数, 并与Algorand 比较其表现。