Embed Notice

@ryanc

About 20 instructions should do: 5 to generate the primes, 5 to find the square roots, 5-6 to find the cube roots, and a few more to select the fractional parts and to select the 8 or 64 primes.

(A few more for bisection or even Newton iteration for the square and cube roots, but that luxury is superfluous here.)

I wonder how many instructions a superoptimizer would leave of those about 20 instructions.