Re: Mersenne: End of list
On Thu, Apr 22, 2004 at 11:30:18AM -0700, Gordon Irlam wrote: FYI. I intend to end this list shortly. Sad, but it hasn't been all that high-volume lately, and I understand the problems hosting it. I haven't been here for all that long (umm, I can't remember for how long :-) ), but it's been fun, and I doubt I'm the only one who have learned quite a bit from the discussions (although most have been way over my head). :-) Web-based alternatives are extremely crappy compared to a mailing list, though, but that seems to be the state of the Internet currently... /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: M#40 - what went wrong?
On Fri, Jun 13, 2003 at 03:42:26PM -0700, John R Pierce wrote: The extended FP multiply has 64 bits of mantissa. SSE2 is, I believe, restricted to 32bit multiplies, so it would take 4 times as many to equal one 64bit (gross simplification, but sufficient for the purposes here). SSE2 can handle 64 bit floating point numbers (not that I can remember off the top of my head how many bits of mantissa there are in those) -- the traditional x86 FPU can handle 80 bits internally, but usually you only save 64 bits of those. In other words, precision is not _that_ big of an issue, even though Prime95 has more conservative limits for SSE2 CPUs. (SSE1, on the other hand, only supports 32 bit numbers, and thus is not usable for Prime95.) The biggest problem with SSE2 is of course that it's only supported on the Pentium 4 yet -- they are becoming increasingly common, but for instance, no current AMD chip supports it. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Twin prime conjuncture
Just saw this on Slashdot -- appearently it has been proved that there are infinitely many near-twin primes, ie. primes that are very close together without not neccessarily being twins. The article doesn't go into too much detail, but I'm sure one could follow the links and learn more. :-) http://www.siliconvalley.com/mld/siliconvalley/5483833.htm /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Twin prime conjuncture
Whoops, that's _conjecture_, of course. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Hyperthreading, once again
I discussed hyperthreading with a few friends the other day -- I pointed out that it was probably only useful for CPU-bound tasks, like we've discussed here earlier. But then somebody said each HT `virtual CPU' had their own part of the bus, so it would definitely help with I/O bound (RAM I/O, of course, not disk I/O) programs as well... Could this be true, or is this just misinformation? /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Overheating!
On Wed, Mar 19, 2003 at 10:38:52AM -0800, John R Pierce wrote: hey, speaking of... anyone care to point me to something I can understand on how to configure lm_sensors in Linux to work with an Intel server board? I'm getting no readings... Try sensors-detect. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: p4 xeons...
On Sat, Mar 15, 2003 at 11:35:01PM +, Brian J. Beesley wrote: As for hyperthreading - I believe the development kernel (2.5.x) has support for hyperthreading. You will almost certainly need to build your own custom kernel to obtain this support. The latest 2.4.x series has too, AFAIK, but the scheduler is not as optimized for it as in the 2.5.x series. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: please recommend a machine
On Sat, Mar 08, 2003 at 09:11:38AM +, Brian J. Beesley wrote: You _might_ be able to recycle the old case as well - however you will probably need to replace the PSU with a new one in order to supply the power requirements of a P4 system. Look for PSUs rated over 300W with dual fans - I particularly reccomend the Enermax PSU with rheostat fan speed control because it's quiet effective, though certainly not cheap. While we're at it -- is it possible nowadays to get power supplies _without_ fans, or at least with only one? I removed my (rather noisy) SCSI disks a month or so ago in favour of running diskless over NFS (unfortunately, I can't get the gigabit cabling to work, so it's `only' 100mbit ATM), so what I have left of fans is: - One 12dB CPU fan (80mm -- it used to be a problem that the CPU got hot, think 85°C, but after getting a proper heat sink it rarely goes over 60°C) - One microscopic fan on the graphics card - The two power supply fans (one 80mm and one 120mm) It's funny -- when the disks and the CPU cooler noise goes away, you suddenly start to care about the power supply, even though it is rather quiet already. As I barely have any equipment left in the PC anymore (an Athlon XP 1700+, some RAM, two rather old graphics cards, a network card and a sound card) I don't think I'm going to need very much power either... Anybody know what my options are if I want a silent power supply? :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Communication between GIMPS Forum and Mersenne mailing list (was: Poaching -- Discouragement thereof)
On Sat, Jan 25, 2003 at 12:38:35AM -0500, Michael Vang wrote: Well, to be honest, not much more can be done... As it is now, we have several mechanisms in place to enable people with dialup access the ability to log on and get done right quick... 1) There are no heavy graphics usage... (If I were paying for access I'd have graphics turned off anyways!) 2) Everything is GZIP compressed... 3) You can have email notifications of new posts... Still, you can't do what you can do with e-mail or a newsgroup, namely: a) Log on, download all new posts, log off. b) Sit logged off, take your time to read all new e-mail (in a form _you_ choose -- if you don't like the forum interface, you can't change it, but you're free to select whatever mail-/newsreader you want). No delays to read a new message, proper text editing functions if you want it, etc.. c) Log on, upload your answers, log off. In short, the very concept of a web forum (where you have to do everything via the web, rather than using a dedicated application for it) just isn't that appealing to most people who have used e-mail or news for a while. The fact that most forums are extremely poorly designed userfriendliness-wise (note that I'm not very familiar to the GIMPS forums, so don't take this as a critique of the GIMPS forums in particular) doesn't help, either. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Poaching and related issues...
On Sat, Jan 25, 2003 at 03:38:14AM -0500, Richard Woods wrote: The cases of conflict you cite had no such method for avoiding duplication/overlap. Early GIMPS and the other project (Slowinski/Cray) had no common agreement or method for avoiding duplication. Umm, I've not been in this project _that_ long, but at least a year or two before Primenet got integrated into the main client. At least at that time, all communication was done by e-mailing George requests for ranges (a list of free ranges was available on the GIMPS website), George solving conflicts if two people requested the same range. (All results were also handed back to George via e-mail, of course.) Are you talking even older than that? :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: question not in faq
On Fri, Jan 24, 2003 at 06:39:40PM -0500, Frank Anzalone wrote: If I need m mod n and m is to big for my mod function, I believe I can add a mod n to b mod n provided a+b=m. Is there an easier way? suppose n is to big? What do you mean by is too big for your mod function? Usually, in this case (at least if m is _way_ too big for your mod function), one would simply use another mod function. :-) But yes, (a mod n) + (b mod n) = (a + b) mod n, as you say -- I doubt it would help you that much, though. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: P-1 and non k-smooth factors
On Thu, Dec 05, 2002 at 12:31:00PM +, Brian J. Beesley wrote: the entire _virtual_ address space is limited to 4 GBytes by the 32 bit address bus, and the OS kernel claims some (usually half) of this, so that the total memory usable by a single process is limited to 2 GBytes. (There is a big memory variant of the linux kernel which expands this to 3 GBytes, but the point still stands). Actually, in newer Linux kernels (ie. at least all 2.4.x versions that I can remember) you can expand this further, up to 64GB on CPUs that support it (which is, AFAIK, Pentium Pro and newer, so in reality it won't be a problem). I don't really know what it does, but judging from the help entry, it appears like it can still only address 4GB at a time, so it's more or less `changing views' of what it can address all the time. This sounds like it might hurt performance when you want a lot of random memory access, though... /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Linux kernels
On Thu, Dec 05, 2002 at 08:02:58AM -0800, Chris Marble wrote: Actually it's a lie. I've got a dual Pent III with 4Gb RAM. You cannot have a single process that uses more than 2Gb of RAM with any of the Linux 2.4 kernels. We hadda install Solaris on the box to do what we wanted to. Hmm, good point -- of course a program like mprime has to run as a single process. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: christmas computer system?
On Sun, Nov 24, 2002 at 08:56:30PM -0800, John R Pierce wrote: those are very fast CD readers too... I dunno CD-RW, never had much use for them, but the bulk TDK blanks I get at Costco seem to burn 100% AOK at 40X, and you can make a 700MB data backup in just a couple of minutes. One should basically not use a CD-R/CD-RW as a general CD reader, since it usually has way lower MTBF than a normal CD/DVD reader, and is more expensive. Ie. it breaks a lot earlier if you use it a lot, and it's more expensive to replace :-) /* Steinar */ - already destroyed two of them, with not very much usage ;-) -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: christmas computer system?
On Sun, Nov 24, 2002 at 12:00:46PM -0800, John R Pierce wrote: btw, lotsa folks will disagree with me, but I find onboard sound to be more than sufficient for 99% of users actual needs unless you are hooking this system up to a goldenears audiophile system, you aren't gonna hear the difference, and I've had *SO* much trouble with the proprietary drivers for the likes of Sound Blaster Live and Audigy cards that I will never touch another one. On the contrary, I've found SBLive! (and other emu10k1-based systems) to be quite a lot less problematic than your random OEM onboard driver :-) Of course, I use Linux exclusively, which might be related ;-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: GIMPS forums!
On Thu, Aug 15, 2002 at 06:14:28PM -0400, George Woltman wrote: I know some folks prefer the mailing list approach for news. I'll continue to post news on this mailing list and on the forums. The forums will let us do searches and see past posts easily. The question is -- is this kind of fragmentation good? I know I'd personally _never_ switch from a well-working mailing list to a web board, simply because I find web boards slow, cumbersome to use and often difficult to customize to my own tastes. OTOH, some people prefer web boards, and will probably flock to the board... Are we basically splitting our reader base in two here for really no good reason? /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Question About Prime Testing Algorithms
On Thu, Aug 01, 2002 at 07:01:04AM -0700, Gary Edstrom wrote: I seem to remember reading that there are probabilistic tests that can be run on a number. The test is repeated for a number of iterations. If the test fails any iteration, then it is definitely NOT prime. If it passes a sufficient number of tests, then it is PROBABLY prime. Now my question is this: How long does an iteration of one of these probabilistic tests take? and Can these tests be used on Mersenne numbers? It would seem to be a good way to dispose of even more Mersenne candidates before submitting them to the lengthy Lucas-Lehmer algorithm. Why isn't it done? Isn't it already done? Prime95 has been doing P-1 tests for quite a while now. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: This supercomputer is cool
On Wed, May 22, 2002 at 11:36:11AM +, Brian J. Beesley wrote: A few weeks ago there was an argument based on making graphics chips programmable. This would enable massive parallelization of SSE type code. Of course we really need double-precision, but it's an interesting idea. How massive is massive? Most graphics hardware today can only texture one, two or four pixels per clock -- although they can do a lot of work quickly, they definitely don't do hundreds of operations at a time :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: mprime crashes in linux 2.4.8
On Sat, Apr 13, 2002 at 10:20:37PM -0400, Pierre Abbat wrote: I was running mprime 21.4.2 under Linux 2.4.3 for many months with no problem. I just rebooted into 2.4.8 (both are stock kernels from Mandrake) and mprime segfaulted. Umm... Could you try a _stock_ kernel? Mandrake's kernels are heavily patched. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: mprime, linux and 2 MB pages
On Tue, Mar 19, 2002 at 08:11:54PM +, Brian J. Beesley wrote: The speed it's running at suggests that any performance loss due to TLB thrashing is small, since the extra drop beyond linearity is only about what one would expect from the LL test algorithm being O(n log n). Disclaimer: My argument below might not be a very valid argument. ;-) Paste from gwnum.c, Prime95 v19: /* Well I implemented the above only to discover I had dreadful */ /* performance in pass 1. How can that be? The problem is that each */ /* cache line in pass 1 comes from a different 4KB page. Therefore, */ /* pass 1 accessed 128 different pages. This is a problem because the */ /* Pentium chip has only 64 TLBs (translation lookaside buffers) to map */ /* logical page addresses into physical addresses. So we need to shuffle */ /* the data further so that pass 1 data is on fewer pages while */ /* pass 2 data is spread over more pages. */ So, it might be that due to TLB thrashing, George would have to choose a less efficient memory layout to avoid them, and thus get lower speed overall. No such note in v20, though :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Two L-L tests at once?
On Fri, Mar 01, 2002 at 08:22:44PM +, Brian J Beesley wrote: Sure But the only way there would be a problem here (given that the data values are independent because of the different random offsets) is if there was a major error like miscounting the number of iterations This is relatively easy to test out Take the worst-case scenario -- some person has cracked the PrimeNet security code and submits fake results Or a cosmic ray hits the CPU just before it calculates the PrimeNet checksum, causing it to send a bad residue Or whatever :-) I don't really see the point of doing it this way -- I'm sure most users would be a lot happier getting twice the speed out of their computers You'd have less problems with early quitters, too /* Steinar */ -- Homepage: http://wwwsessenet/ _ Unsubscribe list info -- http://wwwndatechcom/mersenne/signuphtm Mersenne Prime FAQ -- http://wwwtasamcom/~lrwiman/FAQ-mers
Mersenne: Re: Are problems more likely in the last 1% of a 10,gigadigit LL?
On Thu, Feb 14, 2002 at 10:55:00PM +, Russel Brooks wrote: My save files are @1.5M in size. I could save quite a few before space was any concern (too me). Mine are @7M -- and I'm of those who prefer speed and sound level (two Ultra160 SCSI 1rpm 18.2GB disks, in RAID-1, both very quiet) over diskspace -- people are buying _cheap_ 80-100GB disks without even blinking nowadays. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Are problems more likely in the last 1% of a 10,gigadigit LL?
On Thu, Feb 14, 2002 at 03:54:41PM -0800, Aaron Blosser wrote: I doubt George would be interested in working in a little simple zip routine when saving/reading save files? AFAIK, most of the space is due to the data being stored in floating-point format instead of integer. There was some talk about a common save format among Mersenne testing programs (an integer-based one was suggested), but I don't know how it went from there? /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Are problems more likely in the last 1% of a 10,gigadigit LL?
On Thu, Feb 14, 2002 at 12:47:23AM +, Russel Brooks wrote: How about a Prime95 option where it makes a daily backup for you, saved to a datestamp fileid? It could save them to a subdirectory with the exponent name. That would make it easy for the user to do a cleanup occasionally. Those files get _big_, unfortunately... Your HD would quite quickly fill up. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: 10 million digit overkill
On Tue, Dec 25, 2001 at 01:41:31AM -0500, Paradox wrote: If the computer above could do each iteration in 0.001 seconds, the amount of seconds required to complete the task would still be significantly more than 4,000,000 digits. Thats incomprehensible. Unless we find something more efficient than the Lucas-Lehmer test before that. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Maybe the #######th Mersenne prime???!!!
On Tue, Dec 25, 2001 at 03:20:50PM +0100, Elias Daher wrote: (2^2-1) is prime! (=3) (2^[2^2-1]-1) is prime! (=7) (2^[2^(2^2-1)-1]-1) is prime! (=127) [...] Well, I wish I will live enough (maybe thousands of years!!!) to see this number tested! I'm positive there was a FAQ entry on this very question somewhere, but I can't remember where it was... /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Factoring benefit/cost ratio
On Wed, Dec 05, 2001 at 07:10:24PM -0600, [EMAIL PROTECTED] wrote: Am I correct in interpreting this to mean that you think that using 64-bit residuals is more reliable than using 16-bit residuals? If so, then surely you'll grant that 256-bit residuals would be even more reliable yet, meaning that there's still room for error in our practice of using 64-bit residuals. Given that the chance of error (given that it is a random error and no program error) of a wrongly matched 64-bit residual is about 0.0542%, I think you'll agree that a 64-bit residual would be sufficient. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: [Mersenne] celebrate
On Sun, Nov 18, 2001 at 01:09:18PM -0500, Jud McCranie wrote: I should have suggested this yesterday, but let's have a meteor shower to celebrate the probable discovery of a new Mersenne prime! Big, big disappointment here in Norway -- I was outside for about an hour during the maximum, _nothing_ to be seen. No clouds at all, perfectly clear, but not a single meteor. :-( Let's hope the prime verification goes better ;-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: number of processors participating
On Thu, Nov 08, 2001 at 07:58:37PM -, [EMAIL PROTECTED] wrote: The point is that it is almost impossible to modify a binary image without changing the MD5 checksum - in fact, to the best of my knowledge, this has not been demonstrated, even in a laboratory environment - a very great deal of trial and error would be required to match the 256 bit checksum First, MD5 is only a 128-bit checksum (SHA1, which is intended to replace it, is 160 bits). Second, there _are_ known weaknesses in MD5 -- as far as I remember, it is possible (although not without a great deal of work) to produce two messages/files with the same checksum -- but I don't think you can decide the checksum for yourself, and you certainly can't modify a file, add a few bytes and retain the checksum. Just that there are weaknesses, though (and they could be viewed as rather serious), would probably mean it's best to leave MD5 alone and instead use SHA1, which is (as far as I've heard -- I'm certainly no cryptography expert) extremely well-designed, and free from any known weaknesses. Except for the MD5 weakness, though, hashes are generally extremely difficult to fake -- that's their main purpose, after all :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: What will we do when anyone finds a number of 10 million+ digits which is prime?
On Mon, Nov 05, 2001 at 12:02:30AM +0100, Torben Schlüntz wrote: What will we do when anyone finds a number of 10 million+ digits which is prime? Spread the prize according to the rules on the website, and continue searching? ;-) Will everybody just leave the project because there is no prize to gain any longer? Considering that the project worked very well for years (actually, a whole lot longer than we've had a prize) before EFF announced its prize, I doubt so. :-) After the introduction of search for 10 million digits number this could leave the project with quite a big hole, say from M14.xxx.xxx and up till the exponent found. Well, then we'll do our best to fill such a hole, won't we? :-) It will be kind of difficult to find new volunteers that will use time and electricity to fill the hole if nothing more than glory is won. Doubtful (see my comments above). Will there be an other prize? Will there be a new goal? EFF has a prize for a 100+ million digit prime, and a 1000+ million digit prime. The first prize (which has already been awarded) also went out to a GIMPS member, discovering the first 1+ million digit prime. :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: What will we do when anyone finds a number of 10 million+ digits which is prime?
On Sun, Nov 04, 2001 at 07:27:35PM -0500, George Woltman wrote: Of course this is all very wishful thinking. It would take about 20,000 top-of-the-line P4 systems a year to have a 50% chance of finding a 10M prime. We will find it one day, but it is more likely to be when 5 and 10 GHz P4s are commonplace. Speaking of which -- shouldn't we be (statistically) really close to finding a new prime soon? /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: number of processors participating
On Tue, Oct 30, 2001 at 10:00:07PM -, [EMAIL PROTECTED] wrote: which are much shorter than the minimum timeslice (which is typically of the order of 200 ms). 200ms? Wouldn't this be an error? I can't really imagine that one would typically have only five time slices per second :-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Lucas Wiman Mersenne Prime FAQ
On Thu, Oct 25, 2001 at 10:31:57AM -0500, Ken Kriesel wrote: M33219281 is the smallest Mersenne Prime with at least 10^7 digits. Possibly Mersenne prime candidate, not Mersenne prime? 33219281 is prime, but my guess is somebody has checked 2^33219281-1 long ago, and I haven't heard of any prime being found there ;-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Problems with firedeamon and prime95
On Mon, Oct 22, 2001 at 11:26:18AM +0200, Reto Keiser wrote: The user interface is quite desirable, but if no solution can be found, we have to use the nt version instead. I don't really see the problem -- last time I checked the service version, it had a front-end resembling Prime95, that one could use to control it? /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Message display problems [OT] (was: Re: AthlonXP)
On Mon, Oct 15, 2001 at 03:36:39PM -0700, Matthew Ashton wrote: I've heard that before, and always from Outlook users. It seems to be a bit of a bug in how outlook interprets the pgp signature. (Is this any better?) If there's still a problem, try set charset=iso-8859-1 in your .muttrc file. It has fixed some similar (although not PGP-related) problems for me. /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: AthlonXP
On Mon, Oct 15, 2001 at 07:35:36PM -, [EMAIL PROTECTED] wrote: What I would like to see in a CPU is a means where you could upload your own microcode, enabling design of specific instruction sets to handle particular problems very efficiently. What about (in an ideal world) just programming microcode directly, without having to make an extra instruction set on top of that? Suddenly, you would have both instant access to all the ports (or whatever the CPU makers call their execution units these days), a lot of registers, etc.. In addition, the problem with only a single decoder etc. on P4 would effectively go away entirely. The only problem I could see would be a lot more code having to go over the bus (and occupy more space in the instruction cache), especially as some people have pointed out that the microcode might very well be some form of VLIW :-) At least for us Linux users, having to recompile everything wouldn't be _that_ big of a problem -- source for about everything you'd need would be readily available (except that mprime would have to be ported, of course ;-) )... /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Torture test passes but normal use fails!
[snipped: text explaining possible cause of prime95 errors] Whoa, That's quite a comprehensive text you have there, Brian. What if one put something like this online somewhere on mersenne.org? /* Steinar */ - who just got his motherboard replaced AGAIN... same error as last time (random reboots more and more often, and finally motherboard death) -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: P-1
On Thu, Jul 26, 2001 at 01:58:17AM -0400, CARLETON GARRISON wrote: Your statement has made me look deeper. The difference between factoring 2^211 and 2^311 seems trivial, but using trial factoring I understand this difference equates to a billion-fold (2^30) increase in computational resource. A bit tongue-in-cheek: Both 2^211 and 2^311 are incredibly easy to factor, as both have 2 as the only factor, over and over again ;-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: scientific american
On Sun, Jul 22, 2001 at 04:53:50PM +0200, mohk wrote: Are we alone? 1) no, we found something 2) dunno :) Are there more than 38 (aren't we at 38 now? ;-) ) Mersenne primes? 1) No, we found something. 2) Dunno :-) Now, of course, we _think_ there are more Mersenne primes out there, while SETI is more of a guess ;-) /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Prime web site
On Thu, Jul 19, 2001 at 05:08:34PM -0600, Matt Goodrich wrote: Anyone else having trouble hitting the web server?? Both WWW and FTP down from here. :-( /* Steinar */ -- Homepage: http://www.sesse.net/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: New Address and Phone number
H David Carol Friedberg7505 Weeping Willow Boulevard (after July 20th) Sarasota Florida 34241941 925 1191 or 941 587 1308 cell701 Land's End Drive Longboat Key FL 34228 until July 19th BEGIN:VCARD VERSION:2.1 N:Hollman;Al Sonia FN:Al Sonia Hollman TEL;HOME;VOICE:378 8019 EMAIL;PREF;INTERNET:[EMAIL PROTECTED] REV:20010710T145300Z END:VCARD
Mersenne: Re: numeric hazards of high performance CPU design = Pentium 4 - constant speed problem
On Sat, May 19, 2001 at 10:53:13PM -, Brian J. Beesley wrote: BTW if you have Prime95 or mprime running with a displayed console window, reduced clock speed will be evident. Since the CPU clock _but not the memory bus speed_ will be reduced, the clocks per iteration will _fall_ to an unusually low level. However you should notice that the per iteration time no longer corresponds to real elapsed time between output lines. Hmmm... What do you mean by a displayed console window? An MS-DOS-window? I'm quite positive that mprime on Linux doesn't slow that much down when I open up a copy of /bin/sh, at least :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Different results
On Fri, May 18, 2001 at 07:47:10AM -0700, Aaron Blosser wrote: The WW1 is part of Scott's security check, just to make sure it's not been falsely generated or some such. I assume part of it is related to the date, time, or some other such thing which is why there's one part that's different? Wouldn't the last part be the shift count? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Overriding assigned exponent type (was Re: Mersenne: Re: 26 exponents)
On Mon, May 14, 2001 at 02:00:02PM -0700, Aaron Blosser wrote: I fear that many folks may not be aware of the list, or find that subscribing seems too hard (odd as that may sound to us experts :) Or perhaps being set back by the description of an in-depth discussion about Mersenne primes... ;-) When people start throwing the maths around, I feel like I should take more maths soon :-P Anyhow, no critique, but perhaps this _isn't_ a mailing list for the general user. I personally like it, but the average SETI@Home `convert' might not. Perhaps we could have a general `users' list instead? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: 26 exponents
On Tue, May 15, 2001 at 04:48:19PM +0100, Daran wrote: BTW what happens now when a first-time check, (or for that matter, if a double-check) discovers a new prime. Surely this is checked immediately on the fastest machine available to the project, and not left to the vagaries of random allocation? It is run on a different architecture, with different software. The three first were (as far as I know) tested on Crays, while the 4th (M38 (we think)) was tested on an Alpha machine with mlucas, as far as I remember. The idea is to completely eliminate any possibility of a persistent program or hardware bug :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Overriding assigned exponent type (was Re: Mersenne: Re: 26 exponents)
On Tue, May 15, 2001 at 10:23:33PM -, Brian J. Beesley wrote: If you understand _nothing_ discussed on a mailing list, there's no point in subscribing. Similarly if you understand _everything_. You can always delete the messages which you consider beyond your intellect, or beneath contempt. Personally I like the range we have at present. Yes -- that is my opinion too. I skim quite a lot, though ;-) Some of the deeper maths makes me go away read up on the topic, occasionally I get a bit wiser as a result. Hmmm, I think I've learned quite a bit of maths just be skimming :-) It's surprising how much you can learn just by looking at a clueful calculation, even if you don't really understand the maths behind it. Now, just to print out my maths hand-in where one of the proofs utilizes (simple!) modular arithmetic, which I've learned... here. :-) (We haven't had it in school yet, but I suppose we will next year.) (If anybody wants to know, it's `prove that n^3 - n has 24 as a factor, for odd n' :-) ) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: 22 below M#38 and counting
On Sun, May 13, 2001 at 09:24:00PM -0400, George Woltman wrote: So. the first 6 folks that email me privately can have one exponent each. Yes please -- if there are any left by now :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Pentium 4 owners - pre-beta prime95 release available
On Sun, May 13, 2001 at 11:03:50AM +0200, mohk wrote: Don't you say, this code enhances the Athlon as well? No, it doesn't. It's that much faster mainly because it utilizes the SSE2 instructions that are new on the P4, which the Athlon doesn't have (yet). /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Getting new GIMPSers
On Sun, Mar 25, 2001 at 10:03:01AM -0500, Pierre Abbat wrote: How does idle time accrue *to a process*? Idle time is when the CPU is not executing any process. Just like the brain, your computer can not `do nothing'. `Idle' time would most likely be spent in some sort of loop, possibly a HLT loop, keeping your CPU cool :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: phew, one way to get cycles...
On Wed, Mar 21, 2001 at 10:16:43AM -0800, John R Pierce wrote: heh, a friend just ran this by me for my amusement, seems a 3rd friend has juno.com as heir ISP and juno just revised their service agreement, embeeded in it was the following little nugget... [...] damn. whatta way to get more CPU cycles, eh? Now, I wonder what this juno.com _is_... and how they possibly could get anybody to accept that. Looking at their pages, they look like an ISP -- but how could possibly their Internet connection be `free' when you're actually _forced_ to keep your computer on at all times, and authorize their software to dial up to the Internet... at YOUR cost? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Security of prime95
On Tue, Mar 13, 2001 at 09:32:10PM -, Brian J. Beesley wrote: Any idea where I could get a freeware SHA checksum utility? I made one once, but I'm not sure where I have it nowadays. It should be quite trivial scripting one in Perl using the SHA1 module from CPAN. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Status reports (was: reports corrupt?)
btw: would it be possible to get those huge status.txt and cleared.txt files in a compressed (gzip?) format? This would definitively save download time and bandwith... (I never got this message, so I'm replying to a reply...) What about simply installing mod_gzip on the server, given that it runs Apache? Then any compression-compatible browser (at least Mozilla and IE works just fine, think at least Lynx will accept it too) will automatically get a gzip-encoded version :-) /* Steinar */ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Spontaneous reboots -- status so far
Well, I cleaned out some dust (wasn't very much) and put the case back on today -- rebooted, and now it's even worse than it was. Now it can only take 5-6 minutes, which isn't always even enough for system boot (which is SLOW, as RAID reconstruction and ReiserFS journal replay goes on at the same time and obviously makes the disk seek back and forth ALL the time -- this is nothing new, though)... So, I've turned it off, and will try to get a replacement motherboard/CPU for testing. Hopefully teachers etc. will understand my situation =). /* Steinar */ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Spontaneous reboots
On Sat, Feb 24, 2001 at 09:58:13AM -, Brian J. Beesley wrote: The fact that your heatsink feels cool(ish) suggests to me that the thermal bond between the processor and the heat sink has failed. (If the fan had failed, you'd toast your fingers making this test!) Hmmm -- interesting. This definitely sounds like a good thing to test out, although I'm actually not used to tinkering inside _those_ parts of the system... Another possibility is that the chipset may be overheating. If the chipset has a cooling fan (probably a small one like those used on 486s) is that running too? No cooling fan, so it definitely isn't running :-) You could investigate this by running an integer-only memory thrashing program like a prime number sieve. OK, will test :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Spontaneous reboots
Hi, After being away for five days recently, I noticed that my computer (running Linux kernel 2.4.1, by the way -- 2.4.2 now) had rebooted. Just a few hours later, it rebooted again -- and that night, it rebooted _again_. If I turn off mprime (v20), the problem goes away -- the computer doesn't reboot, at least not the 36 hours I tested. After I start mprime, it reboots in just a couple of minutes now. mprime doesn't run as root, the machine has run mprime stably since I got it (about a year) and the machine (an Athlon 800, running on an Abit KA7-100 mainboard) is not overclocked. Does anybody know what's going on here? Like I said, it's been going fine on the same exponent for quite a while now, but suddenly, it just feels like rebooting (no error message or anything, the screen just goes blank and suddenly it's in the BIOS). The voltage meters in the BIOS screen look OK, and there should be more than enough power for the PC... Strange... Any ideas? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Spontaneous reboots
On Fri, Feb 23, 2001 at 10:33:09PM +, Gareth Randall wrote: CPU overheating? Hmm... The BIOS says the system temperature is at 25 degrees Celsius -- not exactly much, is it? Haven't got anything to measure the _CPU_ temperature, though... Have you opened the case, and checked the condition of the CPU fan? It sounds as if the CPU is overheating once the FPU warms up. Is your heatsink sufficient? Is it full of dust? Open it up while the machine is running and check that the fan really is spinning, and at a decent speed. Actually my cover is off all the time -- the fan is spinning, and not full of dust (although there _is_ dust other places in the case). The BIOS says it's spinning at 4500 RPM -- not a bad number either. I might try to clean out some of the dust -- could that help? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Spontaneous reboots
On Fri, Feb 23, 2001 at 06:02:32PM -0500, Paul Victor Novarese wrote: I had a similar problem a few years ago on a P166, and it was poor cooling. With a new heatsink and fan, and some decent thermo-grease it ran fine under full load. Yes, but like I said -- it's been running stably for _months_ under the same load -- and the system temperature shows 25 degrees Celsius -- how can the problem be poor cooling? It's not even overclocked! /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Spontaneous reboots
On Fri, Feb 23, 2001 at 06:04:01PM -0600, Shane Amy Sanford wrote: That is the kind of program you need to find for Linux though. I'm running lmsensors, but it appears like the values it reports are somewhat off... Anyhow, if the system is overheating, I'd suspect it wouldn't go from 70 to 25 degrees in a couple of seconds? it as if it were. Suspect heat then voltage then double check bios settings then reseat all your cables, ram, cpu, cards then if it is still doing it try a reformat. A reformat, of all things -- now, how was THAT supposed to help when I'm running Linux? (I haven't reinstalled Linux since I started using it :-P Windows, on the other hand... ;-) ) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Spontaneous reboots
On Fri, Feb 23, 2001 at 04:37:32PM -0800, Francois Gouget wrote: Though if it barely boots you may have trouble doing that. In that case try switching the RAM with that of another computer and see if it gets better. It boots and runs stably with no problems -- as long as I don't start mprime. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Spontaneous reboots
On Fri, Feb 23, 2001 at 05:05:20PM -0800, John R Pierce wrote: Easy test, reach in there, and touch the edge of the CPU package. is it too hot to touch for more than an instant? then its too hot. Absolutely no problem -- it doesn't even _feel_ hot... I'd rather say room temperature. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: idea for a new prime95 version
On Fri, Feb 02, 2001 at 03:24:43PM +0100, mohk wrote: the first idea is more an ideological one. the name is obsolet. :) i vote for winprime or prim4win. Hardly any good name, as there is (at least?) one version for another OS, namely mprime for Linux. the next idea is to give the prime crunchers the choice of doin' what they want to do. This already exists -- in Test/PrimeNet, I think. Uncheck the "always get the work that makes most sense" box, and select freely :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Overclocking - bad for project?
On Sat, Dec 23, 2000 at 11:08:47AM -0500, Jud McCranie wrote: I agree. I've never overclocked my computers because I think it is more important to be confident in the results. As long as even George overclocks, I don't feel really guilty about my 400@448 machine (that has successfully completed a 72-hour-torture test before I put it into PrimeNet use)... /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: OT: The appearance of a graph when its third derviated equals zero
Hi, Since it's just a couple of days left of a mini-`contest' our maths teacher has announced, and since she said it was 100% OK to get help from other people (and because I'm lazy and don't want to search mathematical literature everywhere :-P ), here comes a question: When f(x) = 0, the graph crosses the X axis. When f'(x) = 0, the graph is at its top or bottom. When f''(x) = 0, the graph is at what we in Norwegian call a `turning point' -- I don't know the proper English term :-) How does a graph look like when f'''(x) = 0? I mean, I can plot a few graphs and see that it is somewhere between f'(x) and f''(x), but I don't see anything striking... Our teacher also mentioned a (female) mathematician finding these points and subsequently gotten them named after herself -- I'm sure this would be worth some bonus points ;-) Does anybody know, and more importantly -- can you _explain_ it? (One of the hardest things here would be that graphs don't go well in ASCII, I'd guess ;-) ) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: More on Compression
On Tue, Nov 28, 2000 at 02:06:41PM -0800, Stephan T. Lavavej wrote: The question is, if compression involves a one-time, five-minute cost on the part of the developer and saves everyone a few seconds of download time and a few K of HD space, then why not? Perhaps since UPX requires a writable /tmp? No, the decompression cost is not paid again and again while the executable runs: there is no (significant) memory cost or compute cost. I don't claim to understand how UPX works, although I intend to learn some day, but the UPX homepage notes "Your executables suffer no memory overhead or other drawbacks". UPX decompresses the program to /tmp, then runs it from there. Another side effect is that the program (at least with my old version of UPX) shows up as `3' instead of `mprime' in `top' and `ps', among others... The two things that don't work with UPX are executables that want to read data from themselves and things with "overlays". This is for DOS only, and doesn't apply to Linux, since the Linux version doesn't feature in-place decompression. UPX works for Linux too - isn't there a Linux port of Prime95? The entry for UPX's Linux capabilities in its readme does detail some of its inner workings. It is lengthy. Oh, you're talking about the Windows version, not the Linux version. Oh well, I'm not too sure it's a good idea to use in-place decompression, when we already have enough problems with fragmented memory maps etc. -- as some seem to have noticed, there can be quite a hefty speed penalty if the memory mapping has problems (cf. the ReCache discussion) :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: bug in Wordpad?
On Mon, Oct 30, 2000 at 07:43:09AM -0800, John R Pierce wrote: another very good ascii editor is 'Ultraedit32', also available for free evaluation. http://www.ultraedit.com While EditPad (http://www.editpad.com/, I think, not quite sure) is postcardware (ie. send a postcard to the author :-) ). Optionally, if you're into Unix and vi, vim (www.vim.org) is of course available in DOS and Windows versions :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: New FFT algorithm.
On Sat, Oct 07, 2000 at 01:48:18PM +0200, Nacho wrote: I am in "Seti At Home" proyect at the same time that in GIMPS. And there is a new version of "Seti at home" that improves the FFT performance by 60%, using new algorithms. Maybe the new algorithm were useful for GIMPS? The `new algorithm' was just (as far as I know) another implementation of the FFT. The original SETI client had (has?) rather slow FFTs, however Prime95 uses the fastest FFTs ever made for the i386 (for _any_ CPU?). So it is highly unlikely that the Ooura algorithms would help us any. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: [OT] Re: Double check validity
On Mon, Sep 11, 2000 at 03:15:44PM -0500, Ryan McGarry wrote: You just pop in the network boot floppy Try network boot once -- it's great! ;-) 1) If there was a way for Prime95/PrimeNT to either store worktodo.ini and/or results files on a separate server or 2) If Prime95/NT could somehow detect the machine's different name/MAC and automatically configure itself based on the machine's name to start from scratch... I've been asking about a similiar thing -- I guess it's on George's todo list :-) If I could somehow type: prime.ini=\\primeserver\%i ...and it would look for prime.ini in \\primeserver\194.248.45.42 (or whatever), that would increase my school's throughput by... oh, say 60-70%. ;-) This would make setting up PrimeNT on every machine (i've got access to 80 Pentium II's and Celerons) MUCH more appealing... 30 here, but yes, I know the problem. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: Tips on compiling source
On Mon, Aug 28, 2000 at 04:38:30PM +0100, Andy wrote: I'm trying to compile the source code for Prime95 for a wintel machine and am slightly lost for how to do so. I have Visual C++, gcc, a86 and just about everything else. You're aware you need NASM as well? That's at least the problem I faced when I tried to compile it myself. There should be reasonable object files included that you can link to, though... /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: running prime95 while a login screen is active
On Wed, Aug 16, 2000 at 02:13:47PM +0200, Reto Keiser wrote: These pentium computers are running win95 and a novell network (but the win95 login screen). Each pupil has an own login Is it possible to install prime95 in a way, that it runs always, even while the login screen is active? What about 'running as service'? The `running as service' is exactly what you're looking for (in the Options menu). Just be sure to remove Prime95 from the Startup menu (where, for some reason, the installer obviously puts it -- argh!) -- if your pupils don't really know what Prime95 is, consider LockUserInfo=1 (see undoc.txt) and possibly `No Icon' too. (Side note to George: Would it somehow be possible to include computer IP in the selection of what prime.ini file to use? I'm having the problem that the machines at school are quite often ghosted, and thus they lose their save-files etc. -- if I could give each their own share at a SMB server, that would probably solve a lot...) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: Miscellany
On Mon, Aug 14, 2000 at 04:50:04AM -0400, [EMAIL PROTECTED] wrote: Thought: If a website uses images, does it necessarily have to care that text-based browsers won't see them? No. Yes! You write that IMG tag without a second thought for the poor text-based browsers. Yes! And that thought is called an ALT= attribute. In the `new' HTML 4.0(1) DTDs, ALT= tags are in fact _mandatory_ on every IMG tag. Remember that the blind are to use the web, too... Similarily, people may choose to turn off images if they're on low bandwidth, or just want a cleaner page. Same way here. If a website uses PNG images or Macromedia Flash or Javascript, I think comparing PNG with Flash is... well, not good ;-) So write that IMG SRC="abc.png" tag with impunity. Go on, say IMG SRC="abc.png" ALT="GIMPS - We love you" and I'll be content :-) My point is, make the page look _good_ for the top 95%, and make it _usable_ for the low 5%. ZEALOT I'm now disgusted with GIF images, if only because I'm tired of living in an 8-bit color, 1-bit transparency world. I wouldn't stand for a computer that ran with 256 colors, and I don't have to stand for an image format that tops out at 256-colors and 1-bit transparency either. And has terrifically bad compression either./ZEALOT But, on the other hand, is amazingly much simpler (you can quite easily write a GIF reader in a couple hundred lines of C -- just counting the .c files in libpng and zlib gives over 25000 lines of code) :-) But we've got computers that are powerful enough now, I think :-) Doesn't matter. PNG *is* better, and PNG ought to be used on the GIMPS site regardless of whether any other site does. Yes! :-) BTW, has anybody pushed the site through http://validator.w3.org/ lately? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: Miscellany
On Mon, Aug 14, 2000 at 04:28:52AM -0700, John R Pierce wrote: and spend a few lawyer-years negotiating with Unisys over payments for use of the Lempel-Ziv patents No, the decompression is not restricted. Only the compression is. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: Miscellany
On Mon, Aug 14, 2000 at 10:26:40AM -0400, Jeff Woods wrote: Wanna bet? Unisys strong-armed all developers of .GIF *readers* back in 1994 in to those contracts. I know. I was one of them. Wow, this was totally new to me, and unlike everything else I've been told... But then, I've never written a single GIF routine, so I can feel quite safe :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: Athlons on DDR MBs
On Fri, Aug 11, 2000 at 01:06:11PM -0700, Stefan Struiker wrote: much cooler, and the 700 (see review) has been pushed to nearly 900 without much complaint or special cooling. Funny, my 800 usually reboots frequently while torture testing, even on `only' 880MHz... 800 is rock stable, though. (Non-DDR, though...) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
Mersenne: Re: Algorithm improvements?
On Sun, Jul 16, 2000 at 12:46:03PM +0200, Martijn wrote: Furthermore, one could save the value of for instance the 10 000th iteration, and check if a later iteration gets the same value, if it does, one knows that the value will never get to 0 anymore. This is quite unlikely to happen, as there are so many possible values to choose from! Think 2^(1024^2) (approx.) for a 1024kB FFT -- as you are only doing a couple of million iterations, the chance of getting a `loop' quickly becomes extremely slim, and it really isn't worth checking for. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Mersenne Digest V1 #753
On Sun, Jul 02, 2000 at 12:39:13AM +0100, gordon spence wrote: I run an ABIT BP-6 with dual Celeron 433's running at 507, both have Golden Orb's fitted. Temperature varies from 39-45 for the cpus and from 45-51 for the case. CPU temperature is measured via a probe touching the underside of the chip. As for getting a chip down to -40 or even -50, you can get a chip *too* cold you know, then it also stops working properly.. Doubt it -- I just saw a story where some guys cooled their systems down to -190!! They used liquid nitrogen, and submerged their entire motherboard in some kind of 3M fluid... /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Motherboard Temperature
At 22:18 29.06.00 +0100, Michael Bell wrote: Soory to be a little off topic, can somebody tell me how hot a motherboard should be running? I have a Celeron 466 and an ASUS P2B-B. It claims to be 42 degrees after some days of continuous use. Is this normal? I'd say 42 degrees is a little hot. I think I've heard numbers saying that 50 is critical, and at 60, your CPU simply won't work anymore. My own usually runs at 28 or 29, even though the fan isn't especially good. The extreme overclockers get it down to -40 or even -50 :-) As long as it's stable, though, it probably won't harm your CPU, but to be on the safe side, I would have installed some kind of extra cooling. /* Steinar */ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Motherboard Temperature
At 06:39 30.06.00 -0500, Mikus Grinbergs wrote: In my opinion that is being excessively conservative. I stand corrected... :-) /* Steinar */ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Weird ILLEGAL SUMOUT
Hmmm... Just a few minutes ago, my mprime v20 gave me: Iteration: 8312000 / 15269993 [54.43%]. Per iteration time: 0.424 sec. (190008097 clocks) Iteration: 8312694/15269993, ERROR: ILLEGAL SUMOUT Possible hardware failure, consult the readme file. Continuing from last save file. Waiting five minutes before restarting. Resuming M15269993 at iteration 8312652 [54.43%] Iteration: 8313000 / 15269993 [54.44%]. Per iteration time: 0.428 sec. (191927493 clocks) Iteration: 8314000 / 15269993 [54.44%]. Per iteration time: 1.913 sec. (857236303 clocks) This machine is overclocked (112MHz x 4.0 for a 400MHz Pentium II), but it has run mprime (and about 100 hours of torture testing in one go) stably for about two years now. What puzzles me, is that there are only 42 iterations from the saving to the illegal sumout... Isn't it so that mprime only checks for errors every 64 iterations or something? In that case, could the saving (I'm using Linux 2.4.0-test1 and an unstable ReiserFS patch as well -- not exactly the `safest' platform, but we run these QA tests on pairs of machines and compare residues during the entire test) have caused the error? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Factoring
On Fri, Jun 16, 2000 at 01:40:26AM -0700, Jim Howell wrote: This program runs on Windows, and can be downloaded from Chris Caldwell's main page, at: Just wanted to add that there is a Linux version as well -- I'd guess it's available at the same place. It didn't factor your number using P-1, though -- it had to go through 11 ECM curves in my case. Guess it's just bad luck or something :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Yikes !! Restart?
On Sun, Jun 04, 2000 at 06:23:55AM -0400, Vincent J. Mooney Jr. wrote: Suddenly, 9028373, which was at 14% done, disappeared!! In its place,.the P-III (450 MHz) was factoring new number 1 (pass 1 of 16). This is quite normal. From readme.txt: --- Furthermore, the program may start factoring exponents before a previous Lucas-Lehmer test completes. This is normal! The program will resume the Lucas-Lehmer test when the factoring completes. --- Don't worry -- your LL test will start again when the factoring completes. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: errors
On Thu, May 25, 2000 at 07:45:50PM -0600, Aaron Blosser wrote: Now...my Pentium III 600's are kicking butt at LL testing... Actually, the P6 family is better at factoring than LL testing, compared to the vanilla Pentium... But we couldn't set all the PIIs and PIIIs to do factoring either -- we wouldn't get much LL testing done... /* Steinar */ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Richard's Y2.1K error !!
On Sat, Apr 29, 2000 at 11:36:39PM +0800, Dave Mullen wrote: If year / 100 then leap year If year / 400 then not leap year If year / 1000 then leap year OK, to complete the mess (I saw your message saying `ignore this', but I want to throw in my own errors as well ;-) ): If year % 4 = 0 then leap year If year % 100 = 0 then not leap year If year % 400 = 0 then leap year If year % 1 = 0 then not leap year I don't think there are any more conditions than this, but who knows? :-) Of course, we're forgetting about the leap SECONDS now... /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Facelift (round 2)
On Tue, Apr 18, 2000 at 09:54:08AM -0600, Alan Vidmar wrote: I think you are on the right track. Take a look at this web site for an example of what can be done without frames but still have a nice looking side menu on all pages. Tables, Tables, Tables. What about CSS? Take a look at http://zicon.cjb.net/ -- no frames, no FONT tags, no tables, but it still looks great. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Facelift (round 2)
On Tue, Apr 18, 2000 at 02:17:54PM -0400, Chip Lynch wrote: I'm sure there's a way to force them beneath the NAV bar, but I can't think of it... used to have this sort of problem all the time. Have you tried an HR or a solid BREAK tag? I'm rnning out of time to experiment myself. What about br clear="both" or something like that? /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Facelift (round 2)
On Tue, Apr 18, 2000 at 08:50:10PM +0200, Hoogendoorn, Sander wrote: If you use a seperate frame for the menu you only need to download the gifs once This should have been done by the browser cache anyway. A browser without a cache today is, well, quite useless. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Facelift (round 2)
On Tue, Apr 18, 2000 at 03:24:40PM -0400, George Woltman wrote: How about www.microsoft.com which has dropdown menus from the banner at the top of the page. Isn't that some weird kind of ActiveX or other Microsoft proprietary tech? I read this somewhere br clear="all" or some such. Not `all', `both'. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Zicon
On Tue, Apr 18, 2000 at 01:30:25PM -0700, Luke Welsh wrote: Looks like shit in Netscape 4.7 :-( I know -- she's fixing it ATM. My own page (take a look at the `secret' URL http://members.xoom.com/sneeze/redesign/) should work in 4.7, but not in IE. However, I've got a version that works in _both_ IE5, NS4 _and_ Opera here :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Facelift (round 2)
On Tue, Apr 18, 2000 at 02:32:01PM -0700, John R Pierce wrote: actually, I believe its done with client side JavaScript. Anyways, it doesn't work in NS, and NS _invented_ JS ;-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: V20 beta #4 (will the beta never end?)
On Tue, Apr 11, 2000 at 06:21:22PM -0400, George Woltman wrote: The fourth beta is available. It fixes a few more bugs. For a feature request: Could you please handle some signals with the following (mprime-specific) meanings? SIGUSR1 - Set time to `day time' SIGUSR2 - Set time to `night time' This will: - Make it possible to have more advanced scripts, like having different rules for different days. - Make it possible for a knowing sysadmin to reduce the RAM needed by mprime, if he/she thinks it's needed (without killing mprime). - Make it possible for me to set `nighttime' when I go to bed, because I go to bed at the weirdest times ;-) ...all this without changing mprime further, and it shouldn't be too difficult to implement either (just remember an `external control only' option, for bypassing the time checks entirely). /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Security and Prime95/mprime
On Fri, Mar 03, 2000 at 04:46:30AM -0800, Paul Leyland wrote: George is an honorable man, I'm sure, and has not knowingly put in any loopholes. I'm equally sure that he's not infallible and that he will freely admit to this. Do *you* want to bet the security of your site even more than you are now doing? Suggestion: Compile mprime from source code. Then you have it all there. Sure, you won't get credit (since the security codes are zeroed out), but you will still contribute to the project. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Security and Prime95/mprime
On Thu, Mar 02, 2000 at 02:01:24PM -0500, St. Dee wrote: Am I creating any security risks by running mprime on the firewall box? You shouldn't, since mprime doesn't deal with server sockets (only the occasional HTTP traffic to PrimeNet) at all. The only problem I can think of, is that it eats a chunk of your RAM, so a DoS attack would probably be slightly easier (at least if somebody can connect 1 times to your FTP socket, and inetd fires up a new ftpd dæmon for every new socket). I run it on a 486sx/16 (24MB RAM, though) just fine, and that machine serves 3 proxy requests (HTTP) a day :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Williamette
On Thu, Mar 02, 2000 at 01:40:55PM -0500, George Woltman wrote: The new SIMD2 instructions have the potential of doubling throughput. But why would Intel market these instructions as `multimedia' instructions? Surely no normal MM tasks would need double precision. Of course, I shouldn't complain :-) The FXCH instruction is no longer free. Is SIMD2 (or SSE2, or whatever Intel likes to call it) _still_ stack-based? I thought Intel should have learned by now? By the way, if the registers are not aliased upon the FP registers, what will Intel do with the task switch problem? Back when MMX was new, I heard the reason for aliasing the MMX registers upon the FP registers was that no OS change would be neccessary (to save/restore the registers). Mispredicted branch penalties are higher, etc. etc. Any idea why? BTW, branching when there is two different sets of code (running in parallel) to take care of will be quite interesting :-) /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: 60 Day Expiration
On Sun, Feb 06, 2000 at 05:37:58AM -0600, Mikus Grinbergs wrote: I've mothballed a middling-speed non-Intel machine. That machine could have been participating in GIMPS, but I chose not to have it do so any more. The reason - I resent feeling "pressured" by expiration requirements and contact-every-xx-days requirements. Try sending direct mail to George Woltman ([EMAIL PROTECTED]), who's the leader of the search. I'm sure he could allocate you some exponents, with manual (e-mail) check-in and long expiration dates. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Poaching is no more
We do not need to poach anymore. See George's last post on this topic. I believe the PrimeNet semantics were changed in v15 (?), and now it's based on check-ins, not just expected dates. Anyhow, if any poaching _needs_ to be done, George and Scott takes care of that themselves, since they occasionally check for such exponents. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Icon
On Wed, Feb 02, 2000 at 07:58:17PM -0500, Vincent J. Mooney Jr. wrote: Prime95 disappears when I minimize it. It used to be on the taskbar (right word?) at the bottom of the WIN98 screen. Prime95 doesn't disappear -- if you look in your system tray, you will find a small Prime95 icon that you can double-click to reveal the big window. If you really want it to be on the taskbar taking up space all the time, you can just deselect `Tray Icon'. Can't there be an icon on the desktop, as I originally asked? Yes, there can, although I don't know why you'd want it. Right-click on your desktop, choose New/Shortcut, and follow the steps for making a shortcut to prime95.exe. Also, is there a FAQ about this? See the README.TXT file that is included in the zip-file. In answers most of your questions, although not the `icon on desktop' problem. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Icon
On Wed, Feb 02, 2000 at 03:56:01PM -0500, Vincent J. Mooney Jr. wrote: I am using WIN 98. How do I set up an icon on the desktop to kick off PRIME95 (as I needed to do twice today when the dang computer crashed)? The right thing would be putting it either in the Startup folder (on the start menu), or by following this procedure: 1. Open the Prime95 window. 2. Select Advanced/Password, and enter 9876. (I'm not sure if you need to do this.) Click OK. 3. Select Options/Windows 95/98 service. 4. Select Options/Tray Icon. If you set Prime95 up this way, it will run even if you're not logged in, and automatically on system startup. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Version 20 memory questions
On Tue, Feb 01, 2000 at 01:35:36PM -0600, David J. Zook wrote: I have been looking for a method to determine how much RAM is "really" available (without using swap file), but have never seen it mentioned in any way. A quick and dirty test would be using ReCache (see previous discussion on mersenne, or mail me for the URL) and just checking when it starts to swap. However, that would be rather hard for a program, but I guess you could try to see just when the swap usage starts to go up, up, up... Remember -- swapping isn't the only problem either. That spare memory is used for disk cache. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: Setup Testers needed
On Sun, Jan 16, 2000 at 06:09:44PM -0500, Bassam Abdul-Baki wrote: Any way I can fix that? Most of the options are grayed out and the preferences, tray icon, and Windows 98/95 Service don't seem relevant. Any ideas on what to do? Select Advanced/Password. Enter 9876 (the value is in README.TXT too). Now you can check `Tray Icon'. You'd also want `Windows 98/95 service', so it runs even if you're not logged in. /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: V18.1.1 to V19.1 of prime
On Tue, Jan 11, 2000 at 01:39:10PM +0100, Grieken, Paul van wrote: Currently I am running with Prime V18.1.1 Can someone tell me what the advantage is to go to V19.1 Is it faster or what. It is faster, and has some new functions (like P-1 factoring). Also, it can test large numbers -- larger than v18 can. See the WHATSNEW.TXT file included for more information. Can I just download and install the V19.1 Do I have to reinatall the automatic internet situation to get and upload information to the internet prime server. Prime95 v19 can be installed over Prime95 v18 without problems. Just quit v18, install, and restart prime95.exe. /* Steinar */ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Re: The Second Mersennium Behind Us, How Now For MyriadThe Third?
On Tue, Jan 11, 2000 at 09:46:09AM -0700, Aaron Blosser wrote: Dunno 'bout all that, but another problem was that in order to do a "quick and dirty" fix of the Y2K problem, a good number of people implemented windowing. The funny thing is, somebody has actually been granted a patent on this. Now. I saw that in DataEase, running on MS-DOS 3.21. Something like 10 years ago. I've heard some rumours that they're reconsidering that patent, though... /* Steinar */ -- Homepage: http://members.xoom.com/sneeze/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
