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 submits a constructive proof for the complete 480-factor mixed-rank multiplier. For every pair of n-bit binary integers, the specified deterministic fixed multitape machine returns their exact product in O(n(log n)^(1−κ)) time and O(n) maximum visited tape space, with κ = 0.00387992803556. The exponent is the one already priced in PR #7830. The result submitted here is the removal of the five research premises for that price. The complete proof includes written mathematics and partial Lean verification. Theorem and scope · Obligation ledger · Original conditional receipt
The binary word has 36 native calls and the complex word has 48. The ordinary supplier reaches 0.003879928035646. The separately accounted CRT conversions still give saving 0.003879928035626 before logarithmic factors. All grouped Hadamards operate on the complete dyadic field. A discarded face and its retained core use the same normalization. The final decoder carries both source-length factors and both input digit scales. Formal physical-coordinate decoder · Kernel-checked cost inequalities
We built the Lean modules and replayed their compiled declarations through the kernel. Their printed axiom sets are subsets of
propext,Classical.choiceandQuot.sound. The finite compiler's real majorant, the transcendental Gaussian estimates and the tape running-time proof include written steps. The short-word multiplier of Harvey and van der Hoeven and Trudgian's explicit prime estimate are independent published theorems. The submitted all-size result awaits independent scientific review. It gives no practical cutoff. Formal boundaries and replay instructions · EvidenceWith CPython 3.12, from the repository root, run
The small integration test and package runner finish with
The full pinned source replay authenticates 148 bindings and reproduces the original application and independent audit bytes. The small product uses a 5×7 source and 8×8 target. The integer interval generator produced every diagnostic Gaussian page. Checks also cover all rows of two fine-prime maps. The all-size supplier proof uses the pinned finite words. A complete execution at the astronomical first carrier remains untested. Source replay · Product probe
The repository navigation test
CurrentCiNavigationTests.test_current_ci_section_matches_selected_recordfailed on the unchanged canonical files. The selected receipt requiresmake frontier7000-verify, while the CI guide names the earlier selected family. GitHub's onboarding job reported this single failure in 760 tests and skipped the hosted package replay. All six package checks passed on a read-only export of this commit with Git and network dependencies excluded from the replay. The separate Lean build and kernel replay passed. Hosted job · Navigation test · CI guide at the baseThe base is
e54523517d0f03e58352e647c403a5af3e525a57, the mixed price is pinned at87fbf4f7b35b0f18ab12b5767775a9a424cf0b15and the raw all-column predecessor ata7f99a5f5f919dd3ffb2987f90c1e7d6527feb1e. @Clear1nsight supplied the mixed rule and its application. The native transfer uses the exact source work in PR #7837. The grade-14 precursor is PR #7835, submitted by @rohanarun. Its source credit identifies the contributor. Cinna Davis supplied the earlier balanced CRT and outer proof. The Gaussian, compiler and ordinary-bridge predecessors retain their source credit. @aliromman prepared the integration with substantial OpenAI Codex assistance. Source notice · Attribution and contributing work · Coordination and review request