AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 324: Discovering New Elliptic Curves with Antonio Sanso and Youssef El Housni
Zero Knowledge
Matching Fields for Efficient Snark Proving
1min Snip
00:00
Summary
Transcript
Episode notes
Ensuring the efficiency of snark proving involves matching the fields of definition for arithmetic and snark computation. The mismatch between these fields can lead to inefficiencies. One solution is to find two elliptic curves where the statement elliptic is defined over the field used for snark computation. This issue has occurred in various curve implementations like Japetto, Zexe, MNT4, and MNT6. Ideally, finding a cycle allows using one elliptic curve for both statement and snark elliptical, but for efficiency or specific applications, using separate curves is preferred. Recursion can be applied for this purpose and other scenarios.
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