Hello. For any of you out there lucky enough to have access to an Alpha 21264, I've developed a library for large integer convolutions using number theoretic transforms and optimized for this processor. The library distribution includes a sample program that performs a Lucas-Lehmer test. I designed ICL, the Integer Convolution Library, to be fast, self-tuning, and easy to use. It handles Fermat-mod and Mersenne-mod arithmetic natively; it also produces runtimes within a factor of two of the fastest floating point implementations, with improvements on the way. www.glue.umd.edu/~jasonp/icl.zip Let me know what you think, jasonp _________________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
