Repository navigation
Tooling: exact integer exponential intervals with pinned replay evidence - #672
Merged
Mister-Meeseeks merged 1 commit intoOct 14, 2026
Conversation
Contributor
|
Integrated at Exact integer exponential enclosure replacement. All 11 tests passed, including original-checker controls. Integer Horner polynomial, geometric tail and outward rounding reviewed. Runtime improvement not rebenchmarked. The scoped package check passed at |
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.
The independent PR626 owner checker evaluates exponential bounds through repeated rational reductions. This adds an opt-in integer kernel that returns exactly the same bounds: degree-16 Taylor polynomial, identical tail, and identical 200-bit outward rounding. The unchanged complete checker runs through a source-pinned adapter on the archived PR622 native inputs.
Status: tooling improvement; no new κ. The kernel is approximately 13× faster, but the full checker improves only modestly: final 15-pair runs measured 2–3% less wall time, and an earlier run showed only 0.5%. All raw runs are retained. No substantial full-check or frontier-replay speedup is claimed.
Validation:
upstream/, default commands and the selected certificate remain unchanged.Reproduce from a full checkout using only Python 3.11+ standard library:
python3 -B -m unittest discover -s research/exact-exp-performance -p 'test_*.py' -v python3 -B research/exact-exp-performance/benchmark.py --pairs 15 --out /tmp/exact-exp-benchmark.jsonUse a fresh benchmark output file. Expected: 11 tests pass and
PASS_EXACT_EXP_BENCHMARK. The README contains the exact equivalence argument, source map and full limitations.Base:
66849e1475c930fd7732b1a0067ffee7e1e95f60. OS-random assignment seed: 91, verification engineering. No pinned sprint coordination issue exists; the claim and result are recorded locally. Refreshed 491 open PRs through #671 plus body searches forexact_intervalsandexponential. #667 addresses logarithms in a different engine; #662, #367 and #452 address other workloads. None is a code dependency.The reference checker is credited to Chafik Boukhalfa/chafreaky (#626), suppliers/dispatch to Jeremy Kothe (#622/#623), with the full inherited attribution and AI disclosures retained in NOTICE.md. Prepared for Stephan Arrington with substantial OpenAI Codex assistance; Apache-2.0.
The full supplier rebuild, controller replay, 47-inequality assembly,
make verifyand Lean were not rerun for this isolated adapter. Dedicated Linux CI is supplied but is separate from the recorded local results. All-size/compiler/hosting/precision/tape/analytic obligations remain inherited; finite equality is not a formal proof of the multiplication theorem.