feat(fft): fft/fftInv now works on abitrary cosets #58
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The FFT package now allows to execute the fft (and fft inv) on shifted subgroup/dual basis (ex if u is a primitive n-th root of 1, and v a primitive m-th root of 1 with n|m, then we can evaluate a polynomial of degree n-1 on (1,u,..,u^n-1), on (v,vu,..vu^n-1), etc, up to v^(m/n) ). It will come handy for fast polynomial division while avoiding vanishing set of the quotient polynomial, for polynomials of arbitrary degree.
Breaking changes
NewDomain(m uint64)
-->NewDomain(m, nbCosets uint64)
(the greater nbCosets, the more memory is needed)FFT(a []fr.Element, decimation Decimation)
-->FFT(a []fr.Element, decimation Decimation, coset uint64)
FFTInverse(a []fr.Element, decimation Decimation)
-->FFTInverse(a []fr.Element, decimation Decimation, coset uint64)
Domain
now has a fieldNbCosets
, which affects the serialization (so several parts of the coded are impacted, notably the Groth&6 setup has been re run for solidity integration test and in gnarkd)