Repository navigation
Reduce complete precision qualification time by 19% with C bookkeeping - #5864
Conversation
(cherry picked from commit ba8a9e6)
|
FINDING / DONE / RELEASED — measured native bookkeeping passes the complete 15% wall AND CPU gate; PR #5864 is open. Kappa research remains paused.
|
|
Exact-head CI is now green at This completes the pending CI item in the seven-field handoff. Hosted coverage is finite/native/source verification; the 19.12% wall / 18.82% CPU complete saving is supported separately by the retained local cold-process BCCBBC experiment, full normal/O and Git-free readonly replay. PR remains open and unmerged. No kappa or selected-frontier change. |
|
FINDING / DONE / RELEASED — scoped stop after the additional native score-dispatch screen. PR #5864's validated 19.12% wall / 18.82% CPU saving remains unchanged; no additional complete gain is claimed.
|
Change and mathematical scope
The complete frozen PR #5848 qualifier spends substantial time in Fraction contribution bookkeeping. This opt-in package combines the exact bounded table and source-bound entry/compact/slot keys with a small C cache and coefficient-loop helper. It retains original Python Fraction arithmetic on every miss and ordered Python score additions, plus all independent integer, reverse, observation, witness, hash and source checks.
Across six fresh serial B,C,C,B,B,C processes on Linux, each candidate paying its new checks and a cold compile/link/load:
This is a source-pinned local tooling result, not a universal speedup, hosted performance certification, mathematical construction or kappa claim. Both 15% gates passed before expansion. Mutable answers never cross traces or backends; only loaded immutable code is shared within a fresh process. No compiled binary or dependency installation is included. Kappa research remains paused.
Task and overlap
Task
replay-runtime, refined scopePR5848/frozen66fb6c6/native-cache-complete-qualification. Canonical main isde5ec2e7a6074068452f45b1a191b5c72832df4a, priority 8; frozen PR5848 is66fb6c6b8683b37967e9d7f313b3df99a49d2406. Own input ancestor is2ebc3a071c62fc839aaed1291220d78a317395d4.This builds on PR #5852, PR #5853 and the entry-domain finding, whose earlier complete-cost screens stayed below 15%. The native loop changes a measured cost after finite feasibility and one complete actual audit. The direct-add, compact/slot-only and cache-only C negative results remain in the evidence. Recent targeted PR/comment searches found no matching active native implementation within bounded coverage; unpublished overlap is not excluded. Canonical progress claim.
The branch also retains Ali Romman’s exact test-only PR #5761 repair, cherry-picked as
01014cbe772ea5a59ccbc55266222433944c7368fromba8a9e640e1983f3c29993fefa3f46e8ed03313a; it is an inherited dependency, not new work here.Validation
The package retains 964 complete finite comparisons, 73 inherited +45 native controls, and all four unchanged custody controls. Complete qualification covers 25,984 events / 799 coordinates, all 120 independent finite fixtures, six source controls, signed witnesses and the full scientific receipt. Full optimized qualification also passes. The Git-free read-only export replays the full command in 33.03 seconds, with all 159 exported files unchanged.
Registered verification runs finite/native/source checks in about three seconds; full replay is separately opt-in. Linux CPython 3.12, an existing
ccand Python development headers are required. No silent native skips. The complete benchmark includes cold compilation and compiler-child CPU; innerqualify.secondsalone is not the complete bill.Meaningful controls include full-key/hash collisions, FIFO wrap, callback exceptions and re-entry, source/getter/callback drift, malformed packets, metadata ownership and cyclic GC. Two diagnosed harness failures and their corrections are retained: an explicit-cleanup warning and an inert forced-GC constructor fixture. The latter did not demonstrate the intended interleaving; no such empirical claim is made. No automatic retries or discarded timing samples. Same 180-second command / 1 GiB sampled group RSS / 600-second initial and 1,500-second shared budget; one serial numerical runner.
Metadata/source pins, all committed bytes/modes and complete export/input coverage pass. Full-history preflight is unavailable in this shallow checkout. Hosted CI status is separate and will be reported at the exact head; no hosted performance replay is claimed. Independent human or proof-kernel acceptance remains open.
Proof, code, complete timing receipts and raw evidence.
Credit
Original arithmetic and independent integer backend: Ali Romman, retaining Adam Gall, ywz65/PR #2878, Mason Hale/PR #5811, PR #5831, PR #5826, PR #5819 and all nested P104/native/compiler/precision notices. Tooling lineage includes PR #5839, PR #5816, PR #5818, PR #5832, PR5848/5852/5853 and the exact PR5761 repair.
New implementation and execution: Chris R / Clear1nsight with substantial OpenAI Codex assistance. GPT-6-astra xhigh performed static C API/source review only, with zero compiler or numerical runs. Memoization, loop invariants and C API techniques are standard. Apache-2.0; original archives and notices are retained.
Open next questions
Can one further source-bound reduction in the remaining bookkeeping pay its additional validation bill? Refresh overlap and census the new candidate, then nominate one small feasibility test before further construction. Keep this measured contribution frozen during publication; a new rational-arithmetic port requires a separate, broader proof and cost bill. See the package’s open questions.