I'm not sure how sieving applies to this, I know it's used in the other prime searching projects but I've never understood how it's actually used.
The only thing I can think of is generating a bunch of the above factorials, trial dividing by small primes below a certain limit, then performing the primality tests on whichever don't divide.
