Repository navigation
Compress the selected native scalar graph by 116 ADDs (no new K) - #4692
Merged
Mister-Meeseeks merged 3 commits intoOct 22, 2026
Merged
Mister-Meeseeks merged 3 commits into
Mister-Meeseeks merged 3 commits into
Conversation
This was referenced Oct 23, 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
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 selected PR4470 scalar word contains repeated ADDs that combine across exactly commuting instructions and noncommuting three-gate triangles with shorter exact replacements. Rebuilding the actual native program removes 116 scalar macros and 914 real primitive allowance units per invocation in each orientation. All 632 persistent inputs remain arbitrary.
No higher K is claimed. The complete Gaussian paid profile, 408 productive helper boundaries and main endpoints are unchanged, so the complete recursive moment is identical for every exponent. This is a local circuit saving and a bounded result on PR4470's changed-scalar-order question, not the requested bottleneck breakthrough or a global scalar-circuit optimum.
Only
research/scalar-trace-compression/changes. The package reconstructs both words, checks every common frame and paid rank with two retained exact native interpreters, retains free noncommuting warp words and owned-center return, and confirms that no new Gaussian edge needs a phase recipe. Exact prefix bounds remain 457 forward and 169 backward.Validation: CPython 3.12.15 registered replay; isolated optimized replay; committed-byte/source-history preflight; export/archive checks; fresh Git-free optimized replay with PATH=/nonexistent; whitespace check. The scientific program and receipt were tested at 5bad501; the final commit adds only the validation record. No selected cold replay, compiler/outer admission, formal kernel or independent human review is claimed.
Credit Cinna Davis's PR4441/4447/4470 lineage, zxv, Jacob Alan Sussman and retained scalar/native/Clifford/geometry/precision/outer authors. Source construction and both interpreters are reused with credit. Prepared for Cinna Davis with substantial OpenAI Codex assistance; Apache-2.0. Canonical main refreshed at b58ad9e; selected conditional K remains 0.00302015. Latest queue refresh also checked #4690; its non-nested contact search is a distinct predecessor direction.