Repository navigation
Conversation
Project the formal one-output span onto a stabilizer coset to isolate distinct-frame contamination and derive the same-frame binomial test at every address width.
This was referenced Nov 18, 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
Scoped written proof, produced by Nick Petalas. In the formal frame game at any address width m ≥ 3, take a kind A shared-middle part with nonzero rational coefficient c and a final call that raises its plain term to level three. Assume the extra term is outside the raw frame. With free preparation and addition of earlier outputs, the call finishes the part exactly when both terms have the same frame and
(-c)^ord(γ) ≠ 1, where γ is the free element defining the extra term.The proof projects the output span onto one coset of the raw-frame stabilizer. Distinct frames leave a forced pair of coefficients. On a common frame the surviving columns give a cyclic binomial inversion test. This supplies the all-width proof left open by jacobalansussman's finite result. Source question and finite evidence in #7629 · Advance claim.
Evidence and reproduction
CPython 3.12.15 on arm64 macOS. The direct verifier and the registered replay passed with
PASS_KIND_A_LAST_CALL_COSET cases=8 post_call_control=1. The eight exact cases use five and six address bits. A separate free post-call control changes one excluded result to an attainable one. Committed bytes and source history passed.Run from the repository root. Any CPython 3.12 executable can replace the local path.
Limits
The result concerns one part and one last-call output. Joint output decoding, a free operation on the last-call output, removability, and Pauli phases lie outside the theorem. The package does not run a native caller or a formal proof kernel. It supplies no supplier admission or κ claim. The mathematical contribution is confined to one research package.
Open next questions
Related open work
CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
All three hosted checks passed at
f642d2740265a61f8ac64b3a087f0118382c56e3:planand the registered replays ofresearch/historical-selected-replay-gapandresearch/kind-a-last-call-coset. GitHub Actions run. All six current-status tests and the historical replay-gap package passed locally. The kind A package and committed-byte/source-history checks also passed at this head.On the original base,
test_current_ci_section_matches_selected_recordexpectedmake frontier7000-verifywhile the current CI guide named #6030. The historical verifier now replays against its recorded source instead of the live Makefile. Earlier planning log with the #6030 mismatch.