In the early work, we needed to assume that some sort of encryption scheme was optimally hard. Nowadays, we can based it on an assumption called learning with errors. The thing I was curious as an innocent theoretician is what can we say about Boolean circuits? Right? So we have hash functions, SHA or whatnot that are natively described asBoolean circuits. And in this setting, they indeed achieved a linear time prover.

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