Abstract. In relation to Hall’s conjecture, a new algorithm is presented to search for small nonzero k = |x 3 −y 2 | values. Seventeen new values of k<x 1/2 are reported. 1. Hall’s conjecture Dealing with natural numbers, the difference (1.1) k = x 3 − y 2 is zero when x = t 2 and y = t 3 but, in other cases, it seems difficult to achieve small absolute values. For a given k ̸ = 0, (1.1), known as Mordell’s equation, is an elliptic curve and has only finitely many solutions in integers by Siegel’s theorem. Therefore, for any nonzero k value, there are only finitely many solutions in x (which is hence bounded). There is a proven lower bound, due to A. Baker [1] and improved by H. M. Stark [14], that places the size of k above the order of log c (x) for any c<1. A bound concerning the minimal growth rate of |k | was found early by M. Hall [2, 7] by means of a parametric family of the form (1.2) f(t) = t 9 (t9 +6t 6 +15t 3 + 12), g(t) = t15 27 + t12 +4t9 +8t6 3 f 3 (t) − g2 (t) = − 3t6 +14t3+27