If a Prime is found, are we able to stop work for unclaimed work units?
What kind of code would need to be considered to stop all work for a range above the Prime?
____________
Primes Found:
50*893^231310-1 (Top 5000)
20*634^476756-1 (Top 5000)
96*789^506568+1 (Top 5000)
225*370^322863-1 (Top 5000)
3293*82^335630-1 (Top 5000)
18431*82^467690-1 (Top 5000)
More primes on prestacki.com!
/ 
Reply
Quote
rebirtherVolunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Send message
Joined: 2 Jan 13
Posts: 7479
Credit: 43,657,967
RAC: 40,740
If a Prime is found, are we able to stop work for unclaimed work units?
What kind of code would need to be considered to stop all work for a range above the Prime?
For short ranges yes. All primes will be removed from the sievefile which are found in the last range but generally no.
For local tests with llr there is a stoponprimedk option. Sort your ranges by k values, if a prime for a k is found the rest will be skipped for this k and go to the next.
For llr2 I dont know if there is the same option. PRST hasnt any function.
/ Reply
Quote