Repository navigation
Prove equal-key wrapper sharing for the finite physical caller - #4758
Merged
Mister-Meeseeks merged 2 commits intoOct 22, 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.
The public finite compiler retains fresh
Residualwrappers for repeated source keys. This scoped package answers the sharing handoff from #3391 and #3650 (selected-compiler-source-bridge): an opt-in post-compilation pass shares equal definitions within a mode, with a conditional simulation proof for the unchanged physical caller.The pass checks complete residual segments, exact segment-owner identity and every definition field, including code and plan. Its contract requires deeply unchanged fields and read-only, identity-insensitive observers. The original geometry identity guard and source callbacks remain in place. Malformed segments, same-key/different-plan definitions and cross-mode collisions reject; controls also demonstrate why identity observers and stale geometry are outside the proof.
Validation:
This reduces wrapper identities retained by returned
Codeafter old references are released. It does not remove original emitter allocation, setup peaks, operation tuples, direct references, LOW enumeration or full compiler cost. The earlier 32-visits-per-key coefficient remains conditional on its source-census hypotheses and equal definition fields; selected GL64 is not expanded here. No stock, supplier admission, selected frontier or κ changes are claimed. Historical loader admission is explicitly outside the reduced runtime experiment.Canonical claim: #2319 (comment)
Credits and open next questions are in the package README. Prepared by JoyboyBrian with substantial OpenAI Codex assistance; no independent human or formal acceptance is claimed.
Submission checkpoint: canonical main was fetched again and remains
b58ad9ef4d4e861b0eaa5dba41742bdc072dca51, priority revision 7. The refreshed complete inventory (2026-10-22 19:10:08 UTC) covers 512 open PRs, 3,673 Discussion records and 5,860 base local notes. Scoped search and live predecessor heads were rechecked; no competing result was identified in this stated coverage. Closed PR diffs, arbitrary nested code and unpublished work remain outside it.Hosted replay budget correction: Ubuntu 24.04 / CPython 3.12.15 completed the first nested execution in 274.67s, then hit the former 360s command limit while running the second execution (failed job). Both registered commands now have the permitted 600s limit, totaling 1200s. Both full normal/optimized runs, scientific code and RESULT.json remain unchanged. Metadata/source-history/committed-byte/export checks pass; hosted success still requires the updated CI run.