Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees
Approximate Agreement (AA) is a key consensus primitive that allows honest parties to achieve close but not necessarily identical outputs, even in the presence of Byzantine faults. While optimal round complexity for synchronous AA on real values is well understood, its extension to other input spaces remains an open problem.
Authors
- Diana Ghinea (ORCID: https://orcid.org/0000-0002-5294-9459)
- M. Fuchs (ORCID: https://orcid.org/0000-0003-2272-4483)
- Zahra Parsaeian (ORCID: https://orcid.org/0009-0006-3848-1796)
Institutions
- University of Freiburg (DE)
- Lucerne University of Applied Sciences and Arts (CH)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3732772.3733555
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00