Repository navigation
Attain the mixed-negative Q8 bound for t <= 2 - #3697
Merged
Mister-Meeseeks merged 1 commit intoOct 20, 2026
Merged
Conversation
PR3589 proved the necessary bound 5n >= 11t for mixed-negative Q8
endpoints and left "is 11t/5 sharp?" open. This package closes that
question in the t <= 2 regime.
For every mixed-negative endpoint with t = 1 or t = 2 the minimum number
of paid rank-one calls is exactly the parity-rounded bound: 3 and 6. The
lower bound is inherited and role-free, so the minima are complete over
all role counts; the upper bound is an explicit word, because three calls
on one role multiply it by the cube of its label and i^3 = zi, j^3 = zj.
Consequences: the uniform constant is attained at t = 1 and t = 2, so no
strictly stronger necessary function of t can hold there. The bound is not
attained by this witness family for t >= 3: t = 3 stays in {7,9} and the
balanced t = 4 in {10,12}, both still undecided.
Evidence is five complete breadth-first receipts over 6 and 56084 distinct
states, eight witnesses replayed to their exact diagonal endpoints, the
Q8 product law checked against an independent signed-unit table, and
behavioural controls that must reject corrupted algebra, boundaries,
witnesses and limits. A randomised search for a ten-call balanced word is
recorded in VALIDATION.md as a search failure only; it excludes nothing.
No new kappa, physical supplier, invoice or frontier change is claimed.
petalas
force-pushed
the
research/w4-b21-q8-tower-20261018
branch
from
October 18, 2026 17:33
097d500 to
b5fa864
Compare
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.
Summary
Close PR3589's open sharpness question for mixed-negative Q8 endpoints, in the
t <= 2regime.The lower bound is inherited and role-free, so these minima are complete over all role counts and over any finite restored dirty workspace. The upper bound is an explicit word: a paid factor with
u = v = e_amultiplies roleaby its labelg, andi^3 = zi,j^3 = zj, so three calls per target role realize the endpoint in3tcalls — which fort = 1, 2lands exactly on the bound.Two consequences, in the direction that narrows the question:
11t/5constant is attained att = 1andt = 2. No strictly stronger necessary function oftcan hold at those points. This is PR3589's open question 2, answered affirmatively fort <= 2only.t >= 3.t = 3admits bound value7against a9-call witness; balancedt = 4admits10against12. Those minima stay in{7,9}and{10,12}and are not decided here.This is a mathematical side result for the nonabelian bit-register model. No new kappa, physical supplier, invoice, native conversion or selected-frontier change is claimed.
Evidence
11/5is not claimed sharp. After: the constant is shown attained att = 1andt = 2, so no improvement ofnas a function oftis available there.i^3 = zi,j^3 = zj,z^2 = 1are checked directly.2and5—6and56,084distinct states — and find none. These are a cross-check of the model and the witnesses; the theoretical bound is what supplies completeness att <= 2.-Oand must produce real rejections for a corrupted Q8 product law, a corruptedzinvolution, a bad paid label, a zero or out-of-range projector, evenv^T uoverlap, role capacity, an empty or unknown endpoint target, a truncated witness, a shrunk census limit, a corrupted parity bound, and a receipt round trip. No check usesassert.giving
PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES(097d500ac). The package is standard-library only and replays without Git or network.Search failure, recorded as such
A randomised hill-climbing search for a ten-call balanced four-target word was run over
4–6roles (18 independent runs, best cost6, no cost0). A positive control at twelve calls reached only cost8, so the search is known to be weak. Its failure is written intoVALIDATION.mdonly to stop a later reader mistaking it for an exclusion. It excludes nothing.Limits and unrun obligations
t >= 3is not decided; complete enumeration at four or more roles exceeded this session's budget. Nothing here re-proves PR3589, and no physical scalar, routing, restoration, hosting, precision, recursive or supplier-admission cost is computed. Lean, Docker, the selected full cold replay,ruff(not installed in the authoring environment), independent human review and formal proof-kernel acceptance are unrun.Credit
Nick Petalas/PR3589 for the mixed-negative boundary-rank bound and the parity, with PR3570 (mixed cubic identity), PR3578 (two-orientation boundary-rank method), PR3536 (sign-sensitive chronology) and PR3558 (cyclic subspace argument). Only the witnesses, the complete small-case census and the sharpness consequence are new here.