The chapter delves into the technical details of polynomial commitment schemes within the context of snarks, discussing their role in verifying commitments and evaluations. It highlights the use of oracles as make-believe entities and the transition of polynomial IOPs from proof to argument category in snarks. The conversation explores the integration of deep fry and deep Ali concepts in enhancing security and the importance of proximity in efficient polynomial commitment schemes.

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