Zero Knowledge cover image

The Road to Plonky2 with Brendan and Daniel from Polygon Zero

Zero Knowledge

00:00

Using a Recursive Proof in Plonk?

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

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app