This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minimum diameter. It also shows that the solution is ε-unique. The proof uses geometric arguments and a global optimization algorithm to solve a nonconvex quadratic program.