mpz_probab_prime_p(n, reps) : how long?

[jojo 29]

Someone wrote me that my mpz_probab_prime_p() function (33 million digits 
number, 10 iterations) needs few months only, with a Pentium 4. So... I 
don't know who is right...

What calculations did you make to determine that my mpz_probab_prime_p() 
function needs "100 years"?

regards,

jojo

>From: Torbjorn Granlund <tege at swox.com>
>To: "jojo 29" <jojo29118 at hotmail.com>
>CC: gmp-discuss at swox.com
>Subject: Re: mpz_probab_prime_p(n, reps) : how long?
>Date: 10 Mar 2005 16:08:58 +0100
>
>"jojo 29" <jojo29118 at hotmail.com> writes:
>
>   A last precision : the complexity of GMP's Miller-Rabin implementation 
>is
>   "O(n^(2*log(n)))" or "O((n^2)*log(n))"?
>
>The latter.
>
>--
>Torbjörn