Repository navigation
Conversation
|
Thank you @rohanarun. This contribution is now recorded on main in the scoped reconciliation review and contributor credits. Contribution: Compose before compiling and use coordinate cost oracles. Review and limits: Exact-head CI evidence; oracle scores remain candidate-selection heuristics. The complete original source, proof/research notes, notices and relevant replay/CI evidence are retained through the pinned source archive. The review distinguishes fresh runs, exact-head historical CI and prior integration evidence. Closing this historical PR as reconciled; its obsolete headline does not replace the current selected bound, and draft/retracted claims retain their explicit qualifications. Reviewed head: |
Conditional improvement
0.49049670% above PR #80, under the inherited all-size and analytic hypotheses. Bit saving:
13008876609597/250000000000000000.Full verification passed:
make -j1 verify, inherited combined checks, fresh byte-for-byte producer regeneration, complete physical/exact checks and seven new controls completed successfully. The run covered 82 isolated test modules and took 44m50s. All 45 GitHub checks passed on the tested research head; the follow-up commit only records validation and updates README status. This is not an unconditional multiplication theorem or a global optimum.Change
PR #80 selected already-compiled axes. Here we compose the methods before compilation on both axes:
At h25 we also price candidate compiler choices using the final permuted coordinates. This changes heuristic choices among legal operations, while preserving all independence and frame-containment checks. Its engine differs from #79’s only in the oracle frame writer and attribution comment; the portable compiler asserts this exact relationship.
All copied centers, endpoints, data growth, cleanup and complex costs remain charged. We derive the width bridge from the actual W. Complete #76/#79/#80 recursive profiles are each excluded at the new bit saving using their own widths.
Validation and reproduction
Passed: full input and arbitrary-dirty-basis replay in both orientations; literal frame transitions; exact bounded-minor/CRT profiles with zero disagreements; complete paid profile/rank reconstruction; independent rational moment bounds; all 47 inequalities and seven margins; adjacent bit/κ grid rejection; six physical/coordinate failure controls and three stale bridge controls. Every source pin was additionally checked against committed Git bytes.
The new portable compiler regenerates original words, then the verifier checks coordinate relabeling byte-for-byte. Dedicated CI runs this regeneration and the controls on Python 3.11/3.13/3.14, preserving every inherited workflow.
python3 research/envelope-balanced/verify.py --regenerate (cd research/envelope-balanced && python3 -m unittest test_controls -v) make verifySee
research/envelope-balanced/README.mdfor the general compatibility argument and conditional scope,certificate.jsonfor exact arithmetic, andSOURCE.jsonfor immutable inputs. The completed full rerun is recorded inresearch/envelope-balanced/validation.json.Credit
Thomas DiFiore (#74), Dominik Scholz (#76), Chafik Boukhalfa (#79/#71), eumemic (#69/#57), Alejandro Zarzuelo Urdiales (#70), Rohan Arun (#78/#80/#65/#67), Rohan Garg, Avi Eisenberg and every inherited contributor retain credit. Tested #75 zero-circuit variants were not selected. Original licenses, author and AI disclosures, OpenAI and Harvey–van der Hoeven notices remain intact. This composition and coordinate-aware pricing were prepared by Rohan Arun with OpenAI Codex assistance.