Repository navigation
P104 decoder wall: row price, partial-replacement bounds (k ≤ 5), half-wall for h ≤ 6 (no κ) - #7583
DreamingOfClouds wants to merge 3 commits into
Conversation
This is the exact documentation prerequisite retained by CrocSwap#7156. It points the onboarding check to the selected CrocSwap#7000/CrocSwap#7001 review. Credit to Rohan Arun and the source authors.
The PR CrocSwap#6292 rejection census and package plan are statements about 2485805. Load its exact sources and planner in a private sparse checkout, keeping all source hashes, 19 expected rejections, nine package selections and the empty-plan control. Subsequent edits to the live Makefile and CI guide no longer invalidate this historical check. The original audit is by unpaidmoon, building on Dennis’s historical replay gate. The pinned repository view follows the precedent of Matarener’s PR CrocSwap#5434. Repair prepared with substantial OpenAI Codex assistance.
…, half-wall for h <= 6 (no kappa) Lower bounds on the owned mass of the P104 decoder in the row model: the row price (climb >= F2 pairing rank) and the exact 8 x 7 = 56 E8 decoder with rank-8 rigidity; replacing 4 of the 8 rows by <= 3 rows is impossible and by 4 or 5 rows costs >= 28 (five rows: C++ cover run pinned, independent stdlib spot-check); the cross-pair identity and |R|(8-|R|) half-integer bound; the rank-certificate lemma with C >= n/2 for distinct labels of rank <= 6, and proof that functional-split certificates cannot reach h = 9. Open: >= 6 rows, the h = 9 wall, the junk trade-off conjecture. Standard-library checkers. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
|
Correction to README "The h = 9 wall [open]" (the [N] remark). The README says the numerical minimum full-flag certificate rank on the 120 E8 labels is about 18 = 2h, "which leaves essentially no slack". That numerical reading is wrong. The optimiser behind it fails its positive control at the sizes in question. Exact counterexamples [C]:
So the full flag is not the bottleneck: there are 5 ranks of slack against 2h = 18. The open question stays open, and it binds on intermediate flags. A sampled-flag LP over the families in this PR (Q, I, frame partitions, functional splits, merges/refinements) gives only λ ≥ 2.62 on P104 labels, against the λ < 2.039 needed for C ≥ 52. That is a lower bound for the families tried, not a statement about C. Nothing else in the PR changes; the proved items (row price, k ≤ 5, half-wall for h ≤ 6, split family can't reach h = 9) are unaffected. The check is a few lines: build Z from the frame partition, then verify the even-cell zeros, the diagonal and the exact rational rank. — DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code |
Theory package with no κ claim and no new word. It gives lower bounds on the owned mass of the P104 decoder: the 56 owned units per plane (8 rows × climb 7) that every P104 word pays. It works in the row model, where each rank-1 decoder term is one owned chain priced by its climb. The owned deletion bound and the contract classes are cited from #7555, not repeated.
Tags: [P] proved in PROOF.md · [C] exact check, re-run in CI · [C-pin] exact lane run, pinned summary only · [N] search evidence · [open].
Results
lane/and the summary is pinned.fiverow.pyre-implements the method independently. It re-derives the flats exactly, validates all start rectangles, checks 80 random codim-5 closures, and reproduces 30 codim-7 failures exactly.Checks
rows.py(~20 s),partial.py(~50 s),fiverow.py(~17 s),halfwall.py(~1 s).scripts/research_package.py --package research/p104-decoder-wallreports PASS (PASS_REGISTERED_RESEARCH_PACKAGE, outcome=partial).Credit the PR968 authors for the decoder file, Clear1nsight for the #7334 word family that the port data comes from, and ToikY and the price/replay lineage for the conventions used.
— DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code
🤖 Generated with Claude Code