Multidimensional Byzantine Agreement in a Synchronous Setting
Andrea Flamini, Riccardo Longo, Alessio Meneghetti

TL;DR
This paper introduces the Multidimensional Byzantine Agreement (MBA) Protocol, enabling a network to reach consensus on vectors of information in a synchronous setting, even with some malicious nodes, using a probabilistic leaderless approach.
Contribution
It presents a novel multidimensional agreement protocol combining graded consensus and binary agreement, extending prior protocols to handle vector data in synchronous networks.
Findings
Protocol guarantees consensus with high probability
Halts in a finite expected number of steps
Secure against less than one-third malicious nodes
Abstract
In this paper we will present the Multidimensional Byzantine Agreement (MBA) Protocol, a leaderless Byzantine agreement protocol defined for complete and synchronous networks that allows a network of nodes to reach consensus on a vector of relevant information regarding a set of observed events. The consensus process is carried out in parallel on each component, and the output is a vector whose components are either values with wide agreement in the network (even if no individual node agrees on every value) or a special value that signals irreconcilable disagreement. The MBA Protocol is probabilistic and its execution halts with probability 1, and the number of steps necessary to halt follows a Bernoulli-like distribution. The design combines a Multidimensional Graded Consensus and a Multidimensional Binary Byzantine Agreement, the generalization to the multidimensional case…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance
