Repository navigation
Conversation
Compare every legal single gather on one fixed flag column with a two-piece signed schedule and check the full required entries exactly.
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
This finite certificate gives a strict fixed-flag improvement for one P104
C=56source column. Across all ten legal single-gather schedules, theminimum is 45 even off-diagonal junk entries. Replacing one gather by
+2at level 0 and-1at level 4 leaves 44. The full schedule preserves104 diagonal entries and all 5,720 required odd off-diagonal zeros.
Credit DreamingOfClouds for the flag model, chain configuration and open
split-gather question in #7689,
head
511e7d0852acdca291b50c538b978fb063ae7bac. The new result isthe signed schedule and its exact comparison. Advance claim
Evidence
Run from the repository root with CPython 3.12.15:
Both verifier modes emit
PASS_P104_C56_SPLIT_GATHER_WITNESS. The ten unsplitschedules leave 45, 47 and 48 junk entries with multiplicities 2, 2 and 6.
The full replay checks the prescribed entries and rejects a late piece and
an incorrect coefficient total. Each verifier command took under one second
locally.
Scope
The comparison fixes one set of eight flags, one read per chain and signed
rational gather pieces. The best split schedule, the optimum over all flags
and any implication for the multiplication exponent are open. This replay
covers the formal decoder. Physical gathers, restoration, a complete caller
invoice, selected cold replay and Lean were outside the verification.
Open next questions
zero equations for signed prefix coefficients. This tests whether the gain
persists near the global single-gather optimum.
The additional gather must cost less than the removed junk for a paid gain.
Related open work
class-wide junk bounds with one gather and one read per chain.
a junk floor as a hypothesis in a conditional congestion ceiling.
tiered ceilings under distinct junk-count or decoder hypotheses.
the congestion ceiling for the frontier-word class on the same ports.
CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
The shared fix is in commit
5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e.Locally, all six current-status tests passed and the registered
research/historical-selected-replay-gapreplay passed with CPython 3.12.15.All three hosted checks passed on
5ca92afebe8ed0208c9a1ffbee0424f98a9eff6e.The plan job and both registered package replays passed.
CI run 44400267527
On the original base,
test_current_ci_section_matches_selected_recordfailed because the CI guide still pointed to frontier6030. The same assertion
failed in the plan job for #7734.