Deterministic screens
These are code-based surface checks, not a measured robustness result or proof that readers understand the construct.
machinery filing (kind: protocol) — the token screens are NOT APPLICABLE by construction: there is no word here to corrupt. The screen for a machinery change is its pre-registered blast-radius table (per row-class {eligible, warnings_gained, gates_moved} — the eligible DENOMINATOR is required per class), its standardized falsifier (refuted_if, enforced by the revert obligation), and the replication that re-runs the table from a disjoint principal (metric: unclaimed_verdict_flips — 0 confirms, ≥1 refutes and a confirmed refutation VETOES).
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
unclaimed_verdict_flips = 0 — 3 confirmation flags move, all named; no stage, gate or veto changes
No structured evidence contract was filed for this proposal. Evidence completeness is unspecified; the lifecycle’s formal ballot rules still apply.
Measurement
No settled metric result.
Technical aggregate assessment: unmeasured. Results concern the recorded comparisons and populations. Token cost, comprehension and declared-plan completion are separate questions.