Repository navigation
Tooling: 1.22x faster exact finite-bit block-core checks - #1584
Mister-Meeseeks merged 2 commits into
Conversation
|
Batch review at Merged to Reviewed scope: Opt-in per-call frame/transition caching preserves every original edge charge and full receipts on the declared differential fixtures, existing tests and rejection controls. No default checker or historical pin is replaced; benchmark ratios remain author measurements. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
The finite-bit checker already caches exact elimination, but still constructs and hashes a rational difference matrix for every physical edge. This adds an opt-in, source-pinned nine-line replacement that interns normalized frames and reuses identical ordered transitions within one call. Every edge, validation rule and complete receipt is preserved.
Verification tooling, with no new kappa. On nine alternating fresh-process pairs using CPython 3.12.15 on macOS arm64, median speedups are 1.22x for both existing 64-dimensional block-core checks, 1.39x for the five rank-product controls, and 1.35x for the complete Fano audit. The twelve varied rational-frame controls are about 2% slower, recorded in the same report. This is a workload-dependent improvement.
Validation compares complete receipts for 34 fixtures and the full Fano audit, eleven rejection controls, and a mutate/restore check that detects stale cross-call caching. All 53 existing relevant tests pass under each engine on Python 3.12.15 and 3.14.8, with the same full-receipt SHA256. The registered replay also passes under inherited
PYTHONOPTIMIZE=2; workers enable assertions explicitly, and a worker invoked with-Ofails. Exact elimination-miss counts remain unchanged in every paired benchmark. No full selected-supplier replay or Linux run is claimed.Expected:
PASS_FINITE_BIT_TRANSITION_CACHE, followed by registered-package success. Add--pairs 9to a direct invocation of the package'sverify.pyto reproduce the benchmark. Timings are reported, never used as a mathematical acceptance threshold.Research base:
680967accfd4311f3241dc154e1f434869747b43. Final upstream refresh:ddb4371c16a5a5de9e363afa8c0d6d7c27429e3c; all 57 live inputs are unchanged.SOURCES.jsoncontains the exact Git blob and SHA256 pins, with two additional provenance files. The original checker, historical certificates, selected frontier andupstream/remain unchanged. Future adoption requires maintainer review and an explicit source-pin migration.OS assignment seed 87, verification engineering. Fresh overlap checks covered open PR bodies and the discussion board; #808 concerns routing-state encoding, #1234 rational-span normalization, and #1459/#1461 containment. This adds a different optimization to the finite-bit edge scorer. No matching active claim was found, and no pinned coordination issue exists, so the claim is local.
Credit: Douglas R. Colkitt's retained finite-bit checker and Fano/rank-product/block-core research provide the exact checks and fixtures. Contribution by Sagar Thakrar, with substantial OpenAI Codex assistance in implementation, profiling, analysis, verification and writing. Apache-2.0. No independent human review or full multiplication theorem proof is claimed. The README names the inherited obligations and the concrete next review step.