Repository navigation
Certify PR288's restricted sign-gauge obstruction with four constraints (no new κ) - #349
Draft
erebos-labs wants to merge 2 commits into
Draft
erebos-labs wants to merge 2 commits into
erebos-labs wants to merge 2 commits into
Conversation
Point the checker documentation to the supplied PROOF.md file. The certificate checker behavior is unchanged. Publish-Source: bc9a985a0da22ec02cd5273b3749a36117bbbfa8
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.
Change and mathematical scope
PR288 §1.4(d) already reports the restricted sign-gauge obstruction for the Braverman–He PG(2,9) instance. This contribution supplies an explicit four-constraint witness, three inspectable five-edge paths and a separate exact verifier. Two session signs are forced to be both equal and opposite. No new multiplication bound, κ, exponent or practical speedup is claimed.
The model has fixed additive 5×5 rational vertex matrices, rank-at-most-one physical edge differences and independently signed session targets equal to one common invertible matrix. The result does not cover nonadditive or varying frames, unrelated Levi targets, higher-rank edges or larger dimensions. The matrix-to-sign implication is an ordinary written proof, not a Lean proof, independent human peer review or verification of the full multiplication theorem. Unprovided SAT/MITM/Gröbner searches are outside this contribution.
The standalone package contains the normalized instance, certificate, proof, independent checker, deterministic producer and 24 corruption/positive-control tests. Its checker imports neither the producer nor upstream checker. A new Make target and split CI job check the package; existing algorithms and witnesses are unchanged. Scope: ten research files, five Makefile lines and nineteen workflow lines.
Sources are pinned to upstream main
12a4934d15006e8c10f9b2264f13f8f341be802band PR288's head475a088b5862f75f0b10596cfd6842d19531a5ecin eumemic/integer-mult-bounds. The original checker already excludes R's trailing paper-page-number 13. The normalized 175 R, 182 π, nine C and nine J entries matched the primary paper and pinned companion data in the preparation audit. Immutable references and input hashes are inSOURCES.md.Validation
Local environment: macOS arm64, CPython 3.14.7; isolated SymPy 1.14.0 environment for host gates. The new certificate package itself uses only the standard library.
make pr288-sign-cycle-verify: all five stages passed, including 24 tests normally, the same 24 under-O, byte-identical deterministic regeneration and verification of the regenerated certificate. The preparation audit also passed isolated replay, independent positive/negative CLI controls and regeneration with three hash seeds.make gen4-bank-verify, invoked within their full runs: both completed all nine fresh stages, 112 immutable inputs and nine omitted-stage controls. Inputs remained unchanged and mathematical certificates were byte-identical. This preserves the host result; it is not a new result of this sign-cycle contribution.make verify: incomplete in both checkouts under separate 1,200-second wall limits. Baseline stopped inscripts/complex_network.py; candidate stopped inscripts/paired_network.py, both withinverify-certificates. Later groups are not cleared. No mathematical check failure was observed before termination. A redundant standalone gen4 repeat was stopped after 213 seconds; its second repeat was not started. The gen4 successes above refer to the completed embedded runs.make joint-dual-verify: fails in pristine baseline and candidate, exit 2,AssertionError: Makefileatjoint_dual_compose.py:70, before mathematical replay. HistoricalSOURCE.jsonexpects Makefile SHA-256768131bd4ce18433f6abccdc9812a38c92e11220e3a1019c6d95334b42f529d1; pristine baseline iscd0fb59dc078d1fdf54a163ea13bb3660d03c8fe69c1a7f99fc8e5f476a3d5c2, candidate isbfe01daff2349b7260d6580ee2b1ce149fddf98ac1a59aca5bbca102299f0958.This is a draft for review, not a claim of merge readiness. Completing repository verification, reviewing the historical binding repair, running CI and reviewing the ordinary proof remain required before merging.
Braverman and He receive instance credit; eumemic/PR288 receives priority for the known obstruction and original checking work. The explicit witness and separate checking implementation are the addition. Apache-2.0 attribution and substantial OpenAI ChatGPT/Codex assistance are disclosed in
NOTICE; PR288's Anthropic assistance disclosure is retained. Companion source code and the full paper are not redistributed. No worldwide novelty or exclusive-ownership claim is made.