mersenneforum.org - View Single Post

Sam Kennedy · 2016-11-28, 15:13

I had an idea but I thought I would ask here as to not waste time. After the first pass of the sieving algorithm, there will be a set of indices which have accumulated a value higher than some threshold. Would it be possible, knowing the size of the sieving array, and the size of the factor base, to figure out which indices would be over the threshold using the old indices as a starting point? That way sieving could be bypassed and more time spent finding smooths.

I'm guessing if this was possible it would have been implemented already, but even if it's not it would be interesting to understand why not.

2016-11-28, 15:13	#1
Sam Kennedy Oct 2012 2×41 Posts	Bypass Sieving Stage? I had an idea but I thought I would ask here as to not waste time. After the first pass of the sieving algorithm, there will be a set of indices which have accumulated a value higher than some threshold. Would it be possible, knowing the size of the sieving array, and the size of the factor base, to figure out which indices would be over the threshold using the old indices as a starting point? That way sieving could be bypassed and more time spent finding smooths. I'm guessing if this was possible it would have been implemented already, but even if it's not it would be interesting to understand why not.