Repository navigation
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This proof removes
native_all_columnsfrom the complete grade-14 multiplication claim. For arbitrary binary operands of at most n bits, the fixed-tape time remains O(n (log n)^(1−κ)) at κ = 0.00387992802601. The original application needed five premises. This construction needs four. The limiting outer cost remains the main transform. Operator proof · Physical routes and leaves · Complete application · Exact receiptsThe eliminated premise required the actual operators, all phases, spectators and whole-job adapters to work at every positive column multiplicity. The native one-column replays and grade counts did not prove that implication. This proof starts at the two words consumed by PR #7835, follows arbitrary independent inputs through both recursive boundaries and supplies its imported ordinary interchange rate from elementary operations. Original five statements · Exact word, phase and price inputs
Remaining dependencies. The four original premises are
owned_erasurefor private streams and suspended owners,compilerfor finite chronological compilation and uniform closure,precision_tapefor the fixed-tape movement, storage and precision prescriptions, andanalytic_recoveryfor the outer decomposition, prime avoidance and exact recovery. They keep their original statements. The proof is specific to the grade-14 application and the words and weights it actually uses. The conservative constants are enormous. We did not materialize either full uniform template or execute an asymptotic-size integer product. Independent human and formal verification of the universal proof remain open. Qualification and comparison with higher advertised ratesVerification. CPython 3.12, standard library only. Run from the repository root.
The five scientific checks emit these markers.
We reproduced the three original grade-14 receipts byte for byte. The new registered replay and the read-only, Git-free export replay passed. The independent physical checks cover 1,930,240 monomial basis images, 95,420,416 Walsh phase values and all 108 split rank-one projectors over Z/9 at four widths. Replacing all binary port placements by identity changes 27,972 basis directions. Dropping the mixed-role inverse return changes all 7,776 positions in that control. These finite checks support the written arbitrary-width proof. Complex verification · Binary verification · Independent leaf check · Application verification · Replay manifest
GitHub's hosted onboarding test stopped the plan before package replay. The canonical CI guide still lists the historical 6030 replay where the selected record requires
make frontier7000-verify. The same test fails on the unmodified canonical base. All six files it reads are byte-identical between that base and this PR. Direct package selection on the exact change selects only this package. Both local five-command replays passed. Hosted failure · Canonical navigation test · Canonical CI guideBase and credit. The canonical base is
e54523517d0f03e58352e647c403a5af3e525a57. @rohanarun submitted the grade-14 cutoff at43007c979859fa84ccc3a3509ccacc9620d181fa, following @Dugongue's preceding cutoff. @Clear1nsight supplied the actual rational word at14c74c6a67108f675ac1196a5f2415ead0920e71and the binary word and expanded verifier at89a67c404226d51028e135de2b9169e9020d57af. @aliromman supplied the previous mixed caller at4f7c67ae387cc91580f469aeda4d508b372b9ec1. @CubeJerry and the credited predecessors supplied the selected circuit and Clifford engines. PR #7831 · PR #7830 · PR #7786 · PR #7776 · PR #7000Ross Richardson supplied the fallback implementation, Jose Manuel the recursive ordinary closure, and Nick Petalas the complete-cover counting argument. The operator proof uses the earlier monomial lowering, fresh-row and delayed allocation proofs, and the retained compact global router. Ali Romman prepared this proof, implementation and source-bound checks with substantial OpenAI Codex assistance, including separate adversarial reviews of the complex, binary and resource arguments. The source notices credit the rest of the physical, compiler and analytic lineage. Full credits · Canonical proof and code pins · Coordination and review request