Repository navigation
Attain the static connector rank bound and audit its obstruction - #5681
Merged
Mister-Meeseeks merged 4 commits intoOct 26, 2026
Merged
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.
This construction and separate proof audit shows that the connector rank/signature cut is sharp, even for square-zero thin queries. Over every finite field of characteristic two, the construction has
g=2q^(dh)-1leaves, total thin rank2d+2h, and at most two leaves per row or column signature. Complete kappa is unchanged.Proof, exact evidence, source pins, validation.
The construction supplies explicit static maps for both targets in PR #5673: 31 leaves with five rank-two queries, and 127 leaves with ten rank-one queries. Every map has square zero and their sum is the required K. These maps are not chronological words. They show that another exclusion of these targets must use an additional condition, such as chronology or the full endpoint.
A separate implementation and written audit confirm the source's mixed-coefficient restriction and prefix determinant proof under its full-stage contract. The checker imports no source code or finite certificate. It checks 19,440 ordered flag words, 72 literal words with noncommuting flags and external stages, 432 extracted blocks, formal polynomial determinants, and six complete static matrix fixtures including F4. Twelve damaged constructions are rejected.
Expected:
PASS_ONE_SIDED_AUDIT_AND_STATIC_SHARPNESSandPASS_REGISTERED_RESEARCH_PACKAGE. Python3.12 and the standard library suffice. Normal and optimized registered runs, committed-byte and archive checks, read-only Git-free optimized replay with empty PATH, and actual retained-source corruption rejection pass. No complete caller, native lift, physical invoice, new tariff, proof-assistant or independent human acceptance follows. Hosted CI is pending at publication. Full-history preflight was not run in the shallow checkout; immediate source ancestry and bytes were checked.Base and refreshed main:
df0137efd35e11b4445734bf612bdd4c7ebc330c, priority7, selected conditional kappa.00310045. Contribution head:67f07448eec5ad8d84bdf96b46981ac0b893592f. The retained source proof is unchanged. It supplies the obstruction, lower bounds, targets and retained credit to Cinna Davis and the P104/helper/compiler line. The static sharpness construction and separate implementation are new here. This is a separate audit by the same assistant family, not independent human review.Prepared by Ali Romman with substantial OpenAI Codex assistance; no subagents. Apache-2.0. Scoped claim.