all,
A couple of weeks ago, there was discussion about repeating remainders in
the LL test. There was general agreement that this would be technically
unworkable due to the fact that the remainders are so large. Wouldn't it
be possible to store the last 1024 binary digits of the remainder (saving
1024 of these would be only 1MB, not a big deal.) Then we could check for
repeating remainders in the last 1024 iterations, without signifigantly
restraining performance. If it actually repeated, it could be confirmed in
double-checking quite easily.
As I don't know that much about searching algorithms, I don't know how much
this would hurt performance. Any thoughts? If this turns out to be workable,
is it still possible to implement in V19?
-Lucas
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
