Quote:
Originally Posted by paul0
In gnfslasieve, why is there two parameters (for rational and algebraic) for the sieving bound? Is the sieve checked twice? If so, what is the advantage instead just checking it once? The sieve adds the logarithms anyway, right?
EDIT: btw, my lattice siever is operational. I'll upload it to github when I'm satisfied with it :)

Are you remembering to handle projective roots properly?
Are you handling skew?
What method do you use to split the large primes?