T-246: Reported degree-7213 minimal polynomial of the record side
V0 C0 Exact side recorded
Daniel reports that the side sigma of the best known packing of 29 unit squares, Schadt's packing as Ellsworth improved it, whose exact certificates are T-155 and T-195, is a root of an irreducible integer polynomial p of degree 7213, so that p is its minimal polynomial: sigma = 5.93383346267692918968946061635201913843383418107…, the root of p that the source's Krawczyk enclosure isolates, and p has a leading coefficient of 325 digits and coefficients of up to 5,074 digits. It is the exact value of that configuration's side, the record side, and it states no bound and no optimality: the source does not check the packing's non-overlap at sigma, and the case's upper bound is T-195's.
The source eliminates the packing's 152-row contact system to five consistency polynomials in the class angles of its five tilted orientation classes and solves them by polyhedral homotopy continuation: 44,448 paths give 7,209 regular roots, and the 4 the homotopy missed, beside the singular side 5, are recovered algebraically; p is rebuilt from all 7,213.
It rates irreducibility over Q (degree patterns modulo 12 primes), the Krawczyk enclosure of the unique zero t* of the five polynomials (radius 1e-50) and the link sigma = S(t*) rigorous, and the identities that certify the shape-lemma parametrization in Q[x]/(p) Monte Carlo, modulo random 62-bit primes. The polynomial, a 27 MB file, is published in the release exact-data-2026-10-12 and retained here by its digest; its degree and coefficient sizes were read from it here, and nothing else was run.
Daniel after Schadt, Ellsworth and Levy, square-packing, 11 October 2026, with the data in exact-data-2026-10-12, announced on X on 13 October 2026 (the thread). The source's CREDITS.md says its work was produced by Claude (Anthropic) under human direction.
Significance, composition and next rung
- Significance
- The exact algebraic value of the side of the best known packing of 29 squares, which the record held only as decimals and rational certificates: of degree 7213, an order of magnitude above the largest degree the record otherwise states (672 at , from the catalogue), found by a complete homotopy solve with the roots it missed recovered algebraically. A substantive case result, above the S2 of T-120 to T-123, whose exact forms of degree 8 to 40 come from routine elimination; it proves no bound, so not S4.
- Composition
- One cited entry, the source's report (E-n029-evand-minpoly-7213-report), which claims the exact side as derived structure and no bound. The certificates T-155 and T-195 cite are not cited: they decide the same packing at rational sides and say nothing of p. Nothing is replayed here, so V0; no review has read it, so C0.
- Next rung
- C1 needs the stage 4 mathematical review of N29.md recorded as this entry's read: the review of 31 October 2026 (#817, think-10m1) accepts the chain with one Monte Carlo step. C3 and V3 need the identities F_k(tau) = 0 and Sn(tau) = x Sd(tau) in Q[x]/(p) decided deterministically. The source's five-step replay, run on 25 October 2026 (#817), checks them only modulo random primes, far short of the resultant bound, so it does not earn C3. Either deterministic route would: exact division, priced at about 440 to 720 CPU-hours by a model that leaves out building the numerators, or the modular route, about 1.1e8 primes against that bound and about 8.8 million CPU-hours (think-10m1).
The packing at the unique zero t* of the five polynomials in the Krawczyk box is decided (#817), so <= S(t*), 3.9e-799 below T-195, is a separate upper bound for the owner to register or not. This entry stays an exact side until S(t*) = sigma is decided, since sigma is the side it states. - Unfinished confirmations
- C1 (think-6gti): the stage 4 mathematical review of N29.md, its elimination to the five consistency polynomials, the shape-lemma parametrization, the Monte Carlo error bound and the link argument, read from the retained packets. Not priced.
C3 (think-10m1): the identities F_k(tau) = 0 and Sn(tau) = x Sd(tau) in Q[x]/(p) decided deterministically, by building each cleared numerator in Z[x] and dividing it by p exactly; the source's five-step replay, which reproduces them modulo random primes only, ran on 25 October 2026 and does not meet this item. About 717 CPU-hours (priced 2026-10-25). - Novelty
- previously-published Present in an identified source
The case
As published
Proven
- exact
Citation record n-029
lowerHosono after Tokoharu, Levy et al. 2026, GitHub (confirmed T-108)
upperSchadt et al., GitHub (confirmed T-195)
Open
- optimality
The case record
Results on the case
16 results in the register on , oldest first, each with what it established and how it stands now.
2005 published T-007
for
V0 C1 Lower bound incomplete on this case, superseded by T-108
2026-08-29 established T-009
, by a Krawczyk interval certificate
V3 C3 Upper bound confirmed superseded by T-195
2026-09-04 published T-085
Nagamochi 2005, Lemma 1 is false for every container with and
V3 C3 Correction confirmed
Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register
2026-09-22 published T-044
Weighted point lower bounds for ten counts in , plus seven from the same files
V3 C3 Lower bound confirmed superseded by T-108
Hosono after Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 point bounds 2026 · packet · source · review · register
2026-09-22 published T-047
; for ; for
V3 C3 Lower bound confirmed superseded by T-108
Tokoharu after Levy, Hosono, Stromquist, Nagamochi, Burns, Massaccesi · Tokoharu density 2026 · packet · source · review · register
2026-09-27 published T-046
Rectangle-density lower bounds verified at 48 counts in
V3 C3 Lower bound confirmed superseded by T-108
Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026 · wand125 rectangle bounds 2026-09-28 · packet · packet · source · review · register
2026-09-28 published T-070
Rectangle-density lower bounds replayed at 25 counts in
V3 C3 Lower bound confirmed superseded by T-108
Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-09-28 · packet · packet · source · review · register
2026-09-29 published T-058
Rectangle-certificate ceiling
α·UB(n)proved for ..100;B·UB(n)on 64 grid rowsV3 C3 Method limit confirmed
Hosono after Tokoharu, Daniel · wand125 tools 2026 · packet · register
2026-09-29 published T-083
for every nonsquare
V3 C3 Lower bound confirmed on this case, superseded by T-108
Karakuş · Karakuş 2026 · source · register
2026-10-01 published T-068
Rectangle-density lower bounds verified at 34 counts in
V3 C3 Lower bound confirmed on this case, superseded by T-108
Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-10-01 · packet · source · review · register
2026-10-01 published T-074
Rectangle-density lower bounds replayed at 31 counts in
V3 C3 Lower bound confirmed on this case, superseded by T-108
Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-10-01 · packet · packet · source · review · register
2026-10-06 published T-108
Mixed rectangle-measure lower bound verified at , on a declared net
V3 C3 Lower bound confirmed
Hosono after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 mixed bounds check2 2026-10-06 · packet · source · review · register
2026-10-10 published T-132
Mixed rectangle-measure lower bound reported, on a 2,073-direction declared net
V0 C0 Lower bound recorded
Hosono after Tokoharu and Levy · wand125 fine-net n29 2026-10-10 · packet · register
2026-10-11 published T-246 this result
Reported degree-7213 minimal polynomial of the record side
V0 C0 Exact side recorded
Daniel after Schadt, Ellsworth, Levy · Daniel exact and local reports 2026-10-12 · packet · packet · register
2026-10-12 established T-155
Exact regularized sides at 59 counts,
5.4e-20to9.9e-15below the ceilings they replaceV3 C3 Upper bound confirmed on this case, superseded by T-195
2026-10-15 published T-195
A tighter rational certificate of Schadt and Ellsworth's 29-square packing,
1.57e-36below T-155V3 C3 Upper bound confirmed
PingYou Ltd after Schadt, Ellsworth, Daniel, Levy · PingYou PR 622 certificate 2026-10-15 · packet · register
Links
- On this site
- Case record, · Frontier row, · T-246 in the results table
- Issues
- Issue #545 · Issue #811 · Issue #816
On GitHub, at main
- Register
- T-246 in
results.yaml, line 35296 - Evidence
E-n029-evand-minpoly-7213-report- Proofs and certificates
- certificate
release.json - Sources
- Daniel exact and local reports 2026-10-12 (its own site, retained copy)
- Source packet
resources/web/evand-exact-data-2026-10-12/README.md·resources/web/evand-exact-and-local-reports-2026-10-12/README.md- Artifacts
11 artifacts and controls
resources/web/evand-exact-data-2026-10-12/README.mdresources/web/evand-exact-data-2026-10-12/acquisition/release.jsonresources/web/evand-exact-data-2026-10-12/acquisition/release/s29/README.mdresources/web/evand-exact-data-2026-10-12/acquisition/release/s29/n29_krawczyk.jsonresources/web/evand-exact-data-2026-10-12/receipts/announcement/tweet-2110154454817448106.jsonresources/web/evand-exact-and-local-reports-2026-10-12/source/search/exact/homotopy/N29.mdresources/web/evand-exact-and-local-reports-2026-10-12/source/search/exact/homotopy/irred.pyresources/web/evand-exact-and-local-reports-2026-10-12/source/search/exact/homotopy/krawczyk.pyresources/web/evand-exact-and-local-reports-2026-10-12/source/search/exact/homotopy/link.pyresources/web/evand-exact-and-local-reports-2026-10-12/source/search/exact/homotopy/verify_mod.pyresources/web/evand-exact-and-local-reports-2026-10-12/source/search/exact/homotopy/contacts_mod.py- Case file
frontier/n-029.md(verified lower, verified upper, reported lower, reported upper)