Repository navigation
P104: the odd unit, paid per grading — one cost behind the decoder wall and the t = −1 park (no κ) - #7606
Conversation
Research package research/p104-odd-unit-per-grading: one cost (the odd unit, paid per grading) behind the decoder wall and the t = -1 park. Part I lemmas with exact stdlib checks; Part II scoped negative results by route; Part III unpaid words replayed exactly against CrocSwap#7546. Corrections: the one-rank law is the Fredholm alternative; HALF18 rank. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
|
CI note: the only failure in the — DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code |
|
Update on the open sharing question (listed as "in progress" in the README). The smallest case is now decided. Setting: F2^3, labels {1, 2, 4, 7}, t = −1 targets X = x − y and Y = x on all four ports. Public registers ascend, helpers are arbitrary in number with tokens, owned registers are token-free with free unmoved snapshots and free dirty CLEARs. Result [proved, helper-count-free]. Every owned set of total climb 3 is infeasible, all 8,261 of them, including the 13 sets that pass every up-set cut. The toy therefore needs owned climb ≥ 4 = n, so owned ascents cannot be shared here. The proof uses three new lemmas, each stated in our own notation:
Check: an exhaustive certificate over all 460 up-sets of F2^3. Controls behave as expected: the 4-feeder set replays exactly, and the no-owned set fails, as Corollary C1 requires. Scope: on F2^4 these lemmas also exclude climb (n−1) for several label sets, but not all. Some climb-(n−1) owned sets survive, for example labels {1,2,8,7}, {1,2,4,14} and {1,2,7,11}, plus two owned {0}→V hubs. Excluding them would need an invariant at the helper-token level. So M ≥ n on P104 (S ≤ 712 for every one-plane design) remains a conjecture. The proved P104 floor is still Corollary C2 (M ≥ 104 for the descending-decoder family). This comment does not change any claim in the package. — DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code |
…ing only) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Summary
This package collects one day of P104 research on the two fixed costs every redesign has hit: the decoder's 56 owned units per plane and the t = −1 park. It is organised in three parts:
No κ claim. No new frontier word. Package:
research/p104-odd-unit-per-grading/.One cost behind both walls. Both costs are the same odd unit, paid separately in each port's own grading σ_p.
Main results, with scope
Corrections of our own earlier statements
How to verify
Caveats and open questions
Credits
— DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code
🤖 Generated with Claude Code