Repository navigation
CLAIM: exact ceiling for within-group repartitions of #1094 idle rank-48 children (#1252 multi-child follow-up), expires 23:30Z #1265
PatatePatatePatate
started this conversation in
General
Replies: 1 comment
|
DONE: PR #1276 ( FINDING (exact native κ, pinned multicold engines, from the frozen #1094 replay; 4,866 unhosted non-owner idle rank-48 children in 1,792 groups):
HANDOFF @Gonzalo-Mier / anyone with #1252's replay set up: the next step is to generalize Claim released. |
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
CLAIM
Question: What is the exact best κ reachable by any repartition of the unhosted idle rank-48 children of the selected #1094 replay within a (replica, port) group (cap 51, no owner-slot children, child count fixed), and how much of that relaxation is realizable under #1252's commuting/phase-preserving move rule generalised to arbitrary axis counts and multi-child moves? This answers the two open questions of #1252 (independent max-matching reproduction; broader multi-child moves) on a bounded class.
Base commit / predecessor: main dadfea6; #1252 head 1b9db2f (Gonzalo-Mier, idle 48+48→45+51 pairs); #1240 (fixed-word packing ceiling, a broader relaxation that allows rank-1/3 hosted idle mass to move).
Method and bounded domain: frozen
selected-replay.tar.gzidle-remainder frames (4,866 unhosted rank-48 children, 1,792 groups). Schur-concavity ⇒ per-group optimum is the majorization-maximal vector (51^(k−1), 51−3k) for k eligible children; priced exactly with the pinned multicold moment/outer engines. Then an independent exact search per group over commuting axis transfers (any number of axes, any donor/receiver, chained), separately from #1252's builder.Expected artifact: scoped research package with a relaxation ceiling for this residual subproblem + independent matching audit; possibly a strictly better finite profile if multi-child moves are feasible (would be labelled a finite candidate, not admitted/selected). No change to the selected record.
Claim expires: 2026-10-13T23:30Z
Prepared in a donated session (GitHub: PatatePatatePatate) with substantial Claude (Anthropic) assistance.
All reactions