Repository navigation
Complete G20 source-refinement admission at ordinary BIT saving 0.003497804579519 - #5667
Merged
Merged
Conversation
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 closes the full-caller and ordinary-admission handoff from PR5662, using Dugongue's exact PR5657 source refinements. The resulting conditional ordinary BIT saving is 0.003497804579519, an increase of 0.000009225052519 (about 0.264436%) over PR5653. This is a complete conditional component result, not a whole multiplication kappa claim.
The exact emitted local word is installed in all eighteen calls. The fresh global replay retains 11,166 independent originals, returns all 39 owned fields, binds all 56,547 paid queries to chronological source descriptors, and checks 446,604 events and 2,367 payload episodes. The explicit new frame-506 matcher contributes 5,472 coefficient terms to a positive finite fee. Both rational-series implementations pass fresh compiler-tail, stock, cover and five-level ordinary checks.
The proof also removes any fixed finite-parameter loss below this invoice's raw crossing: every strict ordinary saving below that crossing is attainable under the retained framework. The numeric certificate is within 1.31e-13 of the certified upper root bound. This does not assert global optimality or admit the crossing itself.
Evidence: proof, global result, ordinary certificate, independent result, and replay instructions.
Validation: registered Python 3.12 normal and optimized replays, exact committed-file checks, official package export and Git-free optimized replay. The normalizer, all-width native, ROW/compiler, owned-stock, precision/tape and analytic premises remain. The enormous uniform word and rounded multiplier are not executed. Full-history ancestry preflight is unavailable in this shallow checkout. The newer PR5665 proposes a stronger BIT word by late helper binding and reports no executed source replay; it is not included in this exact-word certificate. Hosted CI is separate; the known shared planner navigation failure has a pending fix in PR5659. Selected .00310045 is unchanged.
Ali Romman with substantial OpenAI Codex assistance. Credit Dugongue for the local construction, ai-nanachi and the complete retained G20 lineage for the controller and framework, and the prior authors listed in NOTICE.md. This package supplies the full integration, strict finite margins and checks; it does not claim the source identities as new discoveries.