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

距离保持摘要:BFT共识的一种基础组件

Distance-Preserving Digests: A Primitive for BFT Consensus

School of Engineering University of Connecticut(康涅狄格大学工程学院)

Ryan Patrick Mercier

AI总结:

本文提出距离保持交易摘要,通过8维空间中的可交换向量和替代碰撞抵抗哈希,解决BFT共识中距离破坏问题,提升共识效率与安全性。

摘要:

每个BFT共识协议都使用抗碰撞哈希来比较验证者状态。抗碰撞性破坏距离:两个验证者在20个交易中同意19个产生无关哈希,与无共同交易的验证者无法区分。这迫使BFT文献中的三个设计约束:验证者必须在投票前同步状态,协议质量只能在投票后测量,以及层级委员会必须足够大以实现独立BFT,限制树深度。本文引入距离保持交易摘要,一种用8维空间中的可交换向量和替代抗碰撞哈希的原始组件。该原始组件具有哈希缺乏的三个属性:距离与分歧成比例,加权平均是精确的,且集合差异可通过布隆过滤器差识别。我们展示了三个应用:一种两阶段BFT协议(Proxima)在验证者同意时实现单轮最终性;具有10个验证者组的树状共识(vs Ethereum的128个),因为距离过滤取代了每组BFT;以及跨分片一致性验证,每分片对128字节,取代两阶段提交的每交易协调。安全性已证明:少于N/3的拜占庭验证者无法导致冲突最终性,无论第一阶段聚类或树拓扑。在N=100,000时,Proxima Tree使用的消息数量比HotStuff少2.2倍(一个结构性质不受并行的影响)。单核最终性为0.9秒vs HotStuff的18秒;多核BLS缩小但未消除此差距。

英文摘要:

Every BFT consensus protocol uses collision-resistant hashes to compare validator state. Collision resistance destroys distance: two validators agreeing on 19 of 20 transactions produce unrelated hashes, indistinguishable from validators sharing nothing. This forces three design constraints across the BFT literature: validators must synchronize state before voting, agreement quality cannot be measured until votes are counted, and hierarchical committees must be large enough for independent BFT, limiting tree depth. This paper introduces distance-preserving transaction digests, a primitive that replaces collision-resistant hashes with commutative vector sums in 8-dimensional space. The primitive has three properties hashes lack: distance is proportional to disagreement, weighted means are exact, and set differences are identifiable via bloom filter diff. We demonstrate three applications: a two-phase BFT protocol (Proxima) that achieves single-round finality when validators agree; tree-structured consensus with groups of 10 validators (vs 128 in Ethereum), enabled because distance filtering replaces per-group BFT; and cross-shard consistency verification at 128 bytes per shard pair, replacing the per-transaction coordination of two-phase commit. Safety is proved: fewer than N/3 Byzantine validators cannot cause conflicting finalization, independent of Phase 1 clustering or tree topology. At N =100,000, Proxima Tree uses 2.2x fewer messages than HotStuff (a structural property unaffected by parallelism). Single-core finality is 0.9s vs 18s for HotStuff; multi-core BLS narrows but does not eliminate this gap.

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

↑