Repository navigation
Prove sharper continuation backing for the selected coefficient evaluator - #2925
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 2026
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.
Summary
Prove that unchanged PR2697
Callback.weightstores at mosth+1RETURN records on its value stack. This sharpens PR2758's four-tape retained-backing allowance while keeping its source contracts and live-symbol proof:Here
h>=1,A=2I+4,B=R+3,T=max(A,B)andF(h)=(h+1)T+hB. The package also proves exact depth-zero backing, accounts for arbitrary warm history coordinatewise, and states the conditionalA>=Bbinary-grammar sharpness boundary.For the already published GL64 depth-two example, the certified allowance drops from 340 to 214 cells, matching its known observation. The new result is the all-depth source lemma and per-tape rejection checks, not a new measurement or runtime saving.
Scientific source: Jose Manuel/jmbarrancoml's #2697 at
a53fdf4bcbe33c6732f0bec1badc8c023380f9d1, authenticated through Nick Petalas's unchanged #2758 exports. Exact pins, proof, receipt, limitations and next questions are inresearch/selected-continuation-backing/. The #2770 numerical live-word result, Ross Richardson's #2831 arena backing and #2923 native ADD join retain separate credit. Source notices remain unchanged. Substantial automated assistance was used for analysis, proof drafting, implementation and internal review.Canonical scoped claim. Started at current main
a7482490b; refreshed main3bee87dc2has unchanged priorities, selected record, consumed inputs and replay runner. Fresh overlap covered 495 open PRs, 2,122 closed/merged PRs and 1,601 Discussion records. Metadata coverage omits arbitrary diffs and unpublished work.Evidence
145+44+19+6.Replay:
python3.12 -I -Werror -B scripts/research_package.py --package research/selected-continuation-backing.Merge danger
Door: two-way. Blast radius: research.
One opt-in package. The theorem assumes successful private weight execution; general
B>Aoptimality is open. Numerical arenas, input programs/fields, other caller categories, physical reuse/movement, complete reserve and supplier admission remain separate. The selected frontier and frozen predecessors are unchanged; no new kappa or complete multiplication theorem is claimed.