Repository navigation
Research: prove even-subset R floor 82 among X=6 at seven queries (no new kappa) - #2686
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 2026
Conversation
Answers CrocSwap#2643 OQ1 in the PR1898 alphabet: covering Q=7 walks have R in {82,88,96}, so min R among X=6 is exactly 82 (sharp via champion). Repeated prefixes cannot undercut; tariff floor 442 does not beat 436. Prepared by Wentao Li with substantial AI assistance.
cursor Bot
pushed a commit
to VictorLiwentao/integer-mult-bounds
that referenced
this pull request
Oct 15, 2026
…y repair Answer CrocSwap#2686 OQ1 for the natural all-subset connector-state alphabet at Q=7: free R=66 would tariff 410<436 at X=6, but odd live-connector R_m parity leaves connector dirt; zero-slot parity repair collapses to even-subset R>=82 (tariff 442). No new kappa. Prepared by Wentao Li with substantial AI assistance. Co-authored-by: Victor Li <VictorLiwentao@users.noreply.github.com>
cursor Bot
pushed a commit
to VictorLiwentao/integer-mult-bounds
that referenced
this pull request
Oct 15, 2026
…y repair Answer CrocSwap#2686 OQ1 for the natural all-subset connector-state alphabet at Q=7: free R=66 would tariff 410<436 at X=6, but odd live-connector R_m parity leaves connector dirt; zero-slot parity repair collapses to even-subset R>=82 (tariff 442). No new kappa. Prepared by Wentao Li with substantial AI assistance.
This was referenced Oct 15, 2026
Merged
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.
Change and scope
In the five-source common-B mutable-source alphabet of #1898, every restored straight-line word with exactly seven queries and even-subset connector-state readout needs at least 82 readouts. Among words with
X = 6, that floor is sharp: the path-lowered champion(0,1,2,6,12,24,16,0)attains7 Q / 82 R / 6 X(abstract tariff 442 at(b,a,x)=(38,2,2)).< 5label setsThis answers open question 1 of #2643: min
Ramong restored seven-query words withX = 6is exactly 82. In particularR ≤ 78is impossible, so tariff38·7 + 2R + 2·6cannot undercut six-query endpoint 436 by loweringRatX = 6. Repeated prefixes cannot beat 82 (only addR = 96).Scoped obstruction with sharp attainment; no new kappa. Leave-alone through #2677 (including #2643, #2593) was not reopened.
Result
Package:
research/seven-query-r-floor/.Tip:
0e5f24d033eba7a36e6fc990d7263dc4c2ee9183.Exact:
min_R_among_X=6is 82 sharp; repeat layerR=96; tariff floor 442.Validation
Expected:
Default verify is read-only. Admission uses
need();-Oalso passes.Overlap and credit
Closest priors: #2643 (
X≥6at Q=7; OQ1), #2677 (path-lowered distinct-slot spectrum), #1898. Freestanding; no competing open PR on this repeated-prefix R floor at refresh.Credit the mutable-source / PR1898 / #2643 lineage. Prepared by Wentao Li (VictorLiwentao, @Is__Victor) with substantial AI assistance, under Apache-2.0.