Paper 2024/1661
zkFFT: Extending Halo2 with Vector Commitments & More
Abstract
This paper introduces zkFFT, a novel zero-knowledge argument designed to efficiently generate proofs for FFT (Fast Fourier Transform) relations. Our approach enables the verification that one committed vector is the FFT of another, addressing an efficiency need in general-purpose non-interactive zero-knowledge proof systems where the proof relation utilizes vector commitments inputs.
We present a concrete enhancement to the Halo2 proving system, demonstrating how zkFFT optimizes proofs in scenarios where the proof relation includes one or more vector commitments. Specifically, zkFFT incorporates streamlined logic within Halo2 and similar systems, augmenting proof and verification complexity by only
Note: Work in progress
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Zero knowledge proofsFast Fourier TransformsHalo2Curve TreesBulletproofsInner Product Arguments
- Contact author(s)
-
aram @ skycryptor com
goharhovhannisyann @ gmail com
hayk @ layerswap io
Nerses @ layerswap io - History
- 2024-12-27: last of 2 revisions
- 2024-10-14: received
- See all versions
- Short URL
- https://ia.cr/2024/1661
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1661, author = {Aram Jivanyan and Gohar Hovhannisyan and Hayk Hovhannisyan and Nerses Asaturyan}, title = {{zkFFT}: Extending Halo2 with Vector Commitments & More}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1661}, year = {2024}, url = {https://eprint.iacr.org/2024/1661} }