mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   3*2^n-1 Search (https://www.mersenneforum.org/forumdisplay.php?f=14)
-   -   4-5M Reservations (https://www.mersenneforum.org/showthread.php?t=9865)

paulunderwood 2008-01-17 00:28

4-5M Reservations
 
[B]updated 5:55:56 AM, Tues, Sept 23, 2008

[/B][SIZE=5][COLOR=Red]ALL DONE - PROJECT FINISHED[/COLOR][/SIZE]

These mega-prime candidates have at least [B]1323327 decimal digits[/B] :w00t:
They have been sieved for divisors less than 271.2 trillion :showoff:
:geek: Here are 249 candidates contained in 4 input files ready for LLR testing

:help: An average file of 58 candidates will take about three weeks to process on an average Pentium computer -- each number taking around 14 hours; 64-bit AMDs 15 hours per core; 2.4Ghz Core2Duo/Quad around 10 hours per core

[B][U][SIZE=3]T[/SIZE]he [SIZE=3]3[/SIZE][SIZE=2]2[/SIZE][SIZE=1]1[/SIZE] [SIZE=3]R[/SIZE]eservations [SIZE=3]S[/SIZE]ystem[/U] :[/B]
[COLOR=Green][B](0)[/B][/COLOR] Make ready your system, maybe by creating as many directories as the number of cores you want to use for this project
[COLOR=Green][B](1)[/B][/COLOR] Download and decompress [URL="http://www.mersenne.org/gimps/"][COLOR=Green]the program LLR-3.7.1c[/COLOR][/URL] (Linux or Windows)
[COLOR=orange][B](2)[/B][/COLOR] Choose a range from the list below that no one else has recently reserved further below
[COLOR=orange][B](3)[/B][/COLOR] [COLOR=red][I]Leave a message here to reserve your chosen range[/I][/COLOR]
[COLOR=orange][B](4)[/B][/COLOR] Download the corresponding input file(s) -- all done
[COLOR=Green][B](5)[/B][/COLOR] Run LLR with your new input file(s)
[COLOR=orange][B](6)[/B][/COLOR] When finished, email the results file(s) to [EMAIL="paulunderwood@mindless.com"]paulunderwood@mindless.com[/EMAIL]
[COLOR=orange][B](7)[/B][/COLOR] To continue go back to step [COLOR=orange][B]2[/B][/COLOR]

(Alternatively to the above steps, just email me.)

Range of a 1000 n :: Candidates in file
4396000-4397000 :: 61
4397000-4398000 :: 60
4398000-4399000 :: 60
4399000-4400000 :: 68

:spot:

paulunderwood 2008-05-30 20:04

If you book out any of the remaining 4 files above, please ensure that you can complete them by the end of June.

You can always join [URL="http://www.primegrid.com/"]PrimeGrid[/URL] and crunch individual 321 numbers through the BOINC interface. Each will take about half a day and you might find a mega-prime :wink:

Lennart 2008-06-02 18:17

Reserving
 
4396000-4397000 :: 61
4397000-4398000 :: 60
4398000-4399000 :: 60
4399000-4400000 :: 68


I reserve the last 4 files.:smile::smile:

/Lennart

jrk 2008-06-02 18:29

Paul are you going to be adding more ranges?

paulunderwood 2008-06-02 18:37

[QUOTE=jrk;135018]Paul are you going to be adding more ranges?[/QUOTE]

No! I might have a few sub-n=4M if James can not do those himself.

I hope we can get all sub-n=5 done by the end of June :smile:

mdettweiler 2008-06-02 21:04

[quote=paulunderwood;135019]No! I might have a few sub-n=4M if James can not do those himself.

I hope we can get all sub-n=5 done by the end of June :smile:[/quote]
Once all n<5M is done, and sieving for 5M+ is complete (or at least ready for 5M-6M to be broken off), will files in the 5M-6M range be made available for manual testing, too, or will it be PrimeGrid only?

paulunderwood 2008-06-02 21:07

[QUOTE=Anonymous;135028]Once all n<5M is done, and sieving for 5M+ is complete (or at least ready for 5M-6M to be broken off), will files in the 5M-6M range be made available for manual testing, too, or will it be PrimeGrid only?[/QUOTE]

PrimeGrid only. PG are sieving n=5M-10M already. It will be up to them when they decide to release more (only on their server.)

mdettweiler 2008-06-02 21:38

[quote=paulunderwood;135030]PrimeGrid only. PG are sieving n=5M-10M already. It will be up to them when they decide to release more (only on their server.)[/quote]
Ah, I see. So, then, will the 321 project just die out, or will it pick a new k to work on? (Or maybe even a new base--such as 3*3^n-1?)

paulunderwood 2008-06-02 22:29

[QUOTE=Anonymous;135032]Ah, I see. So, then, will the 321 project just die out, or will it pick a new k to work on? (Or maybe even a new base--such as 3*3^n-1?)[/QUOTE]

"321search" is near its end, but PG will carry on searching for primes of the form 3*2^n-1 in conjunction with 3*2^n+1. "321search" will not continue.

jrk 2008-06-03 01:25

Does PrimeGrid still assign double-checks at the same time as first-time tests? It was doing that a few months ago when I was checking it out.

paulunderwood 2008-06-03 01:30

As far as I know, yes. Double checking becomes more important with the bigger numbers because there are many helpers needed, some of whom might have defective hardware, and because general hardware failures can occur anyway.

jrk 2008-06-03 01:52

Oh I don't doubt that double-checking is important (I do it occasionally to test hardware). I just wonder why it can't be a few weeks behind first-time testing, you know, so if someone's interested in making the record list he can make it without getting demoted as a double-check.

But maybe that doesn't matter. I dunno. :)

paulunderwood 2008-06-03 02:16

That might be a good idea. I do not know PG's error rates for 321.

On a similar note, wouldn't it be fun to start where we expect the next prime to be and to work outward from that until one is found and then repeat the operation again?

jrk 2008-06-03 03:09

Yep. It'd also be fun to pick your own assignments, too, if that were possible. So people could entertain their own ideas (though, just as a game, you can't really say much about the distribution of these numbers anyway :smile:).

Rytis 2008-06-05 18:01

There is a new feature coming into BOINC, which will assign a reliability score to computers (they will first crunch doublechecked workunits, and when it's known that the host produces valid data, it will be issued non-doublecheck work). The plan is to have only about 10-20% of work doublechecked and still ensure valid results. And we can always go back to full doublecheck if needed or revisit the single-check numbers later.

Over the last 7 days we had 6.6537% fail rate on Linux (1.1305% aborted by user, 0.2261% returned wrong residue, total of 3096 tests completed) and 11.6169% fail rate on Windows (5.1209% user aborts, 1.0748% wrong residue, total of 12654 tests completed).

Kosmaj 2008-06-08 03:29

People who like the prime testing style of 321 are welcome to joing our [URL="http://www.mersenneforum.org/forumdisplay.php?f=59"]Riesel Prime Search project[/URL] searching for primes of form k*2^n-1. We have manual reservations and use LLR only. Everybody is free to test the numbers he/she likes.

Well sieved values in the megabit prime region (n>1M) are available right now for k=5, 15, 17, and 105. Presieved candidates for many k<300 and n<1M organized in so-called "drives" are available as well. Feel free to drop by and have a look.

Thanks,
Kosmaj


All times are UTC. The time now is 07:39.

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