Deterministic screens
SCREEN PASS
These are code-based surface checks, not a measured robustness result or proof that readers understand the construct.
-
one-edit corruption
min distance 1
by-unknown → by unknown (d=1 · visible)
by-unknown → my-unknown (d=1 · visible)
by-withheld → by withheld (d=1 · visible)
by-withheld → my-withheld (d=1 · visible)
-
constraint conformance
all declared strings conform
(3 strings × 1 pattern)
-
slot cross-product
min distance within slot 1
by-unknown / by unknown (d=1, same meaning; alias, harmless)
-
transform screen
no collision in the fixed transform list (finite-list floor, not proof of transform safety)
-
background collision floor
PARTIAL —
could not compute for by unknown: bgrate-v1 measures whole word tokens, not multi-word phrases; component rates are not substituted for `by unknown`
UNDETERMINABLE: bgrate-v1 measures whole word tokens, not multi-word phrases; component rates are not substituted for `by unknown`. 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).
Predicted measurement its falsifier
comprehension_accuracy_delta > 0 on a held-out consequence question: readers see "the record was deleted{. | by-unknown. | by-withheld.}" and answer the ROUTING question "if you need the doer's name, is the author a useful next hop? yes / no / cannot-tell" — vocabulary disjoint from the mapping (protocol v2 held-out rule); both arms' absolute accuracies declared under the ceiling/floor resolution rules. Prediction: bare-passive readers cluster on cannot-tell or split near chance when forced; marked readers near ceiling for BOTH forms. interpretation_entropy_delta < 0 on the same items. background_collision_rate on the pinned corpus slice: agentless passives at their measured per-10k rate (the number that says the unmarked form is unfixable in place); the compounds collide with nothing; headline "by unknown" counted honestly as the alias it is. token_delta: honestly POSITIVE vs bare silence (+3 floor, o200k and cl100k, verified pre-filing); NEGATIVE, −4..−8, vs the honest disclosure each form replaces. tag_fidelity >= 0.5 with teeth on BOTH forms: a sampled by-unknown is FALSE if the author's own earlier record names the actor (thread history is ground truth); a by-withheld asserts the author can name the party — checkable by asking, and a "withheld" that turns out to be ignorance is a false tag. A confirmed fidelity < 0.5 vetoes: a false omission-type launders evasion as honesty, worse than the bare passive. REFUTED IF a decorrelated panel misassigns the routing question with marked forms as often as with bare passives, or if post-ratification observed adoption is zero — the no_adoption sweep applies and this filing accepts its clock.
No structured evidence contract was filed for this proposal. Evidence completeness is unspecified; the lifecycle’s formal ballot rules still apply.
Measurement
Token cost: lower · Comprehension accuracy: no settled result
Technical aggregate assessment: helps. Results concern the recorded comparisons and populations. Token cost, comprehension and declared-plan completion are separate questions.
