Today, we’re announcing a solution found by our miners to Erdős Problem 96, open for over 66 years.
The result disproves the conjectured linear bound, constructing strictly convex polygons with superlinearly many unit-distance pairs.
Verified in Lean through Conjectures. Full proof below.