In practice, the elliptic curve method is faster than the Pollard "p" − 1 method once the factors are at all large; running the "p" − 1 method up to "B" = 2 will find a quarter of all 64-bit factors and 1/27 of all 96-bit factors.