In this week’s episode, we learn more about Plonk with Ariel Gabizon and Zac Williamson from Aztec. PLONK is a recent highly efficient, universal SNARK construction. We explore what distinguishes Plonk from some other other new constructions including their focus on Lagrange-bases to deconstruct complex problem statements into simple polynomial identities.
This episode goes very deep and so we do recommend you check out a few of previous episodes to help you follow along! All mentioned can be found here along with the other deep zk-topic episodes: https://www.zeroknowledge.fm/zkseries
Ariel also mentions the [Bayer groth permutation argument](www0.cs.ucl.ac.uk/staff/J.Groth/MinimalShuffle.pdf) which influenced their work.
Thanks to this week's sponsor Nucypher!
On January 20th, NuCypher's incentivized testnet is launching on Coinlist. This incentivised testnet has the motto “Come and Stake It”!
If you are interested, be sure to pre-register now. Keep an eye on their blog for launch date, structure, and prize details. All winners will need to complete KYC/AML. Please go to [nucypher.com](nucypher.com) to sign up.
Thanks again Nucypher for sponsoring our show!
If you like what we do:
Or directly here: