Verify C511 mutable-source interfaces and a restricted rolling boundary

[RossRichardson]

Summary

Complete the fixed C511 mutable-source interface and its caller boundary. The local three-copy word has 660 arbitrary ordinary inputs plus one required-zero private field. An exact five-call binary operator identity restores both public banks after a paid swap and decoder, but its complete invoice has rank mass 25,545 and deficit −33.

The raw three-call alternative fails its endpoint. An actual ADDRESS impulse exposes its residual, and all 24,898 projected coefficient rows give a rank-111 certificate: any factorization through fixed ADDRESS-independent scalar source-reader arrays needs at least 111 such readers. This is a restricted information bound, not a native query tariff.

Scope and limits

One package, research/c511-mutable-source-boundary. This is the older 1487-ADD order-511 code, distinct from PR3645's later order-28 code. The physical inverse and routed charts are explicit; helper restoration is logical, with its physical FULL frame retained. Signed integer target residuals are separate from the clean binary endpoint.

The source-consuming variant needs 111 zero target fields, costs 16,257 scalar ADDs, and leaves linked source remnants. Those remnants do not supply another independent public input family. Its exact arbitrary-target formula is retained. The restored five-call word costs 112,095 ADDs including the terminal code and bank swap. Historical large bounded searches are excluded from the proof.

The reader theorem excludes routed/ADDRESS-dependent readers, direct public-input access and changed words. Native internal lowering is inherited; chronological owners, rounded errors, source/tape access and all-size admission remain separate. No positive supplier, selected-frontier change or new κ is claimed.

Test plan

• Complete registered Python 3.12.14 replay at b991ef6d2b71c71716f5307b71899b9a8ccdf82b; final publication adds review/validation prose only.
• All 660 signed/F2 ordinary columns plus private-zero row, complete typed COPY/ERASE lifecycle, literal inverse, actual 111 Weyl charts and 6,465 code intertwiners.
• Separate operator normal-form proof of both physical inverse products and five-call identity; full CLEAN/coded invoice and actual omitted-cleanup/wrong-order/signed-code controls.
• Independent complete 3,131-output impulse, all 24,898 coefficient rows, 111 original witnesses, 888 identity-code cancellations and actual ADDRESS-map mutations.
• Every field of all five receipts compared; all 22 frozen inputs authenticated; source/receipt/type/path-collision and nested poisoned-cache controls pass normal/-O through the real launcher and from a committed export.
• Metadata/source-history preflight and separate AI mathematical/integrity reviews. No independent human or formal-kernel certification.
• Automatic exact-head GitHub CI 39245165745 passed the complete replay and unchanged-input gate; no manual rerun requested.

Sources and credit

Scientific pin: 20ecf2891d80b5acf18d980b2164fb44ea7faa90. Retain Sagar Thakrar's R438 transport and the eumemic, DreamingOfClouds and Ali Romman geometry/source-code lineage. Exact original bytes, hashes and every adapter are included.

Hanson Sun/bbMisk PR1522 supplies related restored mutable-source tours; Ali Romman PR1862 supplies ordered source-code/identity-transfer work. Chris R/Clear1nsight PR3882 concerns a distinct P104 source-consuming replacement model, and Gonzalo-Mier PR3772 prices different retained-schedule BIT endpoints. No priority is claimed for those general mechanisms. Fresh overlap covers 751 open PRs and 2,599 discussion records; it is not a novelty certificate.

Prepared by Ross Richardson with substantial OpenAI Codex assistance and separate AI reviews. Apache-2.0; original notices retained.