Repository navigation
Prove the exceptional single-hub literal charge is 48. - #4124
Merged
Mister-Meeseeks merged 1 commit intoOct 20, 2026
Merged
Conversation
The relaxed actual-reader model on PR3573's twenty extremal premises pays 48 against a baseline of 40. The excess of 8 is exactly the four dxy and gtxy reader rows, and the GF4 hub transfer still holds. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
This was referenced Oct 20, 2026
Draft
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 exact minimum. No new κ and no selected-frontier change. Selected κ stays
0.001672660197076918.On the exceptional single-hub star of PR #3573 (marks
E,F, queriesg,d,t,h,x,y), the relaxed literal actual-reader model of PR #3698 has minimum charge 48 against baseline 40. The excess of 8 is exactly the four reader rowsE dxy,E gtxy,F dxyandF gtxy. Each has a unique reader, and every admissible evaluator leaves at least two queries visible. The other sixteen extremal rows attain cost 1.The coordinate-functional bearing count is not this minimum.
dthxanddthycontain three mark-bearing queries, but the evaluators(1,0,-1,0)and(0,1,-1,0)see onlydand pay 1. The two-bearing mechanism that survives the PR #3698 relaxation is the pairing ondxyandgtxy.PR #3573's GF4 hub map still preserves all 128 oriented subset implications. The excess is a rational factorization bill, not a transfer obstruction. One attaining per-query split for
g,d,t,h,x,yis[0, 20, 4, 8, 6, 10]. The total is the minimum. That split is not claimed unique.Task and overlap
bb4bccbf42844d2801487450727c2f63e10d1d0f(canonicalCrocSwap/integer-mult-boundsmain, refreshed unchanged before submission; priority revision 6).uniform-transfer-audit, scope changed. The card asks for one all-size, compiler, precision, hosting or restoration implication. This session takes discussion Handoffs and requests for independent checks #1166 comment 19021149 instead of redrawing a card. The finite charge is the comparison with the two-hub excess of 12.f0cb59da21fbde87b4ca6a7480b0905d6f6fb9bc, PR The two-hub literal actual-reader tariff minimum is exactly 54 #3698f8893fdfcb41a236ac085a92bca68ec6e5139cdc. The six columns are restated and the extremal table is rederived.Validation
CPython 3.12.3. Registered replay:
python3.12 -B scripts/research_package.py --package research/p112-single-hub-two-bearing
Passed locally as
PASS_REGISTERED_RESEARCH_PACKAGE research/p112-single-hub-two-bearing outcome=completed.verify.pyrederives the twenty extremal premises, checks the pairing, searches the row model, checksWITNESS.json, the40×40Gram identity and the GF4 transfer.independent.pydoes not import that file. Minors and Cramer's rule recompute the twenty minima; GF4 is{0,1,2,3}.test_controls.pyrejects a brokendxyreader, a substitutedyimage, and equating the strictdthxcount with the relaxed cost.Not run: Lean, Docker, a selected cold replay, or hosted CI. The argument is the pairing in
PROOF.mdtogether with a finite enumeration of one row model. It is not a graph classification or a supplier admission.Credit
The star, the extremal table and the GF4 map are Nick Petalas's PR #3573. The row model and the two-bearing mechanism are Nick Petalas's PR #3583 and PR #3698, retaining Philippe Van Velzen's expanded identity, ctoth's coverage question and the actual-reader lineage. New enumeration and pairing by unpaidmoon, with substantial AI assistance (Cursor Grok). No independent human or proof-kernel review is claimed.
Open next questions
dxyandgtxy, or repeat the twelve-unitK3,2excess? First step: write the third hub's queries the way PR Prove the arbitrary-map two-hub support-transfer obstruction #3583 addedk,z,wand rerun this row model. Blocked by the absence of a charge-transfer lemma; PR Prove rooted-minor closure of marked support-transfer obstructions #3591 moves support obstructions, not this charge.Workflow feedback (optional)
The handoff in comment 19021149 named the comparison and the row model, so the session could stop at one finite minimum. No separate workflow note.