The kernel circuit has to verify the correctness of function proofs, which is a snark circuit. If your transaction is consisting on more than one private function, then you have to repeatedly compute kernel circuit proof square at each iteration. I do feel like I'm going to need to see slides. Which I think we will see at some point. Yeah. Well, our architecture documents are finally public. We finally got them in a state where we're happy to show them to the world. And so if you can send that my way, I'll add it to the show notes for folks as well. This is fascinating.
In this week’s episode, host Anna Rose sits down with Zac Williamson, the CEO of Aztec. Anna and Zac dive deep into the history of Plonk, one of the most important proving systems to emerge in the last 5 years. Zac explains how the initial ideas came to be, how it was developed with co-author Ariel Gabizon, and how the system has evolved over time, branching out into many different iterations of Plonk, leading up to his recent work on Goblin Plonk.
The conversation also touches on Aztec's cutting-edge technology stack, including their Noir zkDSL and their planned private programmable L2, Aztec 3. Zac shares his insights on the state of ZK applications and folding schemes, and provides a glimpse into the future of the ZK space.
Here’s some additional links for this episode:
Check out the ZK Jobs Board here: ZK Jobs. Find your next job working in ZK!
Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.
Interested in building private applications? Check out Aleo’s programming language called Leo that enables non-cryptographers to harness the power of ZKPs to deploy decentralized exchanges, hidden information games, regulated stablecoins, and more. Visit http://developer.aleo.org.
For questions, join their Discord at aleo.org/discord.
If you like what we do: