6min chapter

Uncommon Core 2.0 cover image

Hasu gets STARK-pilled - with Eli Ben-Sasson (StarkWare)

Uncommon Core 2.0

CHAPTER

The Undecidability of the Stopping Problem

Limidei: How do you generate this property that you have a proof system? You in put a huge amount of computational data, or data that you want to perform some amount of computation on. And then you generate this very small proof that is very computationally cheap to verify er that the computation was done correctly. So how can this magic be oe? First of all, it turns out that there is a huge difference between knowing things with 100 % a guarantee and knowing it with a minus one 28 error. The second thing is that these systems are somehow interactive. There is a back and forth going on between prover and verifier. But i'd like to sort of explain a

00:00

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