Repository navigation
Research audit: PR468 modular rank and parity arithmetic - #700
Merged
Mister-Meeseeks merged 1 commit intoOct 14, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
Contributor
|
100-PR batch review at Merged to Reviewed scope: Independent modular/rational three-register rank census; sampled wider controls are distinguished from exhaustive small-domain coverage. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
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.
PR468's nine-call lower bound depends on using F101 as an exact representation of rational relation arithmetic. This standalone audit tests that obligation directly against an independent integer-determinant oracle, including the distinction between rank preservation and primitive-row parity. No new κ or construction is claimed.
The source-pinned package adds a written argument, a reproducible exact certificate, and direct probes of the existing modular kernels. It checks 319,254 small cube matrices, 6,266,880 subset pairs and 49,152 target-span decisions. The wider fixtures are a documented deterministic sample, not an exhaustive search of width-eight matrices. Four deliberately damaged implementations must fail specific mathematical comparisons. Concrete small-prime and residue-parity examples explain the failure modes.
Reproduce from the repository root:
Expected:
PASS_PR468_MODULAR_ARITHMETIC_AUDIT.Base:
66849e1475c930fd7732b1a0067ffee7e1e95f60. PR468 dependency:07a78bf335b0b5039a1fecd7cd74a0fe1d1605ea; exact source hashes are included. Assignment seed: 66, adversarial mathematical audit.Validation passed with standard and optimized Python, C++ address/undefined-behavior sanitizers, and an isolated-directory replay. The selected-record check and PR468's small formal controls also pass. The complete scalar-order replay and expensive repository-wide suites were not rerun; only the new audit directory changes. This does not certify all symbolic reductions, search completeness, or integer multiplication.
Credit to Ali Romman's PR468 and its predecessors eumemic's PR288 and huxint's PR203. Prepared by David Govea with substantial OpenAI Codex assistance; Apache-2.0. The refreshed PR queue contained no overlapping modular-kernel audit; PR680 treats a different complex Clifford model. No pinned sprint issue existed, so coordination was recorded locally.