T-247: Kim's exact degree-21 side at 297, as reported, of the packing the record credits

V3 C3 Upper bound confirmed

2026-10-25 published · Kim after Couzo, Daniel, PingYou Ltd, Levy · n=297

Kim's comment of 25 October 2026 on issue 804 reports that the stationary side of the best-known packing at 297 is the only real root of an irreducible degree-21 integer polynomial, which the comment prints, so s(297)≤17.7404172875438018509758015948842895936406549234461952734252335613502680498177981816058180396096276933…, and attaches an exact configuration at that side under CC0 1.0. The attachment could not be downloaded here; the author's public copy of 31 October serves the same bytes, which the packet keeps since 1 November 2026.

The author's configuration was decided here on 1 November 2026 on two exact routes (route B), so the bound is shown. sqpack's exact witness verifier, over the configuration's field of degree 21, decided every unit-square identity, wall and pair and refused a duplicated square and a square moved outside the box. Daniel's verify_exact.py, the checker the author reports running, run unchanged, printed VALID, with the 1,750 corner incidences it counts as touching (a square's corner on a wall or on a separating side) proved as identities, and refused four mutated controls. Before deciding, the file was held to the digests the comment states and its side to this entry's: the same polynomial, a root of it in the field, and the same real root.

This repository also built its own exact configuration at the same side from T-174's retained certificate (route A, devtools.build_field_configuration): the contacts and the side's stationarity solved to 2,600 digits, the field K of degree 21 generated by the band's half-angle tangent found by integer relation, and every centre and rotation solved exactly in K, where all 1,208 contact equations are identities and the comment's polynomial vanishes at the side. Its feasibility, every other pair and wall separated, is not yet decided exactly: sqpack.witness.exact_verify over K did not finish within the item's CPU cap.

The side lies below T-174's rational certificate, the case's house, by 3.359e-90, and below issue 639's degree-12 side by 6.624e-63, decided exactly. Credit Kim with the exact side, a refinement of the packing it solves, after that packing's finder and improvers as the case record credits them: Couzo's, as Daniel and PingYou Ltd improved it (T-174). The comment says Claude (Anthropic) did the computation, the construction and the checks at the author's direction, and that he reviewed and reran them.

Significance, composition and next rung
Significance
An exact algebraic side of a packing the record already credits, 3.4e-90 below the house's rational certificate: a citable detail of the case that changes no theorem, S2 as T-244's sides at 172 and 263 and T-193's exact forms are. No lower bound or optimum.
Next rung
Route B is decided on both exact routes since 1 November 2026 (think-ozx8): route 1, the author's file on sqpack.witness.exact_verify over its degree-21 field, and route 2, verify_exact.py. Route A, this repository's own configuration on exact_verify, is a further route that raises no rung, held over the item's CPU cap (think-vv1q).

As T-244 at 263: the side at 297 is the exact value of the house's own arrangement, 3.359e-90 below T-174's certificate there, not a new packing. Its adoption waits on the algebraic-house writer (upper_bound_houses.FIELD_COUNTS, think-ot5c) and on the owner's restatement question (think-ikku). If those make it adoptable, a stage 4 review of the configuration comes first, then the house rule adopts the side at 297, carrying its general and flip regularization at adoption, as the regularization gate requires of every adopted house. The case record is unchanged until then, so this entry reads as pending adoption at 297.

Local minimality of the packing at its side is a separate claim and is not registered. V4 and C4 need two adversarial AI reviews by distinct reviewers and a human oversight record.
Regularizations
n = 297: a regularization of T-174’s packing by Kim (KKT closure of the packing's active contacts, solved at 1,500 and 3,000 digits, with an LLL relation for the side's polynomial and an exact configuration in its field; solved to its side; identity: the source’s claim).
Novelty
previously-published Present in an identified source

The case

Case record

n=297

17.2417.740
171819
17.23418.234
nn+1

Proven

17.24066≤s(297)≤17.740418

  • exact

Citation record n-297

lowerKarakuş 2026, arXiv corrects Nagamochi 2005 (confirmed T-083)

upperCouzo et al., GitHub (confirmed T-174)

Open

  • optimality

The case record

LowerUpper
Gap0.49974824…

Results on the case

8 results in the register on n=297, oldest first, each with what it established and how it stands now.

  1. 2005 published T-007

    s(n)≥min(⌈n⌉,n−2⌊n⌋+1+1) for 4≤n≤324

    V0 C1 Lower bound incomplete on this case, superseded by T-083 and T-180 (reported)

    Nagamochi · Nagamochi 2005 · source · register

  2. 2026-09-04 published T-085

    Nagamochi 2005, Lemma 1 is false for every container with a>3 and b>2

    V3 C3 Correction confirmed

    Karakuş; Vlasenko · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

  3. 2026-09-27 published T-056

    Smaller packings for 49 counts from n=68 to 307, each certified two independent ways

    V3 C3 Upper bound confirmed superseded by T-174

    Couzo · franciscouzo square-packing 2026-09-27 · packet · register

  4. 2026-09-29 published T-083

    s(n)≥1/2+n−⌊n⌋+1/4 for every nonsquare 8≤n≤324

    V3 C3 Lower bound confirmed

    Karakuş · Karakuş 2026 · source · register

  5. 2026-10-05 published T-098

    Exact optima of 48 known-best packings: s(n) ≤ S', 3.5e-13 to 5.0e-11 below each printed side

    V3 C3 Upper bound confirmed on this case, superseded by T-174

    Daniel after Couzo, de Winter, Ellsworth, Levy · evand exact optima 2026-10-05 · packet · register

  6. 2026-10-13 published T-174

    Tighter certificates at 68 counts from PingYou Ltd, of others' packings and its own

    V3 C3 Upper bound confirmed

    PingYou Ltd after Friedman, Ellsworth, Daniel, Xu, Barnett, Couzo, Ostashev, Chaoweeraprasit, Gupta, Fang, Polkovskyi, Levy · PingYou PR 574 certificates 2026-10-13 · packet · register

  7. 2026-10-13 published T-180

    Closed-form lower bound s(N)≥a(N) for every non-square N≥49, reported

    V0 C1 Lower bound reviewed

    Hosono · wand125 closed form 2026-10-14 · packet · packet · register

  8. 2026-10-25 published T-247 this result

    Kim's exact degree-21 side at 297, as reported, of the packing the record credits

    V3 C3 Upper bound confirmed

    Kim after Couzo, Daniel, PingYou Ltd, Levy · Kim s297 2026-10-25 · packet · register