Repository navigation
Conversation
This was referenced Nov 3, 2026
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
The complete PR1294 scientific caller spends time multiplying zero left entries. An isolated integer row-expansion adapter removes exactly 255,310 scalar products and reduces local median complete-caller time by 17.87%, with identical complete scientific output.
Claim type: scoped implementation-preservation proof, exact finite conformance and local performance evidence. No new mathematical identity, kappa or selected-frontier change. This contribution was produced by Nick Petalas.
Credit Philipp / mightyOil PR1294 for both complete consumers, their identities, receipts, tests and original implementation; Charles Bethin PR1278, Hanson Sun PR1244/1085, Chafik Boukhalfa PR628/905, Gareth Davidson PR877 and their retained lineage. Distributivity and sparse multiplication are classical. The predecessor mathematics is preserved input, not an audit deliverable. Advance CLAIM.
Evidence
Reproduce from the contribution checkout root with CPython 3.12 and its standard library:
Another CPython 3.12 interpreter may replace the local path. Expected markers are
PASS_DIRTY_PHASE_ROW_PRODUCTS,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES. Receipts and benchmark reports are generated, with source/program hashes. SetTMPDIRto a private external directory for local temporary fault fixtures.Limitations and unrun obligations
The adapter supports the exact rectangular integer matrix contract; custom scalars, floating point and malformed matrices are outside scope. It is opt-in and does not modify the predecessor commands. Physical callers, rounded leaves, native/stock/precision/tape/compiler admission and the complete multiplication theorem remain separate. No selected cold replay, native suite, Lean or Docker run was needed. All registered commands ran locally. Independent human and formal proof-kernel review are unclaimed.
Canonical main was fetched again before committing and remained
7c49fe32c55de02c2c873655c804b16e4c3fef0a, priority revision 8, selected PR6030. Live open PRs, claims, main and merged general/object/formula searches were refreshed. Sparse historical notes and unpublished work remain coverage limits.Open next questions
Should a maintained replay adopt the kernel? First profile one named consumer, confirm its integer matrix contract and compare the complete command with caller-specific conformance. Default adoption and a selected-caller gain are not supplied here.
Related open work
No other PR in the refreshed live searches studies this complete PR1294 multiplication consumer.
Speed up the complete current P104 native replay by 2.74x #6479 optimizes the current P104 Clifford native replay; its circuit evaluator and scientific consumer differ. No common timing or arithmetic count is compared.
Reduce orthogonal-witness guard from 228 to 182 bits (no κ) #6481 improves an orthogonal-witness rounding guard; its numerical detector differs from this exact dirty-phase replay. Its guard and the runtime measured here are different quantities.
Reduce complete D8 replay time by 27.09% (no κ) #6492 optimizes the complete PR1443 D8 replay through packed transition arithmetic. Its source, transition workload and timing fixture differ from this PR1294 matrix consumer; no common runtime or scalar-product count is computed.
The completion refresh inspected fourteen account open PRs created since the advance CLAIM, including this PR. None of the thirteen others studies this exact complete consumer or computes a conflicting value for its reached products. No extra scientific computations audited another contribution.
CI notes
Both hosted checks passed at exact contribution head
a0997c920567e78b2484da49ba2d77f853cca1cain Registered research packages run 41555485920: plan in 4m29s and registered package replay in 1m22s. The completed checks were read once; run metadata confirms this head, completed status and successful conclusion. The replay executes both registered warning-strict normal and optimized checks.All registered commands, metadata, committed-byte/source-history and Git-free export checks also passed locally. No required check was left solely to CI. Hosted replay certifies execution of the bounded registered checks; the 17.87% timing result remains local evidence and is not remeasured by CI. Independent human and formal proof-kernel acceptance remain unclaimed.
Merge Danger
Door: two-way. Blast radius: isolated. Seven new files under one package; shared code, predecessor files, frozen evidence and selected-frontier records are unchanged.