IPA verifier is O(nlogn)

[lucasxia01]

We currently inefficiently compute G^(0) in nlogn time where n is the length of the polynomial.

We can reduce this to to O(n) time by precomputing coefficients, which should be also parallelizable.