Quote:
Originally Posted by axn
Due to the way the primes are paired, some of the smallest stage 2 primes are paired with some of the largest. So, at no point (until the very end), there might be a bound such that all smaller primes have been handled in stage 2.

Understood. If it's smallest and largest paired and processed first, a modest B2 claim may be valid. Up to the "largest smallest" of the pairs that none got skipped. It's not simple, but I believe it's under consideration to implement that.