We're turning general number sieve field theory into a straight calculation.
Take a[t] from (e, 1) and subtract from a in (e, 1). You'll get smooth numbers. Take d[t] from d in (f, 1) and you'll get smooth numbers. Smooth numbers are made from triangles and squares.
GNFS is a blind man's factorisation algorithm.