Repository navigation
Exact exclusion for a six-source TRIO connector path - #2146
Merged
Mister-Meeseeks merged 2 commits intoOct 15, 2026
Merged
Mister-Meeseeks merged 2 commits into
Mister-Meeseeks merged 2 commits into
Conversation
This was referenced Oct 14, 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.
Contribution
Adds an exact scoped census for a six-source connector alphabet with one
charged three-source call. For a closed 12-call word with eleven singleton
steps and one weight-three step, no path covers all 63 nonzero pairwise
prefix differences. After symmetry normalization, the complete exact search
contains 1,098,204 simple paths and 709,812 eligible closing-edge candidates;
maximum coverage is 49, and no candidate covers 63 masks. This excludes only
the stated call and source-add profile. No supplier, recursive bound, or
kappachange is claimed.The fully charged hypothetical bill would be
138 o + 140 p, including 126output readouts, versus PR #2128's
140 o + 142 p. The TRIO call is chargedo + 3p, and any additional implementation surcharge must be below2o + 2pfor the modeled saving to survive. The complete census shows thatthis profile does not realize the saving.
Verification
Run:
The verifier independently scans all normalized paths by a product iterator,
recomputes difference sets from scratch, checks the exact histogram and
endpoint-record digest, confirms the PR #2128 full-cover fixture, and runs
three negative controls. Direct local output under Python 3.14.7:
The metadata-and-source-pin check passes locally. The registered replay is
configured for Python 3.12; it was not run locally because Python 3.12 is not
installed.
Provenance and disclosure
Seed
1b82dfd0673536e282d9d9e7adcb1a04, trackrecursive-interfaces, taskconnector-alphabet-change, priority revision 4. Exact base:0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2. Selected record SHA-256:10b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32.All pins and the refined scope are in
TASK.jsonandSOURCES.json.Nearest positive comparator and fixture: Aaron Wang, PR #2128,
head
697369a971eed02c0fbcd75ebefec9f59945f08e. The current result uses adifferent alphabet extension: exactly one charged TRIO call. Substantial
OpenAI Codex assistance was used; no independent human review is claimed.