arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.05356cs.DC
收藏

通过亚二次通信实现单值性

Reaching Univalency with Subquadratic Communication

Andrew Lewis-Pye

AI总结:

本文通过引入ε-BA协议,证明实现单值性无需二次通信,从而揭示Dolev-Reischuk下界中的二次成本源于传播而非单值性确定。

摘要:

Dolev-Reischuk下界证明了任何能够容忍f个故障的确定性拜占庭同意(BA)协议需要Ω(f² +n)条消息。但这个二次成本究竟付出了什么代价?即使最基础的要求,即每个正确的处理器至少接收一条消息,也 necessitates Ω(f² +n)条消息。这提出了一个根本性问题:Dolev-Reischuk下界是关于实现单值性——协议结果确定的点——的难度,还是仅仅关于将结果传达给所有处理器之后的传播?我们通过证明实现单值性并不需要二次通信来解决这个问题。具体来说,我们引入了ε-BA,允许ε比例的正确处理器输出错误,证明当f <n(1/3 -ε)时,可以确定性地以O(n log n)的通信复杂度解决。关键的是,任何ε-BA协议都可以作为完整BA协议的第一阶段:在ε-BA之后,一次全交换和多数投票即可完成BA。由于结果在ε-BA之后已经确定,这表明Dolev-Reischuk中的二次成本完全来自于传播,而非实现单值性。我们还定义了可提取BA用于认证场景,捕捉当处理器集体持有足够签名的消息以确定一致值的情况,并证明其可以以O(f log f)的通信复杂度解决。

英文摘要:

The Dolev-Reischuk lower bound establishes that any deterministic Byzantine Agreement (BA) protocol for $n$ processors tolerating $f$ faults requires $Ω(f^2+n)$ messages. But what exactly does this quadratic cost pay for? Even the minimal requirement that every correct processor \emph{receive at least one message} already necessitates $Ω(f^2 + n)$ messages. This raises a fundamental question: is the Dolev-Reischuk bound about the difficulty of \emph{reaching univalency} -- the point at which the protocol's outcome is determined -- or merely about \emph{disseminating} the outcome to all processors afterward? We resolve this question by showing that reaching univalency does \emph{not} require quadratic communication. Specifically, we introduce $ε$-BA, a relaxation allowing an $ε$-fraction of correct processors to output incorrectly, and prove it can be solved deterministically with $O(n \log n)$ communication complexity when $f < n(1/3 - ε)$. Crucially, any $ε$-BA protocol can serve as the first phase of a full BA protocol: after $ε$-BA, a single all-to-all exchange and majority vote completes BA. Since the outcome is already determined after $ε$-BA, this demonstrates that the quadratic cost in Dolev-Reischuk stems entirely from dissemination, rather than from reaching univalency. We also define Extractable BA for authenticated settings, capturing when processors collectively hold enough signed messages to determine the agreed value, and show it can be solved with communication complexity $O(f \log f)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑