[RC5] What CPU works best?

Michael K. Weise mkw at att.net
Thu Sep 9 09:00:36 EDT 1999

Dan Oetting wrote:
> At 1:24 -0400 9/7/1999, Michael K. Weise wrote:
> >
> >Hmm. . . I suppose it's only a matter of time until a d.net project comes
> >along that needs FP math. Then AMD CPUs will have their chance to shine in
> >the stats.
> The "Great Internet Mersenne Prime Search" (GIMPS) computes the function:
>     M_p = 2^p - 1;
>     for (i = 2, S = 4; i < p, i++) S = (S * S - 2) mod M_p;
>     if (S == 0) printf("M_p is prime");
> using sine, cosine, square root and a few other floating point functions
> because it's
> faster than using integer arithmetic.
> Is this the project you are looking for?

Yes, for example. Shouldn't it be theoretically possible to incorporate a
core for that project into the client in such a way that it keeps the FPU
busy doing something useful without significantly slowing down the RC5


To unsubscribe, send 'unsubscribe rc5' to majordomo at lists.distributed.net
rc5-digest subscribers replace rc5 with rc5-digest

More information about the rc5 mailing list