Mersenne Digest Sunday, July 13 2003 Volume 01 : Number 1082
----------------------------------------------------------------------
Date: Sat, 12 Jul 2003 00:11:43 +0100
From: "Doug Feather" <[EMAIL PROTECTED]>
Subject: Mersenne: How do I find out if my DC work matches the original
What is the easiest way to check if an exponent I did a Double Checking test
on gave the same result as the original test?
If it didn't what how do I find out when a 3rd test of this exponent has run
and what the result of that was?
Doug.
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
------------------------------
Date: Sat, 12 Jul 2003 06:08:34 -0700
From: "Scott Gibbs" <[EMAIL PROTECTED]>
Subject: Mersenne: Speeding Up The Speediest Yet
This is a multi-part message in MIME format.
- ------=_NextPart_000_001D_01C3483C.069065B0
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
Dear Base:
By a twist of extraordinary luck I procured a 3GHz. P IV with 1 GByte of =
RAM which translates to 12 possible
1 million candidate tests per year. But I found a way to accelerate =
this behemoth even more!
By installing the www.memokit.com memory optimizer and setting the =
priority of PRIME95 to REALTIME,
I brought the .081 spec down to .063 at the very top of the Benchmark =
list. =20
Every little smidgin counts, eh?
Best Wishes,
Stefanovic
- ------=_NextPart_000_001D_01C3483C.069065B0
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=3DContent-Type content=3D"text/html; =
charset=3Diso-8859-1">
<META content=3D"MSHTML 6.00.2800.1170" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2>Dear Base:</FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>By a twist of extraordinary =
luck I=20
procured a 3GHz. P IV with 1 GByte of RAM which translates to 12=20
possible</FONT></DIV>
<DIV><FONT face=3DArial size=3D2>1 million candidate tests per =
year. But=20
I found a way to accelerate this behemoth even more!</FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>By installing the <A=20
href=3D"http://www.memokit.com";>www.memokit.com</A> memory optimizer and =
setting=20
the priority of PRIME95 to REALTIME,</FONT></DIV>
<DIV><FONT face=3DArial size=3D2>I brought the .081 spec down to .063 at =
the very=20
top of the Benchmark list. </FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>Every little smidgin counts, =
eh?</FONT></DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2></FONT> </DIV>
<DIV><FONT face=3DArial size=3D2>Best Wishes,</FONT></DIV>
<DIV><FONT face=3DArial size=3D2>Stefanovic</FONT></DIV>
<DIV> </DIV></BODY></HTML>
- ------=_NextPart_000_001D_01C3483C.069065B0--
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
------------------------------
Date: Sat, 12 Jul 2003 19:39:15 +0000
From: "Brian J. Beesley" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Speeding Up The Speediest Yet
On Saturday 12 July 2003 13:08, Scott Gibbs wrote:
> Dear Base:
>
> By a twist of extraordinary luck I procured a 3GHz. P IV with 1 GByte of
> RAM which translates to 12 possible 1 million candidate tests per year.
> But I found a way to accelerate this behemoth even more!
>
>
> By installing the www.memokit.com memory optimizer and setting the priority
> of PRIME95 to REALTIME, I brought the .081 spec down to .063 at the very
> top of the Benchmark list.
1) Assuming your system is otherwise idle, changing the priority should have
zero effect.
2) Again assuming your system doesn't run loads of other stuff, 128 MBytes is
more than sufficient for running LL tests in Prime95. More is useful for P-1
stage 2 and ECM, depending on the exponent.
3) I've no idea what the "memory optimizer" does, but any bigger change than
a few percent is most unlikely - unless you do something like overrrunning
the memory clock?
BTW I'm getting 0.084 benchmark for 1792K FFT run length on a 2.66 GHz P4
using dual-channel PC2100 DDR memory, e7205 chipset. 0.063 sounds about right
for a 3GHz system using dual-channel PC3200 DDR.
Regards
Brian Beesley
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
------------------------------
Date: Sat, 12 Jul 2003 13:15:12 -0700
From: Eric Hahn <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Re: Mersenne Digest V1 #1080
Robert Braunwart wrote:
>I'm having trouble with one of my computer contacting PrimeNet.
>It is supposed to connect every day, but hasn't connected for
>two weeks. I get the Error 29 message. I have looked at the
>explanation for Error 29 at PrimeNet, but none of the four
>possibilities apply to me. I am running Prime95 v. 21.4 and
>have not upgraded in a long time. Also, I have been running
>Prime95 on this computer for a long time. Any suggestions?
Bob...
The message forwarding service is still obviously down.... :-(
George was going to ask Scott if he could get Entropia to
restart the service again... about a week ago... It still
hasn't been apparently... since a number of clients I have,
haven't been able to contact the server since June 27th...
Hopefully, the service can be restarted in the next two
weeks... or there could be a considerable amount of
re-assignments of exponents by PrimeNet...
The best solution might be upgrading to v22, but again,
unfortunately, that may not be possilbe for a number of users,
who don't have access to certain clients anymore... In which
case, there COULD BE... a significant decrease in computing
power to the project.... :-(
Eric
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
------------------------------
Date: Sat, 12 Jul 2003 22:44:20 -0700
From: "John R Pierce" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Speeding Up The Speediest Yet
> > By installing the www.memokit.com memory optimizer and setting the
priority
> > of PRIME95 to REALTIME, I brought the .081 spec down to .063 at the very
> > top of the Benchmark list.
>
> 1) Assuming your system is otherwise idle, changing the priority should
have
> zero effect.
worse, running a 100% compute bound process thread at 'REALTIME' will
completely shut down ALL other processing including prime95's GUI.
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
------------------------------
Date: Sun, 13 Jul 2003 21:43:41 -0400
From: Pierre Abbat <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Squaring huge numbers
On Sunday 29 June 2003 03:24, Brian J. Beesley wrote:
> I don't know offhand, but:
>
> (a) Python is interpreted;
>
> (b) the Python interpreter is open source, so it shouldn't be hard to find
> out how it does big integer arithmetic;
>
> (c) you might also look for a dependence on the GNU multi-precision library
> (GMP) since that is an obvious candidate;
>
> (d) whatever method it's using doesn't seem to be very efficient - you have
> been running for 10 days to execute something which mprime/Prime95 would
> accomplish in a small fraction of a second.
I had the program output the time it took instead of the result of squaring.
It quadrupled each time after the 10th iteration, which means it's doing
shift-and-add the same way any child learns to multiply big numbers. I'm not
going to try dealing with roundoff error in FFT to square a number that's a
different size each time, so I'll just code up the method that triples the
time each iteration ((ax+b)^2=a^2*x^2+b^2+(a^2+b^2-(a-b)^2)*x). That'll be
fast enough for something that only occasionally produces a big number.
phma
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
------------------------------
End of Mersenne Digest V1 #1082
*******************************
