The problem that's trying to solve the way that it does it is inspired by how FFT works. If you're using Reet's Almond code, so polynomials, you could very well have that your message gets encoded into a straight line. So in that case, you do know that point is where the bit flip happened. This is the error. And it should have been on the pretty line. Because it's complicated enough. It would be almost probabilistically impossible that you'd have a wrong polynomial that only misses that spot. The purpose of FFTs is something else. I kind of forget what are the- what is the purpose of a fast
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: