A reproducible exhaustive computational proof for four terms of OEIS A386493. Computation: September 8, 2026.
The problem is to minimize the squared diameter of a set of integer lattice points such that, at every selected point, its distances to all other selected points are different. This excludes collinear midpoint triples as well as ordinary isosceles triangles.