Repository navigation
Certify sharp linear wrapper costs for complete high routes - #2982
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 2026
Merged
Conversation
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 17, 2026
#2915's ordered high-field ADD Answers the ordered-ADD component of PR #2982's single-cube handoff for the unchanged PR #2915 kernels.added and its pooled stream.add_pass. For odd Q>=3, canonical positive B,M,S and c in {-4,-2,-1,1,2,4}, with V=BQMQS: exactly 10+[S>1] additional scratch roles suffice and are attained in every call, sharpening PR #2809's conservative 32-role lexical allowance; six additional numerical words suffice and one fixture attains six (PR #2810's add_pass bound composed with the actual coefficient callback); and the complete local physical read/write/ unit-move bill, including encoded arithmetic and pool acquisitions, is at most 4096V, or 4102V with returned-output disposal. The exact non-arithmetic invoice extends PR #2877's and PR #2473's countdown and payload bills, zero case included, with pool acquisitions, the one-bit-suffix path and the marginal lifecycles. It matches the unchanged source on 109 complete packets (37,241 payload bits), and one fewer scratch role or numerical slot rejects at the real allocators. Route setup, B1 swaps, machine steps, physical backing and whole-stage stock remain open; no supplier, selected-frontier or kappa change is claimed. Adds research/high-add-scratch-invoice/ only. 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 was referenced Oct 20, 2026
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.
Summary
Add the isolated
research/high-route-prefix-costpackage, following PR2968's released route-cost handoff.The exact source-level invoice covers canonical prefix/high/fibre counts, cube extraction/appending, pooled acquisitions, clearing and final rewinds. Both constants are sharp within this wrapper's physical read/write/unit-move currency. A single-cube tariff lifts without another prefix factor.
This changes the drawn stock-envelope scope to a released local H2 obligation. It closes only the wrapper component, not the complete all-width cube tariff or a whole-stage stock coefficient. Task, proof and source pins retain the boundary and next questions. Canonical investigation.
Evidence
python3.12 -Werror -B scripts/research_package.py --package research/high-route-prefix-cost python3.12 -Werror -B -m unittest discover -s tests -p 'test_research_*.py' python3 -B scripts/check_research_commit.py --package research/high-route-prefix-costUnknowns remain explicit: the uniform single-cube tariff, complete machine-step/allocator/provisioning charges, physical storage and inherited caller/refinement dependencies. No selected cold replay, independent human/formal review, hosted-CI result, supplier admission or new kappa is claimed.
Credit Jose Manuel/jmbarrancoml for PR2915/2899/2809, David Arias for PR2753, Arham Tahir for PR2877's countdown, and the retained PR2157/PR589/source lineage. PR2951/2968's scaling and PR2708's separate storage result are not claimed as new.
Merge danger
Two-way; research-only. Nine new package files and an opt-in bounded replay. No production, frozen-source, selected-result or shared workflow changes. Archival publication would not discharge scientific review.