C] Total Number of 4-Chains Found = 214: When difficulty is 5.x 4 CH won't be accepted. The only logical reason I can see that chains are getting accepted above 5.x is somebody expanded supercomputing's code for 5.x and kept it private, or that the 4 ch that are found by his miner at random times are 5x too, which would account for so many rejects.
Correction, the wheel factorization procedure implemented in the code
can efficiently sieve for prime twins, triplets, quadruplets, quintuplets, and sextuplets without any modifications to the code. But only prime constellations which meet the minimum difficulty requirements are submitted.
The sieve is only for admissible k-tuples.
Please see:
http://math.mit.edu/~primegaps/http://ocw.mit.edu/courses/mathematics/18-785-analytic-number-theory-spring-2007/lecture-notes/k_tuples.pdfhi!
Looking at the original miner, it looks like it accepts gaps of up to 12 between primes, and tuplets are not required to have minimal diameter.
So, we know that 6-tuples of minimal diameter have only one admissible form:
p+0 4 6 10 12 16
however since they are not enforcing the diameter to be minimal (16 in this case), then the following could be a valid block even though it's diameter is 24:
p+0 4 6 10 12 24
or lots of other combinations, with diameter up to 12*6 = 72
So, a sieve that allows only admissible 6-tuples of diameter 16 may not be the most efficient way to mine this... or it may be, idk, I just wanted to leave the question beause but I can't help thinking that the sieve may be filtering too much.
btw, have you abandoned RIC? me miss you
