Zero Knowledge cover image

Episode 282: Error Correcting Codes & Information Theory with Ron Rothblum

Zero Knowledge

The Relationship Between Polynomial Commitments and the Read Solomon Code

3min Snip

00:00
Play full episode
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.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode