Repository navigation
Conversation
Derive the invariant agreement set across binary radices and window widths by tracking the temporary and source carries. Extend the five-translation minimum to the stated packing range.
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 algebraic proof with finite corroboration. For the two-target compact-switch word with constant source bits
(1,1), binary control radixBand window modulusN>B, the maximal invariant agreement core isA carry calculation proves necessity and sufficiency on both points of each ideal XOR orbit. The core excludes any four-entry independent translation menu at
B>=4. Five entries are optimal whenB>=8and5(B-2)<=N, with an invariant selector.This contribution was produced by Nick Petalas. It answers the symbolic-core question in #7197 and credits its finite core and four-entry adversary. zhaobenny's #6812 supplies the raw word and five-phase upper construction. Advance claim
Evidence
(B,N)=(8,64)and 168 at(16,128). Seven controls include an agreement whose ideal mate fails and a case whose error wraps atN=B.Run from the repository root. Local environment was CPython 3.12.15 on macOS 27.0.1 arm64 with the standard library.
Limitations
The proof fixes the two target positions, the all-one source pair, two-digit control fields and the live-digit word. The menu bound requires independent coordinate translations and an invariant selector. Movement, physical selection and cleanup, tape, precision, hosting and the complete recursive bill remain open. The prior finite census, selected scientific cold replay, Lean and Docker were outside this run. This result supplies no new κ. Independent human and formal proof-kernel review are unclaimed.
Open next questions
B>=4outside the five-phase packing range. Begin with the four restored coordinates atB=4, N=8, where the lower bound still applies.Related open work
B=8, N=32by finite methods. Substituting those parameters in the symbolic formula gives the same predicate. The predecessor census was not replayed.CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
All three hosted checks passed on
3d6b5586a43240d5d166912b4873a2009b281de7, including planning and the symbolic-core and historical replay-gap package replays. CI run 44394137014 The six status tests passed locally on CPython 3.12.15. The historical replay-gap check returnedPASS_REGISTERED_RESEARCH_PACKAGE.Before the sync, the base's
test_current_ci_section_matches_selected_recordfailed locally because the selected record namesmake frontier7000-verifyand the CI guide still namesmake frontier6030-verify. The same assertion stopped the onboarding plan job on #7734, with one failure and 24 skips in 760 tests. Hosted logMerge danger
Two-way change.