Re: Mersenne: version 19 and confusion

1999-09-24 Thread Steinar H . Gunderson
On Fri, Sep 24, 1999 at 02:24:32AM +0100, Ian L McLoughlin wrote: Really I want to know about the difference between floating point computation and integer based calculations. To put it short: FP is _much_ faster on all CPUs. Even on the Cyrixes, which have very slow FP. Perhaps somebody can

Mersenne: Re: Linux error 2250 (was Front-end design)

1999-09-24 Thread Steinar H. Gunderson
On Thu, Sep 23, 1999 at 05:45:39PM -0400, George Woltman wrote: Incidentally, can anyone explain why under v19.0.2 I'm getting "ERROR 2250: Server unavailable" messages? Someone told me that glibc-2.1 (as compared to v18's libc5) uses different files or network setup or something. I am a Linux

Mersenne: Re: Conflict with Windows Schedule agent?

1999-09-24 Thread Steinar H. Gunderson
On Thu, Sep 23, 1999 at 06:52:40PM -0400, Jud McCranie wrote: The only thing (other than the regular system stuff) that I have running is Prime95. Any ideas? Try to turn off Prime95 and then retest, OK? :-) It's not easy to say if Prime95 is the problem, without trying without it. /*

Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-24 Thread Jukka Santala
Philippe Trottier wrote: I don't know how the software of primenet work but When I wanted a really fast execution I was doing like so (The last time I coded it was in 1991) *snap* Sounds like loop unrolling is what you're talking about. Most modern compilers (try to) do this already

Re: Mersenne: Front-end design

1999-09-24 Thread Jukka Santala
Robert van der Peijl wrote: Now, everybody, _PLEASE_: If you're thinking How about a nifty gadget such-and-such?. Let's NOT send all THAT to the mailing list! The list would get swamped in tons of traffic. So please, okay? Though you ask this, I find the topic rather appropriate for the

Re: Mersenne: Important info on M(M(p)) from Wilfrid Keller

1999-09-24 Thread Tony Forbes
Lucas Wiman [EMAIL PROTECTED] writes [...] when I found out than Curt Noll had started an attack on M(M(127)) with superior hardware. I imagine that by now he has carried the search much further. This is further evidence for why GIMPS is such a good idea! (as if we needed more) Well, yes

Re: Mersenne: Front-end design

1999-09-24 Thread Brian J. Beesley
On 23 Sep 99, at 16:18, Robin Stevens wrote: There are some Linux folks that like the present program because it doesn't use X-windows. I certainly do! A program like mprime that is supposed to run in background at all times should not depend on a X server running. Quite. For

Mersenne: Mlucas 2.7x on SPARC

1999-09-24 Thread EWMAYER
Alex Kruppa has done some SPARC timings of Mlucas 2.7x compiled using the newish SPARC f90 v2 compiler, which appears to be much better than v1. (At last, 64-bit loads and stores - hooray! Seems ridiculous for such a thing to be worth cheering about, but like I said, v1 was *really* bad.) He

Mersenne: Mlucas 2.7: accuracy

1999-09-24 Thread EWMAYER
David Willmore writes: Oh, you're having a bad day, now: mars-test cat p02608007.stat M( 2608007 ): using an FFT length of 131072 this gives an average19.8975143432617 bits per digit M 2608007 Roundoff warning on iteration 995 maxerr = 0.40625000 ... M 2608007 Roundoff

Mersenne: Iteration meter (hooray, a GUI!)

1999-09-24 Thread Steinar H. Gunderson
Linux folks, Here's my small GUI program. It uses the framebuffer device to produce a graph of the iteration time (ie. lower is better). It assumes a couple of things: 1. You already have framebuffer set up. 2. You're running mprime v19. 3. You know what you're doing. (Don't come running to me

Mersenne: V19 source code

1999-09-24 Thread George Woltman
Hi, At 05:27 PM 9/23/99 +0100, Chris Jefferson wrote: Where can I get the most recent Prime95 source code from? I've just uploaded the v19 source code. You can download it from http://www.mersenne.org/source.htm The only restriction I've placed on the code is that if you use it to find

Mersenne Digest V1 #631

1999-09-24 Thread Mersenne Digest
Mersenne Digest Friday, September 24 1999 Volume 01 : Number 631 -- Date: Wed, 22 Sep 1999 22:02:22 -0700 From: Kevin Sexton [EMAIL PROTECTED] Subject: Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

Mersenne: trial factoring using P-1's GCD

1999-09-24 Thread Lucas Wiman
I've been wondering about this lately... If we are to begin P-1 testing on larger exponents, this implies lower trial factoring limits (though possibly only by 1 or 2 bits). Now, P-1 requires an investment of a GCD on two numbers each of similar size to Mn. So, since we are investing this much

Re: Decamega Tests (was: RE: Mersenne: GIMPS client output)

1999-09-24 Thread John R Pierce
Sounds like loop unrolling is what you're talking about. Most modern compilers (try to) do this already automatically. However, I've experimented on different variations of this with the Linux source to, I think, v16 or so, where it seemed possible to attain small benefits from various

Mersenne: Factors Everywhere

1999-09-24 Thread Will Edgington
Eric Hahn writes: [I've already replied in detail to Eric privately.] I've come up with this SWAHBI (like a SWAG, but an idea instead of a guess). Hm, "silly, wild *ssed, half-baked idea" ? That's not an acronym I've seen before.:) What I'm looking for is the following two

Mersenne: Re: Mlucas 2.7x on SPARC

1999-09-24 Thread EWMAYER
The SPARC binary Alex Kruppa sent me of Mlucas 2.7x is at my ftp site: ftp://209.133.33.182/pub/mayer/README ftp://209.133.33.182/pub/mayer/bin/SPARC/Mlucas_2.7x.exe.gz My browser auro-uncompressed the .exe file during transmission and I had to rezip it, so if you get any errors in

Mersenne: Re: and, from WAY out in left field...

1999-09-24 Thread EWMAYER
Hi, Ian: Frankly I can't see any point updating to V19 when I am already testing a factor of 9Meg+...especially with a Cyrix 333 Now you have some idea how the (non-Intel) Unix folks have felt for much of the past 3-4 years...and those are often US$5000-2 machines. As with all distributed