AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 282: Error Correcting Codes & Information Theory with Ron Rothblum
Zero Knowledge
How to Prove Correctness of Boolean Circuits
3min Snip
00:00
Summary
Transcript
Episode notes
Ronald Ronsvi: The ideas under length of linear time provers sort of break down. And I'm saying, you know, let's try to work with these. What can we do in terms of proving correctness of Boolean circuits? But the downside was that the soundness error was a constant rather than being some, you know,. negligible function, which is what we prefer. So it basically works for it kind of takes away the restriction on the field. It can work for any field that you like; hardest case would be 0, 1, f2.
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