Zero Knowledge cover image

Episode 321: STIR with Gal Arnon & Giacomo Fenzi

Zero Knowledge

Efficient Compiler for Compiling to Interactive Arguments

11min Snip

00:00
Play full episode
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.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode