Repository navigation
Borrowed rank-one adapters: 674 → 666 scalar allowance with no extra fields - #4502
Merged
Mister-Meeseeks merged 1 commit 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
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.
The four native cleanup windows cost 766 scalar allowance per orientation in main. #4494 reduces that to 698 with one reusable field; #4499 reaches 686 without an extra field or 674 with one. This package reaches 666 with zero additional owned fields by replacing two owned-sum macros with restored persistent-field adapters and retaining #4499's gauges for the other windows.
For the repeated-input matrix, form X0 + X1 in X0, read it into the three destinations, then undo X0 += X1. The full bill is 42 instead of the owned macro's 46 or the direct block's 52. The dual orientation subtracts the arbitrary dirty target pivot before its update and adds it back afterward. Both exact constructions, their cost formulas and a sufficient strict-saving condition are proved in PROOF.md. These are classical conjugation/uncomputation ideas specialized to authenticated native windows, not a priority claim for the general technique.
Validation passes: source hashes and contiguous native window selectors; 160 independent symbolic local columns in both orientations; 339 legal borrowed-pivot programs from 100 deterministic rank-one matrices; structural checks that every selected instruction uses only original fields; native scalar pricing; missing-uncomputation and dirty-target-subtraction rejection controls; inherited gauge flow certificates; registered replay, committed-byte checks, and isolated optimized Git-free exported replay. Standard-library Python only, tested on Windows; Linux execution is not available in this session.
This is a scoped local contribution, no new κ, no new recursive calls or productive-temporary credit, and no selected-frontier change. Full native stock/norm/coefficient and multiplication-bound replay remains necessary before global use. Main was refreshed before submission and remained 2a13eb1. The package is standalone against those main inputs and does not require either predecessor PR to be merged.
Credit #4489, #4494 and #4499 for the owned sum, rank compiler, source fixtures and exact gauges; retain zxv's native lineage, Jacob Alan Sussman's compiler and Cinna Davis's padding/query/retiming work. ATTRIBUTION.md records relevant MathProof source precedents and neighboring dirty-scratch PRs #1931/#3906/#4017, plus incomplete Discussion/local-search coverage. The open-PR title/body snapshot covered 352 entries; this is not exhaustive novelty evidence. Substantial OpenAI assistance; Apache-2.0.