AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 220: The Road to Plonky2 with Brendan and Daniel from Polygon Zero
Zero Knowledge
Using a Recursive Proof in Plonk?
5min Snip
00:00
Summary
Transcript
Episode notes
In plucky one, we were able to get decent recursion speed. But really the bottlenick there was just field arithmetic for especially multiplying two field elements. A with a standard two 56 bit field multiplication takes something like 80 cycles on a typical c pu. And our idea was that it would just be really nice if we could use a 64 pit field,. Since c pus can natively do 64 bit multiplication with a through put that's very, very high. That kind of brought us to like, an early 20 21. Daniel was was like, ye, i really think we can do recursive fry. Like ponomil commitment scheme or testing scheme used in starks is this sort
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