snarkify / sirius

A Plonkish folding framework for Incrementally Verifiable Computation (IVC).
MIT License
106 stars 15 forks source link

feat(nifs): optimize compute_G #293

Open chaosma opened 4 days ago

chaosma commented 4 days ago

The goal of compute_Gis to get evaluations of G(X) over coset domain so that we can quickly get evaluations of K(X) and use ifft to get its coefficient form.

In current implementation, we first get coefficient form of G(X), and then do coset_fft for G(X) to get its evaluations. However, this part can be avoided by directly return evaluations of G(X) over coset domain instead of coefficient form of G(X). This will save us two (small-sized) FFT.

cyphersnake commented 4 days ago

The whole point is to omit the ifft at the end and return calculation by itself?