Repository navigation
Pay the two-target CRT stencil producer and join its repair mask - #4990
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Change and mathematical scope
Adds
research/crt-two-target-stencil/: a paid producer for two ordered disjoint CRT guard windows, consuming seven protected unary geometry words. Its actual stencil feeds the unchanged dense scanner, and that mask feeds the retained reverse-key repair. This answers PR4644 open question 1: the previous joined producer covered one target, although the scanner and record repair already accepted externally supplied multi-target data.For every admitted
G>=1, H>=2G, K>=G+4, J1>=J0+K, Y>=J1+K, the written proof derives the exact stencil, union-of-failures hole mask, cleanup and producer invoice:The producer/scanner uses 21 fixed tape roles and at most
8ML+15M+83L+456read/write/unit-move actions,M=2^L. The caller erases its owned stencil for another5L+7actions. Both source functions must omit both active target bits. Borrowed geometry remains unchanged; private words, scanner counter, consumed mask and repair scratch are erased and heads returned.This is a local interface/cost proof with finite implementation evidence. Existing reverse algebra and repair tariff remain cited; the opaque-record repair model, host key arithmetic and finite-control transitions do not become a unified binary invoice. Caller descriptor construction/transport, variable target count, last-K boundaries and complete supplier admission remain open. No new κ or selected-frontier change; conditional κ=.00302015 remains selected.
Task and overlap
uniform-transfer-audit, refined to the two-target producer boundary. The family decision is narrow: finish this handoff and stop before another implementation expansion.b91956876e5b4122fd89179f1b57557ff8378f15, priority revision 7. All thirteen live inputs are pinned at this base inSOURCES.json; the catalogue and selected record remain historical provenance.67154122b2867e6dee5b9b25f2f1c862a3e81e95, lowers a fixed-geometry binary key port and does not supply this stencil producer.2026-10-23T05:35:46Zsearched all 6,636 tracked local note paths, 333 open/draft PR bodies and 4,085 Discussion records with complete pagination and no warnings. Targeted recent CRT handoffs/PRs were also read. No competing producer claim appeared; arbitrary diffs and unpublished work are outside that coverage.Validation
Validated package head:
ea2b6fa4d6479813c36ca0c0396c8d06437fb486. Python 3.12.13, standard library only:G=1; largerGhas producer tests and the quantified proof only.f0=y[J1], f1=y[J0]is rejected and yields a concrete ideal-map collision.-I -O -W error -Breplay is read-only; source drift and frozen-receipt drift controls reject.No native/Lean/Docker build, historical suite, full binary repair layer or selected supplier replay was run. Hosted CI is separate from these local results.
Credit
Cinna Davis/#4100: compact caller. ToikY/#4208 and #4201: paid unary helpers and scanner. unpaidmoon/#4644: one-target join and handoff. Ryanson Jonathan/#4328: repair schedule and tariff. Hiroki KUMAZAKI/#4169: arbitrary-source inverse. Douglas Colkitt and John-Michael Smith/#763: inherited compact and exceptional-repair argument. Frozen predecessors remain unchanged.
Prepared by Hiroki KUMAZAKI (@kumagi) with substantial OpenAI Codex assistance in implementation, proof, verification, coordination and writing; Apache-2.0.
Open next questions
README.mdandTASK.jsongive the two bounded follow-ups: identify an actual caller that pays for descriptor construction/transport/restoration, and specify a variable-count descriptor admission contract before implementing it. Related key work should first check PR4982 and Discussion4709. This contribution neither claims those tasks nor authorizes a full-family expansion.