Repository navigation
Record the three-hub extremal actual-reader charge. - #4145
Merged
Mister-Meeseeks merged 1 commit intoOct 20, 2026
Merged
Conversation
The complete extremal table of the PR3573 star has minimum charges 48, 128 and 256 at one, two and three hubs. The excess is 4h(h+1) through three hubs, from crossed two-bearing rows, and is not the 21-premise K3,2 excess of 12. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
This was referenced Oct 20, 2026
Draft
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 mathematical scope
Scoped proof in one finite row model. No new κ and no selected-frontier change. The selected conditional exponent stays
0.001672660197076918.On the complete extremal table of the PR #3573 star with
hindependent hubs, the relaxed literal actual-reader charge exceeds the one-unit baseline by at least4h(h+1)for everyh ≥ 1. Forh ≤ 3the excess is exact:At three hubs, 24 rows cost 2. Twelve of them are crossed five-query readers, two for each pair of hubs. The third hub therefore adds two-bearing rows beyond
dxyandgtxy. It does not repeat the twelve-unitK3,2excess. That twelve is the separate 21-premise certificate, whose charge this package recomputes as 54.The lower bound is the pairing in
PROOF.md, including the determinant-2that makes each crossed five-query set a minimal reader. Equality through three hubs is the subset census. This is not a graph classification, a characteristic-two transfer, a supplier admission, or a κ improvement.Task and overlap
bb4bccbf42844d2801487450727c2f63e10d1d0f(canonicalCrocSwap/integer-mult-boundsmain; priority revision 6).1391427065829965bf3eb83dac022f4de6c82c48.uniform-transfer-audit, scope changed. The card asks for one all-size, compiler, precision, hosting or restoration implication. This session takes the second question of handoff comment 19021149.Eligible handoffs, chronological on #1166 from comment 19016211, after dropping later DONE work, this account's delivered round (#4107, #4110–#4120, #4122, #4123), and next tasks already matched by an open PR:
p112-ten-deletion-spancensus.cpp(comment 19045344).Fewer than 29 items remain. Item index
(29-1) mod 14 = 0, so the refinement target is item 1. Open PR #4124 already proves that the one-hub charge is 48. This package does not import it and does not repeat that proof as the result. The charge 48 appears only as theh=1row of the same census. The added statement is the third-hub excess 48 and the separation from the 21-premise charge 54.Dropped before the cut: the #3605 wrapper (open #3681), the typed actual-width H (#4123), the L22 pair and revisit notes (#4117, #4120), the P104 residual consumer (open #3943), the T385 replay (open #3936), the QQ16 six-tape bind (released, and refined by #4114), neutral-first retiming (open #3941 and #3957), the tensor-pairing review (#4113), the moved-ADD pair (#4122), the separated A2 acceptance (#4112), helpers 600/601 (open #4061), and the R439, batch952, flag-9, V45 and span-four/six notes already delivered this round.
Validation
CPython 3.12.3. Registered replay:
Passed locally as
PASS_REGISTERED_RESEARCH_PACKAGE research/p112-third-hub-extremal outcome=completed.verify.pyuses rational row reduction.independent.pyuses integer cross-multiplication and does not import that file. Both print the same charges.test_controls.pychecks rank agreement on every two-hub mask, minimality of the one-hub triple, separation of charges 128 and 54, a dropped-row mutation, and the two written minors equal to-2.-O.Not run: the
h=4census, a characteristic-two transfer, Lean, Docker, hosted CI, and the selected cold replay. Finite enumeration certifies equality only through three hubs. The inequality for every hub count is the written pairing.Credit
The one-hub star is Nick Petalas's PR #3573. The second hub and the 21 premises are Nick Petalas's PR #3583. The relaxed row model and the charge 54 are Nick Petalas's PR #3698, retaining Philippe Van Velzen's expanded identity, ctoth's coverage question and the actual-reader lineage. The one-hub charge 48, proved separately, is open PR #4124. The third-hub census is by unpaidmoon, with substantial AI assistance (Cursor Grok 4.7). No independent human or proof-kernel review is claimed. Apache-2.0.
Open next questions
4h(h+1)for every hub count? The inequality is proved. Equality needs the extremal table. The first step is the same census ath=4(2^15query masks). Nothing mathematical blocks it; this session stops at the third hub named in the handoff.Workflow feedback (optional)
The handoff named the third hub as the next comparison after the single-hub charge, which kept this session off the charge-48 proof already opened in #4124. #1200