ECO/CPO-DAG:一种用于对抗性供应链的基于矛盾的问责层
ECO/CPO-DAG: A Contradiction-Based Accountability Layer for Adversarial Supply Chains
AI总结:
研究针对对抗性供应链提出ECO/CPO-DAG问责协议,将矛盾检测作为补充验证层,通过发布签名声明到有向无环图,违反约束时编制矛盾证明对象触发经济削减,经分析处理给出检测模型等,实现矛盾检测且补充源验证。
摘要:
我们提出了ECO/CPO-DAG,这是一种针对对抗性供应链的特定领域问责协议,它将矛盾检测形式化为一个补充验证层,而非共识或确立真相的机制。参与者将签名的事件声明对象(ECO)发布到一个因果有序、只追加的有向无环图(DAG)中,其边编码了先后关系。当关于同一主题的两个声明违反领域约束时,任何观察者都可以编制一个矛盾证明对象(CPO),它是一个自我验证对象,绑定两个签名声明和被违反的规则,公开验证时会触发对明确被指责方的经济削减。我们将约束映射到GS1 EPCIS 2.0事件语义(空间唯一性、时间单调性、数量守恒、质量单调性、监管有效性),以便检测在实践中有意义的不一致性。通过承诺方案和可选的零知识矛盾证明进行选择性披露,使各方能够在受到挑战迫使最小化公开之前保留声明内容。我们进行了分析处理:独立观察者检测模型为$1-(1-p_{\min})^h$,$k$方勾结下的威慑条件为$S>g(1-p)/(kp)$,在既定假设下每个参与者每年的存储估计约为1GB。该协议的边界很明确:它检测可证明的矛盾,而非一致的谎言;从不自相矛盾的一方对其不可见,因此该层补充而非取代源验证和预言机聚合。单机参考实现证实了检测模型,在每个观察者数量下预测覆盖带与测量的95%置信区间重叠,且记录零错误指控;完全零知识的CPO、多方传播和自适应对手规避仍为分析性的。
英文摘要:
We present ECO/CPO-DAG, a domain-specific accountability protocol for adversarial supply chains that formalizes contradiction detection as a supplemental validation layer rather than a consensus or truth-establishing mechanism. Participants publish signed Event Claim Objects (ECOs) into a causally ordered, append-only directed acyclic graph (DAG) whose edges encode happened-before relations. When two claims about the same subject violate a domain constraint, any observer can compile a Contradiction Proof Object (CPO), a self-verifying object binding the two signed claims and the violated rule, which, on public verification, triggers economic slashing of a determinately blamed party. We map constraints to GS1 EPCIS 2.0 event semantics (spatial uniqueness, temporal monotonicity, quantity conservation, quality monotonicity, regulatory validity), so detection targets inconsistencies that are meaningful in practice. Selective disclosure via commitment schemes and, optionally, zero-knowledge contradiction proofs lets parties withhold claim contents until a challenge forces the minimal opening. We give an analytical treatment: an independent-observer detection model $1-(1-p_{\min})^h$, a deterrence condition $S>g(1-p)/(kp)$ under $k$-party collusion, and a storage estimate of order 1 GB per participant per year under stated assumptions. The protocol's boundary is explicit: it detects provable contradictions, not consistent lies; a party that never contradicts itself is invisible to it, so the layer complements, and does not replace, source verification and oracle aggregation. A single-machine reference implementation corroborates the detection model, with the predicted coverage band overlapping the measured 95% confidence interval at every observer count, and records zero false accusations; the fully zero-knowledge CPO, multi-party propagation, and adaptive-adversary evasion remain analytical.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。