Digging into recursive zkSNARKs with Coda
In this week's episode, we sit down with Izaak Meckler and Evan Shapiro from O(1) Labs to discuss Coda, a blockchain using recursive composition of zkSNARKs to eliminate history. We discuss recursive zkSNARKs generally, what a recursive zkSNARK construction blockchain would look like, and the challenges in implementing this sophisticated scaling solution. To find out more about the project and some of the resources mentioned in the episode, please have a look at the links below: Coda on Twitter: https://twitter.com/codaprotocol?lang=en (https://twitter.com/codaprotocol?lang=en) Coda on Github: https://github.com/o1-labs (https://github.com/o1-labs) Scalable Zero Knowledge via Cycles of Elliptic Curves https://eprint.iacr.org/2014/595 (https://eprint.iacr.org/2014/595) Incrementally Verifiable Computation or Knowledge Implies Time/Space Efficiency https://pdfs.semanticscholar.org/4074/97eeb99a9341714e9db05b57f500270139d7.pdf (https://pdfs.semanticscholar.org/4074/97eeb99a9341714e9db05b57f500270139d7.pdf) Thank you to our sponsor https://poa.network/ (POA Network) - for more information about their ERC20 to ERC20 TokenBridge, check out the POA Network repo: github.com/poanetwork/token-bridge Follow Zero Knowledge on Twitter - https://twitter.com/zeroknowledgefm (@zeroknowledgefm) Support us on Patreon - https://www.patreon.com/zeroknowledge (https://www.patreon.com/zeroknowledge) Or directly here: ETH: 0xC0FFEE1B5083230a5154F55f253B6b6ae8F29B1a BTC: 1cafekGa3podM4fBxPSQc6RCEXQNTK8Zz