Communication Efficient Byzantine Agreement with Predictions
Muhammad Ayaz Dzulfikar, Seth Gilbert

TL;DR
This paper presents communication-efficient Byzantine agreement algorithms leveraging predictions, achieving near-optimal complexity and tolerating many prediction errors without excessive message exchange.
Contribution
It introduces algorithms that significantly reduce communication complexity in Byzantine agreement with predictions, surpassing previous limitations and achieving optimal round complexity.
Findings
Unauthenticated algorithm with $ ilde{O}(n^{2.5})$ communication complexity.
Authenticated algorithm with optimal $O(n^2 ext{kappa})$ communication complexity.
All algorithms have optimal round complexity regardless of prediction errors.
Abstract
In Byzantine agreement with predictions each process begins with an input value and some (unreliable) prediction bits. Recently, it has been shown that with \emph{classification predictions} -- where the predictions predict each process to be honest or faulty -- Byzantine agreement can be completed more quickly than without predictions, circumventing the traditional round lower bound. However, existing algorithms either handle limited prediction errors or send too many messages. Moreover, they all exchange bits -- enough to allow the processes to approximately agree on the classifications. In fact, it almost seemed necessary to share a significant number of prediction bits if one wanted to tolerate a high number of incorrect predictions. In this paper, we show that this high level of communication (and sharing of predictions) is not inherent by developing an…
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.
