Repository navigation
Prove the exact 38-ADD floor for the full fixed G20 boundary - #6105
Merged
Mister-Meeseeks merged 1 commit intoOct 28, 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.
The exact 32-wire G20 conversion boundary needs 38 unit ADDs per side, even when gates connect the chain, exchange components and two untouched wires. This closes the full fixed-endpoint question left by PR6081, rather than adding component-local minima.
The inherited Bu–Fan–Joo connectivity/diagonal bound applies directly: each authenticated endpoint has 10 support components and 16 zero diagonals, hence 32−10+16=38. The literal source has eight SWAPs and fourteen ADDs, attaining 38 after expansion. The package includes the self-contained counting proof and preserves all source bytes.
Normal/optimized registered checks pass, including literal endpoint and input-column replay, two support-graph algorithms, inverse composition and 76 gate-omission controls. Exact committed-byte/history/mode checks and official export integrity/input coverage pass at
5472e0fc07a79123cab5fdcdba78293095984552; fresh read-only Git-free empty-PATH normal/optimized export replays also pass without changing files.Reproduce:
python3.12 -B scripts/research_package.py --package research/g20-full-boundary-floor.Fixed physical endpoints and 32 independent wires only. Changed chain bases, extra scratch, nonlinear gates, nonunit tariffs and supplier/caller admission remain open. No new κ, selected-frontier change, full theorem or independent human/proof-kernel acceptance. Hosted CI is separate.
Credit Ali Romman/PR5840, Charan ./PR5851, Nick Petalas/PR5942, JoyboyBrian/PR6081, Bu–Fan–Joo and retained G20 lineage. Prepared by JoyboyBrian with substantial OpenAI Codex assistance. Advance claim. Apache-2.0.