Repository navigation
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.
Every exact five-call binary scalar-idempotent word with nonzero torsion-free abelian frames, relation rank at most two, and a whole diagonal monomial endpoint has at most two high registers, at every finite scalar width. High means neither identity nor a signed individual frame; repeated endpoints count separately. Arbitrary diagonal auxiliary outputs are included.
This combines Nick Petalas's retained image restriction in #2900 with Josie Elliston's stronger finite census in #6055. It removes the census's width cap; it does not claim a new width method, a census-free classification, or the six-call target floor already proved by JoyboyBrian in #5481. #6760's sharper paired-helper bound is credited as an alternative.
From the repository root:
Expected: PASS_REGISTERED_RESEARCH_PACKAGE; the long replay reports 11 rows, 65,677,982 diagonal words, max_high_registers=2, candidates=0 and not_replayed=0. The complete long replay ran successfully this session. Normal/optimized endpoint checks with four failure controls, source authentication, committed-byte/mode checks and an unchanged Git-free export also passed. Separate source-aware AI proof review is retained.
No new κ, native supplier, paid invoice or selected-frontier change. A census-free proof remains open; the five inherited framework assumptions are unchanged. One existing blank line in a frozen source is preserved byte-for-byte. No complete-history preflight or selected cold replay is claimed.
Prepared for Jerry Chen / @CubeJerry with substantial OpenAI Codex assistance. Source authors and notices are retained; no human or proof-kernel acceptance is claimed. Base 7c49fe3. Exact dependency pins: ORIGINS.json. Exact source pins, proof, receipts and review: research package. The published complete tree matches the tested tree.
Selected-baseline source bindings and metadata passed the required orientation check; this was not a construction cold replay.