Repository navigation
Research: exact early-prefix P104 shared correction dimensions - #2345
Merged
Mister-Meeseeks merged 1 commit intoOct 15, 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
2 participants
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.
The P104 pooled-snapshot correction problem had an unresolved early-prefix boundary. This package gives the exact rational shared-space minima 104, 103, 102, 101, 100 and 99 on the six intervals covering cuts 0 through 2717, with explicit contact witnesses and matching lower bounds.
The proof reduces arbitrary shared spaces in all 280 input coordinates to an 8-by-8 affine minimum-rank problem. A linear projector-feasibility test certifies each interval. This is a pooled information-space result: it does not construct a chronological correction, reprice dimension as transport cost, or claim a supplier or new kappa. Cuts 2718–2823 remain open here.
Validation: exact standard-library replay of all 4,059 cuts and 280 columns; source hashes, frame legality, private lifetimes, arbitrary dirty restoration, complete G/2 endpoint and unchanged local profile; direct 104-by-104 and reduced 8-by-8 ranks; independently implemented projection generator reproduces every contact. Native Windows CPython 3.12.11 optimized CLI passed (48.5 seconds). All 11 optimized corruption and lifting-premise tests passed (182.4 seconds). Package metadata/source pins and whitespace checks pass. Native Clifford regeneration, global hosting/moment, precision/all-size admission and selected cold replay are outside this scope; hosted CI is separate.
Reproduce:
Base: canonical main
0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Onlyresearch/p104-prefix-minrank/is added. Canonical claim and handoff. TASK.json records refreshed overlap, the single assignment nonce and the changed algebraic scope.Credit Gonzalo Mier/#2173 for the model, Gareth Davidson/#2251 (
822bceef780d8da9605798f0836ae5320e8e291e) for the full-pool complement, and @josecarlosgonzalezroque-design for the late-prefix result and explicit early-prefix handoff (Discussion2245 comment18940216). Retain Rohan Arun/#1972, Chafik Boukhalfa/#1991, Adam Gall/#1940, Josie Elliston/#1071, Ali Romman/#1125 and their source lineage.Prepared for AAAmirinu with substantial OpenAI Codex assistance in mathematics, implementation, verification and prose, including delegated projection exploration and proof review. No independent human review or proof-assistant verification is claimed. Apache-2.0.