Repository navigation
Research: partial theorems on the P112 decoder wall (no kappa) - #5559
Merged
Mister-Meeseeks merged 2 commits intoOct 25, 2026
Merged
Mister-Meeseeks merged 2 commits into
Mister-Meeseeks merged 2 commits into
Conversation
The planner requires Git-tracked repo-relative inputs; "MANIFEST.json" broke the onboarding tests (test_research_matrix_batches) for every PR based on current main. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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.
Research package: partial theorems on the P112 decoder wall (no kappa)
Methods package for the
complex-rank-shape-decodercard (scope recorded aschanged): exact lower bounds showing masked P112 decoders cannot cost less than 64 in the covered cases.Covered: every decoder with at most 8 rank-1 terms (C >= 64 for m <= 8); MIX-8 for mixed rectangle/Ferrers-atom decoders with at most 8 pieces; rank-8 nine-term decoders (CORE3 / CORE-RES / R8); KFAM T-block cost C(T) = 8 for COVERSAT orbits 0, 1, 3, 4 and CT8. Orbit 2 of COVERSAT, rank-9 nine-term decoders, m >= 10 and mixed decoders with 9 or more pieces are open (see "Open next questions" in the README).
No supplier, no coefficients, no kappa claim. Part of the proof is conditional (stated precisely in the README).
Verification:
python3 scripts/research_package.py --package research/p112-decoder-wall-partial --check-onlypasses.data/.Also includes a one-line cherry-pick fixing the
wordram-ntt-kernelVERIFY.json input path.Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.
🤖 Generated with Claude Code