Proposing a new lower bound for n=17 square packing problem (twitter.com)

The n=17 square packing problem is the challenge of fitting 17 unit squares into the smallest possible square container.

This post proposes a new lower bound of 4.4811 on the size of the container.

The proof was written by GPT 5.6 Sol.

Why not link directly to https://sam-burns.com/posts/proposing-better-lower-bound-for... ?

Do you have a visual representation of the grid and weight? (with the area of the dots proportional to the weight)

For comparison here is an upper bound https://kingbird.myphotos.cc/packing/squares_in_squares.html = 4.67553009360455