[Research] Exact scalar obstruction to early centre fanout (no new κ)

[1337isnot1337]

Change and mathematical scope

This package records a scoped negative result for the zero-storage early-fanout timing move. It injects one selected centre output through its pinned 22-row canonical scatter before the selected forward scalar program, suppresses that centre output at its selected event, and compares the complete 704-local-role endpoint over all eight basis outputs in Q^8.

The exact Q-linear common-frame projection retains all 19,693 scalar events of the pinned forward program. The number of differing local roles is 34, 34, 36, 36, 54, 54, 56, and 56. For centre channel 0, normal minus early is exactly 1/4 at role L114. The result rejects only this early/no-storage timing move in that scalar projection. It does not rule out native frame transport, persistent storage, phase reordering, other schedules, or a changed interface. It supplies no supplier, new kappa, or full-call endpoint result.

The favorable screen in the pinned actual-profile overhead note gives 32 units/call of ideal centre saving and at most a 3.4536% whole-bound gain; this experiment assumes zero added carry/copy/restoration/frame/precision/hosting cost. The required scalar endpoint identity already fails, so no surviving schedule or full cost invoice is claimed.

Task and overlap

• Task: centre-path-sharing, track recursive-interfaces, refined scope, seed 2803b7f39d0d886af6d0a63cd1521a40, scope key a55534776f5479f1686c.
• Assignment base: e112d71c8d7bb32435debcc54df932593dd8223a, catalogue revision 3, catalogue SHA256 6686ad58f1fbdbc87134a78901b60fd53a20d3984355e91defbbebc9e9fa8075.
• Selected record SHA256: 10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32.
• Current main advanced to 7c1e7811c730b17fe0eeef6c82ef011318b0465e (priority revision 4) during this cycle; it retains centre-path-sharing. The package preserves the exact revision-3 assignment and source pins.
• Added value: PRs Finite centre-phase fanout across two shared-source panels #1708/Certify shared reverse centre phase with a charged precision guard #1748/Planning result: exact overhead budgets for centre-path sharing on the actual selected profiles (no new kappa) #1791/Research: selected adjacent centre-owner census #1829/Add exact rank-one center-difference sharing mechanism #1838 concern aligned centre sharing, return/precision, actual-profile overhead, adjacent owner census, and a rank-one centre-difference mechanism. Discussion CLAIM: nonadjacent centre-path sharing with role permutation (seed 146930b1) #1963 is a scoped helper-carried aliasing negative. PR Scoped proof: PR1918's selected centre-source minor lifts to native rank 8192 (no new kappa) #2048 treats the fixed time0/time1 replica0/8 source minor. PR Research: multi-pair schedules cannot beat the nine-stage template (Theorem S, no new κ) #2052 bounds simultaneous multi-pair stage schedules. This package tests a distinct temporal commutation condition across the pinned scalar prefix. Exact predecessor heads and the refreshed overlap receipt are in research/centre-prefix-fanout-obstruction-seed2803b7/OVERLAP.json.

Validation

From the repository root:

python3 -B research/centre-prefix-fanout-obstruction-seed2803b7/verify.py
python3 scripts/research_package.py --package research/centre-prefix-fanout-obstruction-seed2803b7 --check-only

Observed direct marker:

PASS_CENTRE_PREFIX_FANOUT_OBSTRUCTION channels=8 mismatched=8 counts=34,34,36,36,54,54,56,56 center0_role114=1/4 controls=3 no_new_kappa

The verifier checks selected-record, archive and archive-member hashes; complete forward/backward program digests; all eight centre events and 176 canonical scatter coefficients; exact Fraction arithmetic; a commuting identity-prefix control; a noncommuting read-before-centre control; and rejection of a mutated cut. Local direct replay used CPython 3.14.7. --check-only passed. A Python 3.12 interpreter is unavailable locally, so the registered Python 3.12 replay was not run here; hosted workflow status is separate. This is not the full selected native-frame replay or a supplier acceptance check.

Credit

Prepared by Cinna Davis with substantial OpenAI Codex assistance in scope selection, derivation, implementation, replay and writing. No independent human review or proof-assistant formalization is claimed. Source/predecessor attribution is retained, and new work is Apache-2.0.

Open next questions

Can one exact full-call phase reordering or persistent centre bank preserve every dirty helper endpoint and keep its fully charged cost below the 32-per-call ideal saving? First specify a call pair, saved components, owner windows and complete copy/restoration/frame/precision/hosting invoice; no such priced carry-state contract is known.