Repository navigation
Certify eight-query minimum for the saved binary two-burst schedule - #5906
Merged
Mister-Meeseeks merged 1 commit intoOct 27, 2026
Merged
Conversation
This was referenced Oct 27, 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
Finite certificate over F2: eight rank-one thin queries are necessary and sufficient for the saved PR #5699 schedule. The six full calls stay in order
(1,3,2,4,0,5)and thin queries occur only after two and four full calls.This answers the predecessor's first Open next question for its saved gap pair. The new contribution is the lower bound. Credit theon199 for PR #5699's attaining eight-query square-zero construction and explicit question, Ali Romman for PR #5673's full matrices and normalized model, and Cinna Davis with the retained controller/native/helper/compiler lineage. No new kappa or selected-frontier change.
Evidence
Before: eight queries were an upper bound; the source explicitly left fewer thin queries open. After: every feasible aggregate pair in this fixed binary schedule has rank sum at least eight. Rank subadditivity proves the query lower bound, and the cited construction attains it.
Local CPython 3.12.15, macOS 27.0.1 arm64, standard library only. The direct warning-strict verifier and both registered normal/optimized exhaustive replays pass. Each includes all 16,777,216 pairs, 512 independent kernel/rank controls and nine boundary, rejection or enumeration controls. The complete rank-pair histogram also agrees with the discovery calculation. The verifier imports no predecessor code and prints a generated receipt bound to package and input SHA256 hashes.
Exact reproduction from the worktree root:
Use the corresponding CPython 3.12 path on another host. Expected
PASS_TWO_BURST_THIN_RANK,solutions=16777216,minimum_rank_sum=8, andPASS_REGISTERED_RESEARCH_PACKAGE.Both registered checks were also individually timed at 33.699s and 34.327s. Metadata/pins, committed bytes/executable modes, full declared-source ancestry and the official ten-file export with all three declared inputs pass. A read-only Git-free optimized export replay with an empty PATH also passes in 33.13s and preserves all 11 exported files.
Limitations
The certificate covers F2, these exact full matrices/order and these two gaps. Extension fields, changed schedules, extra full calls, stage-dependent thin entries, native lifts, physical restoration and complete supplier/outer admission remain outside it. No Lean/kernel proof or independent human review is claimed. The predecessor's optimistic invoice is cited, not replayed. All five framework assumptions retain their status. All new files are confined to
research/two-burst-thin-rank/.Open next questions
Related open work
Refreshed all account open PRs created since the CLAIM at 2026-10-27T11:59:19Z. The nine other PRs are #5897 through #5905; none studies the fixed PR #5699 full order and two-gap thin-query count or its aggregate rank-sum quantity. No same-object open contribution or conflicting number was found. PR #5699 and PR #5673 remain merged predecessors. This supplements the earlier live 448-open-PR body scan and handoff check; unpublished work remains outside coverage.
CI notes
At commit
8448d0552496963f4cd02ee7abec89c6fb649690, CI run 40502000289 finished with plan failed; replay skipped. The only failed step was Onboarding helper tests. All ten failure/error entries are in unchangedtests/test_research_current_assignment.py, endingFAILED (failures=8, errors=2, skipped=22). The two errors areKeyError: 'follow_up_steps'andKeyError: 'catalog_first_step'. Assertion failures concern frozen-card/current-route expectations, missing-reference handling and sparse omission lists. All ten failure/error headers match PR #5905's failed plan log exactly. This is the reported shared mainde5ec2e7aonboarding failure. Maintainers will address it; no shared source or tests were changed.Hosted replay has not certified this package; only local scientific and publication checks have run. Local normal/optimized exhaustive replays, metadata/pins, committed-byte/mode/source-history checks, official export integrity and read-only Git-free replay pass. The CI result is not mathematical acceptance.
Merge danger
Door: two-way. Blast radius: isolated research package. No shared implementation, frozen source, selected result or predecessor credit is changed.