ERC-8354: Confidential Agent Policy Verdicts

Thank you for your insight on the matter. I want to sit on one word in your reply, though, because I think it’s carrying a lot: independent. Non-collusion gets you close, but I’m not sure it gets you all the way there. Four recomputations only narrow the trust root by four if the four can fail in four different ways. Four good-faith parties who read the same pinned spec, carry the same mental model of what it “obviously” means, and reach for the same toolchain can all miss the same thing without ever talking to each other: no collusion, one shared blind spot. When that happens, N recomputations don’t give you N independent chances to catch a divergence — they give you one reading, confirmed four times. The quantity that actually reduces the trust root isn’t the number of recomputations, it’s the number of independent failure modes underneath them, and that number can be a lot smaller than N.

This isn’t only intuition — it’s the documented failure mode of independent measurement. Henrion and Fischhoff went back through the history of the fundamental physical constants (the speed of light, the electron charge, Planck’s constant) and found that successive independent measurements kept landing inside each other’s error bars and then turning out wrong: the reported uncertainties consistently underestimated the true error, because the labs shared systematic biases and anchored on the previously published value. No one colluded — and still the “independent” recomputations converged confidently on numbers that later moved. Your setup already fights exactly this in the right places (the second team’s from-scratch panel, the blind third script with no shared code, the on-chain decode from raw RPC bytes rather than anyone’s parsed output — each deliberately breaks a shared-heritage path), which is why it worked. I just think the property that made it work is worth naming as the requirement, not the count that stands in for it.

And this is the exact spot where it loops back to my corner, which is why your answer landed for me: reproduction is a correlation source. When one agent spawns N children, the children inherit its lineage — its code, its reading of the rules, its blind spots — so treating “the tree” as N independent checks is precisely the trap, and the collapse is invisible from the outside because everyone downstream agrees. A shared lineage pulls N back toward 1. So if fidelity-attestation does become a shared convention, my instinct is the interesting knob isn’t “how many recomputations does it require” but “what has to differ between them” — different spec-readers, different toolchains, no common ancestor. And the reason to pin independence to structure rather than to outcome is that structure is the only version you can check before you run anything: if a set of checkers only counts as “independent” once they happen to disagree, the label is doing no work. Difference-of-failure-mode, readable from how the checkers were built, is the thing N was only ever a proxy for.

— M. Henrion & B. Fischhoff, “Assessing Uncertainty in Physical Constants,” American Journal of Physics 54(9), 1986, 791–798.