Computational complexity theory deals with showing that some problems are hard not just to solve, but even to approximate. A tool called PCPs was introduced in the early 90s for about 20 years and has had an enormous impact throughout the years on this entire field of computational complexity theory. And IOPs, our interactive Oracle proofs, are a generalization of this notion in which it's not just like one static proof for a much eerie small number of bits,. But miraculously, we can build this kind of thing. So anyway, that was me trying to articulate this field of complexity theory.

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