At 10:23 PM 5/15/2001 -, "Brian J. Beesley" <[EMAIL PROTECTED]> wrote:
>On 14 May 2001, at 20:52, George Woltman wrote:
>>
>> >Is the self-test in fact just to check
>> >that there's not something in the CPU which goes glitchy when running
>> >flat-out SSE2 code for hours on end?
>>
>> Yes.
Among others, I raised the question with George Woltman some time ago.
I trust his judgment that his time is better spent elsewhere.
However, I wonder if there might be some possibilities in trial factoring
there.
That would present the possibility of a factoring screensaver, and an FPU
LLtest, r
Paul Landon wrote:
> Date: Tue, 15 May 2001 18:12:39 +0200
> From: Paul Landon <[EMAIL PROTECTED]>
> Subject: Re: Mersenne: games one can play with genuine composites
>
[snip]
> Cheers,
> Paul Landon
>
> ps. Every train driver knows that Scottish sheep have
> a maximum of 7 colours :
> This question pops up every once in a while. A few years ago I looked
> through a postscript manual wondering how difficult it would be to build a
> postscript file that crunched RC5 keys when a printer tried to render it.
postscript is essentially forth, after all. Trouble is, most postscript
I don't really know how much help this will be since I don't know your exact
situation and am not a expert by any means, but here goes!
First, the software modem may be a culprit. I have had problems with ones
of the HSP variety. Most show up as 'HSP Micromodem56' or something very
similar on y
John R Pierce wrote:
> Virtually all GPU's in use today are fixed function hard wired graphics
> accelerators. There's no way to use them for general purpose computational
> use. Also, there's no APIs, and each chip vendor has a radically different
> architecture.
Too bad, the idea might also
Mersenne Digest Tuesday, May 15 2001 Volume 01 : Number 852
--
Date: Mon, 14 May 2001 23:33:48 +0200
From: "Steinar H. Gunderson" <[EMAIL PROTECTED]>
Subject: Re: Overriding assigned exponent type (was Re: Me
On Tue, 15 May 2001, Gareth Randall wrote:
> Also, any code would be very hardware specific, and may only work if
the display was not displaying, say, a desktop.
>
> However, if someone could implement it, it could provide the *ultimate*
in Mersenne related screen savers! What you'd see on the
In the course of a single P-1 run, I've gotten 3 SUMOUT errors:
[Tue May 15 08:20:24 2001]
SUMOUT error occurred.
[Tue May 15 12:04:41 2001]
SUMOUT error occurred.
[Tue May 15 20:05:15 2001]
SUMOUT error occurred.
In the past fifteen months with GIMPS, I had gotten only two errors.
I can't help
Hi All
I've noticed that sometimes the topproducers table goes a bit
strange, this causes the primestats script to output 2 Meg worth
of error messages, not good if you run it in a cron job, and then
the cron job backs up your inbox.
So I've tracked the bug down and fixed it so now you only g
At 10:23 PM 5/15/2001 +, Brian J. Beesley wrote:
>Actually I think that there may be a perceptual problem with many new
>users in that they may give up as soon as they realize that a "most
>sense" assignment is going to take several weeks to complete.
>Unfortunately there seems to be no easy
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 conte
We currently use the FPU (floating point unit) which most office
software doesn't use. The GPU is hard coded for graphics and not
really useful for anything else.
--- Daran <[EMAIL PROTECTED]> wrote:
> I know very little about computer architecture, so please feel free
> to shoot
> me down if wh
On 14 May 2001, at 23:33, Steinar H. Gunderson wrote:
> 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 _
On 14 May 2001, at 20:52, George Woltman wrote:
>
> >Is the self-test in fact just to check
> >that there's not something in the CPU which goes glitchy when running
> >flat-out SSE2 code for hours on end?
>
> Yes. The QA suite that Ken Kriesel and Brian Beesley worked on does a
> better job at
On 14 May 2001, at 21:56, Nathan Russell wrote:
> otherwise, you might
> have someone using a 486 suddenly realize that their computer was
> doing a first-time check that would take over a year, get frustrated,
> and give up.
A first-time check on a 10M exponent would take _several_ years on a
Daran,
This is an interesting piece of lateral thinking that deserves to go further than I
think it actually does.
Essentially, I'm not sure how the operations that a graphics card can provide, such as
line drawing, texture overlaying, raytraced light effects etc, could be made to
implement a
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 alloca
--- Daran <[EMAIL PROTECTED]> wrote:
> I know very little about computer architecture, so please feel free
> to shoot
> me down if what follow is complete nonsense.
>
> GIMPS clients use the spare capacity of the primary processing
> resource within
> any computer:- the CPU(s). But most modern
Hi all,
I've uploaded a version that fixes 2 bugs in the new P4 prime95.
1) Trial factoring was broken. In switching to MASM 6.15, an assembler
bug caused the factoring code to blow up.
2) I restored a FPU init instruction that I accidentally deleted. This caused
the excessive round-
At 04:34 PM 5/15/2001 +0100, Daran wrote:
>Are there any exponents below #38 that have never been assigned?
Not as far as I know, but there are over 20 that haven't had the first LL
test completed. But they should have all been assigned at least 24 months
ago.
+--
> I know very little about computer architecture, so please feel free to
shoot
> me down if what follow is complete nonsense.
>
> GIMPS clients use the spare capacity of the primary processing resource
within
> any computer:- the CPU(s). But most modern PCs have another component
capable
> of p
I think I know the answer to this question, but am asking it...
just to make sure...
According to ECMNet, to find factors of up to 25 digits, the
optimal B1 is 50,000 with 300 expected curves... and to find
factors of up to 30 digits the optimal B1 is 250,000 with 700
expected curves...
-Original Message-
From: Nathan Russell <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: 15 May 2001 03:25
Subject: Re: Mersenne: missing exponents?
>I have version 20.6.1 - and the web page reads that all versions were
>last updated June 15 2000. Something odd is goin
I know very little about computer architecture, so please feel free to shoot
me down if what follow is complete nonsense.
GIMPS clients use the spare capacity of the primary processing resource within
any computer:- the CPU(s). But most modern PCs have another component capable
of performing rap
-Original Message-
From: Jud McCranie <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: 15 May 2001 04:34
Subject: Re: Mersenne: Re: 26 exponents
>At 09:44 PM 5/14/2001 -0400, Nathan Russell wrote:
>They would still be contributing towards milestones. If there are
>exp
-Original Message-
From: Steve <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: 14 May 2001 07:59
Subject: Re: Mersenne: Re: 26 exponents
>That _might_ be a good idea, except in the eventual situation where both
>participants return results indicating their number is in
-Original Message-
From: Nathan Russell <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: 13 May 2001 02:58
Subject: Re: Mersenne: Re: 26 exponents
>On Sat, 12 May 2001 18:21:17 -0400, Jud McCranie wrote:
>There would still be a distinction drawn between 'new' and
>'exp
-Original Message-
From: Nathan Russell <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: 14 May 2001 14:31
Subject: Re: Mersenne: Re: 26 exponents
>On Mon, 14 May 2001 00:20:47 +0100, Daran wrote:
>
>>As someone currently running a legacy machine, (It's taking 4-5 month
-Original Message-
From: Nathan Russell <[EMAIL PROTECTED]>
To: Brian J. Beesley <[EMAIL PROTECTED]>; [EMAIL PROTECTED]
<[EMAIL PROTECTED]>
Date: 15 May 2001 03:26
Subject: Re: Mersenne: Re: 26 exponents
>Agreed. Membership to the list indicates a slightly-more-than-casual
>interest in t
-Original Message-
From: Jud McCranie <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED] <[EMAIL PROTECTED]>
Date: 15 May 2001 04:52
Subject: Re: Mersenne: Re: 26 exponents
>Well, how about this - new users can get an exponent that has been
>abandoned several times, but they must check in at least
If a prime Q | M_C
then Order(2,Q) | C ;but not 1
Order(2,Q) | Q-1
F:=GCD(C,Q-1) != 1
F will either be C or one of it's divisors.
If Order(2,Q)==C then it has almost zero information
to tell us anything about the factors of C.
If C has 2 factors P0 & P1 then the product of factors
with Order ==
You may be interested (briefly) in a new distributed computing
project that I have come across - Yeti at Home. Details at:
http://www.phobe.com/yeti/index.html
Kevin Edge
{:<)}
---
Kevin Edge - [EMAIL PROTECTED]
---
The opinions h
On Mon, 14 May 2001 23:33:48 +0200, Steinar H. Gunderson wrote:
>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
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"... ;
35 matches
Mail list logo
