mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Twin Prime Search

Reply
 
Thread Tools
Old 2006-11-27, 23:06   #89
MooMoo2
 
MooMoo2's Avatar
 
"Michael Kwok"
Mar 2006

22358 Posts
Default

Quote:
Originally Posted by pacionet View Post
Wow !
Gribozavr we need next pre-sieved ranges 1100-1200M !!!!

Thanks
Andrea

You (or Victor) can send me the "All in one" file with all the 100M range (for Primegrid) ?
I 'll post them here, in "All in one", bottom of the page:

http://www.twinprimesearch.org/pre-sieved_ranges.htm

Thanks
Andrea
At this rate, we'll find a record-size twin by the end of this year
MooMoo2 is offline   Reply With Quote
Old 2006-11-28, 11:36   #90
biwema
 
biwema's Avatar
 
Mar 2004

3·127 Posts
Default

Quote:
Originally Posted by KEP View Post
I just started a for fun test, to see exactly how long it would take, and apparently it will take 99 milliseconds to do 1 iteration, which means that it on my machine will take around 38 days ± ½ day, so as it turns out, LLR is faster on 10 M digit candidates than MPrime is, even though the exact is opposite with the n we are currently testing :) Yeehhh my bad :) Apparently the range though is pretty fast to sieve, so plenty of work should be around for long time :) I might give it a try see how it goes with the 25 G range, if I try to sieve it to 100 Billion :)
finding a 10 Megadigit twin is really a hard task.

Expect searching a range of 400000G - 500000G and testing almost 100 Billion Candidates (during that time you might find 300000 non-twin 10M digit primes), depending on your sieving depth.

Sieving a range of 500G needs about 1.5 G Ram, so better wait until NewPGen Supports a huge Memory Size, before start sieving. Then sieving much more than 1000 CPU years might be appropriate.

Nevertheless, Good luck...
biwema is offline   Reply With Quote
Old 2006-11-28, 16:50   #91
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

17×59 Posts
Default

Quote:
Originally Posted by MooooMoo View Post
At this rate, we'll find a record-size twin by the end of this year
Lets hope so, I think it could be cool to hit the first twin prime, before the end of the year, but still even though Rytis has automatized the LLR job creation process, it will require a load of users from the primegrid network, to start requesting LLR wu, and no primegen WU for those of us doing a hard effort to find the next twin :) No offence Rytis...

Quote:
Originally Posted by biwema View Post
finding a 10 Megadigit twin is really a hard task.

Expect searching a range of 400000G - 500000G and testing almost 100 Billion Candidates (during that time you might find 300000 non-twin 10M digit primes), depending on your sieving depth.

Sieving a range of 500G needs about 1.5 G Ram, so better wait until NewPGen Supports a huge Memory Size, before start sieving. Then sieving much more than 1000 CPU years might be appropriate.

Nevertheless, Good luck...

I couldn't sieve it, actually it has been sieved to 1 billion, but the program made some weird mistakes, like sieving out of the range requested, and when it had to save the work, it crashed :) So I'm not gonna sieve it anyway. But maybe you can tell me how many G is needed to be sieved, before one can say for sure to be able to find a 1 million digit twinprime?
KEP is offline   Reply With Quote
Old 2006-11-28, 23:15   #92
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

6278 Posts
Default

Rytis, I've been watching http://www.primegrid.com/orig/range_grid.php and http://www.primegrid.com/?charts (Unsent LLR results) and can't yet understand some terms.

What are "unprepared tasks"?
"Done tasks" means that the number has been tested and the server got the result?
What are "Unsent LLR results"?
gribozavr is offline   Reply With Quote
Old 2006-11-29, 09:41   #93
Rytis
 
Rytis's Avatar
 
Nov 2006

23×11 Posts
Default

When I initially insert new ranges into the database, they are not created as BOINC workunits, but reside in the temporary llr table. Range grid shows them as red rows, and the actual number of tasks not converted into BOINC workunits is shown in unprepared tasks column.

Later when BOINC client requests work for LLR, generator is launched, creating two results (in BOINC terms, a result is a single instance of workunit, does not matter if returned by the user or not yet sent. I know, confusing) for every row in LLR table (technically not exactly like described, but let's simplify things not going too far from the idea). The generator tries to keep 600 unsent results (for now) to be able to send work any time a user requests for it. This is what you see in the charts table as unsernt LLR results.

Back to range grid. A workunit is considered complete only when two (or more, in some cases) matching results have been returned. Then it is checked for primes and marked as complete (also, BOINC credit is granted). Such complete results are shown in done tasks column.

I hope it got clearer, let me know if you need additional explanations.
Rytis is offline   Reply With Quote
Old 2006-11-29, 11:25   #94
biwema
 
biwema's Avatar
 
Mar 2004

38110 Posts
Default

Quote:
Originally Posted by KEP View Post
But maybe you can tell me how many G is needed to be sieved, before one can say for sure to be able to find a 1 million digit twinprime?
- You are for sure able to find a Megadigit prime by testing one candidate, if you are lucky.

- You will never be sure that you really will find one. (independant from the size of the range)

I assume you want to know when it is likely to find one:
After sieving 7000 G - 7500G you will have the same chance to find a megadigit twin (n=3330000) as twinprimesearch has it now with n=195000 an a range of 25G.

I will post more accurate information later.
biwema is offline   Reply With Quote
Old 2006-11-29, 19:34   #95
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

17·59 Posts
Default

Quote:
Originally Posted by biwema View Post
- You are for sure able to find a Megadigit prime by testing one candidate, if you are lucky.

- You will never be sure that you really will find one. (independant from the size of the range)

I assume you want to know when it is likely to find one:
After sieving 7000 G - 7500G you will have the same chance to find a megadigit twin (n=3330000) as twinprimesearch has it now with n=195000 an a range of 25G.

I will post more accurate information later.
Thanks, I'll awaite that accurate information with patience and exitement To those who doesn't check back to this thread, before or mayby never again does it, I'll say, Merry Christmas and may you all have a Happy New Year
KEP is offline   Reply With Quote
Old 2006-11-29, 20:29   #96
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29·41 Posts
Default

Quote:
Originally Posted by Rytis View Post
A workunit is considered complete only when two (or more, in some cases) matching results have been returned.
I think it's a waste of time to check all numbers twice. We're not trying to find ALL primes in this range, just looking for A twin prime.

One more question, How can i make sure i do not get any primegen WU's? I have a spare pc which can do some useful work on the twin prime search, but primegen isn't even worth the electricity to run my pc.
smh is offline   Reply With Quote
Old 2006-11-29, 20:35   #97
Rytis
 
Rytis's Avatar
 
Nov 2006

23×11 Posts
Default

I do doublechecking because we had people cheating in BOINC. Also, I think that we don't want to miss a twin prime, because that would be waste of computing power - we would need to go much higher to find another one.

As for getting only LLRs, if you have set to run test applications and there are red rows in range_grid page (that is, unsent work), you will get LLRs as they have higher priority.
Rytis is offline   Reply With Quote
Old 2006-11-29, 20:51   #98
thommy
 

94F16 Posts
Default

Quote:
Originally Posted by Rytis View Post
I do doublechecking because we had people cheating in BOINC. Also, I think that we don't want to miss a twin prime, because that would be waste of computing power - we would need to go much higher to find another one.
But going higher doenst take longer. Tests are the same length. Doublechecking really is a waste of time... it will just take twice the time to find a prime. Because 95% of reasidues or more will match and those are wasted.
  Reply With Quote
Old 2006-11-29, 20:52   #99
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

11×37 Posts
Default

Maybe doublechecking should be selective based on the user who submitted the result? We trust people on mersenneforum, they won't send fake results -- so their work doesn't need to be doublechecked. You probably trust your top-producers who have many machines running (but after some doublechecking to be sure that the machines are not faulty).
gribozavr is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
BOINC Unregistered Information & Answers 6 2010-09-21 03:31
BOINC.BE BATKrikke Teams 2 2010-03-05 18:57
Boinc Xentar Sierpinski/Riesel Base 5 4 2009-04-25 10:26
BOINC? masser Sierpinski/Riesel Base 5 1 2009-02-09 01:10
BOINC bebarce Software 3 2005-12-15 18:35

All times are UTC. The time now is 13:42.


Fri Jul 7 13:42:01 UTC 2023 up 323 days, 11:10, 0 users, load averages: 1.07, 1.03, 1.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔