Computation of unknotting numbers: which knot breaks the Bernhard-Jablan Conjecture

Abstract: We determine $2,525$ unknotting numbers of prime knots with at most $13$ crossings, that are unknown in the KnotInfo snapshot of 9 September 2026. The lower-bound calculations use Heegaard Floer correction-term obstructions and Greene's spanning-tree model. We also give explicit crossing-change constructions for upper bounds. For $959$ alternating knots with range $[2,3]$, we verify that no crossing change in a minimal diagram gives a knot of unknotting number one. We determine the unknotting numbers of all four knots in Brittenham and Hermiller's construction and thereby identify 13n3370 as an explicit counterexample to the original Bernhard-Jablan conjecture.