![]() |
|
|
#221 |
|
May 2005
23·7·29 Posts |
k=1515 tested till n=1.04M
k=12345 tested till n=1.04M I am still working on the above. k=617 tested till n=1.2M - testing suspended k=151515 tested till n=1.1M - releasing this k k=736320585 tested till n=860k - testing suspended |
|
|
|
|
|
#222 |
|
Feb 2007
D316 Posts |
Reserving 432383773965*2^n-1 Nash Weight 7788
Thanks cipher P.S: Special Thanks to Thomas11 for helping me find a "Real Heavy K" |
|
|
|
|
|
#223 |
|
Feb 2007
21110 Posts |
432383773965 has 100 Primes between n=0 to n=50k
Code:
432383773965 3 432383773965 4 432383773965 6 432383773965 7 432383773965 10 432383773965 11 432383773965 12 432383773965 18 432383773965 19 432383773965 20 432383773965 23 432383773965 39 432383773965 47 432383773965 61 432383773965 64 432383773965 72 432383773965 73 432383773965 84 432383773965 93 432383773965 94 432383773965 109 432383773965 123 432383773965 127 432383773965 141 432383773965 145 432383773965 161 432383773965 163 432383773965 183 432383773965 223 432383773965 227 432383773965 232 432383773965 259 432383773965 321 432383773965 322 432383773965 326 432383773965 329 432383773965 337 432383773965 340 432383773965 349 432383773965 368 432383773965 426 432383773965 501 432383773965 551 432383773965 553 432383773965 801 432383773965 802 432383773965 890 432383773965 902 432383773965 928 432383773965 1067 432383773965 1106 432383773965 1379 432383773965 1444 432383773965 1499 432383773965 1557 432383773965 1698 432383773965 1774 432383773965 2207 432383773965 2426 432383773965 2606 432383773965 3142 432383773965 3313 432383773965 3622 432383773965 3773 432383773965 3789 432383773965 4103 432383773965 4482 432383773965 4573 432383773965 5445 432383773965 5551 432383773965 5616 432383773965 6188 432383773965 6408 432383773965 7532 432383773965 7593 432383773965 8072 432383773965 8365 432383773965 8571 432383773965 8878 432383773965 9133 432383773965 9870 432383773965 9972 432383773965 12569 432383773965 13543 432383773965 16515 432383773965 17635 432383773965 19586 432383773965 21595 432383773965 21784 432383773965 22184 432383773965 26754 432383773965 29867 432383773965 30984 432383773965 32862 432383773965 36069 432383773965 37967 432383773965 38113 432383773965 40197 432383773965 45654 432383773965 48611 |
|
|
|
|
|
#224 |
|
May 2005
162410 Posts |
k=1515 tested till n=1.05M
k=12345 tested till n=1.05M I am still working on those. Last fiddled with by Cruelty on 2009-05-31 at 06:38 |
|
|
|
|
|
#225 |
|
May 2007
Kansas; USA
29·359 Posts |
I think this is as good a place as any to post this:
NPLB will be pulling out active reserved k's from it's upcoming k=2000-3400 efforts. I have sent PM's to 3 people about some reservations that have not had a search depth reported for 6-12 months to verify that they are still working on them. Please see details in the applicable posting in our thread. If any problems, please let me know. Best would be to reply in that thread or to send me a PM. Thanks, Gary |
|
|
|
|
|
#226 | ||
|
Aug 2008
Good old Germany
3·47 Posts |
Quote:
I have the following idea: Quote:
Last fiddled with by Svenie25 on 2009-06-22 at 23:46 |
||
|
|
|
|
|
#227 |
|
"Curtis"
Feb 2005
Riverside, CA
114048 Posts |
sr2sieve is for an entirely different sort of sieving, with many k values. To sieve a single k, the directions are as good as need be, and sr2 is of no help. Sr2 becomes useful when one wishes to sieve 3+ k values on identical ranges of n; its command line is similar to sr1, or it can be run from a sr2work file listing the ranges of n to search in billions.
I don't know what the -t and -A flags are for sr1, and I've used it many many times; what are you trying to do that's nonstandard with those? edit- if they are for threads, I would like to know if much speed is gained over just running two instances of sr1sieve; I've always done without threads, but if it's faster.... -Curtis Last fiddled with by VBCurtis on 2009-06-23 at 06:04 |
|
|
|
|
|
#228 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
3×2,083 Posts |
Quote:
As far as speed differences with multithreading, generally sieving is a bit faster *without* multithreading. The overhead for communication between threads is not much, but it is present nonetheless. I don't know what the exact % figures are, though, since I rarely use multithreading myself. The main benefit of multithreading is a smaller memory footprint; this can be quite useful if dealing with a very large sieve file. |
|
|
|
|
|
|
#229 |
|
Aug 2008
Good old Germany
3×47 Posts |
Okay thanks a lot guys. So I will use two instances instead of -t switch. (Doesn´t function under windows, too) -A is affinity.
Sorry, but I´m a "DAU". But after finishing srsieve I let run 2 instances of sr1sieve with the factors as output. How can I get the factors out of the sievefile after finishing? Last fiddled with by Svenie25 on 2009-06-23 at 09:02 |
|
|
|
|
|
#230 | |
|
Feb 2003
77416 Posts |
Quote:
Code:
srfile -k factors.txt sievefile.txt Last fiddled with by Thomas11 on 2009-06-23 at 11:35 |
|
|
|
|
|
|
#231 |
|
May 2005
23×7×29 Posts |
k=1515 tested till n=1.07M
k=12345 tested till n=1.07M I am still working on those. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Best Work for Finding Primes | Unregistered | Information & Answers | 9 | 2012-06-24 13:50 |
| Which settings to choose for best work? | jmb1982 | Software | 2 | 2009-04-07 09:33 |
| Help test 210885 - Find a new top 5000 prime! | SlashDude | Riesel Prime Search | 121 | 2008-01-03 08:47 |
| Help test 2995125705 - Find a new top 5000 prime! | SlashDude | Riesel Prime Search | 538 | 2007-05-08 01:42 |
| The fastest way to a top-5000 prime? | lsoule | 15k Search | 13 | 2005-09-19 20:24 |