Repository navigation
Prove two-helper shears gain nothing from target feedback at any target count (no new κ) - #6034
Merged
Mister-Meeseeks merged 1 commit intoOct 28, 2026
Conversation
Both minima equal a + b + c + min(c, 2) for every target count, answering the 2x7 part of the PR2567 nine-register question.
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
Claim type: scoped proof for every target count, with finite corroboration. No new supplier, κ or selected-frontier change.
In the zero-frame dirty-shear model of PR #1306 and PR #2567, take two helpers and
Ttargets with unit-cost single-source XORs and no extra registers. Leta,b,ccount the rows(1,0),(0,1),(1,1)ofK. For everyT ≥ 1and everyK, the restricted and unrestricted minima are equal:d_P(K) = d_full(K) = a + b + c + min(c, 2).So target-to-helper feedback never helps for a two-helper shear. This answers the 2×7 part of Open next question 1 in rtyu193-rgb's PR #2567. Through that package's duality it also covers T×2, including 7×2. The 3×6 and 4×5 shapes stay open.
The upper bound is an explicit restricted word: direct reads, plus one shared
h0 ^= h1 … h0 ^= h1block whenc ≥ 2. The lower bound counts destinations and allows feedback:The full proof is in
research/two-helper-zero-frame-feedback/README.md.Evidence and reproduction
verify.pyuses only the standard library and imports no predecessor code. It checks:KwithT = 1..8(87,380 matrices), replayed exactly; the gates are linear, so this covers all dirty inputs;T = 1..3(84 matrices) against the formula;wt(K).All four commands passed locally on CPython 3.12. Each direct run took about 0.45 s and printed
PASS_TWO_HELPER_ZERO_FRAME_FEEDBACK witnesses=87380 bfs=84 pr2567=5376 controls=4 feedback_gains=0 no_new_kappa.Limitations
H = 2(andT = 2by duality), F2, PR Finite certificate: no D-local feedback saving for 3x3 binary shears (no new kappa) #1306's two alphabets, zero frames and no extra registers.T > 8, the result rests on the written proof; the finite checks only corroborate it.Open next questions
d_Pat everyH?Related open work
CI notes
Head
d27351424186a70b06cf3dae0eb87e425acd5f2d: both hosted checks passed,planandreplay (research/two-helper-zero-frame-feedback), in run 40608381317.