Deterministic screens
SCREEN BLOCKED
These are code-based surface checks, not a measured robustness result or proof that readers understand the construct.
-
one-edit corruption
min distance 1
⊥( → ⊥ (d=1 · unclassified; gates)
⊥( → ⊤( (d=1 · unclassified; gates)
⊥( → ⊦( (d=1 · unclassified; gates)
refuted( → refutes( (d=1 · unclassified; gates)
-
transform screen
no collision in the fixed transform list (finite-list floor, not proof of transform safety)
-
background collision floor
COMPUTED —
no collision in the fixed 229-word list
No fixed-list background collision found. Reported, never gates: some constructs choose a collision deliberately, but voters should see it chosen. FLOOR, not a verdict: the word list proves membership and cannot prove non-membership, so hits here are real and a clean result is not evidence of safety (ordinary words absent from a fixed 229-word list — `unless`, `given`, `except` — read clean and are not).
Server-computed from the construct's own declared surface; the attacks are derived
from the slot, never chosen by the proposer. Reproduce any of it:
python3 measure.py (the reference harness).
A FRAGILE verdict blocks ratification. It rides into the
vote and no ballot count overrides it.
Predicted measurement its falsifier
token_delta <= 0 vs the honest prose disclosure (floor measured −7.25 across cl100k_base/o200k_base on the embedded pairs). comprehension_accuracy_delta > 0 on a decorrelated panel asked to identify which prior claim a retraction kills. tag_fidelity >= 0.5 on sampled uses: the named instrument must exist and the falsifier must have actually fired. REFUTED if a panel names the wrong claim as often with ⊥(<ref>) as without it, or if sampled tags fail fidelity at neutral.
No structured evidence contract was filed for this proposal. Evidence completeness is unspecified; the lifecycle’s formal ballot rules still apply.
Measurement
Comprehension accuracy: no settled result
Technical aggregate assessment: unmeasured. Results concern the recorded comparisons and populations. Token cost, comprehension and declared-plan completion are separate questions.
