11986Re: [PrimeNumbers] has SB been tested?
- Apr 1, 2003In a message dated 01/04/03 13:25:21 GMT Daylight Time,
> While I do agree that such testing would be reassuring and consume fewAs is coding an FFT for 100 Million digits: size has nothing to do with it.
> resources, it is my experience that coding an FFT for the 1 million digit
> range is rather trivial.
What is /not/ trivial is to optimise it to the extent done for the GMP
library incorporated (I believe) in the Proth search programs used by SB team.
To maximize speed, George Woltman's FFT code incorporates an unprecedented
amount of optimisation, and is constantly riding on the extreme edge of
failing (roundoff >= 0.5 bits), so it needs an exceptional amount of testing,
on many different architectures, especially near the many FFT-size
See e.g. http://www.mersenne.org/source.htm
[Non-text portions of this message have been removed]
- << Previous post in topic Next post in topic >>