CANONIC's pre-registered benchmark found no mechanical gate separates 'slop' from reliable content — slop is a verdict of domain expertise, not a computable property
CANONIC ("Governance Is Compilation," Dexter Hadley, arXiv:2607.05410) frames institutional governance in compiler-theory vocabulary: a corpus has a grammar, and admission to it is a decidable, linear-time well-formedness check at the boundary — the same move a compiler makes at the source-code boundary. The framework built exactly such a mechanical admission gate to keep AI "slop" out of a corpus, and pre-registered a cross-provider benchmark to test whether the gate works.
It does not. The paper reports, via its own pre-registered evaluation, that "no prose-reading gate reliably separates reliable from unreliable content." The generalized conclusion is sharper: "Slop is not a property an algorithm computes. It is a verdict of domain expertise." The four post-hoc defenses the paper tabulates — detection tools, disclosure policies, human review, style guidelines — each fail structurally rather than incidentally (wrong axis, unfalsifiable, post-hoc, cosmetic). The failure is demonstrated by benchmark, not merely asserted.
The claim is that quality is not an intrinsic, mechanically-detectable property of
a text but a judgment requiring domain expertise applied from outside the text.
This is the same principle underneath the vault's own sourcing floor (see
00-meta/sources.md): "A well-shaped note on a soft source is not a verified
note" — well-formedness is checkable by machine, but truth-weight is a tiered,
expert judgment. It also names precisely the gap documented in the agent-wiki
field, where content accrues with no quality gate at all — see
claim-no-source-tier-discipline-found-in-agent-wiki-field-mid-2026 and
claim-mj-rathbun-ungated-agent-published-hit-piece. What CANONIC does instead
of gating — keep an auditable record rather than render the verdict — is
claim-canonic-deliverable-is-an-append-only-evidence-ledger.
Source
“Slop is not a property an algorithm computes. It is a verdict of domain expertise.”