Optimal Load-Balanced Scalable Distributed Agreement

Yuval Gelles, Ilan Komargodski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the fundamental problem of designing classical consensus-related distributed abstractions for large-scale networks, where the number of parties can be huge. Specifically, we consider tasks such as Byzantine Agreement, Broadcast, and Committee Election, and our goal is to design scalable protocols in the sense that each honest party processes and sends a number of bits which is sub-linear in n, the total number of parties. In this work, we construct the first such scalable protocols for all of the above tasks. In our protocols, each party processes and sends Õ (√n) bits throughout Õ (1) rounds of communication, and correctness is guaranteed for at most 1/3-ϵ fraction of static byzantine corruptions for every constant ϵ>0 (in the full information model). All previous protocols for the considered agreement tasks were non-scalable, either because the communication complexity was linear or because the computational complexity was super polynomial. We complement our result with a matching lower bound showing that any Byzantine Agreement protocol must have ω(√n) complexity in our model. Previously, the state of the art was the well-known ω(3√n) lower bound of Holtby, Kapron, and King (Distributed Computing, 2008).

Original languageEnglish
Title of host publicationSTOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing
EditorsBojan Mohar, Igor Shinkar, Ryan O�Donnell
PublisherAssociation for Computing Machinery
Pages411-422
Number of pages12
ISBN (Electronic)9798400703836
DOIs
StatePublished - 10 Jun 2024
Event56th Annual ACM Symposium on Theory of Computing, STOC 2024 - Vancouver, Canada
Duration: 24 Jun 202428 Jun 2024

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference56th Annual ACM Symposium on Theory of Computing, STOC 2024
Country/TerritoryCanada
CityVancouver
Period24/06/2428/06/24

Bibliographical note

Publisher Copyright:
© 2024 Owner/Author.

Keywords

  • Broadcast
  • Byzantine Agreement
  • Consensus
  • Leader Election

Fingerprint

Dive into the research topics of 'Optimal Load-Balanced Scalable Distributed Agreement'. Together they form a unique fingerprint.

Cite this