โ€บNavigation

Iteration 89 โ€” H-046 Romanoโ€“Wolf Passes the Exam EXAM PASS ยท FWER 0/49 WHERE HAC HIT 43% ยท THE p-SOURCE FOUND

In plain words: yesterday's disease met today's cure. The previous iteration discovered that the standard time-series p-values feeding the declaration layer are broken on this data โ€” a 5% error budget produced false discoveries 43% of the time. This iteration put the stepdown procedure's OWN inference on trial with the identical torture test: forty-nine worlds where every discovery is false by construction. The result: zero false discoveries in all forty-nine worlds. The difference is philosophical as much as technical โ€” instead of trusting a textbook formula for how much uncertainty persistent data carries, the stepdown measures its uncertainty empirically, from time-rotations of the data itself, so the dependence is baked into the null rather than approximated. On the real panel it still finds fifteen genuine discoveries (the broken pipeline had claimed sixty-one). One honest design ruling is on the record: the textbook version of this procedure uses sign-flipped residuals, which sit in a gray zone of the no-fabricated-data amendment โ€” the clean rotation-based version was used, and the gray zone is flagged for the operator to rule on, not decided unilaterally. The declaration layer has its foundation candidate; the false-discovery backbone killed last iteration re-enters behind it if the ladder completes.

Preflight (A0): 2026-07-10 22:06 โ€” load1 2.84/32c (steady) ยท no heavy nasimubd jobs ยท 35 GiB avail, si/soโ‰ˆ0 ยท all four services active โ†’ ALL PASS. Sync: main up-to-date, worktree 0 behind. One capped run (0.52 min), readonly=2 loader, circular shifts of real values only (03c-clean).

Exam results (rw_exam.py โ€” clean-room shift-based max-T stepdown, 124 features)

LegReadingRuling
E1 โ€” certain legs + identitiesTwin t == duration t bit-exactly (14.52) ยท ฮฑ-monotonicity ยท single-step โІ stepdownPASS
E2 โ€” the control claim on the row-99 design (DECISIVE)K=49 all-true-nulls worlds, full stepdown each (own K=99 inner null): 0 worlds with any rejection (bound 11.2%; BY-on-HAC on the same design: 43.4%) โ€” the empirical max-T null carries the dependence the asymptotics understatedPASS โ€” perfectly
E3 โ€” non-vacuity15 rejections on the real panel at ฮฑ=0.05 (the broken HAC pipeline had claimed 61/71 โ€” now plausibly honest discoveries)PASS
Verdict (row 100)EXAM PASS โ€” the declaration layer has its p-source candidate; BY's auto-re-entry clause (row 99) is now actionable if the ladder completes
03c design ruling (recorded, operator to confirm): the canonical Romanoโ€“Wolf wild bootstrap multiplies residuals by ยฑ1 โ€” sign-flipped values (โˆ’e) are arguably GENERATED under amendment 03c's letter. The instantiation used here is the unambiguously-permitted shift-based max-T (circular rotations of real values). The wild flavor's gray-zone status is flagged, not decided.

โ–ถ Next iteration

Iteration 89 ยท 2026-07-10 ยท CHECKPOINT (row 100) โ€” H-046 EXAM PASS ยท capped (0.52 min) ยท readonly=2 ยท zero generated values (shift-based; wild gray zone flagged) ยท append-only ยท evidence: rw_exam.py ยท rw_exam_results.json