Cob: a Leaderless Protocol for Parallel Byzantine Agreement in Incomplete Networks. (arXiv:2108.11157v2 [cs.DC] UPDATED)

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 …

dc networks