Exact rational certificates for 6 packings below register (n = 103, 153, 207, 209, 258, 270): registration request
Maintainers usually reply within 1 day
Nobody has claimed this yet.
Assessment
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Newbie friendliness
- 25/100
- Issue type
- Feature
- Clarity
- Mostly clear
- Activity status
- Active
- Tech stack
- python
- Domain
- testing-qa
Research direction
Start by reading the six linked rational certificates and the cited verification checkers in the pinned commits. Confirm each certificate’s hash and verification result against the stated tools, then review how the register records bounds and construction credit. Done means the six verified bounds and lineage are registered accurately; this request depends on validating external artifacts and updating multiple results.
Written by the indexing model from the issue text.
Description
I’m submitting six improved certified upper bounds. Displayed sides are rounded upward to 12 decimal places from the exact rational certificate headers; improvements are calculated before rounding.
| n | New certified upper bound | Comparison bound | Improvement | Certificate |
|---|---|---|---|---|
| 103 | 10.679232047362 | 10.679232047511 (#432) | 1.493293 × 10⁻¹⁰ | square-103.cert |
| 153 | 12.870013850405 | 12.870013850408 (#504) | 2.564000 × 10⁻¹² | square-153.cert |
| 207 | 14.880960371558 | 14.880960373044 (#503) | 1.485670 × 10⁻⁹ | square-207.cert |
| 209 | 14.946223226448 | 14.946223654488 (#481) | 4.280399 × 10⁻⁷ | square-209.cert |
| 258 | 16.563448002138 | 16.563448002140 (register) | 1.984000 × 10⁻¹² | square-258.cert |
| 270 | 16.929775353544 | 16.929780126242 (#481) | 4.772697 × 10⁻⁶ | square-270.cert |
All certificates are pinned to commit 336bdf5efab4784e54e0ac32edf3ed12f9c8af7e in Mishapolk/square-packing-records. They contain rational centres and rational t = tan(θ/2), representing exact unit squares inside the open container.
Certificate SHA-256 hashes:
square-103.cert 044ab54af75be78261f64fe7e6bd99f02f0a650fe13c5355714102e31432365c
square-153.cert 8c012a7207a4762c48fbd68577f5b20771d0be66a401a90b7d09b549a50f15bf
square-207.cert 3cc901c7096406d0c1d7a2daf23860ad65758b3b133a103d0e5ebd3ab9a34b41
square-209.cert f5aa5aa77ce5b95914b9048884d519ef03ce2a14fe95a14ab01517a157b8ea1d
square-258.cert 580be390e8307ffc9e3ce1f613098e8c6734f8b5cf9266d2ca29255fc9948a45
square-270.cert 7dd96e6455e03cfab11a6b63d6fbce4b071b16445d1beec0b7f5288c7abe0185
All passed exact rational verification using jlevy/squares’ checker and Evan Daniel’s checker.
The checkers share rational half-angle rotations and separating-axis geometry. These certificates prove packing feasibility; no local or global optimality proof is claimed.
Lineage and credit:
103: continued Ryan Xu’s arrangement from #432, refined using SLSQP on active contact graphs followed by exact rational finishing. Please retain his construction credit.
153: new arrangement discovered using basin hopping with tilted grain boundary corridors, refined via exact rational finishing.
207: new arrangement discovered using basin hopping with tilted boundary corridors, refined via exact rational finishing.
209: new arrangement discovered using basin hopping with tilted boundary corridors, refined via exact rational finishing.
258: continued Nate Chaoweeraprasit’s (SQUISH) arrangement from the register, refined using exact finishing.
270: new arrangement discovered using basin hopping and exact rational finishing.
The search implementation, verification orchestration, and issue preparation used Gemini. I directed the work.
- Dominant language
- Python
- Stars
- 54
- Forks
- 6
- Avg merge
- 9h 11m
- Merged PRs (30d)
- 239
Getting set up
- No Dockerfile or Docker Compose file
- Has a pull request template
- No contributing guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from jlevy/squares
-
Difficulty 2/5 1-3 hours Newbie friendliness 67/100
Maintainers usually reply within 1 day
-
Difficulty 5/5 Over a week Newbie friendliness 15/100
jlevy/squares#1039 · 1 comment ·
Maintainers usually reply within 1 day
-
Difficulty 5/5 Over a week Newbie friendliness 1/100
Maintainers usually reply within 1 day
-
Difficulty 5/5 Over a week Newbie friendliness 30/100
Maintainers usually reply within 1 day
-
intake
Difficulty 4/5 3-5 days Newbie friendliness 48/100
Maintainers usually reply within 1 day
Similar issues
-
Layout accepts a step threshold of 0 or less, then in-toto-verify crashes with StopIterationPossibly taken @BahaaMattar claimed this today. Open
Difficulty 2/5 1-3 hours Newbie friendliness 76/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 65/100
Maintainers usually reply within 1 day
-
needs discussion
Difficulty 2/5 1-3 hours Newbie friendliness 78/100
openfga/openfga.dev#1436 · 1 comment ·
Maintainers usually reply within 2 days
-
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
Maintainers usually reply within 1 day
-
usb-device-hid: MouseInterface reports bInterfaceProtocol 1 (keyboard) instead of 2Possibly taken @Duhan07 claimed this today. Open
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
micropython/micropython-lib#1176 ·