Repository navigation
research: speed up the complete selected P104 replay by 2.73x - #5757
Conversation
|
CLAIM — independent Linux validation of PR5757 at 53006fe, against canonical main de5ec2e. I will preserve the complete selected RESULT/WORD, source syntax binding, absolute phase, cache controls and actual-state literal comparisons. Scope: Linux portability, complete-replay timings and qualification overhead, with serial bounded runs and explicit stop-on-drift/resource limits. No engine redesign, new construction, kappa gain or selected-frontier change. Intended result: one focused reproducible validation PR plus seven-field handoff. Target expiry 2026-10-27 02:30 UTC; I will update or release this claim. Credit Ali Romman and the retained P104/native/controller/compiler/stabilizer lineage. Prepared for Clear1nsight with OpenAI Codex assistance. |
|
DONE — independent Linux qualification is published in PR #5816, exact head Both normal and optimized full adapter checks and all-actual-state oracles pass, including every one of 17,651 distinct states against both original literal interpreters. Normal two-command qualification costs 402.88 seconds and the additional optimized qualification 404.05 seconds; these are separate from the speedup claim. Exact source bytes/modes and the original complete caller/invoice/compiler/outer checks are preserved. The package includes portable source retention, explicit resource limits, raw evidence and 17 recorded-evidence plus three actual source-entry rejection controls. Canonical seven-field handoff. One Linux host and small descriptive timing samples; no new kappa, successor transfer, independent human or proof-kernel acceptance. Hosted CI is separate. Credit Ali Romman and the full retained predecessor lineage. Linux scope released; the kappa campaign remains paused. |
|
DONE — the bounded single-pass qualification scope is published in PR #5818, exact head |
The complete selected P104 replay spends most of its time in literal Gaussian state evaluation. This opt-in package uses the archived exact quadratic-state engine at the two state interfaces and keeps every original scalar, native, physical-caller, invoice, compiler and outer check. On this macOS arm64 host, three alternating fresh runs per engine reduce the median from 269.00s to 98.37s (2.73×). Every full scientific stdout hash agrees. The ranges are 264.33–305.90s and 80.89–175.99s; this is a local verification speedup, not a physical multiplier speedup.
-I -O -B, empty PATH, no Git and read-only files. All exported bytes and modes stay unchanged. The normal author-side full replay, independent cross-check and six-process benchmark also pass.Package, proof, measurements, independent trace, validation, canonical investigation.
Reproduce:
python3.12 -B scripts/research_package.py --package research/selected-quadratic-replay. The two registered checks run serially and include extra literal audit work; no 2.73× speedup is claimed for that larger audit. The benchmark measures the unchanged complete selected scientific checks and is a separate six-process command in the README.This preserves the conditional κ = .00310045 and its five assumptions. It does not change the selected record or official reproduction command. Linux timing, independent human review and proof-kernel acceptance are unrun. The checkout is shallow, so the optional full-history ancestry preflight is unavailable; all 31 source bytes and blobs, committed export and Git-free replay are checked.
Base 553d26d; frozen priority-7 card, refreshed against priority 8 before submission. Credit the exact PR5704 engine, selected PR5599 construction and all retained native/controller/compiler and classical stabilizer sources in NOTICE. The new work is the integration, controls, full-input comparison and measurements. Ali Romman with substantial OpenAI Codex assistance; no subagents. Apache-2.0. Archive publication is not independent mathematical approval.