Reed-Saulman works over a very large field. So you have other efficient codes that work over small fields. Can we use them and maybe try to support computations, sort of non-arithmetic computations, Boolean computations, much more efficiently? I see. And then is there a trade-off between the speed at which you can encode with your correct encode and how you do your IOP of proximity? Trade-off in terms of efficiency, I mean, if you use it. Yeah,. OK, so maybe this is a good time to point out that Reed-S Saulman has a lot of amazing properties. One of them is this very fast encoding,
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: