![]() |
S16 Update
2 Attachment(s)
S16 tested to n = 900K. No primes found. :no: Residues attached. Testing continues.
|
S30 at n=600K
1 Attachment(s)
S30 is done to n=600K, I'd like to extend to n=700K.
Results for n=500K-600K are attached, no prime found. |
Reserving S9 to n=5M (2-5M) for BOINC
|
S30 done to n=700K
1 Attachment(s)
S30 is done to n=700K, extending to n=800K.
Results for n=600K-700K are attached, no prime found. |
s19 tested till n=185k
New primes: [CODE] 347616*19^181878+1 529524*19^182493+1 521344*19^183187+1 700006*19^183938+1 [/CODE] |
status report
S10 tested till n=2.7M
R10 tested till n=2.13M |
S30 tested to n=800K
1 Attachment(s)
S30 is tested to n=800K, results for range n=700k-800k are attached. No prime found. Releasing this base.
|
R16 Update
1 Attachment(s)
R16 tested to n = 1000K = 1M. No primes found. :no: Residues attached. Testing continues.
|
1 Attachment(s)
S25 reached n=350K, that was hecking much work! I found i prime, already reported, and i am going to release this base here. Results attached.
|
status report
S10 tested till n=2.8M
R10 tested till n=2.18M |
S16 update
2 Attachment(s)
S16 tested to n = 1000K = 1M. 1 prime found, as previously reported. Residues attached.
|
s19 tested till n=188k
New primes: [CODE] 414046*19^185864+1 630804*19^187127+1 [/CODE] |
1 Attachment(s)
[QUOTE=masser;496358]I will reserve the RS16 sequences that are currently at n=750K; my plan is to sieve up to n=2M, but test up to n=1M.[/QUOTE]
I am un-reserving RS16 now. I have attached the sieve file (I believe it was sieved up to 6e15) |
R31 tested to n=3M (1-3M)
1 prime found, 1 remain Results emailed - Base released |
I know Gary doenst like taking single k´s from larger Bases, but i do have an question about two k´s from S25.
101958*25^n+1 and 207544*25^n+1 have both an very low number of tests; each around 4,5k tests between n=350-1M; with an higher sieve limit even a few hundret less. I could get those down within a few months / weeks. But of course my aim is not to bring them up to 1M, only prime counts. If you agree i would take both til i have a prime. :smile: |
[QUOTE=MisterBitcoin;557373]I know Gary doenst like taking single k´s from larger Bases, but i do have an question about two k´s from S25.
101958*25^n+1 and 207544*25^n+1 have both an very low number of tests; each around 4,5k tests between n=350-1M; with an higher sieve limit even a few hundred less. I could get those down within a few months / weeks. But of course my aim is not to bring them up to 1M, only prime counts. If you agree i would take both til i have a prime. :smile:[/QUOTE] There are many bases with 2 k's remaining at n=300K or 400K. Why do you choose to take two k's only out of a base with so many k's remaining? You say you will search them until you find a prime. What makes you think you would find a prime on them before you get bored with them? It is very likely that would happen. The chances of you finding a prime on them for n=350K-1M are very remote because of how low-weight they are. I'll tell you what. Run a single test at n=770K (~65% of the n-range). See how long it takes. Multiply that by the number of tests that you have to get the total CPU time. Then divide that by your number of cores that you will be running on it 24 hours a day 7 days a week. Then report that time back here. If you can honestly say that you will run all the cores that you reported here in the above calculation full time and you can provide a status report once a month I will reserve them for you. The biggest problem that CRUS has is people reserving way more work than they realize. We've also had people reserve things "until they find a prime" not realizing how remote that chance is and how long the tests begin to take in rapid fashion. |
[QUOTE=gd_barnes;557393]There are many bases with 2 k's remaining at n=300K or 400K. Why do you choose to take two k's only out of a base with so many k's remaining?
You say you will search them until you find a prime. What makes you think you would find a prime on them before you get bored with them? It is very likely that would happen. The chances of you finding a prime on them for n=350K-1M are very remote because of how low-weight they are. I'll tell you what. Run a single test at n=770K (~65% of the n-range). See how long it takes. Multiply that by the number of tests that you have to get the total CPU time. Then divide that by your number of cores that you will be running on it 24 hours a day 7 days a week. Then report that time back here. If you can honestly say that you will run all the cores that you reported here in the above calculation full time and you can provide a status report once a month I will reserve them for you. The biggest problem that CRUS has is people reserving way more work than they realize. We've also had people reserve things "until they find a prime" not realizing how remote that chance is and how long the tests begin to take in rapid fashion.[/QUOTE] I will perform those tests over the weekend and report the results on monday. |
[QUOTE=MisterBitcoin;557890]I will perform those tests over the weekend and report the results on monday.[/QUOTE]
A run at n=590K takes around 1050 secs. A run at around 780K takes around 3500 secs. That makes around 7,7 months for one of those sequences; if using two servers. However without a deeper sieve file i wont start working on them. A sieve up to P = 1e15 should erase around 500 or 600 canidates. It is still a lot of work regardless, but i think i can handle it. ^^ |
R6 Update
1 Attachment(s)
R6 tested to n = 5.4e6. Residues attached. Testing continues.
|
Reserving S30 to n=1M (800k-1M) for BOINC
|
Reserving R25 to n=300k (150-300k) for BOINC --> all available k by sievefile
|
R25 tested to n=300k (150-300k)
9 primes found, 108 remain Results emailed - Base released |
S30 tested to n=1M (800k-1M)
nothing found, 2 remain Results emailed - Base released |
Reserving R7 to n=100k (25-100k) (200-300M) for BOINC
|
S9 tested to n=5M (2-5M)
nothing found, 1 remain Results emailed - Base released |
s19 tested till n=191k
New primes: [CODE] 441244*19^190791+1 [/CODE] |
Small range of R7 proven
2 Attachment(s)
Working on a large base like R7 is troublesome, but i still decided to give it some effort.
And after a few days i have results. The range 408034000000 up to 408034255081 is proven. The last k just fell a few hours ago. [CODE] 408034056294*7^226772-1 is prime! (191657 decimal digits, P = 3) Time : 342.596 sec.[/CODE]The results and primes can be found in results_max_range_R7.zip. The files created from srbsieve will be added in a few minutes. (Edit: added now) I am reserving the range >408G for testing up to n=25K. [5400 k´s remaining at n=3350; quickly decreasing] |
[QUOTE=MisterBitcoin;569089]Working on a large base like R7 is troublesome, but i still decided to give it some effort.
And after a few days i have results. The range 408034000000 up to 408034255081 is proven. The last k just fell a few hours ago. [CODE] 408034056294*7^226772-1 is prime! (191657 decimal digits, P = 3) Time : 342.596 sec.[/CODE]The results and primes can be found in results_max_range_R7.zip. The files created from srbsieve will be added in a few minutes. (Edit: added now) I am reserving the range >408G for testing up to n=25K. [5400 k´s remaining at n=3350; quickly decreasing][/QUOTE] You should have reserved it first. I would have stated the following: This is too messy to show on the pages. Sorry. I suggest working your way upwards from k>500M (lowest untested) on the k's for this huge-conjectured base. Starting at the end and working backwards makes for too much admin work. |
[QUOTE=gd_barnes;569152]You should have reserved it first. I would have stated the following:
This is too messy to show on the pages. Sorry. I suggest working your way upwards from k>500M (lowest untested) on the k's for this huge-conjectured base. Starting at the end and working backwards makes for too much admin work.[/QUOTE] Alright, reserving R7 k= 500M-1G up to n=25K. |
Questions and comments about srbsieve/srsieve/srsieve2 moved to software instructions/questions thread.
|
Reserving R7 k-range <2M up to n=500K.
|
status report
S10 tested till n=3.06M
R10 tested till n=2.34M |
R7 tested to n=100k (25-100k) (200-300M)
1281 primes found, 794 remain in this range Results emailed - Base released |
R6 Update
1 Attachment(s)
R6 tested to n = 5.5e6. Residues attached. Testing continues.
|
1 Attachment(s)
R7, K=500M-600M reached n=10K. 4280 k´s are remaining; testing continues.
Found primes from n=3K-10K are attached, as well as k´s remaining. |
Reserving R7 k-range: 2M-10M up to n=250K.
Additionally reserving R15, k-range 10M-20M up to n=100K. Splitting this into 8 segments to speed it up. |
Update about R7:
Testing range <2M: Extending up to 1M; testing is between 740K and 800K. Found 1 prime, will soon be reported once Top 5k primes works fine again. Testing range 2M-10M: Extending up to n=300K; Found 10 primes. Testing right now is a ~274k. [CODE] 9761156*7^170417-1 5119538*7^173944-1 2096676*7^178423-1 6597704*7^180695-1 8737902*7^182549-1 3531018*7^185035-1 4635222*7^198494-1 8389476*7^208246-1 2539898*7^214467-1 3587876*7^254226-1[/CODE] Testing range: 500M-1G will update soon and mail results. |
About R7.
I have send the results k=500M-700M up to n=25K to Gary. 700M-1G is still processing at varios n-values. k=<2M is now at n=970K so a few more weeks. k=2M-10M is also comming along very well. I found the following primes: [CODE] 7115634*7^273464-1 8354966*7^288802-1 9871172*7^367701-1[/CODE] I will extend the range up to n=500K. Considering to go for a new and better sieved sieve file after passing n=400K. |
[QUOTE=MisterBitcoin;583872]About R7.
k=<2M is now at n=970K so a few more weeks. k=2M-10M is also coming along very well. I found the following primes: [CODE]7115634*7^273464-1 8354966*7^288802-1 9871172*7^367701-1[/CODE] I will extend the range up to n=500K. Considering to go for a new and better sieved sieve file after passing n=400K.[/QUOTE]Please post the primes for k<=2M. Please give the test depth for k=2M-10M. I can't update the statuses on the pages without both primes and test depths. Thanks! |
[QUOTE=gd_barnes;583888]Please post the primes for k<=2M.
Please give the test depth for k=2M-10M. I can't update the statuses on the pages without both primes and test depths. Thanks![/QUOTE] k<2M found no additional primes; only that [URL="https://primes.utm.edu/primes/page.php?id=132445"]one[/URL] from a while ago. k=2M-10M is now at n=368K. |
| All times are UTC. The time now is 09:15. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.