AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
3min chapter
Proofs, Arguments, and ZKPs with Justin Thaler
Zero Knowledge
Using a Special Purpose Snork to Compute a Product Matrix?
The traditional way to do this most naively would literally be to like represent the matrix multiply operation as a circuit. When you apply a snark to that circuit, the prover is proving not just that it knows the product, but that it computed in a specific way. So with these special purpose snarks I'm referring to, you don't even have to have the prover cryptographically commit to these product matrices. That could blow away this whole goal of having kind of a low order runtime overhead for the prover to compute the proof. This all falls under the category that people might be starting to hear about, just like CKML.
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