Quote:
Originally Posted by R.D. Silverman
"\
Nonsequitur. Where, in any of my prior response did I discuss "squares
in the norm". And "diminish smoothness" is meaningless gibberish.

For the sake of the flame, let's call p[k1]^e1*p[k2]^e2*p[ki]^ki*u^2, p[k]  prime in the prime base,
"pseudo smooth".
If you are sieving with quadratic and nfs, will you throw away "pseudo smooth" norms in Z?
When one constructs the final squares mod n, one will have to take in account "u", which is with even exponent, so it doesn't affect solving the matrix.