Repository navigation
Conversation
This was referenced Nov 2, 2026
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
Scoped proof: every formal UT4 central-target word needs at least 4w middle b calls, with arbitrary finite restored dirty workspace and free scalar mixing. The new bound is
n_b >= 2w + rank(X_b) + rank(Y_b).With ToikY's credited outer floors and direct word, the exact complete tariff is
2w alpha + 4w beta + 2w gammafor all nonnegative uniform letter prices. The unit minimum is 8w. This settles both remaining seven-b mixed-rank cases in Victor Li's #3938 and the pure-central weighted question in Josie Elliston's #1816. No new kappa is claimed.Evidence
Before, #3938 excludes middle ranks (2,2) and leaves (2,3)/(3,2) open. After, the paired middle quotient excludes all n_b<4w algebraically, for every finite role count and word length.
The standalone verifier passes 20,632 new paired-coefficient word fixtures, 42 complete full-group endpoint fixtures, 80 omitted-call controls and ten additional rejection controls. Both warning-strict normal and optimized checks produce identical generated file-hash receipts. They took 0.523 and 0.518 seconds locally; the complete registered replay took 1.365 seconds. These are check durations, not performance gains.
Reproduce from the repository root with CPython 3.12 and the standard library:
Other machines may substitute their CPython 3.12 path. Metadata/pins, committed-byte/source-history preflight, AST/in-memory compile, committed export integrity and a Git-free optimized replay pass. No predecessor verifier or census is imported, audited or replayed. The universal claim is the written factorization and dimension argument; finite fixtures corroborate its implementation.
Credit ToikY #1662 for the model, quotient homomorphism, span floors and direct upper word; Victor Li #3938/#3887 for the open mixed-rank gate; Josie Elliston #1816 for two-target unit optimality and the weighted question; Aaron Wang #1690 and the retained #1680/#1573/#1589/#1607 lineage. Exact source provenance is pinned. The advance claim targets seven middle calls; the same argument yields the uniform tariff directly.
Limitations
This is a scoped formal-model proof. It does not supply a native BIT mechanism, rational-frame identity, supplier admission or a complete multiplication theorem. Role-dependent prices, extra free address operations, clean allocation, physical/native implementation, compiler/hosting, stock, precision, tape and analytic recovery are outside scope. The five selected framework assumptions remain. Human review, proof-kernel formalization, selected supplier cold replay, Lean and Docker are unrun.
Open next questions
Can an additional paid address letter escape the paired coefficient equations? Begin with its exact quotient image, identify which hypothesis changes, and price one complete arbitrary-dirty word. No such changed-alphabet construction is supplied here.
Related open work
The completion refresh inspected all eleven other account open PRs created after the advance CLAIM. No additional pure-central UT4 tariff or shared numerical endpoint was found. Adjacent call-cost work is listed below; no additional computations were run to compare it.
The closest same-object predecessors #1662, #1816, #3887 and #3938 are merged. Unpublished work remains outside this coverage.
CI notes
Both hosted checks passed at exact head
2acaf42e1f8a17c13951c5f706decfa4e325bac3in run 41528426188: plan and replay (research/ut4-hyperbolic-middle-floor). The completed checks were read once; run metadata confirms completed success at the matching head.Hosted replay confirms execution of the registered normal and optimized finite checks and package metadata validation. The universal written proof remains outside a formal kernel. All recorded local checks, committed-byte/source-history preflight, export integrity and Git-free replay also passed. Native, physical and supplier obligations remain outside scope.
Merge Danger
Door: two-way. Blast Radius: package. The change adds six isolated research files and its opt-in replay manifest.