Repository navigation
Research: exact 96-dimensional P104 shared correction space - #2251
Merged
Merged
Conversation
This was referenced Oct 15, 2026
commdata2338
added a commit
to commdata2338/integer-mult-bounds
that referenced
this pull request
Oct 15, 2026
…acts Adds docs/research/p104-helper-lifetime-scope-map.md, a narrower successor to PR CrocSwap#2133's scope map. It compares six exact-source P104 correction contracts (PR CrocSwap#2127, CrocSwap#2251, CrocSwap#2353, CrocSwap#2383, CrocSwap#2393, CrocSwap#2445) and four later examples (CrocSwap#2458, CrocSwap#2521, CrocSwap#2594, CrocSwap#2604), and keeps their counted quantities apart: 96 shared rational dimensions versus 96 added whole-array transports, 208 monotone helper lifetimes versus physical storage, target-specific acquisition minima (48 for Y0, 78 for Y0/Y1) versus global counts, and boundary progress versus recursive excess. The six core registered replays pass at their pinned heads. One sentence in the bottleneck brief's P104 entry links the map; the brief's own guidance is unchanged. Navigation only: no new bound, supplier or kappa. Submitted by @commdata2338 with substantial AI assistance (OpenAI Codex research and implementation; packaged with Claude Code). Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01X86sCSXdoDd61SDFfC1PKG
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.
The fixed P104 snapshot model previously had a shared correction-space minimum between 96 and 97. This package attains 96, closing the explicit arbitrary-direction handoff in Gonzalo Mier’s PR #2173, pinned at
d9b784ca86fba060f0264370536ccd322c89998a.For each target, the existing source is the rational span of every other register snapshot ever available in the same binary frame subspace along the frozen channel. A 41-contact certificate constructs a 104×8 matrix
AwithRA=I, whereRis the doubled root-coordinate matrix. ThenK=(I−AR)(I−G/2)has rank 96, and each correction row differs from its row ofKby an available pooled direction. The known lower bound 96 is independently re-certified by projecting all available snapshots into the eight-dimensional root code.Scope: an exact algebraic minimum, not a chronological correction circuit, native transport saving, admitted supplier or new κ. Access at different cuts is pooled; constructing and hosting the shared directions remains unpriced. The known unfavorable 208-rank tail is not repriced as 96 ranks. Only
research/p104-minimum-shared-space/is added; selected and frozen predecessor files are unchanged.Validation:
a8b78ea543762bb03984b2e228fc2652e9036153b7ad0ab51354cedff5766f1a.Reproduce:
python3.12 scripts/research_package.py --package research/p104-minimum-shared-space. The README includes the complete proof, optional witness regeneration, source credits and the next chronological-realization handoff.Base/current canonical main:
0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Exact contribution:822bceef780d8da9605798f0836ae5320e8e291e. Original complex-mechanisms draw04a0b5296b007400a2e6d4c67da47ad2is preserved; revision 4’s central-handoff preference motivated this scoped override. The unimplemented gather claim #2032 is released. Canonical investigation: Discussion #2245. Final overlap completely paginated 480 open PRs and 956 Discussion records, with no warnings; the targeted search returned all 14 matches. Predecessor head and relevant upstream inputs were unchanged.Credit Gonzalo Mier/#2173 for the pooled-span model, lower96/upper97 and handoff; Rohan Arun/#1972 for the channel, Chafik Boukhalfa/#1991 for native realization, Adam Gall/#1940 for the schedule, Josie Elliston/#1071 for the fixture, and their retained geometry/decoder lineage. Substantial OpenAI Codex assistance in mathematics, implementation, verification and writing; no subagents, independent human review or proof-assistant claim. Apache-2.0.