Welcome to the resource topic for 2021/1167
fflonk: a Fast-Fourier inspired verifier efficient version of PlonK
Authors: Ariel Gabizon, Zachary J. WilliamsonAbstract:
We present a variant of the Kate, Zaverucha and Goldberg polynomial commitment scheme [KZG] where d polynomials can be opened at a point that is a d‘th power, such that the amount of verifier group operations does not depend on d. Our method works by reducing opening multiple polynomials at a single point x, to opening a single polynomial at many points via an ``FFT-like identity’'. As an application we present a version of the PlonK zk-SNARK[GWC] with significantly improved verifier performance, at the cost roughly tripling the prover time. Specifically, in addition to the two pairings, the verifier only performs five scalar multiplications, rather than 16 or 18 as in the versions presented in [GWC].
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .