AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
3min chapter
Episode 242: Halo 2 with Daira Hopwood and Str4d
Zero Knowledge
How to Do a Recursive Proof System
The first time i remember this method of constructing a proof system from an i o p and a commitment scheme, is when mary maller am described it to me. The only known way to do that efficiently was to use these cycles of curves, am, that are both paring friendly. There's only one known construction that allows you to do that, called an m n t four, m n t six cycle. And it requires am curves that are quite large. Am at least 800 bits, but probably m arger. For o hundred, 28 bit security and probably about a thousand bits. That sort of the outcome. But what was happening under the hood to allow so i think
00:00
Transcript
Episode notes
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