Repository navigation
Research: prove the 10-XOR minimum over all boundary pairs in the fixed connector - #3318
Merged
Mister-Meeseeks merged 1 commit intoOct 17, 2026
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.
Result
This follow-up proves the exact minimum frame cost for every valid readout-boundary assignment in the fixed two-projection connector model in
research/two-projection-connector-seed51a5.For the fixed source word
B0 B1 B0 B1 B2 B3 B4 B2 B4 B3, with source 3 using direction(1,1), the other sources using(1,0), paired readouts using projections(1,0)or(1,1), and only the two paid row-shear generators:PROOF.mdreduces paired readouts to same-projection prefix differences and proves the six-frame shortest-transition DP is exact.verify.pyindependently enumerates the full demand-set domain, validates all 31 predecessor readout pairs, prices the retained frame schedule, and rejects a corrupted mask-pair control.Scope
This is a finite optimum for the one pinned source word, direction assignment, two projections, paired-readout contract, and two shear generators. It does not bound other source words or connector models. It does not price the row XORs against multiplication children, place the second dirty row in the selected supplier, or change kappa. The predecessor's local 180-child versus 182-child comparison remains a separate cost vector until a supplier-supported row-XOR/storage tariff is supplied.
Reproduction
Commands pass locally under Python 3.14.8:
The repository's full package runner is pinned to Python 3.12. Python 3.12 is not installed in this environment, so I ran the same three replay commands directly with Python 3.14.8 and ran the package metadata/source-pin check separately.
Context
Base:
463113d675af7410ac91d53a4fed51ec6494eb9a(canonical main remained unchanged at submission). The final overlap refresh covered 361 open PRs and 2,159 discussion/comment/reply records. No open PR or exact-term discussion matched the all-boundary follow-up; the old #1167 claim is the predecessor construction, while #2221 and #2262 concern different connector models. Details and timestamps are inOVERLAP.json.The predecessor construction retains its source credit in its own
NOTICE.md; this PR credits that work and adds only the all-boundary lower bound and checker.