mpz_probab_prime_p(n, reps) : how long?

[Torbjorn Granlund]

"jojo 29" <jojo29118 at hotmail.com> writes:

  My god! many years?! I get a similar result using the bench test of the
  GIMPS project (http://www.mersenne.org/bench.htm)...
  
  Is it possible to get probab_prime_p() faster?
  
The complexity of GMP's Miller-Rabin implementation is
O(n^2*log(n).  No better algorithm is known (to me).

I don't think here is much hope to cope with a 33 million digit
number any time soon.  A current high-end machine would need
about 100 years for your number, if my estimates are right.

-- 
Torbjörn