General Convex Agreement with Near-Optimal Communication

arXiv:2602.21411v1 Announce Type: new
Abstract: Convex Agreement (CA) strengthens Byzantine Agreement (BA) by requiring the output agreed upon to lie in the convex hull of the honest parties’ inputs. This validity condition is motivated by practical aggregation tasks (e.g., robust learning or sensor fusion) where honest inputs need not coincide but should still constrain the decision. CA inherits BA lower bounds, and optimal synchronous round complexity is easy to obtain (e.g., via Byzantine Broadcast). The main challenge is emph{communication}: standard approaches for CA have a communication complexity of $Theta(Ln^2)$ for large $L$-bit inputs, leaving a gap in contrast to BA’s lower bound of $Omega(Ln)$ bits. While recent work achieves optimal communication complexity of $O(Ln)$ for sufficiently large $L$ [GLW,PODC’25], translating this result to general convexity spaces remained an open problem.
We investigate this gap for abstract convexity spaces, and we present deterministic synchronous CA protocols with near-optimal communication complexity: when $L = Omega(n cdot kappa)$, where $kappa$ is a security parameter, we achieve $O(Lcdot nlog n)$ communication for finite convexity spaces and $O(Lcdot n^{1+o(1)})$ communication for Euclidean spaces $mathbb{R}^d$. Our protocols have asymptotically optimal round complexity $O(n)$ and, when a bound on the inputs’ lengths $L$ is fixed a priori, we achieve near-optimal resilience $t < n/(omega+varepsilon)$ for any constant $varepsilon>0$, where $omega$ is the Helly number of the convexity space. If $L$ is unknown, we still achieve resilience $t 0$. We further note that our protocols can be leveraged to efficiently solve parallel BA.
Our main technical contribution is the use of extractor graphs to obtain a deterministic assignment of parties to committees, which is resilient against adaptive adversaries.