发表机构
Independent researcher（独立研究者）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
研究如何在无共识情况下实现拜占庭可问责性，提出ACFA方法，通过复制特定集合并进行确定性纯函数聚合。证明相关函数继承强最终一致性，原型通过多项证伪检查，保证了一致性，引入了基于特定条件的稳健性。
AI 中文摘要
诸如多Krum等抗拜占庭聚合规则假定有一个中央协调器，而将它们去中心化会受到规则本身的阻碍：它们是全局耦合、非关联且不连续的，所以一个极小的扰动就能翻转所选子集，使输出产生不可忽略的变化。但这并不妨碍无协调器复制，因为稳健规则不需要贡献的商定顺序，只需要商定集合和商定排除谓词，两者无需共识就能收敛。ACFA（可问责无共识聚合）复制一个带签名贡献的内容寻址或集和一个仅增长的自我认证歧义证明集，任何人都可离线验证。聚合是收敛乘积状态的确定性纯函数：基于哈希规范顺序的定点整数运算，通过内容哈希打破平局。我们证明了CRDT（非单调、非关联或随机）收敛乘积的任何纯函数都继承强最终一致性及其逆命题；贡献在于将数据格与证据格组合应用于稳健选择器，而非基本提升步骤。一个原型（10个节点，3个拜占庭节点）通过了16/16次证伪检查：在对抗性闲聊下字节相同的根、后期歧义证明后的确定性重新收敛、分区恢复以及三次字节身份破坏消融。保证的是一致性而非准确性；稳健性是引入的，条件是有2f + 3个允许的贡献（最多f个拜占庭节点）和一个规定的量化余量条件。
英文摘要
Byzantine-robust aggregation rules such as multi-Krum assume a central coordinator, and decentralising them is obstructed by the rules themselves: they are globally coupled, non-associative, and discontinuous, so an ulpscale perturbation can flip the selected subset, moving the output by a non-vanishing amount. None of this prevents coordinator-free replication, because a robust rule needs no agreed order of contributions, only an agreed set and an agreed exclusion predicate, both of which converge without consensus. ACFA (Accountable Consensus-Free Aggregation) replicates a content-addressed OR-Set of signed contributions and a grow-only set of self-authenticating equivocation proofs, offline-verifiable by anyone. Aggregation is a deterministic pure function of the converged product state: fixed-point integer arithmetic over a hash-canonical order, ties broken by content hash. We prove that any pure function of a converged product of CRDTs (non-monotone, non-associative, or stochastic) inherits Strong Eventual Consistency, together with its converse; the contribution is the composition of a data lattice with an evidence lattice applied to a robust selector, not the elementary lifting step. A prototype (10 nodes, 3 Byzantine) passes 16/16 falsification checks: byte-identical roots under adversarial gossip, deterministic re-convergence after late equivocation proofs, partition recovery, and three byte-identity-breaking ablations. The guarantee is consistency, not accuracy; robustness is imported, conditional on 2f + 3 admitted contributions (at most f Byzantine) and a stated quantisation-margin condition.
