Zero Knowledge cover image

STIR with Gal Arnon & Giacomo Fenzi

Zero Knowledge

00:00

Efficient Compiler for Compiling to Interactive Arguments

The chapter discusses an efficient compiler for Pulomino IOPs, highlighting improved guarantees, efficiency, and knowledge soundness analysis. It compares two techniques for reducing verifier time and proof size, explaining 'folding' polynomials and impact on proof time. The chapter emphasizes the new concept's benefits as a potential replacement with improved parameters, security considerations, and efforts to simplify complex security analyses.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app