As I recall, 200 was the default quantum on a vax 780 20 years ago.
Even 10 years ago, interactive response could be sped up a lot by
cranking quantum down to single digits.
At 11:28 PM 10/30/2001 +0100, Steinar H. Gunderson wrote:
On Tue, Oct 30, 2001 at 10:00:07PM -, [EMAIL PROTECTED]
What will really slow a workstation or server down is running short of RAM.
These days the working sets are getting appreciable as the exponents increase.
NT scheduling will wake up the service version of ntprime every second I think
and give it at least one quantum.
If some more essential
At 10:01 PM 10/25/2001 -, [EMAIL PROTECTED] wrote:
On 25 Oct 2001, at 10:31, Ken Kriesel wrote:
M33219278 is the smallest Mersenne Number with at least 10^7 digits,
but M33219281 is the smallest Mersenne Prime with at least 10^7
digits.
Um, I seem to remember testing that number
At 01:01 AM 10/25/2001 -0500, you wrote:
Forgive my ignorance but;
In reading the Lucas Wiman Mersenne Prime FAQ I became confused at the Q5.3
instruction. (see FAQ insert below).
I want to know how many decimal digits are in a given MP.
This part of the FAQ does not make sense to me.
I believe that is set at the server.
Ken
At 08:25 AM 5/16/2001 +0100, Daran [EMAIL PROTECTED] wrote:
Does the client 'know' the threshold performance level for double-checks and
factorisations? If so, is it hard-coded, or does it get this information
from
the server? If hard-coded, then you
At 10:56 AM 5/16/2001 -, Brian Beesley wrote:
On 16 May 2001, at 0:24, Ken Kriesel wrote:
For the time being I would like to continue focussing our QA efforts on the
general case, rather than P4's specific limits, since
Agreed. I was talking about the short test suite, where the runs
to be uniform.
It should vary about the expected curve.
Ken Kriesel
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
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,
Brian is likely to break his own record in about 5 months, with an LLtest of
2^40250087 -1 proceeding rapidly, with Stephan Grupp's simultaneous
test of the same number trailing by 11 days at the moment, both as
part of the continuing mersenne QA effort.
This candidate was P-1 tested by Brian,
Well, you can add at least 20 P3 cpus to the total, that I run on
without the involvement of primenet.
Also about 20 Celerons.
Prime95 makes a great hardware reliability tester, and has
ferreted out numerous mildly flaky RAM modules and a couple
bad motherboards.
Ken
At 01:16 PM 3/26/2001
At 09:44 AM 2/13/2001 -0500, Jud McCranie wrote:
At 12:54 AM 2/13/2001 -0600, Ken Kriesel wrote:
Intel offered the 286 with 6, 8, 10, and 12.5 Mhz on one data sheet.
AMD got to 16 on this one, but an early data sheet lists 4, 6, and 8
(and says reprinted by permission of Intel). FPU
The 8088 debuted at 5 ( 8) Mhz; IBM derated it a bit for the PC because
4.77Mhz*3 = 14.318 = 4 * 3.57Mhz (TV color burst frequency).
An IBM (pre-XT) motherboard could be pushed to about 7.5 Mhz by splitting
the clock signal paths. FPU was separate. Ten Mhz chips were offered.
This chip had
At 05:56 PM 2/9/2001 EST, [EMAIL PROTECTED] wrote:
Just my 2 cents' worth with respect to the screen saver
proposals: how about the following?
2) For the folks who like something that looks more
scientific, we could have a vertical box that looks
like a control panel. Every iteration, the bottom
At 09:23 AM 2/3/2001 -, "Brian J. Beesley" [EMAIL PROTECTED] wrote:
George has announced the development of new FFT code optimised for
Pentium 4. The FFT code is the true heart of the program: it's really
hard for me to put into words just how much we all owe to George for
his unstinting
Personally, I always go with an external modem.
It's much less hassle if you need to cycle the power on the modem,
or it's taken out by a lightning hit or other surge in the phone line,
or from some other failure.
It's way easier to swap modems when diagnosing "is it the modem
that's broken, or
Setting CPU type in prime95 V20.4.1 and then examining local.ini,
CPUType=3 is a Cyrix 6x86
CPUType=4 is a 486
CPUType=5 is a Pentium
CPUType=6 is a Pentium Pro
CPUType=7 is an AMD K6
CPUType=8 is a Celeron
CPUType=9 is a PentiumII
CPUType=10 is a PentiumIII
CPUType=11 is an AMD Athlon
So
At 03:48 PM 7/27/2000 +0200, Steinar H. Gunderson wrote:
There is a tracert.exe included with Win95 and Win98, at least.
And in Windows NT 3.x, 4.0, ...
Ken
_
Unsubscribe list info --
I saw something similar once, out of hundreds of ECM curves
that I've run.
It happened on the curve being run while I adjusted memory limits
on the program (Version 20.4.1, April 25 file date), if I recall correctly.
Ken
At 03:42 PM 5/25/2000 EDT, you wrote:
I just got this in an ECM run on
Monitors, on the other hand, seem to like to be shut off regularly.
At work, we bought 9 Nanao F750's 60's in 1993.
Only two survive, and one sits on my desk and is turned on and
off daily. Those that were left on 24/7 did not survive the last
cycle of cpu upgrades.
Ken
At 01:42 AM 4/19/2000
When pentium pro 200's were the hot new processor
(in speed, more so than in wattage),
I began running some dual-ppro-200 systems with two prime95 instances each.
Those processors are still running it.
I've never had to replace a cpu or motherboard
(though occasionally a motherboard power
On 20 Mar 00, at 19:01, Stefan Struiker wrote:
LONDON , March 17 Two publishers are offering a
million dollars to anyone who can prove that all
even numbers are the sum of two prime
numbers. No one has cracked the problem in the
At 08:14 PM 3/20/2000 EST, you ("Nathan Russell"
[EMAIL PROTECTED])wrote:
Another potential issue that just occured to me:
If someone has an exponent partially done under version 19.x or 18.x and
upgrades and it finds a factor, will they get more credit for the factor
than they lost for the
M 10133741 is not an assigned QA exponent
(at least by me.)
Scott tells me that the IPS will accept results whether assigned by IPS or
not.
However, the IPS is not involved in issuing QA work; I do that manually,
independently of IPS.
A computer search for the exponent on qa assignments, qa
At 06:07 PM 3/6/2000 EST, you [EMAIL PROTECTED] wrote:
Ken Kriesel writes:
Participants in this phase of the QA should be willing to coordinate by
email with
a partner, running LLtests and double-checks of the same exponent in
parallel,
and cc George Woltman and myself, interim residues
At 05:42 PM 3/3/2000 +0800, "Dave Mullen" [EMAIL PROTECTED] wrote:
For interest, has anyone calculated benchmarks, or run LL tests in those
ranges;
I guess not many, 8 months is a long time to wait for a result !!
A select group of volunteers have been running factoring and LLtests as
part of
At 02:55 AM 2/27/2000 -0800, Paul Leyland [EMAIL PROTECTED] wrote:
BJB wrote:
Yes - I think we need this database - with or without savefiles,
it's a waste of effort to inadvertently duplicate work done before.
Since P-1 is deterministic (like trial factoring, but unlike
Pollard's rho or
At 10:24 PM 2/16/2000 +0900, "Kotera Hiroshi"[EMAIL PROTECTED] wrote:
Hi all
Is a decimal 23-digit numbers 111 prime ?
Could you tell me the answer with proof?
24-digit numbers = 101*1100110011001100110011
regards
For the smaller numbers get ubasic
6274836288508219852
3+1/(7+1/(15+1/(1+1/(292+1/(1+1/(1+1/(1+1/(2+1/(1+1/(3+1/(1+1/14)))=
80143857/25510582=3.14159265358979 26593756269457122
Ken
Ken Kriesel, PE [EMAIL PROTECTED]
_
Unsubscribe list info -- http://www.scruz.net
Punched cards didn't have to be readable Hollerith; the maximum storage
per card was 80 12-bit columns, or 960 bits when binary punched.
The average card is about .006" or so thick by 3 by 8".
(About 6700 bits per cubic inch of card; compare that to a CD in its case
at 440,000,000 bits/cubic
At 07:49 AM 1999/10/19 +0100, Nick Craig-Wood [EMAIL PROTECTED] wrote:
On Tue, Oct 19, 1999 at 12:28:52AM -0500, Ken Kriesel wrote:
How would you extend this concept to P-1, ECM, and factoring save files?
As far as I'm aware prime95 is the only program to do P-1, ECM or
factoring so I wasn't
Look it up in the FAQ listed at the bottom of every mailing list message,
is best in my opinion.
Ken
At 09:15 PM 1999/10/14 -0400, Darxus wrote:
What's the best way of finding the number of decimal digits for the number
2^p-1 ?
At 06:14 PM 1999/10/14 -0400, "St. Dee" [EMAIL PROTECTED] wrote:
If I run a single instance of mprime, I get LL iteration times on exponents
near 8,200,000 of about .220. If I run two instances of mprime, each gets
iteration times of around .245. I expected some hit, but I have no idea if
that
As I posted some days back;
Anyone who wants to quit an exponent after investing a PII-400-month or
more, please contact me, and we'll try to carry it on, using it for the
QA effort.
It could take some major bandwidth-minutes if more than a few exponents
are quit, however.
Ken
At 04:15 PM
At 12:03 PM 1999/10/12 -0400, Jud McCranie [EMAIL PROTECTED]
wrote:
At 12:54 PM 10/12/99 +1000, Simon Burge wrote:
"John R Pierce" wrote:
a year on one of these [a vax] wouldn't equal one day on a pentium-II.
Probably a bit generous there even, given that older vaxen wouldn't
have pipelined
I am looking for about 20-50 additional ambitious very patient QA testers
with extremely fast hardware, and some significant free storage space, to
participate in runs on selected exponents in the larger fft runlengths.
The selected exponents will frequently be fully trial factored, or nearly
, I'll be sending you some candidate exponents to continue factoring to
the full depth.
Ken
Ken Kriesel, PE [EMAIL PROTECTED]
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http
fering bit patterns, and
there's a sizable performance hit.
I ask this because now i'm also using it on my laptop
(great work george!) and when i installed linux some time
ago it said the processor had this bug.
Floris Looyesteyn
Ken
Ken Kriesel, PE [EMAIL
At 07:57 PM 1999/09/09 -0400, George Woltman [EMAIL PROTECTED] wrote:
Hi all,
...
I'd like to thank the excellent work of the QA team. They located
many bugs, bringing you a higher quality beta. The QA team included
Ken Kriesel, Brian Beesley, Tom Cage, Jean-Yves Canart, Bryan Fullerton,
Marc
At 12:29 AM 1999/07/27 EDT, [EMAIL PROTECTED] wrote:
Hello, again. As before, I'm replying to a bunch of different people. And I
have trouble thinking up decent subject lines as well. :-]
...
Well, the likelyhood that a failure occurs may be 1%, but the likelyhood
that a double check will not
Magnetostriction is about a bulk material changing dimensionally with varying
magnetic field; this is probably not occurring or not the prime mechanism.
More likely, it's simply that the magnetic fields generate forces acting
on the currents in the coils, and the coils and neighboring structures
Assuming you're talking about doing it on a conventional computer
(1 or few processors, fixed word length, etc.), the method you propose
is at least O(2^p * p ) per squaring. This is dominated by
the first exponential term, which must be avoided at all costs.
Huge constant factors can be
At 08:13 PM 1999/07/20 -0700, you ("Daniel Swanson" [EMAIL PROTECTED]>)wrote:
I got the following set of messages today: [Tue Jul 20 16:15:19 1999]
Iteration: 6128000/7812379, ERROR: ROUND OFF (0.4026489258) > 0.40
Possible hardware failure, consult the readme file.
Continuing from last
The latest mersenne exponent is added below.
positionp in p# ofbitp in hex p mod 4
in list base 10 in base 2 1's places
1 2 10 1 2 2 2
2 3 11 2 2 3
At 09:09 AM 1999/06/29 -0400, Jud McCranie [EMAIL PROTECTED]
wrote:
At 04:16 AM 6/29/99 -0400, Lucas Wiman wrote:
All,
Here is version 1.1 of the FAQ.
Here's a question that needs to be addressed: how to go from digits to
exponents, and exponent to digits.
By all means include it in the faq;
Make my guess for M38, p~=6,740,000
Ken
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
At 09:01 PM 1999/06/10 -0400, you wrote:
The status page shows that for exponents in the range 3,310,000-3,960,000,
there are 225 exponents for which 2 L-L tests have been done, yet there are
40 exponents for which no factor is known, and no LL test has been done. I
have 2 questions:
1. Why
At 06:49 PM 1999/06/03 -0700, Paul Burnett [EMAIL PROTECTED] wrote:
At 08:47 PM 6/2/99 Ken Kriesel wrote:
The EFF requires that they approve the specific publication and referee
process
...otherwise the newly discovered Mersenne Prime isn't "officially" a
Mersenne Prime? F
At 09:10 PM 1999/05/14 +0200, "Steinar H. Gunderson"
[EMAIL PROTECTED] wrote:
OK, second message in a row, I just thought it would be nice to separate
them.
Has anybody got experience in turning off/disabling screensavers under Win95?
We run Prime95 at 40 machines (most of them 486'es, though)
to participate, but not be publicly listed
in the summary for whatever reason, say so in your email to me.
Ken Kriesel
[EMAIL PROTECTED]
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
At 08:41 AM 1999/04/10 -0600, "Aaron Blosser" [EMAIL PROTECTED] wrote:
George...is it too late to request features for the new version?
I had done some thinking on it, and wouldn't it be great if there were some
sort of "live update" feature, where it could upgrade itself when new
versions come
At 12:45 PM 1999/04/11 -0600, Aaron Blosser wrote:
...
IE4 and IE5 have that (probably Netscape too?), and I think the web site
that checks and sends emails is www.mindit.com.
mindit.com is not the one I was thinking of; there's one based in a US
university (Dartmouth?).
This combined with
At 11:59 AM 1999/03/05 GMT, "Brian J Beesley" [EMAIL PROTECTED] wrote:
(Ken wrote)
Right. The odds heavily favor both mismatched residues being nonzero.
A zero residue at the last iteration is what indicates primality.
Depends on what you mean. If a Mersenne number that has been
tested once
At 06:19 PM 1998/10/21 EDT, [EMAIL PROTECTED] wrote:
Hi:
10/22/1998
I was looking at the available ranges to test Mersenne primes and I noticed
the range included exponents which by definition cannot yield primes.
I looked at some Mersenne htmls and didn't see any mention of even
At 12:04 PM 1998/10/14 GMT, "Brian J Beesley" [EMAIL PROTECTED] wrote:
|I thought the primary purpose of the security code was to ensure that
|the transmission between client PrimeNet server was secure from
|accidental error.
|
|Perhaps we should think of replacing the existing system by
For the factor to be about 630, the exponent could be at most about
315, since the factors of mersenne numbers are of the form q=2kp+1.
(if q=630, for k=1, p=~315, and for larger k, p is smaller)
But nearly all numbers below 331 have already been not only tested
for factors
I can confirm from my own experiences that the working set and thrashing
that may result is an issue both for WindowsNT and for Windows95.
NT Services get woken up for about a 1% cpu duty cycle even when set to
lowest priority, on a system that is thoroughly saturated with other things
to do.
56 matches
Mail list logo
