How large will the exponent be for a 10,000,000 digit prime number?
To be a 10,000,000 digit prime number the exponent must be at least
33,219,281 (which also happens to be a Mersenne candidate).
Has the prime number that was found a week ago been announced on this
list?
I.E. What number was
>>>Has the prime number that was found a week ago been announced on
>>>this list?
>>>I.E. What number was it?
>>It hasn't been announced yet... but from what little information
>>that is available, i.e. The Oregonian newspaper article, the
>>exponent must be =at least= 6,643,859.
>>Eric
I was just about going to ask if George was going to
more factoring assignments available to IPS or if
IPS just wasn't showing ones that had been made
availabe, when I noticed that the range of
10.0 - 10.2 Mil was posted.
Now instead of having enough for about 2 weeks,
there are enough for
(Note to Scott - create a dummy non-zero residue a stick it
in the cleared exponents report).
Too late!! The Cleared Exponents Report reads:
6972593 62 P 0x 01-Jun-99 13:57 nayan precision-mm
Unsubscribe
For those of you who are interested, the San Jose
Mercury News has published the story.
http://www.mercurycenter.com/premium/scitech/docs/prime06.htm
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
NOW it does, after the official announcement Remember
when Roland found M37? Someone found a 0x000
residue in the report and beat George to the punch, so Scott
modified the reports so that they would NOT post a zero
residue automatically. So THIS time, when word came that
George Woltman wrote:
Hi all,
At the risk of opening Pandora's box, I'd like to bring
up the possibility of splitting up the $100,000 award for a 10 million
digit prime. I'm soliciting everyone's opinion before making a decision.
1/4 to George or charity (his choice)
1/4 to Scott or
previous exponents...
-processor usage (compared with the unused system
Running as a background (idle process) task makes this
unfeasible. You'd be better off using something
like WinTop in Windows95 (found in the Win95 KernelToys)
or something like it for other OSes...
Eric Hahn
the ranges
of p between 11 - 9,999,991 and 33,219,281 - 35,999,993.
They also don't cover *all* known factors!
Any and all information on the ranges between
10M - 33.22M and 36M is greatly appreciated, as well
as any known factors not listed in the files I've
pulled.
Eric Hahn
though?? I can't make much use
of it, if I can't read it...
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
(although by 0.0001%)
Eric Hahn
P.S. At the 79.3M range, you'll probably not want to set it
at 100 iterations... Per iteration time on 266MHz PII with
64MB RAM is 58.781 seconds!!! (Yes, it's true, but I'm also
just checking to see if anybody's awake
Rick,
Glad to see *somebody's* awake!! grin
From: Eric Hahn
P.S. At the 79.3M range, you'll probably not want to set it
at 100 iterations... Per iteration time on 266MHz PII with
64MB RAM is 58.781 seconds!!!
The only question that comes to mind is if you had to plough
through factoring
it did this...
I just found it interesting that PrimeNet would produce an
error like this. What would happen if Prime95 should happen
to find a smaller factor? Would it be accepted? H.
Eric Hahn
_
Unsubscribe list info -- http
who don't know (or actually asked),
these exponents use 4096K FFT runlengths, and 16M save
files...
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman
+1) ... = 2^p-1 ??
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
was being used exclusively to test the exponent 24/7.
3) The 4.231 sec/iter is constant (which it isn't!)
4) A factor isn't found (below 2^62 is unsuccessful at least!)
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke
2.36 - 2.95
2^58 2.135 - 2.655 1.93 - 2.36
2^57 1.675 - 2.135 1.48 - 1.93
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http
potential factors with a total
of 100 trillion potential factors to test, is it really
important to know the exact number??
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http
me just say, I realize *exactly* how much time
would be required...
3) Capable of trial-factoring a range of k's.
(example: from k=1000 to k=2500)
It would be best if all three of the requirements
could be fulfilled by a single program...
Can anybody be of some help???
Eric Hahn
Albert Garrido wrote:
I'm currently trying to configure the Time command, as
listed in the docs, to get the prime95 client to function
as follows.
User ID=XYZABC
Time=1-5/18:00-0:00,1-5/0:00-08:00,6-7/0:00-24:00
(reset of Prime.ini)
If you're trying to run from Midnight to 6AM and 6PM to
Brian Beesley wrote:
On 27 Oct 99, at 17:23, Eric Hahn wrote:
I'm looking for program(s) capable of trial-factoring
prime exponent Mersenne numbers (using 2kp+1) meeting
the following requirements:
[...requirements...]
Well, I'm prepared to have a go. Could we tighten up the spec a bit
found testing just 24 exponents previously tested that had
factors. And for exponents that have had no factors found
yet, there might be a smaller one that wasn't discovered :(
Eric Hahn
_
Unsubscribe list info -- http
Perhaps you forgot exponents add, not multiply.
For simplication:
2^3 * 2^3 = 2^6
8 * 8 = 64
Therefore:
2^1165 = 2^5825000 * 2^5825000
Eric Hahn
_ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Perhaps somebody with a little more knowledge about these
matters can help this person...
Frank Dull ([EMAIL PROTECTED]) writes:
i am new to this type of stuff and need some help. can you please
point me to some explicit information on the web dealing with the
different factoring methods? i
Michael Oates wrote:
How do I start factoring when I am part way through doing
an LL test, I would just like to have a break from LL tests
for a few weeks and do some factoring, but I don't want to
loose the number I am part way through.
What is the procedure to use?
There's actually 3 ways
Dave Mullen wrote:
I'd just like to get a clarification on some files I downloaded from the Entropia FTP.
Re the file of exponents, and how far they have been trial factored.
I extracted a range using the decomp program. Each exponent has a number by the side, but I am unclear to what this
Hi!!
Tell me I'm wrong... and if not, what happened??
I just made a slight error in adding a P-1 factor assignment
to the WORKTODO.INI file for M727 and came up with the following
result (on screen):
P-1 on P727 with B1=30, B2=1
P727 stage 1 complete. 116 transforms. Time: 0.018 sec.
Will Edgington wrote:
P-1 on P727 with B1=30, B2=1
P727 stage 1 complete. 116 transforms. Time: 0.018 sec.
(4659194 clocks)
Stage 1 GCD complete. Time: 0.001 sec. (164887 clocks)
P727 has a factor: 11633
This meets all the criteria too
1) 11633 is PRIME.
2) 2kp+1
Steinar H. Gunderson wrote:
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 ;-)
That's because the way MS wrote the JS...
MS has a variable for the drop-down toolbar
George Woltman wrote:
In my new benchmarking page I'd like to create a form that
takes CPU type, CPU speed, and exponent and returns the estimated
number of days to complete the exponent. I hope this will help
newcomers understand how much effort is required before joining
GIMPS.
Windows. BAM!! No more system tray icon, Prime95
can get the CPU's time, and the UPS is running fine!!
Eric Hahn
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman
Nathan Russell wrote:
From: Jeff Woods [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: Milestones?
Date: Tue, 09 May 2000 12:37:31 -0400
We still have a handful of exponents to go.
I was looking at the server's assignments out pages. I guess the
assignments in question must be
Let me rephrase something from my last message:
There should be 12 non-Primenet exponents left to finish testing
(if they aren't already) to prove both M(2976221) and M(3021377)
are the 36th and 37th Mersenne primes, respectively...
Eric
Nathan Russell wrote:
There is a user, "sd70045", who has almost 100 single-checking
assignments out on a single machine ID. These would take a
state-of-the-art box well over two years to finish. Additionally,
these assignments have almost identical figures for time to
complete etc. The first
Calling all P-1 factorers,
I'm in the process of creating a database of P-1 factoring
data for all Mersenne numbers. I have not found any other
database for this information available on the 'net. There
is some data kept by Will that's available, but it only goes
to M(169,991)...
I am
Hi!
This is a little off-topic (not completely tho), and thought
that I few of you might be interested in this...
The Clay Mathematics Institute is offering $7 Million in
prize money to anybody who can provide solutions to any of
their 7 Millenium Prize problems ($1 Million for each
Greetings all,
The first iteration of the P-1 Factoring database is now online!
It still has some work to be done, including (but not limited to)
collecting, sorting through, and merging a lot of information for exponents
1,000,000, and separating the list into two (one for exponents without
) Would it be beneficial to the overall effort?
4) Would it divert resources that could be used better otherwise?
5) Could it cause problems with regard to that "p" hunting term?
6) Anything else??
Eric Hahn
P.S. I deeply thank Sarah Wright and Mark Burke for their
contribution of ti
Greetings all,
I've made a few modifications to the P-1 database webpages.
In addition, I'm providing a new address for it, since some
people have been having trouble accessing it.
For those who would like a short address:
http://mersenne.wackye.com
For those who've been
Levi Broderick wrote:
Yeah.. I kinda also noticed that the entropia.com servers have
been wacky today. Something strange, though -- I was playing
around with URL's and this can get you your account information:
http://www.mersenne.org/cgi-bin/primenet_report.pl?UserID=*HIDDEN*UserPW=*
HIDDEN*
Stefan Struiker wrote:
To All:
In the server transition, the Manual Testing Forms still
seem to be broken. Can't UNreserve exponents, for example.
Hmmm The manual tests page does appear to post to entropia.com
by default. :( One hack around this (until the page is changed)
is to save
Nathan Russell wrote:
Can anyone explain this inconsistency in what the server
believes the MSRC account has done?
I have a hunch, but it could be wrong. If a double-checker
found one of your results wrong, you would have lost credit
for that exponent. However, the report might still list it,
Greetings all,
I was wondering if it was common practice (ie: the norm) for
P-1 to take the product of two or more factors when giving out
a found factor, if two of more factors are found?
To clarify, I was curious about how P-1 would indicate more
than one factor being found. So, I took
Stefan Struiker wrote:
With first-time L-L checking sliding toward a lunar month on an
"old" 1GHz Athlon, we wonder how the Willamette and Itanium might
further The Cause. Anyone have guessimates on the numbers for
these two, say at 1GHz?
I'd guessimate about 17.5-18 days for an exponent around
Jeff Woods wrote:
being found. Currently, all exponents thru Prime95's limit of
79.3M have been factored to at least 2^50... If a factor is
found for an exponent, it's eliminated from further testing
of any kind.
Isn't the factor itself verified?
Yes, it is. However, at least in the case of
Hello! All,
I've updated the P-1 database again, adding two new lists.
There are now four lists available:
1) The entire database (includes *all* tested exponents)
2) Tested prime exponents with no known factors
3) Tested prime exponents with at least one known factor
4) Tested
Stefan Struiker wrote:
I noticed several factoring assignments, in the M13.4 mill range,
where factoring was taken to only 64 bits, but not to 65, as would
be done on a "fresh" candidate. Are these die-hards from the early
daze when machines were wicked slower? Or is there another
explanation?
Intel benchmarks show little advantage to Rambus!
A new series of benchmarks have emerged that show Rambus memory
provides less oomph than cheaper, standard high-speed memory.
And the odd part is that the tests come from Intel, the major
proponent of Rambus.
In benchmark tests conducted by
RE: Statistical Analysis of Prime Exponent Mersennes
After much private debate, I'm providing the following I have
inquired and received information about. Please, don't flame
me or ask me to explain further, as I'm only the messenger and
don't have all the answers myself...
Q: Can all the
Hi! All,
I apologize if some of the following message are a little late,
but I've been "out of commission" recently. At least they're
better late than never
Eric
_
Unsubscribe list info --
Terry S. Arnold wrote:
I don't appear to have gotten credit for a factor found with P-1.
What is the procedure for getting credit for a factor found during
P-1 testing as part of Double checking?
Currently, PrimeNet does not provide credit for P-1 factoring.
As I recall, George has said v21
Wanted: Brave Souls
Re: P-1 Testing small exponents
Besides exponents in the 200,000 - 500,000 range that are available,
new ranges in the 751 - 100,000 are now available!
Note, however, the smallest exponents have been tested to some
degree already. As a result, they will take a good
Gordon Spence wrote:
I went to check my account just on the entropia web-sites
individual accounts report page. The default userid is challenge,
I just hit enter without thinking and this is the report
[...SNIP...]
Can somebody, anybody, please explain how 1 cpu @ 500 and 1 @448 can
possibly
Just an additional note to my last message... Here's what I found
from a couple of top producers reports around the time:
Top Producers Report 22 Jan 2000 05:01 (Jan 21 2000 9:01PM Pacific)
86. challenge 36.031469 1.579106323.64
Top Producers Report 19 Feb 2000 02:01
Marc Getty wrote:
How does the CPU time contributed get calculated? I would assume
that there is a standard credit for each FFT size, but I can't
find what that credit is anywhere on mersenne.org.
Actually, the formula isn't based on FFT size. To get a good
estimate of how much time you'll
Terry S. Arnold wrote:
Does anyone have any skinny on when we will start getting credit for
1. doing P-1 testing?
2. finding a factor during P-1 testing?
AFAIK, from what George has said, credit will eventually be given
after BOTH v21 comes out, and the Scott has time to do some
Hewlett-Packard, Compaq Computer and SGI have joined with
distributed computing software seller Platform Computing and
a host of other companies to standardize the way computers are
harnessed into distributed computing collections
Full story at:
Did anybody else notice that the exponents in the range
between 33,250,000 and 33,300,000 aren't being offered up
by the PrimeNet server ?!?!?That a whole 1328 exponents
that doesn't even seem to be available for tssting
The assigned exponents report shows the assignments jumping
Hi All,
I downloaded and ran the new v21a and did some timings on
several different machines and compared them to timings done
on v19 and v20...
I ran the timings on each version for 100 screen outputs at
100 iterations per screen output... for a total of 1
iterations... and then
Bradford J. Brown wrote:
For some reason, I am at a loss to explain, a v21 P4 1.4 GHz
factors significantely slower that a P3 v20 700MHz. Is there a
reason, and solution, for this?
Hmmm... Good question...
AFAIK, the only change George has or is going to make in the
factoring code since
George Woltman wrote:
M727, the smallest Mersenne number with no known factor, is done.
(It was clearly out of reach of ecm.)
--- Start of forwarded message ---
From: Peter-Lawrence.Montgomery
Date: Thu, 30 Aug 2001 03:26:19 GMT
C(2,727-)
* c219 = prp98.prp128.SNFS
Steve Harris wrote:
-Original Message-
From: [EMAIL PROTECTED] [EMAIL PROTECTED]
To: [EMAIL PROTECTED] [EMAIL PROTECTED]
Date: Tuesday, October 02, 2001 3:44 PM
Subject: Re: FW: Mersenne: Re: Factoring Failure?
snip
Either way, GIMPS
has never considered missing a factor as a big
Found this article on News.com about the new Pentium 4's
coming out next year... code-named Prescott. It mentions
a speed of 4GHz... and the use of hyper-threading...
Hyper-threading is supposed to allow two applications or
application threads to run on one processor at the same
time... by
danny fleming [EMAIL PROTECTED] wrote:
To Whom It May Concern:
I have devised a method of easily figuring out
approximately how many prime numbers are before
a given prime. Here it is: since the natural
logarithm of a number increases +2.3 for every
power of 10, the 39th Mersenne
of the past digests from the
list and noticed that an Eric Hahn posted a message on July 30,
2000, stating that one of the ranges a Mersenne Prime should be
found was between 2^13430227-1 and 2^13501387.
_
Unsubscribe list info
OK...
I think I know the answer to this... but want to
double-check to be sure...
While doing factoring... using ECM... factors up to:
15 digits is the equivalent of ~2^50...
20 digits is the equivalent of ~2^67...
25 digits is the equivalent of ~2^83...
30 digits is the equivalent of
I am posting this message to both this list and the
LoneMersenneHunters group on Yahoo...
As of this date... I have told by 6 people... that they
would like to do work in this range... (that I had
previously stated I was testing)... and have started
doing work... some of which is being
Has anybody else had trouble with the PrimeNet Summary
Report (SUMMARY.TXT) at:
http://mersenne.org/primenet/summary.txt
(or even in the World Test Status)???
No matter when... every time I try to view it...
it is never complete... It usually is terminated
at approx. the 19M mark...
None of the
adjustment
used for P-1). If a exponent says it's been tested to 2^68, how
do you know it's 2^68, or whether it's 2^67, with P-1 having
been done as well??? But that is so minor of a thing, it's
only a glancing thought.
OK... I'll shut up now... and get back to more mersenne
testing...
Eric Hahn
At 09:50 AM 1/25/03 -0600, Shane Sanford wrote:
Increasing the difficulty for a poacher to _find_ a tempting
target would mean other participants could be less concerned
about making themselves into such a target, and just
concentrate on doing the work they considered most suitable
within the
Not knowing a whole lot about ECM... I thought I'd
ask this question... and maybe put out a new topic
to discuss... ;-)
Let's say you've done 700 curves with B1=25,000 to
find a factor up to 30-digits... and you've been
unsuccessful... :-(
Now you've decided to try 1800 curves with
B1=1,000,000
working on this range :-) )
Eric Hahn
P.S. By factoring exponents around 1M instead of 20M... and
factoring to 2^64... instead of from 2^57 to 2^58... you are
increasing the number of potential factors (and hence the
time required)... by an approx. 2048x... That reduces down
to instead of 12 MINS
on
Eric Hahn
_
Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Chris Marble wrote:
I've been running mprime on Linux for a bit less than 2
years now. I was looking at the directory on one box
and found some ancient files:
mE013037.001
mF320219.001
mF550789.001
mF614243.001
mF687599.001
These are from a dual CPU box. The leading m suggests
they're from
Daran wrote:
Chris Marble wrote:
What happened that these files were left around a year ago?
They shouldn't have an extension, so I'm gessing. Backup
and restore? Recovered from a damaged filesystem?
My recommendation would be to complete the P-1 as though
they were DCs. Just remove the
Daran wrote:
Actually the .001 extension would be expected... especially
if running MPrime on a dual CPU box... with one instance using
the -A1 switch... Using the -A switch will put an extension
with the instance after it... No -A switch... no extension...
OK. I've never used a Dual
Robert Braunwart wrote:
I'm having trouble with one of my computer contacting PrimeNet.
It is supposed to connect every day, but hasn't connected for
two weeks. I get the Error 29 message. I have looked at the
explanation for Error 29 at PrimeNet, but none of the four
possibilities apply to me.
77 matches
Mail list logo
