This thread is for software downloads and instructions as well as a forum for any related questions on how to run software related to the effort.
Here is a link to all of the latest software that should be needed:
http://www.rieselprime.de/dl/CRUS_pack.zip. The programs are LLR, PFGW, srsieve, sr1sieve, sr2sieve, and a PFGW starting bases script.
First an important note for more experienced prime searchers. This first post will be relatively elementary. For the specific sequence of what to run for different efforts here, see the second post. This will be detailed instructions on running each program.
Preliminaries:
I would suggest creating a separate directory for most of the programs except Srfile. The Sr(n)sieve series of sieving programs have a tendency to use some of the same generic file names and you don't want one sieve overlaying a prior one. Srfile could be copied into each of the 3 directories of the Sr(n)sieve programs. It is used to manipulate files of different types, remove factors from sieved files, and other misc. tasks.
Program instructions:
LLR - This is a prime finding or PRP (probable prime) finding program. It is the primary one that we will use for finding primes for n > ~3K-5K. If the base is a power of 2, (bases 4 and 16 for this effort), it difinitively finds a prime. If not, it only finds probable primes that must be proven by PFGW. To run it, double click it, choose 'Test Input', key in your sieved file name, the name of the file that you would like it to write programs to, and line 1, and press OK. Primes will be in the file you specified and it will write an 'lresults.txt' file that show details about the search.
PFGW - This is an outstanding general purpose program that can trial factor, find PRP's (probable primes), and do deterministic tests. It should be used at all times for testing bases that are not a power of 2 and is far faster than anything else for testing. It is also the best program to use when starting a new base because scripts can be written for it to do very specific things such as stop serching k's when a prime is found. You'll want to read the pfgwdoc.txt instructions in the download. It will talk about all of the parameters for the program. To open the program, double click the WinPFGW.exe icon. You'll want to change 'Output Verbose Screen' option to 'Super quiet' or the program will slow down slightly from displaying much info. on the screen. There are two different efforts it will be used for. Commands for each:
(1) When proving +1 PRP's found by LLR, use the following command:
"PFGW (input file with extension) -f0 -t -l". -f0 will cause it to do no initial factoring, -t will force it to prove the PRP's prime, and -l will cause it to write a more detailed results file. If you have a lot of primes you're proving, just see if the # of lines in the pfgw-prime.log file equal the number of primes in yor input. If so, they were all prime.
(2) When starting a new base, run PFGW version 3.4.0 or later using the
new-bases-4.3 script as an input file. Then use the following command to run it:
"(script name) -f100 -l". -f100 will cause it do to a 'normal amount' of initial factoring. See above for -l. Regarding the script file, there are very simple instructions in the script. There are only 5 lines that need to be changed for each base.
srsieve: This is an all-purpose sieving program that is used as a 'set up' for sr1sieve and sr2sieve as well as sieving very large #'s of k's more quickly than anything else. It also is very effective at sieving starting from n=1 because it does not erroneously remove low n-values that would make the equation prime. First you need to create an input file of actual equations such as 7*30^n+1, 9*30^n+1, etc., one per line. Then go to the command prompt and use the equations file as input with a command like "srsieve -a -n 25e3 -N 100e3 -P 1e9 -m 4e9 (input file). -a is the type of output file (ABCD file-type in this case) -n is the low n-value of your range, -N is the high of the range, -P is how far to search (1 billion in this case), and -m tells it to not display factors on the screen less than 4G. (Unfortunately you can't set it higher than that but in this case you're not going higher so it keeps it moving by not displaying info. on the screen.
sr1sieve: This is the best program to use to sieve one candidate and is far faster than anything else for that purpose. You do need to use srsieve to sieve up to at least the value of k or the base first but I think the creator recommends something greater than P=1G. When running srsieve first, be sure and use the -g paramater to create the correctly formatted sieved file. I personally sieve to P=250M or 500M and then let sr1sieve have at it. To run sr1sieve, go to the command prompt and try something like "sr1sieve -P 500e6 -i (input file) -o (output file). See the instructions for additional details.
sr2sieve: This one is a little tricky but it is by far the fastest for multi-k sieving anywhere from 3 k's and up. I will just tell you the steps and not how to do them:
(1) Use srsieve to sieve up to about P=1G. Force it to create an 'ABCD' output file using the -a paramater.
(2) Run sr2sieve using the file in (1) as input. You'll need to specify a P= paramater that tells it how far to sieve. It knows by a value in the input file where p-value to start at. The command might be something like "sr2sieve -P 500e9 -i (ABCD-input file). Sr2sieve will not remove prime-search candidates, it will only write factors into a file called factors.txt so one more step is needed.
(3) Run srfile with the commnd "srfile -G -k factors.txt (ABCD-input file from #1). This will cause it to remove all factors found by #2 and write out a file sorted by n that LLR and PFGW can do primality tests on. You're now ready to do primality tests on it.
Any questions...just ask. There is a lot of info. in the various README and other help and doc files for the programs, especially for the sr(n)sieve programs.
Gary