Repository navigation
Conversation
…/final-frame-composition
…nditional kappa = 5.2805219274162e-5
|
Thank you @Th0rgal. This contribution is now recorded on main in the scoped reconciliation review and contributor credits. Contribution: Contiguous pair exchanges and minimum-cost circuits. Review and limits: Exact-head CI evidence; role increases and offsets are included in complete W, not silently canceled by heuristic scores. 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: |
Under the inherited analytic and fixed finite-alphabet multitape hypotheses,
This is a +0.026060% improvement over #98 ($+13,757,650,460$ grid steps over #98, $+14,123,369,682$ over #95, and $+15,602,338,941$ over #91) on the aligned-composition track, with bit saving
52808007812753/1000000000000000000.Current comparison: #97 ($\kappa$ values on the deferred-endpoint / signed-complex track. This PR is a cumulative refinement on the aligned-composition fixed-exterior track (#91 $\to$ #93 $\to$ #94 $\to$ #95 $\to$ #98), not a global record claim.
6.3965813e-5) and #99 (6.3978725e-5) report higher conditionalTwo certified stages (
research/contiguous-pair-exchange/)Stage A — Contiguous-pair coordinate pricing with the pristine unchanged Aligned frame composition: κ=5.2789616935221e-5 with Lean arithmetic certificate #91 engine ($\kappa = \frac{26400279929441}{500000000000000000} = 5.2800559858882\times 10^{-5}$ ):
22at24at4, splitting the chain of consecutive coordinate pairs, and coordinates(17,18)at(23,22), splitting both(16,17)and(18,19).4([6, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 17, 19, 20, 21, 22, 1, 2, 4, 3, 0]at[4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 1, 0, 2, 3, 23]for oracle pricing and[5, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 1, 0, 2, 3, 23]for final relabeling atORACLE_COORDINATESto the unmodifiedscripts/experiments/aligned_composition_engine.pyreclaims an additional role atStage B — Two-round carry exchange and min-cost circuit reclamation ($\kappa = \frac{26402609637081}{500000000000000000} = 5.2805219274162\times 10^{-5}$ ):
outer_exchange_rounds = 2) so 3-cycle updates in round 1 unlock further 1-for-1 and 2-for-2 exchanges in round 2.(profile_cost(s, g), order[s])and includes all zero-sumEvery exterior, center-copy charge, side-growth contribution, and early/late restoration gate remains paid in full; the finite bridge formula and complex layer are unchanged.
Verification
scripts/experiments/aligned_composition_engine.py) and Stage B compilation (research/contiguous-pair-exchange/engine.py), matching all committed words byte-for-byte, plus dense scalar support audit (scalar-23.json,scalar-25.json).crt_disagreements == 0) for all four Stage A and Stage B words.test_controls.py), including exact equivalence betweenprofile_oracle_cached.cppand the reference oracle, and 2,789 pinned source files (SOURCE.json).No search optimality, new Lean theorem, unconditional bound, or practical runtime speedup is claimed. All inherited all-size and analytic hypotheses remain assumptions.
Credit Chafik Boukhalfa (#91), Rohan Arun (#93/#95/#98), Maxime Fleury with Codebuff assistance (#94), Alejandro Zarzuelo Urdiales, Thomas DiFiore, Dominik Scholz, eumemic, Avi Eisenberg, Rohan Garg, icekylinx, James Chang, Zhihao Chen, Aurel Prosz/Paureel, Swapnil Jain, RaD/hipotures, Douglas Colkitt, OpenAI, and all predecessors. Original code and notices are preserved.
Prepared by Thomas Marchand with Google Antigravity assistance.