Research: chronological P104 schedule attains known 32-chain bound

[adamgall]

New result

This adds constructive chronological attainment, not a new lower bound. Ali Romman's #1125 already proves the asynchronous 32-path obstruction and explicitly does not construct a schedule at 32 paths (its PROOF lines 204–206). For the exact eight-centre P104 fixture from Josie Elliston's #1071, the new certificate executes all 416 reads on 104 targets in 32 monotone fixed-centre chains, attaining that existing bound. The additional array count is 24 rather than #1071's 47 under a global centre order.

• 116 source-bound prefix edges specify independent target read orders.
• Explicit chain assignments plus increasing-frame-dimension execution satisfy all target/carrier dependencies; this is not just a poset cover.
• Supplied-copy delivery tails: 85 H1 + 17 H2 + 19 H3 + 20 H4, rank mass 256, versus mass 440 for a reconstructed 55-chain best-global-order witness. The histogram improves componentwise; no global tail-moment optimum is claimed.
• All target tails and all 416 scalar reads remain charged. Eight inherited rank-seven drops still cost COPY56.
• All 32 injected dirty-copy contaminants have nonzero target responses, making the missing arbitrary-dirty formation/restoration contract explicit.

Scope and limitations

This is one pinned decoder's minimal-prefix, fixed-centre, no-redrop geometry. Exact centre values are supplied at singleton survivor frames, and every subsequent delivery/target frame move through the declared exits is counted. Formation of 24 additional exact copies, arbitrary-dirty restoration, side corrections, hosting, precision, and all-size admission remain unresolved and are not free. No physical supplier, original card's 5% gate, new kappa, or frontier update is claimed. #1125's retained-cost premise and two-extra-rank budget warning remain intact.

Evidence

Only research/p104-target-order-delivery/ is added: proof/scope README, exact schedule and receipt, standalone verifier, TASK/SOURCES/VERIFY metadata, and complete selection JSON.

Actually exercised on CPython 3.12.12:

uv run --python 3.12 --no-project python -I -O -B research/p104-target-order-delivery/verify.py
# PASS_P104_TARGET_ORDER_DELIVERY chains=32 extra_arrays=24 reads=416 lower_bound=32 controls=8 no_new_kappa
uv run --python 3.12 --no-project python scripts/research_package.py --package research/p104-target-order-delivery
# PASS_REGISTERED_RESEARCH_PACKAGE research/p104-target-order-delivery outcome=completed

The parent independently replayed the registered package before publication. After final PR1125 attribution/pin changes, receipt generation and --check-only passed again. Positive controls reproduce the exact P104 decoder, eight single-cut chain counts of 19, and the 55-chain global-order witness. Eight semantic negative/limitation controls remain active under -O. OR-Tools was used only to discover the witness; replay is standard-library and exact. No full supplier cold replay, hosted CI, native compiler, or proof-assistant verification is claimed.

Provenance and credit

Independent round-two seed 4e1451a884a6979cb599a332ccc7ad40, track complex-mechanisms, emitted card complex-rank-shape-decoder, exact baseline 0b1cccf. Scope explicitly changed from a complete block-decoder supplier to this missing attainment lemma. Final overlap corrected the initial failure to locate merged/local #1125; its theorem is credited and pinned, not republished as new.

Credit Ali Romman/#1125; Josie Elliston/#1071; themilkman216/#968; DreamingOfClouds/#717/#446/#595; Joel Pulikkan/GamingPuzzled/#620; Douglas Colkitt/#1240 and the selected construction lineage. Prepared for Adam Gall with substantial OpenAI Codex (gpt-6-astra) assistance; Apache-2.0.

Claim/finding: #1929 (comment)

[Mister-Meeseeks]

Batch review at a9b7dfe2809092a9a4c90784d12bb60061e995e8.

Merged to main, preserving the original contributor commits and package attribution.

Reviewed scope: Exact chronological416-read schedule attains credited32-chain P104 lower bound for the pinned fixture, down from its55-chain global-order witness. Full decoder/frame replay and eight controls pass; tail histogram improves componentwise.24 extra exact copies are supplied at entry, with formation/restoration and complete supplier costs explicitly unresolved.

The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions.

Batch review, attribution and evidence. Thank you for the contribution.