Mersenne Digest Monday, 15 March 1999 Volume 01 : Number 531
----------------------------------------------------------------------
From: Henrik Olsen <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 12:50:23 +0100 (CET)
Subject: Mersenne: Spontaneous account change
Hi,
I know this should really go directly to Scott, but I expect the
answer will be of interest to others as well.
I just found this in my logs:
Sat Mar 13 21:01:00 CET 1999
Factored M9800171 through 2103103380*2^32 (pass 7 of 16). Clocks: 27380465 = 0.078
sec.
Factored M9800171 through 3000335833*2^32 (pass 7 of 16). Clocks: 27308905 = 0.078
sec.
Contacting PrimeNet Server.
Sending expected completion date for M9800171: Mar 14 1999
ERROR 5: UserID/Password error.
A new userID and password will be generated.
Will try contacting server again in 60 minutes.
Factored M9800171 through 3897568285*2^32 (pass 7 of 16). Clocks: 27284773 = 0.078
sec.
Factored M9800171 through 508218862*2^32 (pass 8 of 16). Clocks: 21860074 = 0.062 sec.
Contacting PrimeNet Server.
Updating user information on the server
ERROR: Primenet error: 87
Will try contacting server again in 60 minutes.
Factored M9800171 through 1405451315*2^32 (pass 8 of 16). Clocks: 21154689 = 0.060
sec.
Factored M9800171 through 2302683767*2^32 (pass 8 of 16). Clocks: 27271026 = 0.078
sec.
Contacting PrimeNet Server.
Updating user information on the server
Sending text message to server:
UID: S05901/Navi, User: Henrik Oluf Olsen, [EMAIL PROTECTED]
Sending expected completion date for M9800171: Mar 14 1999
ERROR 17: Exponent not assigned to us.
Followed by all other assigned work being not assigned to this machine,
and new work being assigned.
>From what I read, something buggered up in the communication, which
resulted in the machine getting a new accountname, and dumping the work to
do. Following this, I checked, and the old work is still assigned to the
old account/machinename.
This happened to three of the six machines I run mprime on, at around the
same time, so I wonder if we're likely to see a large virtual jump in the
statistics with regards the number of accounts, without any actual reality
behind it, as well as a lot of stale assignments.
My solution has been to quit the new accounts from GIMPS, then recreate
the worktodo files manually from the account info on the old accounts
assignment report and regenerate the prime.ini file for the old
account from backup. So far it seems to work.
- --
Henrik Olsen, Dawn Solutions I/S
URL=http://www.iaeste.dk/~henrik/
Get the rest there.
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: [EMAIL PROTECTED]
Date: Sun, 14 Mar 1999 14:17:03 +0100 (MET)
Subject: Re: Mersenne: VME claim
> Henk Stokhorst writes:
>
> M(727) is not prime. VME made the claim that they could compute the
> first prime following M(727) in two seconds. Just want to know
> someone who can do the same trick and what software it takes.
>
> It took less than 2 seconds to find the next sequential prime :
>
> 7060034896770543742372772105511569658378384779628943811708504827156734575902
> 9962497646848024880749924272446637457099914453082421646959773690663827212173
> 6526607699022870679030143158018123175881930939339869708632591433883
>
> Well, that's only 156 more than M727, so finding it is easy; the
> obvious sieve will do it. Verifying it's at least pseudo-prime took
> the mers package's ecmfactor program only 1.27 seconds CPU on my Linux
> Pentium 200MHz just now, and proving it prime using Morain's ECPP
> program took all of 50.9 seconds.
>
> So, even if they are proving it prime, it's not a big advance.
>
> More to the point, a better test, since they're unwilling to reveal
> their method, would be to give them some large, strong pseudo-primes
> mixed in with known primes of similar size. Anybody care enough to
> produce such a set? The composite factors of prime exponent Mersennes
> are all base-2 pseudo-primes, but that's not enough; they should
> probably be Cunningham numbers (which are pseudo-prime to all bases
> that aren't related to their factors).
Do you mean Carmichael numbers ? Carmichael numbers are though not
strong pseudo - primes, since they might fail the strong psp test
already for the first base (the test was designed on this purpose).
Richard Pinch at Cambridge used to be a master of combining strong
psp's - but I think he left Cambridge ...
>
> The only stronger tests that I can think of are making the program
> available via a TCP/IP server of some sort, so people like us can give
> it arbitrary numbers to check in real time, and a rigorous proof of
> the method, which requires making it public.
>
I bet the last is highly sufficient ....
Sincerely
Preda
> Will
> ________________________________________________________________
> Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: "Aaron Blosser" <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 08:36:36 -0700
Subject: RE: Mersenne: Spontaneous account change
> Hi,
> I know this should really go directly to Scott, but I expect the
> answer will be of interest to others as well.
>
> I just found this in my logs:
> ERROR 5: UserID/Password error.
> A new userID and password will be generated.
> Will try contacting server again in 60 minutes.
> Contacting PrimeNet Server.
> Updating user information on the server
> ERROR: Primenet error: 87
> Will try contacting server again in 60 minutes.
> Contacting PrimeNet Server.
> Updating user information on the server
> Sending text message to server:
> UID: S05901/Navi, User: Henrik Oluf Olsen, [EMAIL PROTECTED]
> Sending expected completion date for M9800171: Mar 14 1999
> ERROR 17: Exponent not assigned to us.
> This happened to three of the six machines I run mprime on, at around the
> same time, so I wonder if we're likely to see a large virtual jump in the
> statistics with regards the number of accounts, without any actual reality
> behind it, as well as a lot of stale assignments.
>
> My solution has been to quit the new accounts from GIMPS, then recreate
> the worktodo files manually from the account info on the old accounts
> assignment report and regenerate the prime.ini file for the old
> account from backup. So far it seems to work.
I had the exact same problem yesterday.
About 4-5 of my instances of NTPrime checked in yesterday, but only one of
those did this, so there must have been a certain time window where this
happened.
I was able to fix it a little easier by running NTSetup on the affected
instance and setting my userid/password back which resulted in the program
telling Primenet to switch back/rename the user again. It credited the
result for that LL test back to my real account and removed it from the new
one it created.
At first I thought somebody else had modified my prime.ini file, but now
that I see someone else had a problem, I guess it wasn't on my end after
all.
However, I didn't check to see if it unassigned any exponents and assigned
new ones...I'll have to look into that some more.
Aaron
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Dan Jue <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 11:28:21 -0500 (EST)
Subject: Mersenne: Re: Dual Processing
Hello,
Please excuse my ignorance, but i was unable to find this information elsewhere.
When running 2 PrimeNT services on my dual PPro200, will the programs
work together on for calculating a set primes, or must I have different
sets of numbers in my worktodo.ini file? (ie one unique set per
processor)
Should the results.txt automatically be generated by the each
PrimeNT program(in separate directories)?
Also, when running the program in Linux (RH 5.0), will I need to run two
jobs of the program?
Thank you!
Best Regards,
<*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*>
<*> Dan Jue, CMSC UMCP <*> Linux '99 <*>
<*> <*> ReSiTaNcE iS FuTiLe! <*>
<*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*><*>
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Henk Stokhorst <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 19:57:33 +0100
Subject: Re: Mersenne: Spontaneous account change
Aaron Blosser wrote:
> > Hi,
> > I know this should really go directly to Scott, but I expect the
> > answer will be of interest to others as well.
> >
> > I just found this in my logs:
>
I had a similar problem just a month ago. When I requested my stats overview
from the server it turned out to be different from my worktodo.ini. Some
exponents (I only do factoring) had disappeared from the server. It was
explained to me as an one time error that whiped out all assignments from the
server more than 60 days ago assigned. Instead of 60 days + expected time to
complete. However all my assignments were less than 10 days old.
YotN,
Henk Stokhorst.
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: "Nicolau C. Saldanha" <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 09:00:15 -0300 (EST)
Subject: Re: Mersenne: Banach-Tarski and Spheres
On Sat, 13 Mar 1999, Joth Tupper wrote:
> I am beginning to feel sorry for starting these threads, especially as they
> are off topic. ...
Well, off topic it is, but I would like to add a few remarks for the
benefit of the curious who might not know about the theorem yet.
...
> Take two solid 3 dimensional spheres S1 and S2 of unequal volume (i.e.,
> different radii). The volumes can be as different as you wish -- Newman
> suggests taking one the size of a pea and the other the size of the sun.
> You can divide S1 into finitely many (n) disjoint pieces A1,A2,...,An and
> S2 into finitely many disjoint pieces B1,B2,...,Bn such that (after
> suitable rearranging, if needed), A1 is congruent to B1, A2 is congruent
> to B2, and so on until An is congruent to Bn. [Note that the word
> "congruent" applies -- not merely "similar".]
...
The way I prefer to state the theorem is that the pieces Ai are moved,
i.e., rotated and translated; Bi is just Ai in a different position.
Also, you do not need to use spheres: any bounded subsets of R3 with
non-empty interior will do: you may cut any small stone into finitely many
pieces and rearrange them (as if they were pieces of a 3D jig-saw puzzle)
in order to produce a real-size replica of your favorite sculpture.
The same theorem (with practically the same proof) applies to any Rn, n>2.
For R2, however, this does *not* work: you can not cut a measurable subset
of the plane and rearrange the pieces in order to obtain a measurable set
of different area. However, you *can* cut a round disk into finitely many
parts and rearrange them to obtain a square of equal area.
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Charles Rezk <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 13:17:23 -0600
Subject: Re: Mersenne: Spontaneous account change
> > ERROR 5: UserID/Password error.
> > A new userID and password will be generated.
> > Will try contacting server again in 60 minutes.
>
> I had the exact same problem yesterday.
This happened to me too yesterday. The FAQ on www.entropia.com
mentions this spontaneous-account-changing as a phenomenon that can
happen to Prime95/98/NT, but I'm running under Linux.
I reset the original password/account data in prime.ini (good thing I
was able to find an old backup of this file!) and restarted; it went
back to work as usual ...
- -- Charles
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Rudy Ruiz <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 15:32:44 -0800
Subject: Mersenne: Re: Mersenne Digest V1 #530
- --------------45CD7CFC9ADD1154ABB837EB
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
From: Will Edgington <[EMAIL PROTECTED]>
> The composite factors of prime exponent Mersennes
> are all base-2 pseudo-primes, but that's not enough; they should
> probably be Cunningham numbers (which are pseudo-prime to all bases
> that aren't related to their factors).
>
>
I think those are called "Carmichael Numbers"
From: http://www.utm.edu/research/primes/glossary/CarmichaelNumber.html
> The composite integer n is a Carmichael number if an-1=1
> (mod n) for every integer a relatively prime to n. (This condition
> is satisfied by all primes because of Fermat's Little Theorem.)
> The Fermat probable primality test will fail to show a Carmichael
> number is composite until we run across one of its factors!
> Although Carmichael numbers are rare, only 2,163 are less than
> 25,000,000,000, it has recently been shown that there are
> infinitely many of them.
>
- --------------45CD7CFC9ADD1154ABB837EB
Content-Type: text/html; charset=us-ascii
Content-Transfer-Encoding: 7bit
<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
<html>
From: Will Edgington <[EMAIL PROTECTED]>
<br>
<blockquote TYPE=CITE>
<pre> The composite factors of prime exponent Mersennes
are all base-2 pseudo-primes, but that's not enough; they should
probably be Cunningham numbers (which are pseudo-prime to all bases
that aren't related to their factors).
</pre>
</blockquote>
<p><br>I think those are called "Carmichael Numbers"
<br>
<p>From: <A
HREF="http://www.utm.edu/research/primes/glossary/CarmichaelNumber.html">http://www.utm.edu/research/primes/glossary/CarmichaelNumber.html</A>
<br>
<blockquote TYPE=CITE>
<pre><b><i><font
size=-1>
The composite integer n is a Carmichael number if an-1=1
(mod n) for every integer a relatively prime to n. (This condition
is satisfied by all primes because of Fermat's Little Theorem.)
The Fermat probable primality test will fail to show a Carmichael
number is composite until we run across one of its factors!
Although Carmichael numbers are rare, only 2,163 are less than
25,000,000,000, it has recently been shown that there are
infinitely many of them.</font></i></b></pre>
</blockquote>
<br> </html>
- --------------45CD7CFC9ADD1154ABB837EB--
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: "david campeau" <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 17:13:43 PST
Subject: Re: Mersenne: Spontaneous account change
>
>This happened to me too yesterday. The FAQ on www.entropia.com
>mentions this spontaneous-account-changing as a phenomenon that can
>happen to Prime95/98/NT, but I'm running under Linux.
>
This is all the work done, submissioned by the Prime95 client, starting
on March 13 19:00. I've removed a couple of column to make it more
readable.
6622523 [snip] 13-mars-99 18:57 jobhopper
2374109 [snip] 13-mars-99 18:57 telos BDC
1921013 [snip] 13-mars-99 19:00 tweak trout
6425647 [snip] 13-mars-99 22:27 finlayson raglan
6350017 [snip] 13-mars-99 22:27 S05688 quark
5560007 [snip] 13-mars-99 22:28 madpoo pcyy2k-4
6914161 [snip] 13-mars-99 22:28 S05696
5549569 [snip] 13-mars-99 22:28 S05700 AL22190
6638669 [snip] 13-mars-99 22:28 S05707 fg09a
2165533 [snip] 13-mars-99 22:28 S05721
2263213 [snip] 13-mars-99 22:28 S05723 Edison
6709823 [snip] 13-mars-99 22:28 S05732 Work2
2335253 [snip] 13-mars-99 22:28 S05734 terminator
6744169 [snip] 13-mars-99 22:29 S05737 lepton0
6235961 [snip] 13-mars-99 22:29 S05739 SKOMER
6772033 [snip] 13-mars-99 22:29 S05743 AL21146
2517631 [snip] 13-mars-99 22:32 S05790 X-90
6693487 [snip] 13-mars-99 22:32 S05791 lb
6768889 [snip] 13-mars-99 22:33 tarnold cypraea3
1876289 [snip] 13-mars-99 22:34 AMD_Man K6333
2509181 [snip] 13-mars-99 22:34 S05799 melissa
6312641 [snip] 13-mars-99 22:35 nevek Rm215
2314643 [snip] 13-mars-99 22:35 r_eckhard Datentechnik
5027713 [snip] 13-mars-99 22:36 glcross WIZARD
6889541 [snip] 13-mars-99 22:39 eben_visher
6777497 [snip] 13-mars-99 22:39 S05831 Linus
6236051 [snip] 13-mars-99 22:40 S05840 P400_Sylmar
9201391 [snip] 13-mars-99 22:41 qazz 300p2
2305969 [snip] 13-mars-99 22:44 S05853
2423489 [snip] 13-mars-99 22:45 S05856 OS_2
6814663 [snip] 13-mars-99 22:46 lcooksey
5881783 [snip] 13-mars-99 22:47 TempleU-CAS Al22159
2347663 [snip] 13-mars-99 22:48 DUnderbakke psalm119
6798359 [snip] 13-mars-99 22:49 S05870 Jupiter200
6798739 [snip] 13-mars-99 22:49 S05873 withbill
1611877 [snip] 13-mars-99 22:50 S05875 Ebi
2510149 [snip] 13-mars-99 22:54 haveland temp01
6855229 [snip] 13-mars-99 22:57 S05900 Compaq
6876811 [snip] 13-mars-99 22:58 curtisc ed
2422543 [snip] 13-mars-99 23:05 S05924 ms
2293549 [snip] 13-mars-99 23:06 TeamSymix vega
6099941 [snip] 13-mars-99 23:09 S05943
2273041 [snip] 13-mars-99 23:11 S05948 P133
5560069 [snip] 13-mars-99 23:15 madpoo rhdy2k-3
6938681 [snip] 13-mars-99 23:17 S05964 CHRIS
6258979 [snip] 13-mars-99 23:23 malmrose 6
6953407 [snip] 13-mars-99 23:24 S05984
5820371 [snip] 13-mars-99 23:24 S05985
2510303 [snip] 13-mars-99 23:25 haveland temp02
4113719 [snip] 13-mars-99 23:28 44
As you can see in the space of 3 hour, more than 300 account have been
created. My conclusion is that anybody who contacted Primenet between
19:00 and 22:30 UTC had there account changed?
David,
Get Your Private, Free Email at http://www.hotmail.com
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: "Scott Kurowski" <[EMAIL PROTECTED]>
Date: Sun, 14 Mar 1999 18:15:00 -0800
Subject: Mersenne: RE: Meganet's Primality Code
Hi all,
About a month ago I invited Meganet to show me their primality
program, a small subcomponent of VME. Saul stopped by our office. I
echoed the Mersenne list's skepticism, but suggested independent peer
review might buy Meganet better credibility. I don't necessarily
support Meganet's claims but thought being open minded enough to
invite concrete results would clear the air.
I signed a simple NDA, the same that up to three other reviewers I
choose will sign to try the program and examine/modify/compile the
code. I have not yet received a copy of the source code, pending
further progress on their patent application.
He walked me through the code, explained the algorithm and described
how it was developed with Milstein. The program was simple - a few
pages - and uses a public domain integer math package. I'm tough to
snow and didn't detect any B.S. as we reviewed its internals, but I'm
no math expert, either.
I can say, loosely, that the 'T-sequence' primality test is actually a
family of four related complementary algorithms performed in series,
any of which can reject a number as composite, but if all four pass
the number is supposedly prime.
One claim Saul made (and showed on paper to my unqualified eyes to
verify) was that pinning the coefficients of the 'T-sequence' to a set
of specific values causes it to degenerate into the LL series. Saul
also claimed the algorithm detects and rejects strong pseudo-primes as
composite, and showed some examples with the program (I don't recall
what they were).
>The number n=4^7057-3 has been proved prime by cyclotomy: with 4249
>decimal digits, it is currently the largest prime proved with a
>general prime proving algorithm. The main stage of the proof took 6
>hours, the final "Lenstra - gcd and trial division" step (allowing a
>factored part of O(n^{1/3}) took roughly 2 days.
Luke invited me to try the Meganet program on 4^7057-3. It reported
the number as prime in 33 minutes on my PPro 200, with a bunch of
other apps going at the same time.
> M(727) is not prime. VME made the claim that they could
> compute the first prime following M(727) in two seconds.
I tried this on my PPro 200 and reproduced the composite result < 2
seconds.
> Well, that's only 156 more than M727, so finding it is easy; the
> obvious sieve will do it. Verifying it's at least pseudo-prime took
> the mers package's ecmfactor program only 1.27 seconds CPU
> on my Linux
> Pentium 200MHz just now, and proving it prime using Morain's ECPP
> program took all of 50.9 seconds.
>
> So, even if they are proving it prime, it's not a big advance.
I thought I'd try this, too:
M(727)= 70600348967705437423727721055115696583783847796289
4381170850482715673457590299624976468480248807499242724466
3745709991445308242164695977369066382721217365266076990228
70679030143158018123175881930939339869708632591433727
(pasted output)
Composite:
Start: 1999/03/14-12:05:33
Finish: 1999/03/14-12:05:33
(end output)
I had the program find the next 5 primes, in 37 seconds:
(pasted output)
Prime: 70600348967705437423727721055115696583783847796289
4381170850482715673457590299624976468480248807499242724466
3745709991445308242164695977369066382721217365266076990228
70679030143158018123175881930939339869708632591433883
Prime: 70600348967705437423727721055115696583783847796289
4381170850482715673457590299624976468480248807499242724466
3745709991445308242164695977369066382721217365266076990228
70679030143158018123175881930939339869708632591434057
Prime: 70600348967705437423727721055115696583783847796289
4381170850482715673457590299624976468480248807499242724466
3745709991445308242164695977369066382721217365266076990228
70679030143158018123175881930939339869708632591434109
Prime: 70600348967705437423727721055115696583783847796289
4381170850482715673457590299624976468480248807499242724466
3745709991445308242164695977369066382721217365266076990228
70679030143158018123175881930939339869708632591435431
Prime: 70600348967705437423727721055115696583783847796289
4381170850482715673457590299624976468480248807499242724466
3745709991445308242164695977369066382721217365266076990228
70679030143158018123175881930939339869708632591436901
Start: 1999/03/14-12:08:49
Finish: 1999/03/14-12:09:26
(end output)
> More to the point, a better test, since they're unwilling to reveal
> their method, would be to give them some large, strong pseudo-primes
> mixed in with known primes of similar size. Anybody care enough to
> produce such a set? The composite factors of prime exponent
> Mersennes are all base-2 pseudo-primes, but that's not enough; they
> should probably be Cunningham numbers (which are pseudo-prime to all
> bases that aren't related to their factors).
I'd be happy to try some of these and report what happens. The
program is easiest to use if the number to be tested is built by
formulation, but it can also read ascii digits from a text file.
> The only stronger tests that I can think of are making the program
> available via a TCP/IP server of some sort, so people like
> us can give it arbitrary numbers to check in real time, and a
> rigorous proof of the method, which requires making it public.
Hooking up its rather interactive DOS UI is a hassle, but it's a great
idea.
I had planned to get the code before asking the list for a few folks
interested in taking a crack at finding a flaw in it. We get only
three evaluations under NDA. Maybe we can use one up to hook it up on
a server under a web form in kind of constrained batch mode. Any
takers? Please email me privately.
Regards,
scott
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Joth Tupper <[EMAIL PROTECTED]>
Date: Mon, 15 Mar 1999 00:03:51 -0500
Subject: Mersenne: Spontaneous account creation
Well,
I just took a look at one of my machines and found that my account has been
hosed like many others.
This took place 3/15/99 at about 3:30 UTC (about 1.5 hours ago for me).
Aaron Blosser outlined a way to correct the problem manually, but I do not
understand the steps.
Can someone in the know spell it out in detail please?
The report just generated is below:
- ---------------------------------------------------------------------------
- ---------------------------------------------------------------------------
- ----------
Divide by zero occurred.
Mersenne PrimeNet Server 4.0 (Build 4.0.017)
Individual Account Report 15 Mar 1999 04:52 (Mar 14 1999 8:52PM Pacific)
All dates and times are Coordinated Universal Time (UTC)
Account ID LL P90* Exponents Fact.P90 Exponents P90 CPU
CPU yrs LL Tested CPU yrs* w/ Factor hrs/day
- -------------- ------- --------- -------- --------- -------
S06078 0.000 0 0.001 0
Contact name : Joth Tupper
Contact e-mail : [EMAIL PROTECTED]
Receive e-mail : YES
Last activity : 15 Mar 1999 03:35 UTC
Account created: 15 Mar 1999 03:34 UTC
------- Machines Assigned to PrimeNet -------
Unspecified type : 1
- ---------------------- -------
TOTAL, uniquely named : 1
------- Exponents Assigned -------
Assignment overdue check-in is set at 60.0 days (-60.0 days to go)
prime fact current days
exponent bits iteration run / to go date updated date assigned
computer ID
- -------- -- ---- --------- ----------- --------------- ---------------
- ------------
2513011 D 59 5.6 8.4 15-Mar-99 03:34 09-Mar-99 13:17
gw2k
2513033 D 59 5.6 17.5 15-Mar-99 03:35 09-Mar-99 13:17
gw2k
Lucas-Lehmer testing : 0
Factoring only : 0
Double-checking LL : 2
- ---------------------- -------
TOTAL : 2
------- Exponents Cleared since last Synchronization -------
Factored composite : 0
Lucas-Lehmer composite: 0
Double-checked LL : 0
- ---------------------- -------
TOTAL : 0
*P90 CPU time according to Woltman/Kurowski formulation. Calibrated by
benchmark P5 90Mhz, 32.98 MFLOP units: 25658999 FLOP/0.778s (256k FFT).
(c)1997-1999 Entropia.com
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: "Brian J Beesley" <[EMAIL PROTECTED]>
Date: Mon, 15 Mar 1999 09:33:20 GMT
Subject: Re: Mersenne: Spontaneous account creation
> I just took a look at one of my machines and found that my account has been
> hosed like many others.
> This took place 3/15/99 at about 3:30 UTC (about 1.5 hours ago
> for me).
>
> Aaron Blosser outlined a way to correct the problem manually, but I do not
> understand the steps.
> Can someone in the know spell it out in detail please?
I assume you're using Prime95 ... if you're using NTPrime, the
procedure is similar (use NTSetup to make the neccessary
changes), you should probably stop the prime service (from control
panel/services) before starting to fiddle, start it again when you're
done. Sorry, I don't know the procedure for mprime. Edit prime.ini, I
guess.
1. Go into the "Test/User Information" submenu and change the
user ID and password back to what they used to be. The program
should contact the PrimeNet server and update the user info. This
fixes any results which you have sent in belonging to the
"spurious" user.
2. You may also want to fix your worktodo.ini file. (Though this is
not essential. Any "lost" exponents will eventually time out and be
reassigned. You will not have been working actively on these, so
you are not losing credit).
The first thing to do is to get your personal account info off the
server. Having done that, check which exponents are logged
against your account which are no longer in your worktodo.ini file. If
you find none, you need take no action.
Having done that, you can *either* use the manual testing pages to
release those exponents, *or* edit the appropriate data into your
worktodo.ini file (the place to put them is just after the first line).
The personal account info contains the neccessary detail (test
type, exponent & factoring depth)
N.B. you must stop Prime95 whilst editing worktodo.ini, else
Prime95 will overwrite your edits ... use the "Stop" option in the
Test menu, edit worktodo.ini then use "Continue".
Having done that, it might be a good idea to force an update (check
"Send new completion dates" in Test/PrimeNet), after the server
has been contacted then re-check your personal account report.
You may find that Prime95 "throws back" some exponents ... this
is normal, if it finds that you have too much work queued up (as a
consequence of grabbing some more work when worktodo.ini got
bombed by the server problem).
Regards
Brian Beesley
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
End of Mersenne Digest V1 #531
******************************
