| Take the processed partials/double-partials and the true "fulls" and now we want to find a new "a" which on combining current a's is a proper square number! |
| Perform a Gaussian elimination looking for a linear dependency module two of a bitmatrix of F columns and R rows, where F is the size of the small-primes factor base and R is the number of quadratic residues. |
| This is a big but not tera-op (for RSA155) computation. But at the end, if a dependency falls out, we know the factors of RSA-N. |