Repository navigation
Close the arbitrary-clean-workspace gap for two bit targets - #2913
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
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
Proves the exact six-call minimum for two invertible rational 3-by-3 targets in the formal abelian bit model, with any finite number of zero-initialized, zero-restored auxiliaries. Rank-one idempotent calls and the stated free scalar mixing are included; free address maps are not.
Adds only
research/bit-clean-workspace-compression/, with proof, separate C++ census/Python oracle, controls, exact sources and registered replay. Continues waynenilsen's PR2167 atcea5d7be431b09877848354f04d5f2ba512339fdand its canonical clean-ancilla handoff. That predecessor's one/two-auxiliary result and Ali Romman/PR468, eumemic/PR288 and huxint/PR203 retain credit. No predecessor engine or recorded census is imported. The different whole-endpoint requirement in PR2900 is explicitly distinguished.Evidence
After: the written coloop/workspace reductions and complete reduced census close that formal-model gap. All 8,158,176 word/pattern cases reject two rank-three targets. Six-call attainment is checked coefficientwise with distinct integer/fractional targets.
Started at canonical main
0706e744cbda1e4d0da5a6c569ad9b47876c6960, priority revision 5. Refreshed through475fec190d5ad746bd4690574dca30d6901acdaf; relevant guidance, selected record and live scientific inputs are unchanged. Final complete overlap covers 492 open PRs, 2,115 closed PRs and 1,585 Discussion records. Metadata coverage is not a novelty guarantee. No advance reservation was posted.Limits: dimensions three/four have one full census implementation with partial independent oracle coverage, not two full implementations. No proof-kernel or independent human review, original predecessor replay, supplier-native compilation, hosting/precision/all-size admission or complete multiplication theorem is claimed. Hosted CI is separate from these local checks. No new kappa or selected-frontier change.
Merge danger
Door: two-way. One additive, opt-in research package.
Blast radius: research. Frozen predecessors, shared tools and the selected frontier remain unchanged.