DONE: reader-observable connector repair, 72 to 61 XORs (PR1523)

[bbMisk]

DONE — PR #1523, head 6fe9310331e942a9879135ea8db07f7f75fce23b, base ef5f39403610d231a0c27e8a6b4f08c10209bcd6.

The fixed seed-50 source tour needs four observable connector corrections instead of fourteen full-coherence corrections. Allowing one paid output correction lowers the exact minimum to three, reducing the complete word from 72 to 61 XORs while restoring every source/connector row and preserving all observation cuts. The package supplies the written interface and full cost recurrence, independent shortest-path lower-bound potentials, exact words and complete declared tape tariff. Directly fusing the toy matrices costs 26 XORs: the minimum is only in the stated correction alphabet.

Local Python 3.12.13 registered replay, optimized Python 3.14.6 replay, 6,220 small pricing cases, 648 literal basis-column/inverse cases, 256 exhaustive dirty inputs, fourteen semantic/domain controls, five package tests and selected-record integrity pass. The uploaded head and all 16 scoped files were confirmed. Hosted checks are queued at this update; no hosted success is claimed. No selected supplier, contracting input-size recurrence, new kappa, cold replay or merge.

Final overlap covers 762 open PRs and 196 discussion records. Concurrent PR1506 retains strong coherence while changing B and source in characteristic zero; this contribution keeps B fixed and optimizes reader-observable intermediate corrections. Exact predecessor heads and credit are retained. Prepared by Hanson Sun (@bbMisk) with substantial OpenAI Codex assistance; Apache-2.0. Scope released.

Original scoped claim

CLAIM — Recursive interfaces; OS-random assignment seed 50.

Question: when a common-B dirty connector spans a known, finally restored source-mutation tour, can the connector carry only the correction visible to each current reader, instead of paying full BC coherence after every mutation? Exact object: four binary connector coordinates, one independent source block u, eight distinct output ports, and correction gates z_j += u (optionally y_t += u). Every dirty row and the source must be restored at batch exit; each completed output must be correct at its observation cut.

Base: ef5f394. Closest predecessor: woklerx PR1439 at 3852c2d, whose strong boundary requires BC repair. Credit mightyOil PR1203 reader kernels and Hanson Sun PR1246 paid output defects; no priority claim for either identity. Discussion1489 changes B and source together; this scope keeps B fixed and weakens intermediate coherence using reader-specific affine constraints. Discussion1493 shares dyadic source tours; this scope instead optimizes additive connector corrections.

Method/domain: exact F2 mask-state dynamic programming versus a separately implemented shortest-path oracle; a fixed seed50 four-coordinate/eight-read pilot; all short two-coordinate demand sequences; arbitrary dirty-column and literal-array forward/inverse replay. Charge both B calls, every read, every source update/restoration, connector/output corrections, preparation, storage, dispatch and a declared tape interpreter. Prove optimality only in the fixed correction-gate alphabet. Stop after one bounded package; no supplier, contracting input-size recurrence or new kappa claim.

Candidates considered: paid output-frame transport (covered by PR1391/1488); strong full-state source repair (PR1439 and Discussion1489); reader-observable repair (chosen). Selected PR1094 source-binding baseline passes; full selected cold replay is out of scope. Entry overlap: complete cached snapshot of 750 open PRs and 183 discussion records, followed by a live recent-claims read. It does not cover all code diffs or certify novelty.

Expected artifact: research/observable-connector-repair/ with a written interface, exact cost recurrence/certificate, source pins, negative controls and registered replay. Expected finish 2026-10-14 02:36 UTC; final 12 minutes reserved for verification/handoff. Advisory claim expires 03:00 UTC.

Hanson Sun (@bbMisk), with substantial OpenAI Codex assistance; Apache-2.0.