Re: Mersenne: More error info
And once more, reworked for short lines and monospace font: Number of errors reported badgooderror_rate 1 314 625 33.4% 2 192 135 58.7% 3 107 63 62.9% 4 74 36 67.3% 5 53 17 75.7% 6 48 20 70.6% 7 31 7 81.6% 8 30 10 75.0% 9 17 10 63.0% 10 25 2 92.6% >10375 58 86.6% -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Do not meddle in the affairs of dragons, for you are crunchy and taste good with ketchup. _ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Work being wasted
On Mon, 4 Feb 2002, Robin Stevens wrote: > On Sun, Feb 03, 2002 at 08:06:27PM -, [EMAIL PROTECTED] wrote: > > As for Mary's current predicament, with that block of small > > exponents you have, my best suggestion is to reverse the order of > > the lines in worktodo.ini so that the _largest_ ones are done first. > > Intermediate checkins to PrimeNet will then cause unstarted > > assignments which are no longer neccessary to be automatically > > removed. > > Of course if one _keeps_ doing this, then the smallest exponents never get > processed (and perhaps they become more likely to be poached) :-) The idea here wasn't that you'd never get the small ones done, but that if someone else finished one of them out of order, it would be removed from your reserved numbers without you wasting any work on it. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ That seems to point up a significant difference between Europeans and Americans. A European says: "I can't understand this, what's wrong with me?" An American says: "I can't understand this, what's wrong with him?" Terry Pratchett on alt.fan.pratchett _ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: SV: Mersenne: Strange factor arrived though not calculating it
On Thu, 2 Nov 2001, Torben Schlüntz wrote: > On Fri, 2 Nov 2001, Greg Hogan wrote: > > On Fri, 2 Nov 2001, Torben Schlüntz wrote: > > 2*3*5*7*11*13*17*19*23*29*31-1 is prime > > I am getting 200560490129 = 228737 * 876817. > > Greg Hogan On the other hand, 2*3*5*7*11*13*17*19*23*29*31+1 _is_ prime as is 2*3*5*7*11*13*17*19*23*29*31*37*39-1 so you could just use one of those. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Holder of the special bastard visionary award for debugging unreleased code. (At least according to Sean MacGuire) _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Exponent already completed?
What probably happened is that the exponent was first assigned to another, whose machine didn't check in in 60 days, which meant the exponent got reassigned to you. The original machine then finished the check and send in the result. You don't need to do anything, once your machine finish it'll send in the result and you'll get credited with a doublecheck and the full CPU time. On Thu, 19 Oct 2000, Siegmar Szlavik wrote: > Hi, > > same problem here... exponent 10590059. Working on it since 3 weeks or so. > Is it safe to leave the machine untouched, ignore the error messages and > let it finish the exponent or do I have to make some changes to the .ini files > to be sure the server doesn't reject the exponent when the work is done? > > Siegmar > > > One of my machines just dropped off my assigned machine list. Also > > that machine is saying "ERROR 11" Exponent already completed. > > > > How did this happen? This machine has been working on this exponent > > for two weeks. > > > > The exponent is 10544533. I checked the competed exponent list and > > the user "LAKE_COMMS" claims to have completed it on Oct 5th. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ "'Chapter Fifteen, Elementary Necromancy'", she read out loud. "'Lesson One: Correct Use of Shovel...'" Terry Pratchett, Jingo _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Re: Mersenne: Re: Top Producers
On Thu, 24 Aug 2000, Russel Brooks wrote: > Brian J. Beesley wrote: > > PrimeNet credits you with CPU time if you use the automatic method to > > report the result of an assignment but not if you use the manual > > assignment form. It doesn't matter whether you got the assignment > > using the automatic method or using the manual assignment form. > > If I screw around with... > > Prime95->Options->CPU->Hours_per_day_this_program_will_run > > ...does his affect the hours I'm credited with? No, it's desided by the size of the number exclusively, and is scaled to the same machine for everyone. > I tried it setting low, 8 instead of 24, just before letting Prime95 > request more work in the hope it would assign smaller exponents that > would finish quicker but I'm not sure I had any effect. You didn't, the server will always give you the smallest assignment it has available, as several have mentioned the pool of assignments is replenished at 6 UTC > > Am I just out smarting myself? Yes. Actually, prime95 will adjust for the real time used after a while, try taking a look at local.ini, the value of RollingAverage is the actual work done, compared to the settings you've given. (1000 is the nominal value) > > Cheers... Russ -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ "'Chapter Fifteen, Elementary Necromancy'", she read out loud. "'Lesson One: Correct Use of Shovel...'" Terry Pratchett, Jingo _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Re: ot: p3 motherboards (was Re: Mersenne: Date: Sun, 30 Jul 2000 18:53:50 +0200)
On Tue, 1 Aug 2000, Stefan Struiker wrote: > For a good review of the ASUS CUSL2 and how it compares to other > popular mobos (overclocking stats are included), see: > > http://www.gamepc.com/reviews/hardware_review.asp?review=cusl2&page=1 > > GamePC uses P95 as their 24-hour burn-in torture test before shipping every unit. They may be ok there, but boy, how they write bad html. :) [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] GamePC [shim.gif] [shim.gif] [header-reviews.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [layout_r06_c07.gif] [layout_r06_c08.gif] [layout_r06_c09.gif] [layout_r06_c10.gif] [layout_r06_c11.gif] [layout_r06_c12.gif] [layout_r06_c13.gif] [layout_r06_c14.gif] [layout_r06_c15.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [layout_r09_c01.gif] [layout_r09_c02.gif] [layout_r09_c03.gif] [shim.gif] [shim.gif] [layout_r10_c05.gif] [shim.gif] [shim.gif] [shim.gif] [shim.gif] [leftbar_r01_c1.gif] [shim.gif] [shim.gif] [shim.gif] [leftbar_r03_c1.gif] [shim.gif] [leftbar_r04_c1.gif] [shim.gif] [leftbar_r05_c1.gif] [shim.gif] [leftbar_r06_c1.gif] [shim.gif] [leftbar_r07_c1.gif] [shim.gif] [leftbar_r28_c1.gif] [shim.gif] [leftbar_r08_c1.gif] [shim.gif] [shim.gif] [shim.gif] [leftbar_r10_c1.gif] [shim.gif] [leftbar_r11_c1.gif] [shim.gif] [leftbar_r12_c1.gif] [shim.gif] [leftbar_r13_c1.gif] [shim.gif] [leftbar_r15_c1.gif] [shim.gif] [leftbar_r16_c1.gif] [shim.gif] [leftbar_r17_c1.gif] [shim.gif] [shim.gif] -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Covenant: I am the savior of The Land. Linden Avery: Can I help? Thomas Covenant: Over my dead body.(dies) (Linden Avery saves The Land.) The Second Chronicles of Thomas Covenant, Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Re: Mersenne: Algorithm improvements?
On Sun, 16 Jul 2000, Dave Mullen wrote: > I think the next true breakthrough on LL testing will only come when > someone finds how to do an FFT or other transform without the need to > "spread" the 2^N-1 values into a 2^N FFT space (my terminology might > be bad, I hope you know what I mean) - and avoid the floating point > inaccuracies (and the subsequent required error checking) - anyone > done any more reseach on the NTT or similar integer transforms ? Already being used in mprime/prime95, with Crandall's algorithm the convolution is tightly packed and the modulus is given for free. Also, a floating point algorithm is used because modern processors does more bits accurately in the same time with floats than with integers, even if you have to throw some bits away with floats. As a result integer algorithms are slower on current hardware, so is used mainly to validate the floating point algorithm implemementations. > I did have a "play" with NTTs, in an attempt to try and do more that > one iteration per forward and reverse transform, but found the > difficulty is finding a big enough prime with suitable roots to cope > with the magnitude of numbers ^2, never mind ^4 ! > > Dave -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Linux isn't at war. War involves large numbers of people making losing decisions that harm each other in a vain attempt to lose last. Linux is about winning.Alan Cox on linux-kernel _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Re: Mersenne: LOST NUMBERS
On Sat, 17 Jun 2000, Lem Novantotto wrote: > On Sat, 17 Jun 2000 05:37:06 -0400, in Mersenne_mailing_list you > wrote: > >Is all your hard work(and subsequent credit) lost? No, although the server > >has already re-assigned them to another account it will still accept the > >results and properly credit your account for the completed work. > > Hi! > I think it would be nice to post the mersenne numbers you're still > working to, and that have been reassigned, so, hopefully, the new > tester can read them and stop his testing. Otherwise HE is going to > loose time and credit. Since first and double checks are credited equally(as far as I know), both should get credited with the same amount of work except for counting tests. Time spent on a doublecheck is only wasted if it's turned into a triplecheck and all three results agree. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ ZOOLOGY, n. The science and history of the animal kingdom, including its king, the House Fly (Musca maledicta).The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Clarification on M#39, M#40, M727...
On Tue, 6 Jun 2000, Eric Hahn wrote: > > Second, the type of information I've received concerning the > statistical data I've received (and is contained in the data), > is of a statistical probability nature. For example(s): > M14,989,627 has a 93.42% probability of having a 53-bit factor. Did you remember to exclude the fact that M14,989,627 HAS a 53-bit factor from the dataset used to calculate this probability? > M14,999,953 has a 9.31% probability of having a 53-bit factor. > > M101 has a 89.17% probability of having 2 factors. > M101 has a 73.25% probability of having highly compositable factors. When getting to this probability, was the datapoint that M101 HAS 2 factors removed, or was it included in the statistical set used to calculate this probability? > M113 has a 92.36% probability of having 5 factors. > M113 has a 64.03% probability of having highly compositable factors. When getting to this probability, was the datapoint that M113 HAS 5 factors removed, or was it included in the statistical set used to calculate this probability? > NOTE: These are just examples that I've come up with to give an > idea of the nature of the data (which I used previously known > information to create). I don't even know if the data is stored > in such a manner or is interpreted to this manner... What's the algorithm used to come up with these probabilities? Remember that it's very easy to accidentally fool yourself into seeing patterns where none are, unless you're very careful not to use preexisting knowledge for generating the predictions you test agains it. > Since these are statistical probablilities, I can't even > guarantee the accuracy of the data. However, in a test run > that was made to validate the data (not by me, mind you), Ah, sorry, the questions I ask you is for the people who did the run then, but they're still relevant. > approx. 436 exponents that had high probability to have a > 53- or 54-bit factor was tested and 401 had a 53- or 54-bit > factor found! There's no telling how many exponents in the > range tested have a factor of this size which wasn't tested > due to a lower probability... > > One last thing... The data is based on current information > as of 4-6 weeks ago, some of which may have changed. It > "predicts" information that isn't known as of that date, such as > # of factors in M727 and M751, range where M#39 and M#40 is, > etc. (which was why I had the subject I did). > > If anybody has further questions or is still confused, let > me know and I'll try to clarify some more... > > Again, the ideas, suggestions, comments, etc. I'm looking for > covers these areas and ???: > 1) Should I post a *tiny* fragment of this information? > 2) What information should I post, if I do? > 3) Would it be beneficial to the overall effort? > 4) Would it divert resources that could be used better otherwise? > 5) Could it cause problems with regard to that "p" hunting term? > 6) Anything else?? > > Eric > > > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ What is worth doing is worth the trouble of asking somebody to do it. The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: M#36 & M#37
> > If there's a sudden burst of these incidents, maybe something > > external is to blame. Maybe a virus infecting Prime95 or one of the > > DLLs it uses; could also be something hitting the comms routines in > > Windows. It's perhaps not coincidental that the PrimeNet server seems > > to have been having problems recently. > > > I saw it happening earlier today. The server seems to be > > going through some periodic difficulties. > > Actually, there are some mighty things happening at Entropia and we are > doing a lot of server and network work. PrimeNet was simply offline on and > off as this work happened - sorry for that inconvenience. The recent phase > of cutovers is complete; the next phase will be several weeks from now. Any chance an announcement can be posted here in advance next time so people know what to expect? > Regards, > > Scott Kurowski > Entropia -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Somewhere almost out of hearing, children were at play. It was always a pleasant, lulling sound. Always provided, of course, you couldn't hear the actual words. Terry Pratchett, Hogfather _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Cooling software and prime95
On Mon, 15 May 2000, Enio Schutt Junior wrote: > Hi, > > Those programs which use the HLT instruction to save power and "cool" the > processor work well with prime95? Are these cooling programs useful when > used together with prime95? I guess it wouldnt work because the cooling > programs run only at the minimum priority and then they would "fight" > idle time with prime95 (which is also by default set to work only > in idle time), but maybe cooling programs and prime95 work well > together. I dont know... Does anyone have the answer to this question? > Did someone already tested it some time? > Please tell me what you've got. > > Regards, > Enio Using the HLT instruction to stop the processor when idle isn't something done by a program, but is instead a feature of the operating system. Windows NT and Linux does this, I think Win95 does as well, Windows 3 and DOS do not. Since the purpose of Prime95 is to use as much of the CPU time as can be spared by other processes, it works extremely bad with the concept of saving power by halting the processor, because the optimal working conditions for Prime95 is to run flat out using the entier processor all the time. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Speak of the Devil and he will hear about it. The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
[OT] Mersenne: M(M(19)) revisited
On Mon, 8 May 2000, Dave Mullen wrote: > I was thinking more in terms of ... > > Let's assume that every cycle of the LL test for M(M(19)), we took the > LSB and wrote it to a file - you might find the code for the virus > there ! Chance is still way off, virus was about 14kB, giving a 1 in 2^12 chance of seeing it each iteration, compare that to the 2^19 iterations taken for the M(M(19)) and you see how far off you are. > (Remember that Bill Gates seems to do this with every application he > creates - whatever the glitch, error, design flaw, overflow condition, > why does it always manage to save as a file and then get executed ?) That's because he seems unable to produce an application that doesn't include a Turing Complete language with file write rights. > btw, I'm on 21 months now without work, the money is running out, and > only the Mersenne mails and Discworld MUD keep me alive ! Careful, that MUD can be awfully addictive as I can attest with 129 DAYS of accumulated online time (I'm Olorin there) > > Regards > > Dave > > > > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Speak of the Devil and he will hear about it. The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Overclocking
On Sat, 6 May 2000, keith wrote: > Heya, > I have an athlon 700, and i overclocked it to 800 w/o soldering the cache. > Now when I run prime95, I get errors. I clocked it back down to 700, and > prime runs fine. But is there any way i can run it overclocked and run > prime too? Everything else runs perfectly fine exept for that. Thanks all! Consider it an indication that the CPU really can't work reliably at that speed and don't use it so fast. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Speak of the Devil and he will hear about it. The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
RE: Mersenne: Just curious
On Wed, 19 Apr 2000, Aaron Blosser wrote: > For power supplies, having a decent UPS or even just a good line conditioner > is a MUST when you want to prolong it's life. Anyone who cared to could > hook an scope to a power line (make sure the scope is protected from > overvoltage! :) and if it's a nice digital scope, you can see the surges and > sags that happen *all the time*. > > Of course, not many folks have digital scopes... But a decent UPS does it's > own logging...the APC Smart-UPS for instance. It'll keep track of the peaks > and valleys through the day and it really is amazing what your poor little > power supply has to deal with all the time. Sags can be just as damaging to > your supply as a spike, by the way. I keep hearing this stuff about power problems, and while I can understand the need for an UPS, the need for a line conditioner evades me, possibly because I live in Denmark which judging from the stories have much cleaner power. Though this is getting way off topic, does anyone know where it's possible to get comparable data on the quality of the mains power in different countries? If possible, collected neither by the power suppliers nor by UPS manufacturers. :) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Example is better than following it. The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: V20 beta #3
On Sun, 16 Apr 2000, Martijn Kruithof wrote: > Henrik Olsen wrote: > > On Sun, 16 Apr 2000, Harald Tveit Alvestrand wrote: > > > At 14:51 15.04.2000 +0200, Henrik Olsen wrote: > > > >On Sat, 15 Apr 2000, Brian J. Beesley wrote: > > > > > On 15 Apr 00, at 4:22, Henrik Olsen wrote: > > > > > > > > > > > I just tried downloading 20.3, both mprime and sprime, as well as tried > > > > > > with mprime 19.0.2 . None of them where able to detect the network as > > > > > > being available on a machine running Mandrake Linux, kernel version > > > > > > 2.2.14-15mdksecure, probably due to /proc/net not being readable by > > > > > > non-root on such a system, which is a bit of a bummer, as I as I don't > > > > > > want to have to run it as root. :( > > > > > > > > > > > > Does a solution exist for running mprime on such a system or will I have > > > > > > to use this one as well for SNFS sieving instead of GIMPS? > Hello, > > It can even be done easier, mount /proc with the gid=(group id) and make > mersenne > member of this group Thanks, this solved the problem for me, now I just have to wait for the server to get up again so it can grab someting to work on. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Should we throw another human wave of structural engineers at stabilizing the Leaning Tower of Pisa, or should we just let the damn thing fall over and build a tower that doesn't suck? Neal Stephenson about cruft, In The Beginning... Was The Command Line _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: V20 beta #3
On Sun, 16 Apr 2000, Harald Tveit Alvestrand wrote: > At 14:51 15.04.2000 +0200, Henrik Olsen wrote: > >On Sat, 15 Apr 2000, Brian J. Beesley wrote: > > > On 15 Apr 00, at 4:22, Henrik Olsen wrote: > > > > > > > I just tried downloading 20.3, both mprime and sprime, as well as tried > > > > with mprime 19.0.2 . None of them where able to detect the network as > > > > being available on a machine running Mandrake Linux, kernel version > > > > 2.2.14-15mdksecure, probably due to /proc/net not being readable by > > > > non-root on such a system, which is a bit of a bummer, as I as I don't > > > > want to have to run it as root. :( > > > > > > > > Does a solution exist for running mprime on such a system or will I have > > > > to use this one as well for SNFS sieving instead of GIMPS? > > Check /etc/fstab. > There's a line there that says something like > > none/proc procsomething 0 0 > > If you change "something" (whatever that is) to "defaults", and umount and > mount /proc, everyone can probably read it. It's already none /proc proc defaults 0 0 in /etc/fstab, the 550 permissions for /proc/net isn't due to a mount option, but looks like it's modified in the source. > No idea why Mandrake would choose not to make it world readable It's essentially a paranoid version of RedHat, which is actually a Good Thing (tm), as RH has more holes than a sieve out of the box. > > Harald -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ ZOOLOGY, n. The science and history of the animal kingdom, including its king, the House Fly (Musca maledicta).The Devil's Dictionary, Ambrose Bierce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: V20 beta #3
On Sat, 15 Apr 2000, George Woltman wrote:
> Hi,
>
> At 10:56 AM 4/15/00 -0700, Will Edgington wrote:
> >near line
> >761 of linux/primenet.c, where there's an fopen("/proc/net/route",
> >"r") inside an #ifdef __linux__. Look lower down, after the #endif,
> >and note that __FreeBSD__ doesn't have a similar check; it simply
> >always returns TRUE. Looks to me like it would be very simple to add
> >a check for the fopen() failing due to permissions or whatever under
> >Linux and return TRUE (i.e., that the system is connected to the
> >network), perhaps based on a new flag in one of the .ini files.
>
> This is a good fix. The next v20 release will return TRUE if /proc/net/route
> is not readable. You can keep the current behavior by setting
> "RouteRequired=1" in primenet.ini.
>
> A question to all you linux users with modems: I assume that the
> /proc/net/route file exists when you are not connected. Let me know
> if this is not the case (I'll need to change the default setting of
> RouteRequired above).
/proc/net/route exists as long as the kernel is compiled with networking
capabilities, it's the content that varies with the configured devices,
ie. its presence alone is not a good indication whether there's currently
a dialled up connection.
>
> Regards,
> George
--
Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/
ZOOLOGY, n.
The science and history of the animal kingdom, including its king, the
House Fly (Musca maledicta).The Devil's Dictionary, Ambrose Bierce.
_
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: V20 beta #3
On Sat, 15 Apr 2000, Brian J. Beesley wrote: > On 15 Apr 00, at 4:22, Henrik Olsen wrote: > > > I just tried downloading 20.3, both mprime and sprime, as well as tried > > with mprime 19.0.2 . None of them where able to detect the network as > > being available on a machine running Mandrake Linux, kernel version > > 2.2.14-15mdksecure, probably due to /proc/net not being readable by > > non-root on such a system, which is a bit of a bummer, as I as I don't > > want to have to run it as root. :( > > > > Does a solution exist for running mprime on such a system or will I have > > to use this one as well for SNFS sieving instead of GIMPS? > > Could I suggest three things to try: > > 1) Install mprime with suid privelege. This should enable mprime to > read /proc/net as though it were running under root even though it's > actually running under an unpriveleged user. With all the respect due to George, I haven't seen anything to indicate that mprime was written with suid in mind, with in any security concient person would raise big red flags when contemplating this solution. Actually, if I setuid it, I might as well run it as root, which is what I wanted to avoid in the first place. > 2) Get out your hacker's hat and fix the problem in the source code. > I'd guess that all you need to change is the code which creates the > /proc pseudofilesystem at boot time. As you've probably found, you > don't seem to be able to change the permissions on "files" in the > /proc tree on a running system - even if you _are_ root. There isn't one piece of code generating the /proc fs, it's done dynamically by linking in inodes with relevant callback functions for the operations on them, one call passing one struct per inode, so it can happen everywhere and tracking down the call/struct for a specific inode is a real pain. > 3) Is Mandrake really linux, or just a linux clone? I think the > latter. If I'm right, then perhaps switching to a genuine linux (Red > Hat, or SuSe) might be a sensible thing to do. Though the official > Red Hat distribution retail package is expensive, you can get just > the CD for about $2, or download the distribution FoC (not > reccomended unless you have fast internet access!) Mandrake is really Linux (whatever that means), it's essentially RedHat with the security holes fixed, and all rpm's compiled for the Pentium. (as for my connection it's only 2Mb/s) > Regards > Brian Beesley > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Should we throw another human wave of structural engineers at stabilizing the Leaning Tower of Pisa, or should we just let the damn thing fall over and build a tower that doesn't suck? Neal Stephenson about cruft, In The Beginning... Was The Command Line _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: V20 beta #3
Hi, I just tried downloading 20.3, both mprime and sprime, as well as tried with mprime 19.0.2 . None of them where able to detect the network as being available on a machine running Mandrake Linux, kernel version 2.2.14-15mdksecure, probably due to /proc/net not being readable by non-root on such a system, which is a bit of a bummer, as I as I don't want to have to run it as root. :( Does a solution exist for running mprime on such a system or will I have to use this one as well for SNFS sieving instead of GIMPS? -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Many are my names in many countries. [EMAIL PROTECTED] among the Elves, [EMAIL PROTECTED] to the Dwarves; [EMAIL PROTECTED] I was in my youth in the West that is forgotten, in the South [EMAIL PROTECTED], in the north [EMAIL PROTECTED]; to the East I go not. With thanks to Tolkien _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
RE: Mersenne: NTPRIME and it's priority...
On Tue, 14 Mar 2000, Aaron Blosser wrote: > >> Moral of the story, US WEST bad... NTPRIME good. :-) > >Actually, moral is "Installing software without explicit permission bad." > > Hehe...no comment. > > >I was overridden by management on both suing for breach of contract, and > >reporting the incident to the police, apparently they felt the > >application he was installing was too important. > > They felt Seti@Home was too important? Sheesh...well, takes all kinds. I No, not Seti@Home. The application he'd been contracted to do that got him the access in the first place and which he hid the Seti client as a legal part of. > wish US WEST would have considered the contribution they could be making > towards number theory and distributed computing, but they were more concerned > about the possibility of this program crashing their machines... Anyone who > has ever worked for US WEST could attest that NTPRIME was probably the most > well behaved piece of software on those machines... :-) :) > > Aaron -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Somewhere almost out of hearing, children were at play. It was always a pleasant, lulling sound. Always provided, of course, you couldn't hear the actual words. Terry Pratchett, Hogfather _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: NTPRIME and it's priority...
On Mon, 13 Mar 2000, Aaron Blosser wrote: > Moral of the story, US WEST bad... NTPRIME good. :-) Actually, moral is "Installing software without explicit permission bad." At least you didn't try to hide its presence as I had a user do with the Seti@home client, which he'd renamed so it showed up in the process list as an apparently legal process, and crontab'ed so it only ran during nights. I was overridden by management on both suing for breach of contract, and reporting the incident to the police, apparently they felt the application he was installing was too important. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Animal behaviour is best described by the four F's. Feed, Fight, Flee and Reproduce. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Dumb Newbie Question
On Wed, 8 Mar 2000, Brian J. Beesley wrote: > 0.729. However, random events like finding factors, arrival of buses, > airplane crashes etc. always seem to arrive in bunches. I've had a finding factors only seems to come in cluster, but the other two does haver mechanisms that does make them actually cluster up. Bus arrival clustering is cause by a well known positive feedback mechanism since any difference in the interval between busses will cause more passenres to arrive at the stops before the late bus, making it even later. Only way to prevent this is to include pauses in each bus's schedule, but traffic plannners seem to be too stupid to understand this and tries to do it with tighter schedules instead. I would expect a feedback mechanism on plane crashes as well. If there haven't been crashes for a while, inspection becomes lax, crashes happen and after a delay inspection tightens up again. It's the deay that causes clustering here. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Many are my names in many countries. [EMAIL PROTECTED] among the Elves, [EMAIL PROTECTED] to the Dwarves; [EMAIL PROTECTED] I was in my youth in the West that is forgotten, in the South [EMAIL PROTECTED], in the north [EMAIL PROTECTED]; to the East I go not. With thanks to Tolkien _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: pi
On Wed, 9 Feb 2000 [EMAIL PROTECTED] wrote: > Hi, I have been considering the possible role pi might play in the > progression of mersennes. It is generally accepted that the value of pi is > a never ending series. > > But when I look at the circle, the formula for the area of a circle with a > radius of 6 inches is: A=pi*r^2 = 3.1416 * (6)^2 = 113.0976. > > We did not, however, use the full and correct expansion of pi in the > calculation. > > Pi has been figured out to over a billion (not sure of the exact figure) > digits with no apparent end or pattern. > > But when I look at a circle I see a finite area within the circle with no > means of growing or escape. Logic seems to indicate that pi would have to > be a finite exact value since the area in the circle is finite. Yep you're actually right, pi has a finite exact value. The problem isn't that Pi isn't finite, it's less than 4 so it's finite. The problem isn't that it isn't exact. The problem is that it can't be represented exactly in decimals which mens that when we write the expansion, we'll always have to make do with an approximation to the exact value. > So, either the figure for pi is in error (not likely) or pi has a end. Any decimal representation of pi is in error, since it can only be an approximation. > The end. > What say ye? > Dan I think where your argument slips is in confusing the number for it's representation, ie. how it's written. These are two different concepts, and confusing them leads to argumenting from false analogies. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Linux isn't at war. War involves large numbers of people making losing decisions that harm each other in a vain attempt to lose last. Linux is about winning.Alan Cox on linux-kernel _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: AMD Athlon problems
On Mon, 7 Feb 2000, Conor McCutcheon wrote: > I have a new athlon 750 running either prime95 or mprime 24 hours a day, but > I am getting a ridiculously slow per iteration time for a 9.5 million range > exponent (1.192 > sec avg). I have installed on prime95 on over 20 machines now, including an Is this measured, or the number reported on the screen? > Athlon 550 (it gets about .2 something seconds on a 9.4 million range > exponent), and experience tells me this is ridiculous. CPU failure can be > ruled out, linux dmesg agrees with the bios and box it came in anyway. Does > anyone have any thoughts on why it is running so slowly? I looked at the > list archives for someone mentioning such an incident, but did not find > anything that helped. > Thank you in advance for your help. Note that the time taken is dependent on a correctly set CPUSpeed since the code don't time anything, but counts clock cycles and converts using the value you gave. Your low speed reported is consistent with a mistype of 75 for the speed instead of 750. > -Conor McCutcheon > > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Flinx: Everybody wants to kidnap me. Oh well, I'll travel the galaxy and have boring adventures. (Pip the Flying Snake spits at something and kills it.) The Flinx of the Commonwealth Series, Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: SMP GIMPSing And Sharing The Burden
On Wed, 2 Feb 2000, Stefan Struiker wrote: > Team M: > > Does the L-L process lend itself to some parallelization > (not the running of multiple copies) over N processors? > > I have a short monograph on Amdahl's Law to squeeze out, > and I thought I might use L-L as an example, bad or good. Since the L-L test for 2^P-1 consists of a sequence of P-2 steps, each consisting of squaring the result of the previous step and subtracting 2 (mod 2^P-1), the ability to parallelize is essentially lost, except for possible multiprocessor implementations of the squaring step, which in that case will be bound by the speed of inter-processor communication. > >Best To All, > Stefanovic > > PS: Amdahl's Law relates Maximum Speedup to a fraction f ( < 1 ) of > ops that must be done sequentially, and the number p of available > processors: > > 1 / MaxSpeedRoom = f + (1 - f) / p > > > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Darth Vader: Luke, come to the dark side. Luke: No. Darth Vader: Your goodness has redeemed me. Die, emperor scum. Return of the Jedi, the Movie-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
RE: Mersenne: small OS setup for mprime
On Wed, 26 Jan 2000, Sylvain PEREZ wrote: > What I personnaly did is to install a full (but light) Windows95 system on > an IomegaZip 100 disquette, plus the regular Prime95 v19. > > So now I only need a motherboard, an internal zip drive and some little > parts to make a Prime Machine. You have to set the BIOS to boot on Zip (or > LS120). > > It works perfectly, even if it may be sometimes tricky to make a Zip a > system drive (and the only drive of the machine). > > It's also easy for communicating with PrimeNet : shutdown your "Zip" > Windows, take the Zip disquette, put it on your machine with a modem or so, > actualize your Prime data and put the Zip disquette back to its machine, > boot. This can be done every 3 month or so. > > Sylvain Perez > The guy who's late updating the french Gimps site ... > > > -Message d'origine- > De: Kevin Sexton [SMTP:[EMAIL PROTECTED]] > Date: mercredi 26 janvier 2000 07:01 > A:Mersenne List > Objet:Mersenne: small OS setup for mprime > > Did anyone figure out a simple way to run mprime from a > floppy, or small partition? I want to search for primes on a > second computer, but the total hard drive space is 650MB, > and I have and want to keep dos, and don't have windows of > any kind installed. > If I figure out how to install it I will add an LS-120 > drive. I managed to fit an extremely limited Linux system together with sprime onto a floppy that boots, then unpacks everything into a ramdisk. That was for the extreme of doing a diskless mprime machine, and I never did solve the problem of saving the state without an nfs server, though it might be possible to solve using a samba share for the temp files. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ It wasn't by eliminating the impossible that you got at the truth, how- ever improbable; it was by the much harder process of eliminating the possibilities. You worked away, patiently asking questions and looking hard at things. You walked and talked, and in your heart you just hoped like hell that some bugger's nerve'd crack and he'd give himself up. Commander Vimes on detectoring. Terry Pratchett, Feet of Clay _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Size of largest prime factor
On Mon, 24 Jan 2000, Paul Landon wrote: > Subject: Re: Mersenne: Size of largest prime factor > > > Pierre Abbat wrote: > > >If I pick a huge number n at random, how much smaller than n, on average, > > is > > >its largest prime factor? > > > Jud McCranie wrote:- > > > On the average, the largest prime factor of n is n^0.6065, and the second > > largest is n^0.2117. Reference: Knuth, the Art of Computer Programming, > > vol 2, section 4.5.4. > > > But for Mersennes this might not be the case. > For the size of exponents that we deal with Mersennes are less > composite than a random set of ones & zeroes. > There are many reasons for this, if 2^p-1 has any factors they > must be bigger than p. They must be +-1 mod 8 etc. > Looking at the string of ones it certainly has regularity. Indeed > there is a measure for it, the order of 2 mod 2^p-1 which is very > low, =p; and any factors have this order as well. This is not > average. > This is not new news to most people here, but I have to remind > myself, it still hasn't been proved whether there are an infinite > number of Mersenne Primes or an infinite number of Mersenne > composites. Erhm? 2^n-1 where n is composite is in itself composite, so showing that there are infinitely many Mersenne composites is easy. :) > > Cheers, > Paul Landon -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Odds on finding a factor ?
On Sun, 23 Jan 2000, Alex Phillips wrote: > Dear List-reader, > I've been running Prime95 on my PII-400 at work, since December, and >I'm > currently on my second LL test ! > And I've also been running it on my Celeron366 Laptop at home (When my wife > isn't playing Settlers 3). I decided to make the Laptop do Factoring, and > I've factored five numbers, all in the 1165-1166 range, as > allocated by Primenet, without finding a factor. > So my question is, What are the odds on finding a factor ? > > I've looked in all the FAQ's, including the mailing list one, and can't > find it anywhere. I know that the odds for a LL test are 1 in 6, but I > can't find out what the odds on finding a factor are ? Presumably all the > non-prime numbers have a factor so the odds should be 1 in 5, but most > of these factors must be higher than 2^64 (Yes/No) ? So what are the odds > on a factor that prime95 will find ? > > Alex Phillips >From a quick browse through the top 101-500 producer list (it's the one I'm in:) it looks like the odds say you can expect 10-15 factors per P90 year spent on factoring. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Lord Mhoram: Thomas Covenant, you are the savior of The Land. Thomas Covenant: Bite me. (Thomas Covenant saves The Land.) The Chronicles of Thomas Covenant, Unbeliever; Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Factoring beyond ECM
On Sat, 22 Jan 2000, Foghorn Leghorn wrote: > I'm interested in trying to factor composite numbers with 100 to 200 > digits. ECM becomes impractical for numbers without any factors below > 50 digits or so. I have heard of algorithms such as MPQS which are > used to tackle larger numbers. Are there any (preferably free) > implementations of this method (or another) that would be feasible to > run on a home PC or Unix workstations? MPQS is ok for numbers up to about 100 digits, at which time NFS takes over. Have a look at Conrad Curry's NFSNET, http://orca.st.usm.edu/~cwcurry/nfs/nfs.html> > Foghorn Leghorn > [EMAIL PROTECTED] -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Daggert to Lucifer: I have my soul, and I have my faith. What do you have... angel? The Prophecy _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: k63-450 cpu
On Sun, 16 Jan 2000, Paul Cuni wrote: > I just installed this new CPU k63-450mhz and I am getting this constantly > in prime 95 version 19.2 > > Iteration: 1044018/4721813, ERROR: SUM(INPUTS) != SUM(OUTPUTS), > 1880675659930562 != 1880675659963331 > Possible hardware failure, consult the readme file. > Continuing from last save file. > [Sun Jan 16 11:42:48 2000] > Iteration: 1044468/4721813, ERROR: SUM(INPUTS) != SUM(OUTPUTS), > 3286921099109153 != 3286921099113248 > Possible hardware failure, consult the readme file. > Continuing from last save file. > [Sun Jan 16 12:11:21 2000] > Iteration: 1046082/4721813, ERROR: SUM(INPUTS) != SUM(OUTPUTS), > 11964574901321.7 != 11964574868554.83 > Possible hardware failure, consult the readme file. > Continuing from last save file. > [Sun Jan 16 12:26:45 2000] > Iteration: 1044929/4721813, ERROR: SUM(INPUTS) != SUM(OUTPUTS), > 4958683212425541 != 4958683212360005 > Possible hardware failure, consult the readme file. > Continuing from last save file. Before you continued with your assignment, did you try setting prime95 to do a complete test? It'll only take about a day, and you'll sleep better knowing that you've hammered it a lot before depending on it. > As to those errors I reported earlier it appears my cpu couldn't > handle its 450mhz rated speed. Or maybe it was my motherboard. > Either way I've underclocked to 400mhz and the problem disappears > along with the quake 3 problems. CPU temp went from 139 F to 130 F > and mother board went from 97 to 90F This sounds like it might also be your memory that's borderline, are you using PC100 memory? -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Do not meddle in the affairs of dragons, for you are crunchy and taste good with ketchup. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: The Second Mersennium Behind Us, How Now For MyriadThe Third?
On Mon, 10 Jan 2000, Tom Goulet wrote: > 2038, and it's more a Unix problem than a C problem. > Unix states the date as the number of seconds since the beginning of 1970. > Simply, after some time in 2038, a 32 bit variable can not hold that > many seconds. 64 bit machines will have the year 20 quadrillion problem > or something. :-) Actually, in '38 the problem is that if the 32 bit integer is signed, it becomes negative, it's good for another 68 years if it's used unsigned. > > TomG > > >The next date-related problem, IIRC, is in 2034 - something to do with > >C/C++'s common date function overflowing. And following that, maybe some > >software peeps will make the same mistake of presuming "20", and 2100 > >will be a problem. > > > >McMac > >I used up all my sick days, so I'm calling in dead. > > > >_ > >Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > >Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Leonardo DiCaprio: Your social class is stuffy. Let's dance with the ship's rats and have fun. Kate Winslet: You have captured my heart. Let's run around the ship and giggle. (The ship SINKS.) Leonardo DiCaprio: Never let go. Kate Winslet: I promise. (lets go) Titanic, the Movie-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: RE: Fibonacci Series
On Fri, 17 Dec 1999, Griffith, Shaun wrote: > Ian McLoughlin wrote: > > Since the list is quiet... > > Does a Fibonnacci series contain a finite or an infinite number of primes? > > From what I understand.. > > In a gen.F sequence if the first two numbers are divisible by a prime all > > its numbers are divisible by the same prime, if the first two numbers are > > co-prime is there a generalised sequence that contains NO PRIMES > > The generalized Fibonacci sequence seems to generate at least one prime > regardless of the values assigned to Fib(1), Fib(2), *unless* Fib(1) and > Fib(2) are even. Then there is never an odd number, and never a chance for a If they are both even they aren't coprime. :) > prime after Fib(2) (though Fib(1) or Fib(2) may be =2, but that seems > trivial). > > I tried it with composite odd numbers, such as 15,77, which happen to be > coprime. The first 3 primes generated are Fib(7)=691, Fib(14)=20101, and > Fib(28)=16945081. > > -Shaun > Quantum Mechanics: The dreams stuff is made of > > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Covenant: I am the savior of The Land. Linden Avery: Can I help? Thomas Covenant: Over my dead body.(dies) (Linden Avery saves The Land.) The Second Chronicles of Thomas Covenant, Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: IPS Database Synchronization
On Wed, 1 Dec 1999, Rich Harms wrote: > My individual account report on IPS has accumulated 18 LL tested > exponents in the "Exponents Cleared since last Synchronization" > section, the oldest having been completed on 29 Mar 99. In fact 5 of > the oldest results recently changed status from "first LL test" to > "double check". Is this a common situation across the IPS accounts, > or is my account "unique" for some reason and not being cleared by the > periodic synchronizations? > > Regards, > Rich Harms I haven't noticed any changing status, but with 45 results since last sync 37 of which are doublechecks I probably wouldn't remember anyway. The long list is definitely not strange. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Re: Mersenne Digest V1 #662
On Sun, 21 Nov 1999 [EMAIL PROTECTED] wrote: > << Things tend to come in clusters >> > > That's what the Noll Island Theory says! Hehehe. > > S.T.L. Since there's no upper limit to the size of the gap between consequtive primes, all primes come in clusters, for any reasonable[1] definition of clusters. [1] and if it's not enough for _your_ definition of clusters, then I can always call it unreasonable. That's the way to win disputes. :) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ I'd like somebody to sacrifice their first-borne son, and write in blood that gas does the right thing every time these days. Otherwise I will keep the thing that looks strange but has a real explanation for it. Linus Torvalds about buggy looking code that isn't _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Reciting Mersennes...
On Wed, 20 Oct 1999 [EMAIL PROTECTED] wrote: > Date: Wed, 20 Oct 1999 19:53:36 EDT > From: [EMAIL PROTECTED] > To: [EMAIL PROTECTED] > Subject: Mersenne: Reciting Mersennes... > > < name in a life time, allthough it is finite in length.>> > > If I remember correctly, someone once recited millions of digits of Pi from > memory in three days. Heh. 4+ digits per second for three days? This fails even the simplest sanity check:) > > S.T.L. > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Animal behaviour is best described by the four F's Feed, Fight, Flee and Reproduce _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Milestone!
On Mon, 18 Oct 1999, George Woltman wrote: > Hi all, > > At 07:07 PM 10/18/99 +0200, Wojciech Florek wrote: > >I was observing the progress in the last 10 exponents below 2M. Almost > >all had been assigned to diamonddave and almost all have been finished > >on schedule ... > > You missed one important step - the residues must match! > > I checked the cleared exponent report against the 3 remaining exponents > below 2M. They have been completed and the residues match! The milestone > was reached on October 16, at 12:09 UTC. Congratulations to all. > > Onwards and upwards, > George > > P.S. It looks like diamonddave is working on an unneeded triple-check. > Oh well, these things happen. This seems to indicate he got poached, but he'd already started the doublecheck before the poacher sent in the result, so he's continuing with what has become a triple check. I noticed similar behaviour at the last exponents in the 1.4M range, where the last ones to finish got checked three or four times. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ I'd like somebody to sacrifice their first-borne son, and write in blood that gas does the right thing every time these days. Otherwise I will keep the thing that looks strange but has a real explanation for it. Linus Torvalds about buggy looking code that isn't _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: problem with prme95 - spl file - ME TOO !
On Sat, 16 Oct 1999, Michael Oates wrote: > I have been running Prime95 on this machine for about 4 weeks. It is on a > LAN with other machines also running Prime95. > > I have a shortcut to run the program in the Startup folder. For Windows 95 and prime95, this is the wrong approach, since as the included story shows, this makes you vulnerable to the mangling of shortcuts that Windows loves and we hate. Instead, remove the shortcut from the startup folder, start prime95 manually, choose "Options" and make sure "Windows 98/95 Service" is checked, then it will start automagically, this is especially important in networked setups, as the service runs even when noone's logged in. > Today I realised that not only was the server not being updated, but the > save files had not been altered for over a week. This was very odd as the > program was re-starting correctly where it left off. So I thought, it must > be storing the save file somewhere else. Then I also noticed that some of > the setting details were wrong, not just wrong, but were for a different > machine. I ran the program from the directory with File Explorer and it used > a different exponent and was at a different stage ! Eh !!! > > I checked the shortcut that was in the Startup folder... well would you > believe it... it was pointing to another machine. > > Some how Windows95 had changed the path to the shortcut all on it's own, and > had been running another exponent on another machine over the network. And > for some odd reason the details stored in local.ini were taken from the > local machine and the details from prime.ini were from the remote. > > Now I know what you are probably thinking, it was not Windows95 that changed > the path, and that I made a mistake when I set it up... WRONG, very wrong. I > have seen this before... if you have a shortcut to a file, and remove the > file, and replace it with another one Windows95 inserts another path in any > shortcut to that program, this has cause no end of problems in the past. > > This probably happend when I upgraded Prime95 with a newer verion, I moved > the directory else where by mistake, instead of copying it to make a backup. > I of course just copied it back again straight away, then copied the new > updated program to it... from... wait for it... the machine that the new > shortcut was pointing to. So somehow windows changed the shortcut path to > the directory on the remote machine, great eh ! > > All is now working ok, but I have lost over a weeks LL testing because of > it. No harm seems to have been done to the remote machine. > > Regards, > > Mike, > > -- > ATLAS CELESTE - Bevis Star Atlas - & "The CD-ROM" > A very rare atlas found at the Godlee Observatory >http://www.u-net.com/ph/mas/bevis/ > Astronomy in the UKhttp://www.ph.u-net.com > > _____ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Catherine: Go to hell! Gabriel: Heaven, heaven. At least get the zip code right. The Prophecy _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: problem with prme95 - spl file - ME TOO !
On Fri, 15 Oct 1999, Michael Oates wrote: > I have checked that before I do the Manual Communication to see if the > prime.spl was there... it was not ! prime.spl only ever exists when there is something to send to the server and it hasn't been sent yet. If it's not present, there is no communication spooled. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Daggert to Lucifer: I have my soul, and I have my faith. What do you have... angel? The Prophecy _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Factoring numbers...
On Tue, 12 Oct 1999, Jukka Santala wrote: > Is it just me, or does factoring smaller Mersenne numbers take > propotionally much longer? I would expect M727 to be much faster than > the 33M range to a fixed depth, yet the opposite _seems_ to be true. It's not just you, it's a natural consequence of the property that all factors of Mp must be of the form 2kp+1, so with a fixed depth and larger p there are fewer possible factors to check. > > Ofcourse, I can't be sure about this, because the real complaint I have > is that factoring numbers to depths beyond the "default" seems nearly > impossible. The manual factoring assignment seems like the only > possibility to force these, yet it doesn't work like the normal > factoring (Doing one bit depth at time) and is a pain on a dual-CPU > machine. Is it possible we'd get a third parameter to the Factor= > work-line specifying the intended depth for the factorization? Also, > usually for some reason Prime95 seems to reject most (all?) Factor= > statements I've tried, could we get some more detailed instructions on > this? > > -Donwulff > > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ No, power off on shutdown is not SMP safe. It kind of happens to work on a lot of boards. If making that APM call reformats your disk and plays tetris on an SMP box, the bios vendor is within spec (if a little peculiar).Alan Cox, on the Linux Kernel list _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: glitches in mprime v19?
On Sun, 10 Oct 1999, jason wrote: > I just grabbed sprime.tar.gz off the ftp site, and to my dismay, I have > run into a couple of problems: > > a) When I start the new version, I keep getting "Error 2250: Server > unavailable" messages. I have "UseHTTP=1" in prime.ini, so what gives? > I switched back to v18.1.2 and it connects to entropia.com just fine. No idea, I haven't seen a problem with either the LInux or the Win95 versions. > > b) When I killed mprime (v19), I realized that it had been *factoring* my > highest exponent (which was not the current one being tested), when it's > explicitly set up to do Lucas-Lehmer tests only. Is this the intended > behavior? The number that it was factoring is > 710, if that's > pertinent. The documentation explicitely mentions that it's factoring to a higher limit in the new version, and since catching up in factoring before going on to LL testing has been a feature for a while, it's not _that_ surprising. Note that this catching up on factoring includes factoring newly assigned exponents BEFORE continuing with the current LL test and it isn't a new thing, but has been there as long as I've been on this project. > > I can't recall if these problems were discussed on the list already during > beta-testing (out of curiosity, is there an archive of recent messages?). > Thanks in advance for any pointers or insights. > > -jason > > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ A Pentium is a terrible thing to waste, http://www.mersenne.org/prime.htm _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Purpose...
On Fri, 1 Oct 1999, Ian L McLoughlin wrote: > Forgive me, > But, I seem to be subscibing to a project which is utilising processors > 'world-wide' for several purposes: > A) For Programmers to enhance their skills at the 'cutting edge' Yep. > B) For Web based people to increase their knowledge within a distibuted > network. Yep. > C): > I realise that a lot of what is contributed is going to be used in > encryption et.al... Nope. I think you're confusing GIMPS and the Mersenne project which are almost entirely about pure maths and efficient algorithms, and the Bovine project which is about solving cryptographic challenges to show the strength/ weakness of the different encryption schemes. Some of the algorithms developed for the Mersenne and similar projects, have applications for cryptography, but it's mainly in the field of breaking the codes, so it may have the effect of forcing the US government to change their ways. > Since I am based in Europe, and denied certain facilities from the web as to > U.S. encryption bit encoding ( U.S. and Canada keeping it for > themselves..?!)... Canada has no choice in the matter, it's the US export restrictions that dictate how software from the US can be reexported. I'm in Europe too, and the EU is almost as bad, with Wassenaar putting about as strong a grip on crypto as the US, though they put in a loophole, so nonprofit software isn't covered:) There are non-US implementations of most crypto protocols, so you should definitely be able to stay safe if you think you need it. > Is their an auterior motive behind this...??? World domination of course, when has anyone wanted anything else.:) > > Just a thought. > Ian McLoughlin, Chematek U.K. > > Tel/Fax : +44(0)1904 679906 > Mobile : +44(0)7801 823421 > Website: www.chematekuk.co.uk -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Re: primes source
On Sun, 19 Sep 1999, poke wrote: > > I would NOT encourage using the gpl for this, it's far too restrictive, > > and the fact that the security stuff isn't included in the public code > > would actually be in direct violation of it. > > I am curious, what about the GPL do you find restrictive? A programmer trying to use gpl'ed code for part of a program automatically loses his right to deside on which licence to use on the rest, that's the fundamental restriction I dislike about it. I like the general idea, but there are clauses in the licence that restricts my freedom to decide on the licence for code I developed. Note that this does NOT apply for the lgpl (L=Library), which allows linking code without forcing the licence, but Stallman has publically announced that the lgpl should not be used for future GNU libraries, because using the gpl will force more people into free software. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Somewhere almost out of hearing, children were at play. It was always a pleasant, lulling sound. Always provided, of course, you couldn't hear the actual words. Terry Pratchett, Hogfather _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Re: primes source
On Sat, 18 Sep 1999, Steinar H. Gunderson wrote: > On Sat, Sep 18, 1999 at 03:01:43PM -0400, Darxus wrote: > >I would incourage you to release it under either > >the GNU General Public License (http://www.gnu.org/copyleft/gpl.html), or > >if you want to allow commercial use, the BSD license (which I'm > >significantly less familiar with). > > I think the current scheme works well. The problem with adding a license, > is that we probably don't have the rights to add a lot of clauses. At least > lots of the algorithms we use are not developed by ourselves. I would NOT encourage using the gpl for this, it's far too restrictive, and the fact that the security stuff isn't included in the public code would actually be in direct violation of it. BTW, the gpl does not prevent commercial use. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Flinx: Everybody wants to kidnap me. Oh well, I'll travel the galaxy and have boring adventures. (Pip the Flying Snake spits at something and kills it.) The Flinx of the Commonwealth Series, Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: complaint
On Wed, 15 Sep 1999, Chris Jefferson wrote: > > On 14 Sep 99, at 7:22, Henrik Olsen wrote: > > > > > Personally I found installing and running it to be an extremely smooth > > > operation, to the point where it takes less that 2 minutes to install on a > > > new machine, including configuration, after which I just forget about it. > > > > Yes - I found the same thing - applies to both un*x & windoze > > clients. > > Although I don't mean to insult anyone, this is exactly what I mean. I can > install the program on a computer in 3 or 4 minutes. The problem is those > people who can't... Also just one question. Was is it I sometimes see > people write un*x instead of unix, which is I assume what they mean? Un*x or the alternative *nix are used because Unix is a registered trademark, originally by AT&T I belive, for a very specific OS. Most people when talking about un*x are talking about a group of OS's characterised by having (more or less) the same libraries, tools, security model and directory structure, which means the look and feel is the same, but the innards can be completely different, and it's only one of them (modulo licensing agreements and other weirdness) that can be called Unix. I hope this clears it up a bit. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Covenant: I am the savior of The Land. Linden Avery: Can I help? Thomas Covenant: Over my dead body.(dies) (Linden Avery saves The Land.) The Second Chronicles of Thomas Covenant, Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: complaint
On Mon, 13 Sep 1999, Tom Goulet wrote: > Greetings all, Greetings to you as well. > Also, I can get the client to segfault at least two different ways. Let me guess, low memony cause segfault at startup? This one has been announced as being fixed when v19 comes for Linux. > > The 'packet' sizes are very large...I have lost weeks of work due to > power failures and friends. Well, that depends a bit on how you look at it. In d.net, I think the smallest 'packet' is 2^28 numbers to test, whereas in gimps, the 'packet' size is 1(one) number, it's difficult to get much smaller. :) > > I also accidentally ran two or three instances of the client, and it complained > about it's work file or something, and delete it. 89% complete doing whatever > it was doing, and it restarted at 0. Since I use RedHat, I avoid this by writing an init.d script to start and stop mprime, this handles locking and such, and as long as that's what I use to start/stop mprime, I'm safe. Since it's so small I've taken the liberty to attach it, do with it what you want. > > So anyways, my comments can be summed up in that it isn't easy for the newbie > (even the very nerdy types like myself) to find their way around the gimps > project and become efficient contributers. Personally I found installing and running it to be an extremely smooth operation, to the point where it takes less that 2 minutes to install on a new machine, including configuration, after which I just forget about it. > > Now, distributed.net (yes, I hear some moans) has a very slick interface, and > helpful documentation and navigable websites and easy to understand overall > structure. (I will be writing another letter to dnet sometime soon... > complaining that they have all these neat things and are wasting them.) As George said, this is a natural consequence of having one programmer, and one who is mostly interested in making the program go faster. At least with version 17.1 you could get the source and play around with an interface of your own, but that's another thread:) > > Hopefully this explains to some of you why the gimps is not growing very fast. I don't want gimps to grow too fast, 'course then all the small numbers will be tested, and I'll have to wait even longer for each result:) > > Please forgive me if I was rude, responses are welcome. :) I didn't see any rudeness, only politely written opinions, which is something completely different. > > TomG > > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Darth Vader: Luke, come to the dark side. Luke: No. Darth Vader: Your goodness has redeemed me. Die, emperor scum. Return of the Jedi, the Movie-A-Minute version mprime.gz
Re: Mersenne: ONLINE.EXE malfunction?
On Sat, 21 Aug 1999 [EMAIL PROTECTED] wrote: > Anyone knows what caused this error message? I'm not emailing this directly > to Mr. Kurowski because it's not working right, and he's probably flooded > with successful results. :-S He wrote the code, he's the one entitled to be told of bugs. How do you expect him to be able to write code that works on every machine if you won't tell him when it doesn't work. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Covenant: I am the savior of The Land. Linden Avery: Can I help? Thomas Covenant: Over my dead body.(dies) (Linden Avery saves The Land.) The Second Chronicles of Thomas Covenant, Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Linux mprime and glibc 2.1
On Mon, 16 Aug 1999, Tom Goulet wrote: > > Have you tried to run sprime? (is mprime but linked with static > > libraries). I've got some problems in an old machine with an old linux > > and sprime ran well. In my machine, sprime runs a bit fast than mprime!. > > Actually, yes. sprime and mprime and mprime-specific-for-redhat-6.0 all > act identically. I blame something to do with ld, my install is rather >From my memory of the start of this thread, the behaviour is immediate segfaults, is this right? I've seen this on a machine with 16MB ram and no swap. After checking the code I think I found the reason. [ms]prime preallocates 16MB memory, even if it doesn't use it all. This will cause the program to fail badly if the memory's not available. The cure was to add enough swap to appease the initial allocation, which is then never used, so the swap space isn't really used. I think I used 10MB swap:) The machine was one I put together after I did a quick inventory of all the bits and pieces I had left from all my updates of my primary machine, and found that the only thing actually missing for it to be a complere computer was the screen:) > ragged. Take a look at this: > > [tomg@nova ~/gimps]$ file mprime > mprime: ELF 32-bit LSB executable, Intel 80386, version 1, dynamically linked (uses >shared libs), not stripped > [tomg@nova ~/gimps]$ ldd mprime > not a dynamic executable > > I get the same file and mprime results for mprime, sprime and mprime-rh6 > (except file properly determines that sprime is statically linked). I doubt > this is a mersenne problem, just something to do with the way my ld is > misbehaving. > > TomG > _ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Orson Welles: Rosebud. (dies) Reporter: What does it mean? Everybody Else: We don't know. Citizen Kane, the Movie-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: redhat 6 - segfault
On Fri, 6 Aug 1999, Tom Goulet wrote: > Hi all! > > My apologies if this isn't the list for pesky technical problems regarding > the GIMPS client. > > I grabbed the one specified for Red Hat 6.0, the filename (after gunzipping) > is mprime-18.1-redhat6. I try to run it...Segmentation fault (core dumped) > > This happened with the other mprime.tar.gz package as well. Is this a > known issue? Could my redhat installation be missing something that > the client needs? (I have a lot of stuff not-installed.) > > In other news, I installed the client on slackware and it worked fine. :) > (the mprime.tar.gz one) > > Any help? I've had a lot of problems with mixed glibc 2.0 and 2.1 compiled programs segfaulting immediately on start, it seemed to be a problem with proigrams compiled for 2.0, and run on a 2.1 system. (Yes, I really mean old binaries die on a new system) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ (Gulliver visits some places.) Lilliputian: We're small. Brobdingnagian: We're big. Horse: We can talk. (Gulliver goes home.) Gulliver: Humanity sucks. I hate people. Gulliver's Travels by Jonathan Swift; Book-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Down With The Evil Thread
On Tue, 27 Jul 1999, Lucas Wiman wrote: > ><<1) What is the approximate P-90 computing time to test for primality > >for a 1, 10, 100 million (& 1 trillion!) digit Mersenne Primes?>> > > >Generally, a billion comes after 100 million, but I can't remember how the > >British and other countries work with billions. And I don't think that many > >people run P90s now for GIMPS I hope. US: million 10^6, billion 10^9, trillion 10^12 ... Non-US: million 10^6, milliard 10^9, billion 10^12, billiard 10^15, trillion 10^18 ... In general, US llion 10^(num*3+3) non-US llion 10^(6*num), lliard 10^(6*num+3) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Animal behaviour is best described by the four F's Feed, Fight, Flee and Reproduce _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Setu for Dual processor NT
On Sun, 18 Jul 1999, Brian J. Beesley wrote: > > Is there any way to set the affinity under NT automatically when a service > > starts up? > > Put "Affinity=n" into prime.ini (where n = 0, 1, 2, ...) This works > for both NTPrime and Prime95/NT. > > If this line isn't there, the processes are scheduled on the first > available processor at each timeslice. This costs about 5% on an idle > system and next to nothing on a system which is very busy (because > idle priority processes don't see much CPU), but it is expensive on a > system which has just a little load from other applications. > > I think "Affinity=n" may work with linux also. There's no support for explicit processor affinity in stock Linux, so I'd doubt that would work. On the other hand, the affinity of a process to stay at the same processor is very high, exactly to prevent that rescheduling performance hit seen in NT, so I wouldn't expect it to be a big problem. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Darth Vader: Luke, come to the dark side. Luke: No. Darth Vader: Your goodness has redeemed me. Die, emperor scum. Return of the Jedi, the Movie-A-Minute version _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: subtracting 2: error in FAQ
On Wed, 14 Jul 1999, Lucas Wiman wrote: > All, > I recieved a message pointing out a possible error in my FAQ: > > > Speaking of Q2.6, I've heard that with Crandall's DWT, the subtraction > > 2 step costs nothing at all. It's done automatically within the > > transformation. Try checking this with George Woltman. > > Is this true? > > -Lucas >From reading the code, as far as I can see, the subtraction cost it the instructions: fld MINUS2 ; Start normalization process faddBIGVAL ; with a BIGVAL-2.0 carry! once every iteration, which is very little, though not for free. The really big save in the algorithm is that the mod operation is not only for free, but halves the size of the convolution as well, making everything come out nice and fast. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Thomas Daggert to Lucifer: I have my soul, and I have my faith. What do you have... angel? The Prophecy _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Benford's law (was exp. representations)
On Tue, 13 Jul 1999, Lucas Wiman wrote: > >So for numbers 2^n (in Base 10), [or is it 2^p?] there are a lot more leading > >ones than one would "expect" naievely (you would expect 1/9 to start with > >"1", I imagine). > Yes. Though they were talking about the exponents... > Here are the percentages for the first 3000 powers of 2. The first collumn > is the percentage, the second is the difference from the predicted Benford > percentage. Weird, I would have thought that it wouldn't affect powers of > two... > .30110036678892964321 .7037112494844799 > .17639213071023674558 .0003008716540349 > .12470823607869289763 -.00023050052960705550 > .09703234411470490163 .00012233110664848727 > .07935978659553184394 .00017854054790701622 > .06702234078026008669 .7555114964688849 > .05768589529843281093 -.00030605167925394399 > .05168389463154384794 .00053137218416255899 > .04534844948316105368 -.00040904107751407172 Benfords Law is a direct consequence of the fact that most sets of numbers obtained by actual measurements are either resulting from exponentially distributed data (eg. river lengths), or come from uniformly distributed numbers, gathered from multiple ranges of exponentially distributed length (eg. house numbers). Since powers of numbers are just about the cleanest exponentially distributed set of numbers you can get, it shouldn't really come as a surprise that they fix the law:) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Leonardo DiCaprio: Your social class is stuffy. Let's dance with the ship's rats and have fun. Kate Winslet: You have captured my heart. Let's run around the ship and giggle. (The ship SINKS.) Leonardo DiCaprio: Never let go. Kate Winslet: I promise. (lets go) Titanic, the Movie-A-Minute version Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: re: Mersenne prime exponent binary representationsand 1's frequency (incl M38)
On Mon, 12 Jul 1999, Jud McCranie wrote: > > At 11:55 AM 7/12/99 -0400, Chip Lynch wrote: > >I'm not sure what the law of leading digits is, but I read this as talking > >only about base 10 numbers... so the leading digit 1 is compared to > >leading digit 2, 3, 4, ..., 9. Right? So for numbers 2^n (in Base 10), > >[or is it 2^p?] there are a lot more leading ones than one would "expect" > >naievely (you would expect 1/9 to start with "1", I imagine). > > > >Why this is, I have no idea... can someone explain? > > > It is also known as Benford's law and the First Digit law. You can read > about it at Eric's Treasure Trove of Math (seems to be down right now or > I'd give the URL). It would take me a few paragraphs to explain, but I'll > do it if you can't find it elsewhere. http://www.treasure-troves.com/ -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Animal behaviour is best described by the four F's Feed, Fight, Flee and Reproduce Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: Poaching
On Sat, 12 Jun 1999, Terry S. Arnold wrote: > You also have take into account the fact that the memory bus on C400 is > running at 66 MHz white the same bus on the PII-400 is running at 100 MHz. > This does make a difference on Prime95 since it is also memory intensive. Yep, and the L2 cache for the PII-400 is running at 200MHz and at 400MHz on the C400 making the speed comparison every more impossible:) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Do not meddle in the affairs of dragons, for you are crunchy and taste good with ketchup. Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: Prime 95 Error Messages/ Misc
On Mon, 7 Jun 1999, Gary Diehl wrote: > I also got the "illegal sumout" and it locked up my machine. It did it > four times in a row at the 6564090 iteration (the lock ups were hard > locks - had to recycle power to recover). > > However, I had my pentium-II 266 overclocked to 333, and when I reset > the speed back to 266 the problem went away. I have had it overclocked > for about 5 months now with no problems. I have been running prime95 at > 333mhz since 16 May 99. After resetting the speed to 266 I went back to > an older backup file (and lost about 4 hours work) just to make sure I > am still working with good data. Interesting to note -- the average > iteration speed at idle (0.275 sec) remained unchanged regardless of the > CPU speed change. Does overclocking even help? It does help but you have to remember that the reported time per iteration is gotten by counting clockcycles, then adjusting for the speed you yourself said your processor was running at. My guess is that you didn't change the cpu speed you'd told prime95 when you lowered the frequency, and since the problem takes the same number of clockcycles, it's reported as taking the same time. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Do not meddle in the affairs of dragons, for you are crunchy and taste good with ketchup. Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
RE: Mersenne: EFF and 10,000,000 digits
On Sun, 6 Jun 1999, Jud McCranie wrote: > At 11:30 AM 6/6/99 -0600, Aaron Blosser wrote: > > >I suppose it depends on whether Moore's Law can continue to hold true. I'm > >not so sure that we can keep doubling speeds of processors every 18 months > >as predicted... > > > That's often stated, but it hasn't been holding true. We are a factor of about > 65,000 short of where we should be - if it was true. Moore actually said "18 > to 24 months", but most everyone says "18". Anyhow, I did a test on it from > 1971 to 98, and it actually averaged about 26 months for the doubling time (and > it was slowing). Was that doubling based on clock speeds, or actual processing power? Clockspeeds are useless for comparing processors, even among processors of the same type. Case in point, I've seen a 350MHz P-II system that's more than 1.5 times as fast as a 300MHz P-II system for NFS calculations, because the former is a 100MHz*3.5, and the latter is 66MHz*4.5, making the memory access for the first system a lot faster. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Do not meddle in the affairs of dragons, for you are crunchy and taste good with ketchup. Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
RE: Mersenne: Screen saver killers?
On Sun, 16 May 1999, Aaron Blosser wrote: > To set up for automatic downloading on NetWare networks > 1. In the Network option in Control Panel, make sure that Microsoft Client > for NetWare Networks is specified as the Primary Network Logon client, and > that a preferred server is specified in properties for the network client. > For more information, see Chapter 9, Windows 95 on NetWare Networks. > 2. Create the policy file to be downloaded and save it in the following > location: > > \\preferred server\sys\public\config.pol > > > For NetWare networks, the client computers must be running Microsoft Client > for NetWare Networks. If the client computers are using NETX or VLM, then > policies must be downloaded manually. Slight bit of FUD there, Netware's own Client32 works just as well. > Important Make sure you place system policy files on the user's preferred > server. Policy files are not available if they are stored on other NetWare > servers or on computers running File and Printer Sharing for NetWare > Networks. > > Hope that's helpful. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: Getting maximum speed out of a Linux machine
On Sat, 15 May 1999 [EMAIL PROTECTED] wrote: > Me neither, so far as linux is concerned. > > I did find that ReCache "worked" in the sense of at least making things > no worse on a wide selection of systems running Win 9x & NT. It had least > effect on systems which had minimal physical memory, and most effect on > systems with lots of memory & high clock rate multipliers. e.g. on my > PII-333 system (96 MB, NT WS 4.0) on a 256K FFT a "random" start of > Prime95 gets an iteration time somewhere between 0.190 & 0.195 - towards > the high end if Prime95 is started automatically by means of a shortcut > in the "Startup" folder - whereas using ReCache I get 0.188 _consistently_. > > If you find ReCache doesn't work for you - even on a Windoze machine - > then I'm sorry, but you do have the option not to use it! This really sounds like it's a result of Intel's policy of making their chipsets as cheap as possible. It's a well known problem that several of the widely used Intel chipsets can't cache memory above 64MB. What isn't so well known is that this makes a real difference on Windows, since Windows uses memory from the high addresses first, so the first programs to be started ends up in uncacheable memory. This is why it's sometimes possible to see machine performance drop when you add more memory. I suspect the real reason why ReCache makes prime95 faster is that it uses up all the non cacheable memory, then loads prime85 in chacheable. This will also be the reason for the difference on Linux, since the VM model is completely different, and Linux specifically works around some of the stupidities of the chipsets. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
RE: Mersenne: usefulness and 486's
On Fri, 14 May 1999, Aaron Blosser wrote: > It does seem lopsided that your 486 takes 2 weeks to do what one of those > beastly PIII-550's can do in 12 hours (just a guess), but that's still 12 > hours less, and that beastly CPU can do a lot more LL iterations in that > time, so you'd still be contributing to the effort. On a related note, I've found that for LL testing, the speed of a Pentium MMX and a Pentium II is about the same adjusted for clock speed, but for factoring, the P-II seems to finish in about half the time. This indicates to me that there's room for more improvement, though how that would work in details isn't clear, since I couldn't find the source for the factoring part of the program when I looked. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
RE: Mersenne: I am curious
On Fri, 14 May 1999, Chris Jefferson wrote: > ---QUOTE--- > I was being a little sarcastic. I think that the original poster who was > wanting to team up with other people running at least 10 machines is not in the > spirit of the adventure. I think it is fine to make a team if everyone on the > team has regular physical access to each machine, but I don't like the idea of > teaming up with unknown people. That's why I said "why not make everyone a big > team", with a little sarcasm that was probably too subtle. > ---QUOTE--- > > Yes, I would have to agree here. Trying to create groups to get nice big > numbers of CPU years I do agree with, but not for the money. By the way, > aren't we forgetting something? I hope if anyone DOES win, they will give > a reasonable portion to the people who wrote the very highly optimised > software to do it, and the people who made sure they weren't re-checking > an exponent that hadn't been checked a hundred times before > > Just out of interest, can I have someone demand I give them a share of the > money / stop being in GIMPS if they really wanted to (not that I should > think they would...) One thing most people seems to have forgotten when it comes to talk about the money, is that according to the common scientific discovery rules George Woltman and Scott Kurowski will be co-discoverers of all primes found using mprime/prime95, and the client/server setup, so should rightfully get a big part of the money. Either half to George and Scott, half to the "winning" team, to split it equally between the runner(s) and the coders, or split equally between all involved, with George and Scott getting equal shares with the people in the team. Personally I have a problem with the idea of forgetting to credit the people who made it all possible, though I can understand if people think giving up 25.000$ for a principle sounds idealistic. :) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: Factoring bignums
On Wed, 12 May 1999, Pierre Abbat wrote: > Is there a program for factoring numbers up to, say, 2^128 in a reasonable > time? I tried bc but it doesn't have a factor command, so I wrote a loop and it > spent all its time outputting. Get Richard Crandall's giantint package, it contains factor, which will factor "any size" numbers, using a variety of algorithms. As for time, I just did a quick test: echo 123456789012345678901234567890123456789012345678901234 |time ./factor Sieving... 2 * 73 * 1723 * Commencing Pollard rho... .. .. .. Commencing Pollard (p-1)... .. Commencing ECM... Choosing curve 1, with s = 352116908, B = 1000, C = 5: .. 17108860903 * 28685059068699533197755335074782923141 14.11user 0.01system 0:15.72elapsed 89%CPU This on a 188MHz Pentium. You can get giantint from http://www.perfsci.com/ -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ `Can you count, Banjo?' He looked smug. `Yes, miss. On m'fingers, miss.' `So you can count up to ...?' Susan prompted. `Thirteen, miss,' said Banjo proudly. Terry Pratchett, Hogfather Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
RE: Mersenne: Re: Factoring & bugs
On Thu, 15 Apr 1999, Foghorn Leghorn wrote: > >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 factoring will ever become automated as a part of PrimeNet? Even > if it is never given as a default type of assignment, it would still > be useful to dedicated number theory enthusiasts who want to run it > on more machines than they can manage manually. For automated ECM factoring you might want to have a look at the ECM client/server setup at http://www.interlog.com/~tcharron/ecm.html instead, once you get it running it works quite well. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ A Pentium is a terrible thing to waste, http://www.mersenne.org/prime.htm Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: GUI for Linux
On Tue, 13 Apr 1999, Ernst W. Mayer wrote: > A bit off-topic, but I think there are enough Linux users out there > to justify it. Check out > > http://www.fsf.org/press/gnome-1.0.html Forcing Linux users to run X just to be able to admin a program is in my opinion quite silly. What I really like about mprime is that it makes almost no demands on what other crud is installed on the machine already. If you really want to gui for Linux, do it the Linux way and write one yourself instead of asking others to do it. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ A Pentium is a terrible thing to waste, http://www.mersenne.org/prime.htm Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Re: Mersenne: IMPORTANT: BUG IN VERSION PRIME95 17
On Thu, 1 Apr 1999, George Woltman wrote: > As alluded to earlier, version 18.1 is available. Those that > already upgraded to 18.0 can upgrade at your leisure. > Version 18.1 will get LL tests assigned to it, whereas version > 18.0 will only get double-checks assigned. > The deleting of v17 save files below 4.2M is fixed. Somehow I find it suspicious that the assignments status report http://entropia.com/primenet/status.txt shows no change at all in the pattern of assignments, something that should have been immediately visible if ~1 exponents had been recycled for first time LL-testing and if all old clients should only be getting double checking assignments. In the last three days, about the same number of exponents have been assigned in the 7.3M range each day, with no indication of the drop that would have been expected if all 17.* clients only got DoubleChecking assignments. Ditto for then expected jump in doublechecking assignments. Conclusion: Either it really IS an Aprils fool joke, or Scott haven't updated the primenet software, something that doesn't ring true with his previous performance. Henrik -- 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
Re: Mersenne: A dreadful Virus called Milessa!
On Wed, 31 Mar 1999 [EMAIL PROTECTED] wrote: > Gosh! > I just read an artical about new virus called "Melissa". When a user > opens this email in his or her MS Outlook, the MS Visual Basic macro > virus automatically sends a copy of itself to the first 50 people in the > user's address book. The subject heading reads, "Very important message > from [user]", (user = the last person who unknowingly sent it.) It > spreads like fire, from anyone who was unintentionally sent this email, > opening this email will breed another 50 copies. I read it in England's > Telegraph newspaper (31 March, 1999). Summery: dont open any messages > with the "important message..." business in the heading. I just thought a > bunch of emailers like you guys might need this info. Let me know if you > find out anything about this virus. > > -oliver This is a report that would normally have triggered all my hoax detectors due to the total lack of references, but luckily I'd already been informed by a more reliable source. For more info and the straight dope, check http://www.cert.org/advisories/CA-99-04-Melissa-Macro-Virus.html -- 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
Re: Mersenne: Version 18.1
On Thu, 1 Apr 1999, George Woltman wrote: > As alluded to earlier, version 18.1 is available. Those that > already upgraded to 18.0 can upgrade at your leisure. > Version 18.1 will get LL tests assigned to it, whereas version 18.0 > will only get double-checks assigned. > The deleting of v17 save files below 4.2M is fixed. I hope you didn't do as said in the whatsnew.txt, shouldn't it be KEEPING those below 4194304? 2) Only v17 save files below 4194304 are deleted. -- 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
Re: Mersenne: Need info about K6
On Thu, 25 Mar 1999, Bob Margulies wrote: > I have just discovered that my wife is about to be presented with a new > computer which contains a K6-2/333 processor, 64K L1, 512K L2, 64MB of > SRAM. I would be willing to invest a few $$$ of my own in an upgrade to > a Pentium if it made a substantial difference in running Prime95. My > understanding is that the program has been optimized for the Pentium. > The question is - how well does it run on the K6? > > Can someone please give me a comparison of the merits of the K6 vs. the > Pentium? Also, please withhold comments on the domestic implications of > the problem. http://www2.tripnet.se/~nlg/mersenne/benchmk.htm Though it only has results for the K6, not for the K6-2, but the main speed advance for K6-2 was in the additional 3DNow! instructions, which aren't used for prime95, so it should still hold. -- 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
Re: Mersenne: Small Conjecture (not mine, sadly).
On Fri, 26 Mar 1999, Henrik Olsen wrote: > On Thu, 25 Mar 1999 [EMAIL PROTECTED] wrote: > > Mp is a Mersenne Prime with odd prime p "iff" > > 3^((Mp-1)/2)=-1 (mod Mp) . > > > > Please mail to : [EMAIL PROTECTED] > > (before 3/30) > > ** > > At first sight, I thought "that's not right", but a few minutes of testing a > > few Mersenne primes and non-prime Mersenne numbers on my TI-92+ has upheld the > > "iff". Can anyone find a counterexample? This is bugging me. Augh! > > S.T.L. > > For a counter example, try M(3)=2^3-1=7, a mersenne prime though > 3^((7-1)/2)=27=6 mod 7 Paint me embarrased:) 6=-1 mod 7, Parkinson time I guess, and me only 33 years old :) There are actually no counterexample for p<1500, I've checked them all. -- 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
Re: Mersenne: Small Conjecture (not mine, sadly).
On Thu, 25 Mar 1999 [EMAIL PROTECTED] wrote: > The following was posted on sci.math recently (not by me, unfortunately): > ** > Subject: Mersenne Prime > From: <[EMAIL PROTECTED]> > Newsgroups: sci.math > Date: Thu, 25 Mar 1999 18:10:30 +0800 > Message-ID: <7dd21c$[EMAIL PROTECTED]> > > Mp is a Mersenne Prime with odd prime p "iff" > 3^((Mp-1)/2)=-1 (mod Mp) . > > Please mail to : [EMAIL PROTECTED] > (before 3/30) > ** > At first sight, I thought "that's not right", but a few minutes of testing a > few Mersenne primes and non-prime Mersenne numbers on my TI-92+ has upheld the > "iff". Can anyone find a counterexample? This is bugging me. Augh! > S.T.L. That looks suspiciously like Proths test, though that would be for fermat numbers, not mersennes, ie. 2^p+1, not 2^p-1, though the reason why you seen to find lots of tests that work is because the test is based on a^((Mp-1)/q)=-1 (mod Mp) where q is a factor of n-1, which works for both numbers since they have 2 as factor. For Mersenne numbers it's not a working test, since it must be true for all factors. For a counter example, try M(3)=2^3-1=7, a mersenne prime though 3^((7-1)/2)=27=6 mod 7 The confusion is probably caused by the Proth test being a socalled N-1 test, because it's based on N-1 being trivially factored. -- 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
Re: Mersenne: Mersenne Machine & Single Floppy LL Tester
On Wed, 10 Mar 1999, Curtis (Jewell) Whalen wrote: > >From: Marc Getty <[EMAIL PROTECTED]> > >Single Floppy LL Tester? > > > >Method Two > >- -- > >Use a linux bootable disk with mprime on it set to automatically > >load on boot, again only manual testing, with temporary files > >redirected to the hard drive of the computer. The linux kernel > >would have to be both FAT32 aware, because most new machines > >ship with FAT32 formatted hard drives now. Hell, if you are really > >good network support could also be built into this disk! > > > >I am not a linux guru by any means, but I'm pretty sure this is > >possible, and can then be freely distributed as a disk image. > > I REALLY like this idea. > > If this disk got distributed, maybe put LS-120 (SuperDisk) drivers on the disk > for an alternate temporary files location as well. I know Linux has them. > > Or just make a big ramdrive! > > --Curtis I've made a first approximation for a floppy like this and put it on http://www.iaeste.dk/~henrik/projects/mprime.html It's a standalone very small, very limited Linux system with mprime plus the utilities to run. I could have made it a lot smaller if I hadn't been adding a complete runtime environment to figure out why mprime kept segfaulting on me, until I finally figured out it's because it doesn't do all the checks it should for low memory, so blindly uses the not after all allocated memory:( If there is interest, I'll try to make it more useful, but there sure isn't room for much, more right now:) bye for now -- 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
Re: Mersenne: Can NTPrime be coded for MP?
On Mon, 22 Mar 1999, Aaron Blosser wrote: > Subject: Mersenne: Can NTPrime be coded for MP? > > I have a few quad processor PPro machines that I run NTPrime on. > > Currently, they're set up to run 4 instances of NTPrime with affinities from > 0-3, and this works just fine. > > Now, I'm sure George has thought of this, maybe, but wouldn't it be fun to > have a version of NTPrime that was capable of multi-processor computations? > > Does the algorithm lend any good ways to do this? > > The reason I thought of this was that if this is possible, would it not also > be possible to use multiple computers on a network to work on the same > number? With Windows OS', you could use DCOM or even just RPC to get many > machines working on the same number. > > I thought perhaps it might look something like you assign a "group" name in > prime.ini, identifying that PC as belonging to a group of others all working > in tandem. > > It might be too slow for the Internet since the dataset we're talking about > can be big, but for a LAN, I think it's reasonable, and certainly a good > idea for multiprocessing on the same machine. > > I just don't know enough about the LL algorithm to see for myself whether it > can be scaled to MP in any useful way. Basically I think it'd be fun to > hook my 32 current PC's together and have them crank out a single LL test on > an exponent above 7M in less than a day. It'd make a great double-checking > "engine" when we find the next prime. We could verify it in hours rather > than weeks. :-) > > Just a thought, maybe someone has more thoughts on this. >From what I know, FFT can be effectively handled by multiple processors with a shared memory abstraction, which should make it possible to greatly accelerate the LL test in a single SMP machine. On the other hand, the shared memory abstraction is really crappy speedwise when implemented in a clustered situation (memory access gets something like 4 orders of magnitude slower even if you use dedicated 100base-t links between the machines), so that wouldn't lend itself to parallellation nearly as well. My suggestion would be to forget about clustering the machines, and concentrate on either redoing the FFT for SMP or automating multiple simultaneous tests on the same machine. -- 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
Re: Mersenne: How to factor further?
On Thu, 18 Mar 1999, Cornelius Caesar wrote: > I got the idea to do some factoring with my now slower-than-average > machine (a P133), but I don't want to factor at the current assignments > (in the 9M range); instead I would like to fill up the factor limits of > small exponents to some common value (56 bits or 58 bits or so). > > Of course, doing it manually using "Advanced - Factor" is out of question, > so I thought to create appropriate entries in worktodo.ini and send the > results unsolicited :-) to the PrimeNet server. > > However, I seem to hit the automatic factor limit value in Prime95, or > something else: > > Error: Work-to-do-file contained bad factoring assignment: 65537,56 > > Is it possible to do what I am trying? Only by recompiling Prime95/mprime, the limits are hardcoded in the code. >From commonc.h in version 17.7: /* Factoring limits based on complex formulas given the speed of the */ /* factoring code vs. the speed of the Lucas-Lehmer code */ #define FAC64 915L/* How far to factor */ #define FAC63 727L #define FAC62 516L #define FAC61 LIMIT192/* This is 396L */ #define FAC60 295L #define FAC59 236L #define FAC58 193L #define FAC57 148L #define FAC56 100L -- 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
Re: Mersenne: Spam
On Wed, 17 Mar 1999, Jason Stratos Papadopoulos wrote: > > As most of you know, Majordomo has always been configured to > > bounce posts from people who are not subscribed to the list. > > In the past, this has caught all the spam (and I have saved it > > all, anybody want copies?) Well, one spam did get through > > at the dawn of the Age Of Spam. > > On the heels of this message came another spam. If this pisses you > off, you can complain to the postmaster at the ISP responsible. > > > > Look at the full header of the message, all of it. If you don't normally > see the full header, use unix mail or configure your reader to show it > to you. > > The first parts is a (possibly large) list of Received: transactions, i.e. > > Received: from acid.base.com (adsl-209-233-24-120.dsl.pacbell.net > [209.233.24.120]) > by po2.glue.umd.edu (8.9.3/8.9.0.Beta6) with ESMTP id DAA20440 > for <[EMAIL PROTECTED]>; Wed, 17 Mar 1999 03:35:53 -0500 (EST) > From: [EMAIL PROTECTED] > Received: (from majordomo@localhost) > by acid.base.com (8.8.5/8.8.5) id VAA12996 > for mersenne-outgoing; Tue, 16 Mar 1999 21:52:01 -0800 > Received: from www.bull.net (www.bull.net [192.90.127.17]) > by acid.base.com (8.8.5/8.8.5) with ESMTP id VAA12992 > for <[EMAIL PROTECTED]>; Tue, 16 Mar 1999 21:52:00 -0800 > Received: from pegase.bull.fr (pegase.bull.fr [192.44.49.46]) by >www.bull.net (8.8.2/8.8.2) with ESMTP id GAA70746; Wed, 17 Mar 1999 >06:49:48 +0100 > Received: from dzbull.frdz.bull.fr (dzbull.frdz.bull.fr [129.184.3.21]) > by pegase.bull.fr (8.9.2/8.9.1) with ESMTP id GAA38362; > Wed, 17 Mar 1999 06:35:58 +0100 > > It's the last Received: line that's of interest, because that's the > first server the message was routed through. None of the rest usually > matters, since spammers bounce messages all over the place to try > and hide their tracks. Likewise, the Reply-To field is always bogus. > (Is it becoming clear the sort of people we're dealing with?) Slight correction, it originated with adsl-209-233-24-120.dsl.pacbell.net, a dialup connection, with the rest of the headers faked, so it's actually (in this case) the first of the received lines that are the correct one. Remember that it's only for mailers that follow the rules it's the last Received line that's the originator, spammers don't follow the rules. -- 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
Re: Mersenne: LL testing
On Tue, 16 Mar 1999, Brian J Beesley wrote: > Suggestion, would you consider changing your filter rules to let > through messages whose subject header contains the key word > "mersenne" irrespective of origin? I doubt many "spammers" would > deliberately change their message format to sneak by that rule. > > Regards > Brian Beesley The problem is that the list software doesn't block spam sent to it, so adds Mersenne: to the subject before spamming us all. So far I've seen two messages sent through the list server, both of which would have been stopped if the server was configured to reject mail without Sender/From fields. I would also suggest adding checks at least for the MAPS RBL list of known unrepentant spamsites. -- 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
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
Re: Mersenne: Mersenne Processor
On Mon, 8 Mar 1999, Bryan Fullerton wrote: > On Mon, Mar 08, 1999 at 08:03:27PM -0500, Jason Stratos Papadopoulos ><[EMAIL PROTECTED]> wrote: > > On Sun, 7 Mar 1999 [EMAIL PROTECTED] wrote: > > > > > If one were to build a microprocessor SPECIFICALLY suited to LL testing, > > > what would the assembly instruction set look like? Approximately what > > > would the architecture look like? Speed shouldn't be an issue because > > > there's never enough anyway and we're trying to work smarter not harder. > > > [liberal snippage] > > > > Unfortunately, I just described the UltraSPARC, the Alpha and the PII. > [...] > > Ok, so why aren't there UltraSPARC and Alpha PrimeNet clients? > > Brayn Nobody's given one to George Woltman yet? -- 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
Re: Mersenne: biiiiig perfect number
On Sun, 7 Mar 1999, Spike Jones wrote:
> I once had a great idea: I would express the Great Number in hex!
> Then I realized that I would get with 4 pages of tiny Fs. {8-[
> Not so interesting. But if some clever GIMPSer were to generate the
> perfect number that is (M37*(M37+1))/2 then express *that* number
> in hex, I would clear off a space on my office wall for it. {8-] Anyone
> accept the challenge?
Lots of F's, followed by one fewer 0's, not a lot prettier. :)
--
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
Re: Mersenne: linux
On Sun, 21 Feb 1999, André de Boer wrote: > Subject: Mersenne: linux > > Hello, > > Recently i installed linux on my pc and i'm thinking of > switching to this platform. > What's the best way to transform my prime configuration to > this platform. > > Can i download the files for linux and copying the p* and q* > files to linux? > > Thanks in advance for the reaction, > Andre de Boer Just run mprime in the same directory as you have prime95.exe, it'll use the same .ini and p*/q* files, updating them in a compatible way. I regularly switch between Win95 and Linux, simply continuing the calculations where they stopped in whatever system I was in last. -- 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
Re: Mersenne: Updating user preferences on Primenet server
On Mon, 8 Feb 1999, ric wrote: > Thus, I found a bit strange that a longtime preference of mines "receive > e-mail" was set to "NO". So, I went to manual test page and tried tho > update account information by myself. > > Does any other on the list face this weird thing? I already sent a mail to Scott telling about it, so I expect it to get fixed Real Soon Now(TM), You should have seen the page just after the update, the "To Go" times where negated. :) Anyway other changes include sortihg the entries by the date updated instead of by exponent, as well as removing the indication of the type of assignment, two things I wonder about the reason for. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Primes95 for SunOS 4.1.4
On Tue, 2 Feb 1999, Luke Hayter wrote: > Is there a Unix prime search app that does what Primes95 does ? > The graphical front end isn't needed, just the ability to configure > it, and it run happily in the background with little need for > manual interaction other than some way of finding out the status of > the searching. > > There are 3 SunOS workstations in this office that sit doing little > more than reading and displaying files - so they can be kept busy > testing for primes. > > Having looked at the various sites and archives the above question > doesn't appear to be answered - or I'm blind. > > Two workstations are SunOS Release 4.1.4, and one is SunOS 4.1.2. > We don't have GCC installed, but can install it if necessary. > > Please can someone point me in the direction of more help. Check http://www2.netdoor.com/~acurry/mersenne/freeware.html for source versions of the original program. They won't include automatic assignment of work to do, so you'll get to do some manual work in giving them assignments, check http://entropia.com/ips/manualtests.html for info on getting assignments. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Prime testing on 486 running linux
On Tue, 2 Feb 1999, David N. Moreno (El Guapo) wrote: > Hi All, > > I am having a software problem(GIMPS), and am hoping somebody has had a > similar expierience. I have a 486 DX4-100 running linux (Slackware, > kernel 2.0.34, 16 meg of RAM) and I cant get either of the linux versions > available to work on my machine. I have essentially the same problem, mprime segfaults on a 486, I tried with both Slackware 3.5.0 and RedHat 5.2, exact same library and kernel versions as the ones in the pentium machines I run mprime on. My "solution" has been to use that machine for ecmnet instead. (and as a fax machine, that's why it's always running:) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Problems with ATI graphics
On Thu, 28 Jan 1999, Louis Towles wrote: > I tried this a few months ago on our E series Gateways (ATI Rage Pro) > > Prime95 LL test - yes interference > Prime95 factoring - no interference > Distributed Net Client - no interference > FPU benchmark (I think it was ZD winbench's FPU test) - yes interference > The no FPU benchmark - no interference > It's is in all video modes (although harder to see on some) > It start as soon as you start pegging the FPU (can be right after boot with > the chip still cold to the touch) > Stop as soon as the FPU backs off > > Louis Towles All this sounds like an excellent time to test the warranty on those motherboards, as they're obviously defective, and fundamentally flawed in their design. Henrik -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Mersenne: Trial factoring not getting credited?
Hi, I've noticed that several of the exponents I've been assigned recently had been trial factored to fewer bits that normal for that range, so mprime started out with trial factoring them, before going on to double check it. Now, what I wonder about, is why that time spent trial factoring isn't credited as such? -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Small doubt
On Fri, 15 Jan 1999, Roger Vives Miret wrote: > Date: Fri, 15 Jan 1999 10:12:10 +0100 > From: Roger Vives Miret <[EMAIL PROTECTED]> > To: [EMAIL PROTECTED] > Subject: Mersenne: Small doubt > > Hi list, > > Running prime95 following message is shown: > "Factored M8496239 through 1577822272*2^32 (pass 5 of 16). > Clocks 22113124 = 0.221 sec." > ^ > May anyone tell me what is the number following 'clocks' word (in the > example 22113124) and the time (?) (in the example 0.221)? > > Thanks! > > Roger Vives Clocks would be the number of CPU clock cycles spend on each iteration averaged since the last message, the time is the calculated time based on this cycle count. As has been mentioned one this list earlier, the time is based on the processor speed as set in the configuration, so it doesn't necessarily have anything to do with reality. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: mprime for QA or performance?
On Fri, 15 Jan 1999, George Woltman wrote: > At 12:24 AM 1/13/99 -0800, Leu Enterprises Unlimited wrote: > >On one CPU, after two days worth of burn-in, the time required to > >complete 100 iterations on the stock number went down, as I would expect. > > > >On a second CPU, the time actually *increased*. From 1 day, 18 hours, > >and 55 minutes, to 1d 19h 13m! > > I'd be surprised if burning in had an effect on iteration times. > More likely, 100 iterations is not enough to get a truly accurate > timing. I'd be extremely surprised, since the speed of the computations is strongly linked to the processor clock, so either you're measuring clock drift (and yes, that is temperature linked) or due to your small samples the variance mentioned which is about 1% is actually noice. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Let's recruit her for GIMPS
On Fri, 15 Jan 1999, Ernst W. Mayer wrote: > The following article, titled "Irish teen's e-mail code could > transform Internet commerce" should be of interest: > > http://www.cnn.com/TECH/computing/9901/14/email.genius/ > > Pretty impressive work for a person of any age, much less a 16-year-old. > We should see if we can recruit her for the GIMPS effort. > > -Ernst I checked that article, it has no mention of her algorithm, no mention of the strength of the algorithm, no mention of whether the judges where competent to evaluate the strength of the algorithm and a very scary quote foretelling the future of her work. She said that she would prefer to publish her discovery rather than patent it, because making money from it would go against the spirit of science. With the way the US patent law works, that will put it up for grabs to whoever gets the application done first, thus enabling them to prevent any unlicenced use by others, including the discoverer. She's showing her age with that comment:( -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Three Questions...
On Mon, 4 Jan 1999, Christopher D Lund wrote: > Since I recently cleaned out my mailbox, I probably deleted the answers to > these questions, so I'll have to ask again. I have set up my system at > home to run both Windows 98 (which I have for some time) and Linux (which > I'm getting into). As a result, I have a few questions about running mprime. > > 1. Is it possible to have Prime95 and mprime share the same files so that > my system tests the same number independant of the OS? (That is, are the > files compatible?) That's the setup I'm running with right now. prime95 has some additional values in prime.ini, controlling the window and such, but as far as I can see there's no problem with sharing the setup. > 2. If it is (or if a conversion program is easy to write), does this > compromise the integrity of the test so that it really shouldn't be done? when stopped, prime95/mprime writes its current state, again in the save format, so it'll continue from the same place. If you're really concerned, you could delete the SelfTest*Passed Lines in local.ini before starting under the other system, to make it rerun the test under that as well. > 3. How does the efficiency of mprime compare to Prime95? (That is, I'm > getting 0.207 s/iteration under Prime95 right now. How would mprime handle > a comparable number?) There is a little difference, but I think it's mainly because you tend to have more services running under Linux, it's within 5% -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Primenet server unreachable
On Mon, 4 Jan 1999, Bryan Fullerton wrote: > On Sun, Jan 03, 1999 at 10:12:20PM -0500, Paul Derbyshire <[EMAIL PROTECTED]> wrote: > > Contacting PrimeNet Server. > > ERROR 2250: Server unavailable > > Will try contacting server again in 60 minutes. > > > > What the heck? It's been trying for over a day now. Anyone here have any > > information on this and when the darn thing'll be back up? > > I've been trying to report in several completed tests as well, same > problem. Emailed Scott about it earlier today or late last night, but no > answer yet. When trying to access the individual status for my machines, I got the following from the webserver: The name specified is not recognized as an internal or external command, operable program or batch file. That first line that comes before the line seems to indicate that they have some problems with the database system used to keep track of everything, and since this is the second weekend in a row where the service has been disrupted, to me it looks a bit like they're trying to upgrade something and it's fighting back:( A comment from someone in the know to tell us what's going on might be a good idea. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Mersenne: Primenet server woes
Hi, Does anyone know what's been up with the server this past 26 hours? -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Re: Mersenne: Linux Client
On Fri, 25 Dec 1998, Sam Laur wrote: > > I'm using the Linux client for about 2 weeks now and it does never display > > anything on the console (bash, XTerm). Is there anyone with an answer ? > > Yes - if you run it in the background with "mprime &" it will never show > anything on stdout; neither will it, of course, if you just run it with > "mprime". If you want to see the progress, then run it with "mprime -m" and > select menu item 6 (Test/Continue). Then it will print out the same as > the Windows version and probably be just a bit faster (some thousandths of > a second - on one range I got 0.280-0.281 on Win95 and a steady 0.277 on > Linux). > I've been using it for a while as well, and I'm quite interested in that observation, as it's directly opposite the behaviour I normally see, which is that the win95 version is a bit faster than the linux version. 0.109 on win95 compared to 0.115-0.117 under Linux. FWIW, I start it with (cd /DOSd/mprime; nohup ./mprime -d >>mprime.run &) so I get a running report in /DOSd/mprime/mprime.run the nohup is just because I'm paranoid, it's probably not useful at all:) -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
Mersenne: Connection to primenet blocking under Linux
Hello, I hope this is not the wrong forum to post this problem. I tried to make the subject as descriptive as possible, but to explain further, I've just signed on by downloading the mprime.tar.gz, installing it as the instructions said, etc. Now, my problem is that about every 1/3 times it tries to connect, instead of realising that the server's not available, it blocks instead, leaving the process essentially dead while waiting for a response, making it a requirement to kill the process. My current system is Linux with kernel 2.0.26 with the securelinux patches, libc.so.5.4.44, libm.so.5.0.9, and I'd really like to have it work, but currently it seems like most of the time I want to donate to the project is ending up in a bug:( I really hope someone's got a hint on what I can do to make the communication at least die instead of stopping the calculations. Keep crunching. -- Henrik Olsen, Dawn Solutions I/S URL=http://www.iaeste.dk/~henrik/ Get the rest there.
