Repository navigation
Improve T16 kappa by composing the 408-helper rank-seven supplier - #3457
Merged
Mister-Meeseeks merged 1 commit intoOct 18, 2026
Merged
Conversation
This was referenced Oct 18, 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.
This composes #3413’s T16 chronology with the current 408-helper rank-seven supplier from #3133/#3148 and a new exact chronological allocation. The complete conditional T16 exponent improves from 0.001674088611862992 to 0.001727153212938552593775 − 10⁻⁴⁶ − 10⁻⁷⁰.
This is a scoped T16 improvement, below the stronger T740 endpoint. It changes the local supplier rather than rerunning the attained 480-helper packing envelope. It does not change the selected frontier.
The certificate reconstructs 58,752 helper occurrences across 144 calls using 181 pattern allocations and 1,167 integer flows. Deterministic bipartite edge coloring removes any optimizer dependency from verification. The fully charged construction uses 91 private buffers and 14,845 physical families. Both provider interfaces, owner windows, parent lift, controller, physical invoice and rational outer release are checked.
Validation: source pins and registered metadata; reconstruction and nine behavioral rejection groups under normal and optimized Python; nine materialization controls; complete finite admission from the exact committed Git-free export, with source inventory unchanged. The native providers are explicitly reused from authenticated artifacts produced by a prior fresh PR3148 native replay. The inherited all-size compiler, precision/tape, source realization and analytic assumptions remain conditional.
All scientific replay inputs are included through the registered export dependency closure and a deduplicated authenticated overlay. Private exploration/solver tooling is excluded. Attribution and exact predecessor identities are recorded in CREDITS.md and SOURCE-ORIGINS.json. OpenAI Codex assisted with discovery, reconstruction, audits and tests.