Read Solomon is just equal to univired polynomial. I think I almost get it. Probably at some point need to see this on a whiteboard, but thanks so much for explaining it. Of course. So we're still in read Solomon land. What, what comes after? What kind of codes have you been using in your work on the near time pervert? Okay. We mean the encoding, right? Then coding. So FFT is awesome, but we have this annoying log n factor that we would like to get rid of. And we know that in principle, we have codes that are faster.
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: