AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 271: Between Two ZK Events with Nico and Guillermo
Zero Knowledge
Nova and Supernova: A Succinct Proof of Incremental Computation
2min Snip
00:00
Summary
Transcript
Episode notes
The main insight of Nova and like super clean, I guess, with the instruction from... It's going to be a bit of a dumb question, but like, Nova, supernova, what are they? Like, are they proving systems? Are they like, I don't really know where in the stack they are. Yeah. They describe like a succinct proof of incremental computation. Okay. What exactly is the folding scheme? So, Guillermo sort of touched upon it earlier. It's the idea that if you have two problems of some kind, like two plunk circuits, you can compress them into one plunk circuit. That makes sense.
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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