SRBase
[[File:{{#setmainimage:SRBase.jpg}}|alt=SRBase logo image|center|frameless]]
SRBase is a BOINC platform volunteer computing project and needs your help to advance mathematical research.
Why SRBase?
For every base (b) for the forms k*b^n+1 and k*b^n-1, there is a k-value for each form that has been conjectured to be the lowest 'Sierpinski value' (+1 form) or 'Riesel value' (-1 form) that is composite for all values of n >= 1.
Goal
Prove Riesel and Sierpinski conjectures for bases <= 1030 that are not currently being worked on by other projects or efforts.
Methods
The project is in collaboration with the Mersenne CRUS project and Great Internet Mersenne Prime Search where SRBase's Trial Factoring sieving on GPU is working on the 100-1000M range and have almost completed the 74-75 bit level.
The server is famously running on a private computer in a VM and may, or may not, be located in a closet. Recent advancements include updating the application from LLR2 to PRST v10, Multi GPU sieving and Intel® Arc support.
- Work reservation and preparation - http://www.mersenneforum.org/forumdisplay.php?f=81 The link is used for any base reservation. This avoids any duplicate work from other users
- Work creation - All bases over 1M tests (lower ranges) will be split into pieces. Normally there are 2-3 batches, 25-50k, 50-60k, 60-100k. Most of the work is done in Excel
- Check results - merge all results to lresults.txt
- Remove primes from a sievefile with the srfile app
Project team / Sponsors
- Gary - Mersenne/CRUS admin - results
- Prime95 - GIMPS admin - work distribution
- Odicin - scripts
- walli - coding
- deletenull - GPU apps and compiling
- rebirther - SRBase admin