Repository navigation
Compress final #4610 scalar word by 151 ADDs per orientation - #5350
Mister-Meeseeks merged 1 commit into
Conversation
Preserve the complete paid profile and credit the retained compressor. Include exact replay and bounded negative search records. Prepared with substantial OpenAI Codex assistance.
|
Independent review (James Reed, with Claude Code). Head Verdict: the rewrite identities are sound, and the exact replay passes. There is one packaging gap: the result isn't registered, so hosted CI never replayed it. Rewrite identities (
|
Reviewer feedback on PR CrocSwap#5350 (jwr404): - Add VERIFY.json (status ready, verify.py command, SOURCES inputs) so scripts/check_research_commit.py passes and hosted CI replays the package. - README: allowance accounting. Per direction the rewrite deletes 205 ADD events (allowance 1,812) and inserts 54 (allowance 596); net -151 events, net saving 1,216. The flat-8 estimate (1,208) misses the coefficient-size difference of +8. - README: state both exact interpreters are retained predecessor implementations. No code or result change. verify.py replay still passes deterministically.
Change and mathematical scope
Apply Cinna Davis's #4692 scalar compressor to Cao Yifan's final #4610 word, excluding the helper-628 triangle that worsens the recursive invoice. This removes 151 scalar ADD macros per orientation and reduces the conservative real scalar allowance by 1,216 per native call: forward 158120 → 156904, backward 158168 → 156952.
Every chronological per-owner Fourier climb, all 408 independent helper boundaries, main boundaries, native maps, phases and owned operations are preserved. The complete paid profile remains
{1:2201,2:412,3:510,4:127,5:40,8:8}, so κ is unchanged. This is an exact scalar construction, not a measured runtime speedup, full multiplication theorem or selected-result update.Two bounded numerical frame/helper/native-map searches found no paid improvement. These floating MILP results are not exact ceilings or universal obstructions.
Task and overlap
ff3cc58e370d0f678e529246f8c73e8094e18fcf, rechecked before submission.final-pr4610/broader-scalar-compression/paid-profile-preservation. The target was a paid-moment gain. The achieved result is a scalar reduction with the same invoice. Scope and stopped routes are inTASK.json.SOURCES.json. The canonical native-word payload iscfcd36b40326d7a5815e1db5313444379b3fb756b27d5201c561574c085cc0dd.Validation
CPython 3.12.14, Linux x86-64. Standard library only for the positive result:
Passed: both retained exact interpreters on all 632 arbitrary-input columns in both directions, owned-center cleanup, identical chronological transports and paid profile, prefix bounds below the retained 2^192 envelope, corrupt-sign rejection, source hashes and deterministic receipt comparison. The default verifier is read-only.
Optional discovery used SciPy 1.17.0 / NumPy 2.3.5. Commands and both frozen search receipts are included. No new complete controller/compiler/BIT/outer-ledger replay or all-size supplier admission is claimed.
Credit
Prepared with substantial OpenAI Codex assistance. Author-checked, not yet independently reviewed.
Credit Cao Yifan / @intqwq, Cinna Davis / @1337isnot1337 (also the #4470 work), and @Chrisbryan17. Credit also @flyingviper, @Dugongue, @zxv, and Jacob Alan Sussman / @jacobalansussman and all retained native, Clifford, compiler and analytic sources. Source notices and Apache-2.0 licensing are preserved.
Open next questions
The README identifies a concrete next step: legally replace one chronological owner dependency while preserving arbitrary-input action, then check whether a #5179 forcing path disappears. Repeated optimization of the unchanged model is not justified by these negative results.