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.
Summary
Eliminate 15,400 exact zero scalar products from the complete fixed q-Toeplitz replay supplied by James Reed's PR3865. The new opt-in multiplier uses 6,650 products instead of 22,050 and preserves every one of 4,550 matrix entries across all 300 multiplications.
Claim type: finite certificate of an implementation improvement, supported by a direct exact-arithmetic equivalence argument. No new factorization theorem, supplier, physical speedup or kappa is claimed. All thirty matrices, five rational parameters, factor/Gaussian/inverse identities, width/norm tests and final receipt checks remain. The predecessor and its default command are unchanged.
The package is produced by Nick Petalas. Credit James Reed / jwr404 for the complete finite replay; Chafik Boukhalfa / PR489, Alexey Kuznetsov and Jose Manuel / PR3851 for the retained factorization and Gaussian context. Sparse multiplication is classical. The new contribution is the fixed replay's exact arithmetic reduction, implementation and evidence.
Evidence
At head
dbdf3f7db12de975e76aa4677aa5053ae9153ab4, warning-strict CPython 3.12.15, macOS arm64:From the worktree root, exact reproduction commands:
Any installed CPython 3.12 may replace the interpreter path. Set
TMPDIRto a scratch directory to direct temporary control copies there. The standalone verifier emits a generated hash-bound receipt and leaves no outputs in the checkout. Optional fresh-process timings, using a fresh output path outside the checkout:Expected markers are
PASS_Q_TOEPLITZ_ZERO_PRODUCTS,PASS_Q_TOEPLITZ_FACTORIZATION,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES.Limitations and unrun obligations
This covers the fixed PR3865 exact rational suite at orders one through six. Its mathematical factorization is cited prior work, not a new audit deliverable. No larger matrix domain, production Gaussian core, native multiplier, physical speedup, selected cold replay, Lean, Docker, independent human review or proof-kernel review is claimed. The five selected framework assumptions remain and the selected frontier is unchanged. No package correctness or registered check remains unrun locally.
Scientific base: canonical main
7c49fe32c55de02c2c873655c804b16e4c3fef0a, priority revision 8, selected PR6030. Thereplay-runtimecard is refined to this fixed complete command. Live handoffs/open PRs, recent account work, local reservations, main and merged q-Toeplitz/formula searches were checked at selection and submission. The complete overlap snapshot covered 555 open PRs, 6,596 Discussion records and 8,917 main note records; arbitrary code diffs and unpublished work remain limits. Advance CLAIM.Related open work
PR6570 removes exact zero products from binary incidence/kernel dot products in the separate
frame-kernel-sparse-productscomplete replay. This PR applies the same classical sparsity principle to rational matrix multiplication in PR3865's q-Toeplitz replay. The workloads differ, so their counts and timings do not estimate the same quantity.The completion refresh screened this account's open PRs created since the advance CLAIM, including eleven other contributions. None computes the same fixed q-Toeplitz replay quantity. No cross-workload numerical comparison or additional predecessor computation was performed. PR3865 is the merged predecessor, credited above.
Open next questions
Does exact zero-product omission improve a larger currently used rational replay with comparably sparse factors? First profile one different complete command and enumerate its zero operands. A larger workload and its complete equivalence contract remain to be established. No follow-up is reserved.
CI notes
Both hosted checks,
planandreplay (research/q-toeplitz-zero-products), passed at headdbdf3f7db12de975e76aa4677aa5053ae9153ab4in run 41633790574. The completed checks were read once withgh pr checks 6606 --repo CrocSwap/integer-mult-bounds.All four registered commands and the standalone verifier passed locally. Hosted replay certifies execution of the registered normal/optimized implementation-conformance checks. The local timing percentage, predecessor factorization theorem and complete multiplication theorem are not independently certified by these CI jobs. No check failed. Timing remains descriptive and is not a CI acceptance threshold.
Merge Danger
Two-way door. Blast radius: isolated. Only a new opt-in research package is added; existing source files, certificates and default commands are unchanged.