of this method (or another) that would be feasible to
run on a home PC or Unix workstations?
Foghorn Leghorn
[EMAIL PROTECTED]
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com
On Sun, 23 Jan 2000 02:06:26 +0100 (CET), you wrote:
MPQS is ok for numbers up to about 100 digits, at which time NFS takes
over.
Is there a good implementation of this available online?
Have a look at Conrad Curry's NFSNET,
http://orca.st.usm.edu/~cwcurry/nfs/nfs.html
Foghorn Leghorn
[EMAIL
could be wrong.
Foghorn Leghorn
[EMAIL PROTECTED]
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
On Sat, 21 Aug 1999 00:15:57 -0400, you wrote:
(No, I won't buy an assember. An assembLer, on the other hand ;-) )
What month comes after Assember?
I think it's Dectembruary. (Or is that just on the Julian calendar?)
Foghorn Leghorn
[EMAIL PROTECTED
The GIMPS project may be in for some serious competition for America's CPU
time now, as ABC news did a story last night on the SETI project and the
impending release of software for Mac and Wintel systems. Which do you
suppose will sound more appealing to the average person--"the search for
At Paul Zimmerman's ECM page,
http://www.loria.fr/~zimmerma/records/ecmnet.html
the optimal B1 value listed for finding 50-digit factors is 4300, but
George's ECM factoring page uses 4400 for the same purpose. Is one of
them wrong, or is there a reason for the difference?
Don't think I didn't try this (and a number of similar ideas). The
problem was that the forked copy of Prime95 doesn't seem to start
executing until ReCache completes. Either that or ReCache
suspends itself until Prime95 completes - *most* unsatisfactory to
hog all that memory long-term...
Thanks for the responses to my suggestion on this topic. Brian Beesley's
ReCache code was very helpful. It doesn't lower the best possible iteration
time attainable on my machine, but it does provide a reliable way to get it.
In fact, I found that there is only a marginal difference between
When I first got Windows 95 almost four years ago, I discovered by
accident that command.com, the DOS command processor, can be used as
the Windows GUI shell. When I remembered this recently, I realized
that it could be useful for some people running Prime95 on machines
that otherwise go
From: Paul Leyland [EMAIL PROTECTED]
You are merely restating a law of nature. After a point, everything
becomes useless.
I am reminded of a quote from Homer Simpson: "Trying is the first
step toward failure." :)
A question for George (and Scott): Is there any chance that Prime95's
ECM
George Woltman wrote:
The bug was in the routine mulmod which was supposed to compute a * b
mod c
The implementation was a rather sloppy:
unsigned long tmp;
tmp = a * (b 0x3FF);
tmp += ((a 10) % c) * (b 10);
return (tmp % c);
You can see in the first
I recently received an unusually small assignment--around 4.8
million--and I'm wondering if it would be okay to start it sooner by
moving the relevant entry in worktodo.ini to the second line, right
after the current test in progress. Is there anything wrong with this?
Chris Caldwell's web page on Mersenne numbers descirbes the Lucas-Lehmer
test briefly and mentions that it is quick on binary computers because
they can quickly perform division by 2^n-1. I know how to find integer
quotients and remainders modulo 2^n with shifting and masking, but I
don't
From: Paul Leyland [EMAIL PROTECTED]
My home box is on the web only very intermittently. It finished a LL
test
several days ago and did not have another exponent ready to test, so I
set
it going on some ECM factoring.
I run ECM with a separate copy of Prime95, stored in its own directory.
The library gmp (GNU multi-precision) uses this algorithm
although it is much slower than FFT-like methods.
Maybe because it only involves integers,
and there is no danger at all of rounding errors.
I once wrote a gmp-based program to perform LL tests:
for low exponents it worked fine but for the
First, I have noticed that recent versions of Prime 95 append an entry
to the results file when iteration 500 of an LL test is reached. Why
is this?
Second, I see that there are now some composite exponents in the ECM
factoring page. Why are none of them even? Is there a technical reason
16 matches
Mail list logo
