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
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
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. :-)
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 --
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
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:
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,
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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)
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
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
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
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)
[...]
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
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,
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
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
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
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 :-)
/*
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
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
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.
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
[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
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.
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
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
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
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?
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... ;-)
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
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
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/
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:
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
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
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:
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
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
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
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
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
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_
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
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.
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.
/*
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
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
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
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
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 :-) ).
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'
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
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
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
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
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/
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
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.
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
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
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.
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
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
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,
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
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
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
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
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
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:
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',
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
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/
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
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
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
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
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
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
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
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
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
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
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
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.
On Mon, Dec 13, 1999 at 09:19:40PM -0500, Pierre Abbat wrote:
I'd like to upgrade mprime, and I see it's linked with glibc 2.1. I have glibc
2.0.7. Will it work? I'm currently running 18.1.
There are some quirks at the moment. You could try, but read the docs
carefully, and have a backup of your
1 - 100 of 197 matches
Mail list logo
