AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 274: SNARKs: A Trilogy with Ariel Gabizon
Zero Knowledge
How to Design a Look Up Protocol That Does Not Depend on Table Size
2min Snip
00:00
Summary
Transcript
Episode notes
The larger tables you can use, the more proven computation you're going to save. And if you can only use smaller look up tables, I guess you can't put that much in. So interesting trade off there. Can I design a look up protocol where the prover computation does not depend on the table size? Okay. This is what caulk did. Totally, almost totally removed the dependence of prover computation on table size. Which opens up the possibility of using much larger tables. which then would save more prover time. The last one currently in the series is the paper called CQ. It was written with Liam Egan and Dario Fiore.
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