AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 210: The Road to STARKs and Miden with Bobbin Threadbare
Zero Knowledge
Is the Verification Time a Factor in the Proof Size?
3min Snip
00:00
Summary
Transcript
Episode notes
For starks, even though the proofs are very large compared to other systems, the rerification time is fairly small. I think in future, we should care about proof sizes much less. But as soon as you have recursev stariks, the proof size becomes much, much less of anisu. So i do not think that er, i think at this point, maybe the proof sizes are somewat of a disadvantage for stariks but it's not a fundamental disadvantage.
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