Project instructions
[B][U][size=4]Gribozavr has sieved range 100M25G, so I've revised this thread.[/size][/U][/B]
Instructions: 1.) Download LLR from [url]http://www.mersenne.org/gimps/[/url] (choose llr370.zip) 2.) The n is fixed at 195000, and the base is 2. Choose any range of k. However, post your chosen range in this thread before starting on it, and choose the lowest range of k available (see "pre sieved range reservation thread). The ranges can be as large or as small as you want. 3.) Download your range (on the pre sieved range reservation thread). Move that file to the folder where LLR is in. Run the program, which will do the rest. 4.) After your range is complete, check LLR's output file to see whether you've found any primes. Post any primes in the "primes found" thread, even if they are not twin primes. If you need additional help, feel free to post here. [b]5.) If you find a twin prime, PM me and email Chris Caldwell (He's the creator of the prime pages. See [url]http://primes.utm.edu/[/url] and scroll to the bottom for his email). Do NOT inform anyone else yet. The reason for this is that I don't want someone else seeing that ?*2^1950001 and ?*2^195000+1 are twin primes. That person may just submit it by himself to the prime pages, which means that he/she gets the credit. The actual person who found the prime and the project won't get any credit[/b] Good luck! 
Oops, I forgot to mention that you should make LLR's output file different from its input file. Also, if the output file is larger than 30 bytes, there's a good chance that you found a prime or two. However, it is possible (and has happened before) for the output file to be smaller than 30 bytes, and still contain at least one prime.

100,000 to 100,000,000,000 reserved
I'm just sieving and I'm not sure how fast the twin option will sieve them out. I may change my reservation in a couple hours. Sorry if I'm annoying anyone. 
[QUOTE=jasong]100,000 to 100,000,000,000 reserved
I'm just sieving and I'm not sure how fast the twin option will sieve them out. I may change my reservation in a couple hours. Sorry if I'm annoying anyone.[/QUOTE] Unfortunately, only ranges above 100,000,000 are available (for LLR testing, see range reservations thread). Gribozavr has sieved everything from 100,000,000 until 5,000,000,000, but you're welcome to sieve after 5 billion or LLR test after 100 million. If you choose the sieving option, PM me, and sieve only to 20 billion (there's a really high chance we'll find a twin prime before 20 billion). It's not entirely your fault for choosing that range, though. My first post in this thread said "currently, all ranges above 100,000 are available". I wanted to edit this many times before, but the site doesn't allow me to edit after 15 minutes. Therefore, you'll have to check the "range reservations thread" for updates. 
[QUOTE]I wanted to edit this many times before, but the site doesn't allow me to edit after 15 minutes.[/QUOTE]
MooooMoo, I think you should ask Xyzzy to give you Moderator status for this subforum. That way you will be able to change your posts after 15 minutes. After all, you started this project and as project admin you deserve Moderator status. Edo 
Sieving does not need primetest reserve.
If we sieve a large range, I recommen also to include the low n part (for example (3 to 20G). The sieving of a 20G range speed is almost the same as 5G. Without knowing your efforts I tried also a bit sieving on 3  10G up to 10T with a speed of 80M/s or 6.5T/day (P4 3.4GHz). At 10T, there are ~4.6M candidates left which is about 85M text file or 16.5MByte Zipped. Removing 3 candidtes /s at 10T. when sieving 20G reching 50T (1 Week sieving), such a file (twice as big) could be distributed, sieved more and then merged again. I people run prime tests on a range of 100M or less, it already makes more sense to take the presieved ranges insted of own sieving. 
MooMoooo can you store somewhere the primes found ? In the site I trace only the NUMBER OF PRIMES FOUND.
Of course if we find any twins, I publish them. 
[QUOTE=pacionet]MooMoooo can you store somewhere the primes found ? In the site I trace only the NUMBER OF PRIMES FOUND.
Of course if we find any twins, I publish them.[/QUOTE] I'll store the primes found in a separate thread.  edorajh, I've requested to be a moderator on the "forum feedback" forum, so all threads will be updated. Hopefully, there won't be any more range confusion. 
i downloaded a presieved range and started running it in LLR, however I noticed that it is only testing k*2^n  1 candidates, it isnt doing the +1. am i misunderstanding the intentions of this project or am i just doing something wrong?

It only needs to check the +1 candidate when it finds a prime in
the 1 candidate. That will miss primes of the form k2^n+1, but is faster towards the goal of a twin prime (both +1 and 1 prime). 
All times are UTC. The time now is 10:34. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.