AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
5min chapter
Episode 242: Halo 2 with Daira Hopwood and Str4d
Zero Knowledge
Optimisation of the Oracle Proof
An interactive proof is will you have a protocol between approver and verifier. The prover is trying to convince an the verifier that they know a witness for some statement. So if these messages are polynomials, then we can instantiate the oracle using a polynomial commitment scheme. And it has these properties iam called binding and hiding. It's a way, just like, commit to something larger in the space of something smaller. But exactly so it's, it helps you, in certain cases, with certain efficiencies.
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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