PCWSieve by Bryan Little
A BOINC-enabled OpenCL stand-alone sieve for Proth (k·2n+1), Cullen (n·2n+1), and Woodall (n·2n−1) factors.
+1-1 search algorithm by
- Geoffrey Reynolds
- Ken Brazier, 2009
With contributions by
- Yves Gallot
- Kim Walisch
- OpenCL v1.1
- 64 bit operating system
- Search parameters are given on the command line.
- A small group of sieve primes are generated on the GPU.
- The group of primes are tested for factors in the K and N ranges specified.
- Repeat #2-3 until checkpoint. Gather factors and checksum data from GPU.
- Check the factors for validity on the CPU and see if they have any small prime divisiors.
- Report any factors that pass the CPU tests to factors.txt, along with a checksum at the end.
- Checksum can be used to compare results in a BOINC quorum.
command line options
* -p
* -P Sieve primes -p <= p < -P < 2^62
* -k
* -K Sieve for primes k*2^n+/-1 with -k <= k <= -K < 2^32
* -n
* -N Sieve for primes k*2^n+/-1 with 65 <= -n <= n <= -N < 2^32
* -c Search for Cullen/Woodall factors
* -s or --test Perform self test to verify proper operation of the program.
Program gets the OpenCL GPU device index from BOINC. To run stand-alone, the program will
default to GPU 0 unless an init_data.xml is in the same directory with the format:
<app_init_data>
<gpu_type>NVIDIA</gpu_type>
<gpu_device_num>0</gpu_device_num>
</app_init_data>
or
<app_init_data>
<gpu_type>ATI</gpu_type>
<gpu_device_num>0</gpu_device_num>
</app_init_data>