Computational complexity theory deals with showing that some problems are hard not just to solve, but even to approximate. A tool called PCPs was introduced in the early 90s for about 20 years and has had an enormous impact throughout the years on this entire field of computational complexity theory. And IOPs, our interactive Oracle proofs, are a generalization of this notion in which it's not just like one static proof for a much eerie small number of bits,. But miraculously, we can build this kind of thing. So anyway, that was me trying to articulate this field of complexity theory.
This week, host Anna Rose and Nico Mohnblatt chat with Ron Rothblum, Professor of Computer Science at Technion. They explore information theory and ZK, diving into the weeds on multiple topics including error correcting codes, FRI, FFTs, Reed-Solomon encoding, Fiat-Shamir and more.
Here’s some additional links for this episode:
zkSummit 10 is happening in London on September 20, 2023! Apply to attend now -> https://9lcje6jbgv1.typeform.com/zkSummit10
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: