n = 35 · Case Records · The Squares Project

n = 35 proved ★ corrects Nagamochi 2005O=

$s (35) = 6$

The best packing known for 35 squares, side

6

, Erich Friedman 1999

567

5.9166.916

\sqrt{n}

\sqrt{n} + 1

Proven

$s (35) = 6$

new result
optimal
exact

Citation record n-035

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

Bounds

Best known packing

$6$

Found by: Erich Friedman 1999
Construction: hand
Source: [Kingbird]
Evidence: E-kingbird-upper-register

Verified upper bound

$6$

The reported value, verified here.

Evidence: E-basic-grid-upper

Reported lower bound

Proved by: Erich Friedman 1999
Kind: unavoidable points
Source: [Friedman DS7]
Evidence: E-migrated-lower-report

Verified lower bound

$6$

The reported value, verified here.

Corrects: Nagamochi 2005 (T-007)
Evidence: E-karakus-strip-lower, E-karakus-strip-measure-interval

Gap

Solved: the verified bounds meet.

Results in the register

T-007 V0 C1 Nagamochi · 2026-08-31 · 321 cases
$s (n) \geq min (⌈ \sqrt{n} ⌉, \sqrt{n - 2 ⌊ \sqrt{n} ⌋ + 1} + 1)$ for $4 \leq n \leq 324$
T-058 V3 C3 wand125 after Tokoharu, Daniel · 2026-09-29 · 100 cases
Rectangle-certificate ceiling α·UB(n) proved for $n = 1$ ..100; B·UB(n) on 64 grid rows
T-083 V3 C3 Karakuş · 2026-10-02 · 301 cases
$s (n) \geq 1 / 2 + \sqrt{n - ⌊ \sqrt{n} ⌋ + 1 / 4}$ for every nonsquare $8 \leq n \leq 324$
T-084 V3 C3 Karakuş · 2026-10-02 · 16 cases
$s (k^{2} - 1) = k$ for every integer $k \geq 3$ ; $k = 3 \dots 18$ are the cases held here
T-085 V3 C3 Karakuş; chelokot · 2026-10-02 · 315 cases
Nagamochi 2005, Lemma 1 is false for every container with $a > 3$ and $b > 2$

Verification

upper: replayed here; lower: external proof (read here), audited here

—

Rigidity

not rigid, numerically checked, numerical multiprecision

Evidence: E-translation-escape-not-rigid

Scope

Square 29 of the retained witness (witness id 30) translates 1 along (0, 1) with the packing still valid, so the configuration admits a non-trivial feasible motion; 2 of its 35 squares do. Every constraint is exactly affine in the slide parameter, so the arithmetic carries no linearization error, but the coordinates are the witness's own finite-precision transcription: this settles the retained configuration, not the true optimum. Rigidity and optimality are independent, and this bears only on the former.

Evidence and sources

7 evidence entries

E-kingbird-upper-register, E-migrated-lower-report, E-basic-grid-upper, E-karakus-strip-lower, E-karakus-strip-measure-interval, E-nagamochi-lemma1-counterexample, E-nagamochi-lower

[Kingbird] record catalogue
[Friedman DS7] lower bound proof
[Karakuş 2026] lower bound proof

In the frontier survey On GitHub

$s (35)$ — solved

$s (35) = 6$ . Established by an unavoidable point set, Erich Friedman (1999).

The packing

Found by Erich Friedman in 1999, via a hand construction.

The lower bound

Proved by exhibiting an unavoidable set: a set of points in the container that every unit square placed inside must contain. With $n - 1$ such points, $n$ disjoint squares are impossible by pigeonhole.

The verified lower-bound evidence recorded here is Karakuş’s rectangle bound, E-karakus-strip-lower, which gives exactly $s (k^{2} - 1) = k$ (T-084). Corrected 4 October 2026: until 2 October it was the Nagamochi result, E-nagamochi-lower, whose published proof rests on Nagamochi’s Lemma 1, which Karakuş showed false; its value here is the same, and it is now a reported bound (review of 2 October 2026). This register had recorded that proof as verified, its own error, logged as defect D-516; this record’s prose was missed by the correction of 2 October and is corrected here.

Verification Code

The programs behind this case’s verified bounds, by their evidence. The code column says how the code that ran stands to the code its producer used. VERIFIERS.md says what each program is and whose it is.

bound	evidence	run	code	programs
verified lower	`E-karakus-strip-lower`	a published proof	no code	no verification code
verified lower	`E-karakus-strip-measure-interval`	audited here	independent	`V-check-karakus-strip-measure` (first-party)
verified upper	`E-basic-grid-upper`	replayed here	independent	`V-check-basic-bounds` (first-party)