In general, you could think of given a particular error correcting code C, do you have the analog of a polynomial commitment with respect to this specific code C? Does that make sense? So I think what you're saying is the error correcting code part is sort of bridging between these two sections of a snark. If you take fry and you compile it using Merkle trees, basically what you will get is polynemic commitment. That is exactly what polynictional commitments do with respect to the read Solomon code or if you talk about unified polynomials.
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: