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
Transcript
Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
App store bannerPlay store banner