mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > 3*2^n-1 Search

 
 
Thread Tools
Old 2005-08-14, 11:17   #78
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7×491 Posts
Default

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

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 is offline  
Old 2005-08-29, 23:20   #79
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7×491 Posts
Default

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

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

But where is our next prime?

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 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:

status

reservations



Our next prime must be very close.

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

Last fiddled with by paulunderwood on 2005-08-29 at 23:25
paulunderwood is offline  
Old 2005-09-01, 19:35   #80
OmbooHankvald
 
OmbooHankvald's Avatar
 
May 2005
Copenhagen, Denmark

4418 Posts
Default

Hi Paul

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

I hope you're not at me for stealing your message.
OmbooHankvald is offline  
Old 2005-09-04, 07:30   #81
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7×491 Posts
Default

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.

Last fiddled with by paulunderwood on 2005-09-04 at 07:32
paulunderwood is offline  
Old 2005-10-21, 20:56   #82
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7×491 Posts
Default

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

I have uploaded to the reservation page the latest blocks (2.2-2.35M) which have been sieved with NewPGen to 175 trillion.

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

Last fiddled with by paulunderwood on 2005-10-21 at 21:27
paulunderwood is offline  
Old 2005-10-25, 00:44   #83
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7·491 Posts
Default

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.

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)
paulunderwood is offline  
Old 2005-12-16, 16:26   #84
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

343710 Posts
Default

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

Note to linkers to input files: Update your links please.

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 and we still have a week in which to recieve an early Christmas present of a prime

For 2006, it would be cool to finish sieving and reach 900,000 digit LLR tests ...
paulunderwood is offline  
Old 2006-01-06, 02:53   #85
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

343710 Posts
Default

We got the Christmas present we wished for

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

Join us
paulunderwood is offline  
Old 2006-02-26, 21:02   #86
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7·491 Posts
Default

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.

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.

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

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!

Last fiddled with by paulunderwood on 2006-02-26 at 21:02
paulunderwood is offline  
Old 2006-03-02, 00:34   #87
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

65558 Posts
Default

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

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

Last fiddled with by paulunderwood on 2006-03-02 at 00:37
paulunderwood is offline  
Old 2006-03-12, 07:24   #88
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

65558 Posts
Default

I've updated the statistics 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
paulunderwood is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Forum Donation and Expense List Xyzzy Lounge 119 2020-10-02 00:00
link to status table paulunderwood 3*2^n-1 Search 2 2004-05-17 22:13
Status of Fermat Search rogue Factoring 13 2004-05-01 14:48
Interesting link... Xyzzy Hardware 0 2003-08-21 00:06
Nice link... Xyzzy Lounge 4 2003-06-28 13:37

All times are UTC. The time now is 09:38.

Wed Oct 21 09:38:21 UTC 2020 up 41 days, 6:49, 0 users, load averages: 1.43, 1.35, 1.36

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.