Zero Knowledge cover image

Episode 172: ZK languages with Alex Ozdemir

Zero Knowledge

Polynomial Commitments - Are They Connected to Complexity Theory?

2min Snip

00:00
Play full episode
Polynomial commitments are their own cryptographic primitive, kind of like snark. What they do is they allow someone to commit to a polyn coefficients and then reveal its evaluation at various locations. They belong in the proof system part of the stack. So for example, if you open up arc works, you'll find an interface for polyn coefficient commitments.

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