(I have of course asked his permission to forward this)
It is identical to the latest version I can find.
Quote:
mersenneforum is gearing up to try to do some >200digit GNFS job, and the version of lasieve4 that we've been using in the past is not coping well with the very highskew polynomials that Jason's latest polynomial optimisation tends to produce.

If the lattice basis for a special q does not fit into 31 bits this special q is discarded. If the number of discarded special q gets too high for your project you might modify the function reduce2 in redu2.w to keep more special q (although the sieving for them will be less efficient). This does not really solve the problem, but adapting the code to high skewness is more difficult and you probably do not want to wait until I finish the new version (>=1 year I expect).
In the case that you want to use the I=15 version, you could try to use the I=16 version with parameter J 13 (so sieving area 2^16*2^13 instead
of 2^15*2^14) which will probably discard less special q.