View Single Post
Old 2011-04-20, 18:50   #19
zerothbase
 
Mar 2011

2·5 Posts
Default

I believe the original intent of the thread was to find fast ways to prove primality up to a given limit.

It takes <3 minutes for my code to chew through the 2-SPRP list, and I've been told:

Quote:
Originally Posted by geoff
There are much faster methods than the mul/div asm version
So there has been an improvement from 15 minutes for BPSW to <3 minutes for my 4-MR tests (assuming the 15 minutes was done on modern HW).

The question wasn't "is there a way to prove 64-bit primality?", it was "how fast can we do it?". Offering BPSW is equally valid to offering factoring up to the square root - yes it works, but it doesn't tell me how fast it is.
zerothbase is offline   Reply With Quote