mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   3*2^n-1 Search (https://www.mersenneforum.org/forumdisplay.php?f=14)
-   -   What is the status of the search and another link (https://www.mersenneforum.org/showthread.php?t=503)

paulunderwood 2005-08-14 11:17

The n=1-2M range for 321 is now done :showoff:

We still need more help with LLR-testing in the range 2-3M. The candidates have been tested to 145,000,000,000,000 for divisors

Were at about 630,000 decimal digit tests and increasing...

paulunderwood 2005-08-29 23:20

Well, it's been a year since our last prime: 3*2^1232255-1 (30/08/2004) Thomas Ritschel

Thomas, Ryan Jackson and I have been busying our Athlons with sieving and should get upto 200 trillion by the end of the year :shock:

We should also be testing with LLR above 700,000 digits by the end of the year...

But where is our next prime? :rant:

We have plenty of DC work for you! Join us!

Our numbers are smaller than GIMPS -- a fast P4 can crunch a 321 candidate in about 2 hours -- A GIMPS number can take months :sick: Similarly with SoB...

Our numbers are now bigger than PSearch's ( n=2 million ), bigger than PSP's current reservations, bigger than Riesel Sieve's, and others...

In fact, our's is a really neat little project that can be easily accelerated by some more help with LLR testing.

Here are our main links:

[URL=http://www.mersenneforum.org/showthread.php?t=4345]status[/URL]

[URL=http://www.mersenneforum.org/showthread.php?t=4301]reservations[/URL]

:help: :help: :help:

Our next prime must be very close.

Join us by signing up to this forum and making "reservations", or email me directly to [email]paulunderwood@mindless.com[/email]

OmbooHankvald 2005-09-01 19:35

Hi Paul

I've ripped your last message and placed it here: [url]http://distributedcomputing.info/phpBB/viewtopic.php?p=28[/url] in the hope of aquiring some computing power from newbies.

I hope you're not :furious: at me for stealing your message.

paulunderwood 2005-09-04 07:30

:no: I am not angry with you in the slightest. We are are pleased with extra help from anyone.

I reckon by the end of 2006 we should have done so much sieving that the time taken to find a divisor will outweigh the time for a 321 LLR test at 4,000,000 bits. When this point is reached then it is all-out LLR'ing -- I'll be putting my Athlons on LLR tests. :cool:

paulunderwood 2005-10-21 20:56

We are upto 2.2 million bit tests. Thanks to everyone who helped get us here.

I have uploaded to the [URL=http://www.mersenneforum.org/showthread.php?t=4301]reservation page[/URL] the latest blocks (2.2-2.35M) which have been sieved with NewPGen to 175 trillion. :w00t:

The new batch is split into two sections. The first is for 32-bit Athlons (2200000-2244000) and the rest is for "SSE2" enabled computers such as Pentium4s and Athlon64s. The 32-bit Athlons last a little longer at the old FFT length.

You will notice it takes longer to do a test at the new FFT length. Hence, on a fast P4 it will take about five and half days to crunch a file of sixty candidates.

Good luck everyone :smile:

paulunderwood 2005-10-25 00:44

I just got some timings at the new FFT length for my 3.4GHz P4 (DDR400) and things are better than I thought. It's taking just under two hours for a 321 test at 2.2 million bits. So an average file of 58 candidates is going to be done in under 5 days. :w00t:

My 1 GHz Athlon takes 28500 seconds i.e. nearly 8 hours, at the same 2.2 million bits (but at the old FFT size) :yawn:

paulunderwood 2005-12-16 16:26

I have just released new candidates: n from 2.35M to 2.5M :w00t: That'll keep us busy for a few months.

[COLOR=Red]Note to linkers to input files: Update your links please.[/COLOR]

The new candidates have been sieved to 208.81 Trillion and there will be no increase in FFT -- so they'll crunch at the usual rate.

There are still a handful of files left from the last release good for Athlons.

We are testing number with over 700,000 digits :showoff: and we still have a week in which to recieve an early Christmas present of a prime :wink:

For 2006, it would be cool to finish sieving and reach 900,000 digit LLR tests ...

paulunderwood 2006-01-06 02:53

We got the Christmas present we wished for :shock:

I'm hoping we and any newcomers can get the exponent "n" upto 3,000,000 by the end of 2006. By my calculations I'd say we are due to find a prime before n=3M. Exactly where the prime is hard to guess...

Sieving is nearly complete -- divisor=236,000,000,000,000 (236T) is our cut-off point. It is going to be more efficient to do LLR calculations on Athlons than it is to find new factors with NewPGen :showoff:

Join us :help:

paulunderwood 2006-02-26 21:02

I have just released the next batch for "n" between 2,500,000 and 2,700,000. This should keep us all busy for a few months. :wink:

Some blocks are just for 32-bit Athlons/PIII because of the difference in changes of the FFT levels between 32-bit Athlons and SSE2 enabled computers such as P4 and Athlon64. :geek:

Also I'm just a few weeks from finishing sieving after which I'll put my 32-bit Athlons and PIII on to 321 LLR work :razz:

We are still on target for 3 million bits by the end of this year.

Join us and stand a good chance of finding a top20 prime today!

paulunderwood 2006-03-02 00:34

Joe's just booked out the last range of a FFT size and this means P4 files are going to take a few more days to crunch at the new FFT size. But hey, if your file contains a prime, the prime will have more than three quarters of a million digits :w00t:

Athlon users have plenty of files too and a good chance of finding a prime.

paulunderwood 2006-03-12 07:24

I've updated the [URL="http://www.mersenneforum.org/showpost.php?p=50474&postcount=2"]statistics[/URL] page to reflect the more time-consuming effort that was put into the old pre-DWT LLR which was when 321 was testing "n" less than 1 million. The stats do not have the logarithm taken any more. It should be easier to judge the relative effort 321 people have made :bow:


All times are UTC. The time now is 06:43.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.