Repository navigation
Conversation
|
Thank you @chafreaky. This contribution is now recorded on main in the scoped reconciliation review and contributor credits. Contribution: Balanced row/column partitions and legal carry choices. Review and limits: Exact-head CI evidence; complete future unit basis required, gains are not simply added. 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: |
Change and mathematical scope
This composes PR #69’s balanced coarse sums and a bounded adaptation of PR #70’s carry exchanges with the anchored split frames from #71. The finite conditional witness gives κ = 25872812736433/500000000000000000 = 5.1745625472866e-5, a 0.6437453019850683% increase over the complete published #71 witness frozen at
1bef94fd40a746452548c84a4a8f8834670a3113, observed on 2026-10-08. This is a historical comparison; later community improvements are outside this package. The full old recursive child list is strictly excluded at the new bit saving51748303221339/10^18.The result remains conditional on the inherited ordered residual compiler, all-size recursion, routing, prime selection, recovery, finite scalar alphabet/tape, and analytic transfer interfaces. No global optimum, measured practical speedup or complete formal multiplication theorem is claimed. This separate package is stacked on #71 and preserves its exact published source and finite evidence at
1bef94fd40a746452548c84a4a8f8834670a3113.Construction
Keep the anchored
[1,1,2]split vector, h23cover-core/ h25reverse-nodeschedules, exact profile-cost reclamation and pending controls with both frame-containment checks. For h23, coarse cells use columns wheni+j<ng-1and rows otherwise; h25 uses rows throughout. Both axes choose independent unit-completion rows using fixed compatible future uses. The h25 carry exchange uses exact integer prices and a three-pass limit, accepting 1,000 legal exchanges.All physical XORs, frame raises, copies and cleanup are charged. Crossing below 2^27 requires recomputing the bridge: wire bits 27, row coefficient 843, degree 2000, degree gap 7007/25, and suffix slope 8000. The data geometry and complex branch remain inherited. Existing numerical witnesses are unchanged; integration updates only three old root-file source pins and their dependent digest fields.
Attribution
All earlier contributor, OpenAI, manuscript, license and AI-assistance notices remain attached. Original #69/#70 sources and the complete published #71 comparison closure are preserved in separate hash-checked archives.
Validation
The 245-file source/finite-input freeze is
68a96f879c1501b62da0366ea1003ccf4d4468a2240a70cf020cc9fff9d38471. Both portable engines differ from the audited discovery source only in the repository-relative ROOT constant. Both selected literal words regenerate byte-for-byte.Independent portable-package review cleared construction
9a58e62cf9e8954a4dde3c9b1372d733c276a6d1: all 245 working and committed pins match, all 112 archived PR71 files match the published construction, engine relocation is ROOT-only, selected words and complete arithmetic match the independently audited winner, and prior numerical witnesses remain unchanged.The complete expanded repository verification passed in one clean construction run: 12 verification groups, 563 tests in 82 isolated modules, and 20 patch checks (1,763.015 seconds). All 39 construction CI checks passed. Receipt-only commit
79dd6e1records these results without changing the source freeze or numerical witness. All 39 final-head CI checks passed at79dd6e134855bc8a7b8950c3aa0eb279fe148ceb; the PR is ready for review and mergeable. The newbalancedCI group retains every inherited group and formal package while keeping compiler regeneration within the existing per-job time limits.See
research/balanced-split/PROOF.mdfor the algebra and exact scope,SOURCE.jsonfor immutable inputs, andcertificates/balanced-split-validation.jsonfor focused receipts. Arithmetic cutoffs are not full operational thresholds; inherited Lean checks do not formalize the complete multiplication theorem.