Good videos, with context.
Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED

Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED

WIRED
3 HN recommenders · discussed 2022–2026
Open YouTube ↗

About this video

WIRED has UCLA professor Amit Sahai explain zero-knowledge proofs to a child, a teen, a college student, a grad student and an expert. Each round goes deeper into the cryptography and why it matters.

Why it appears in the archive

It is the go-to accessible explanation of zero-knowledge proofs, linked whenever a thread needs an intuitive introduction.

AI-generated summary and labels from the source dataset; verify important details against the video. Source & credits.

From the Hacker News discussion

jimmySixDOF · 2022-05 · strong rec

This is the best explanation I have seen [1] : "Computer scientist Amit Sahai, PhD, is asked to explain the concept of zero-knowledge proofs to 5 different people; a child, a teen, a college student, a grad student, and an expert." [1] [VIDEO]

Read original comment ↗
mohsen1 · 2026-07 · strong rec

Computer Scientist Explains One Concept in 5 Levels of Difficult [VIDEO] This video is very beautifully explains it

Read original comment ↗
abhv · 2025-07 · rec

My colleague Amit made a simple video explanation about zkp with Wired. [VIDEO] That doesn't explain the way this scheme works, but it's a nice start.

Read original comment ↗
ricochet11 · 2022-01 · reference

agree, ZKProofs are really interesting and i'm sure they will come to be used across lots of areas of the web and not just blockchain, though their use and development is most active in the blockchain space for how useful they are for privacy+scalability. Proving knowledge without revealing information allows us to prove computations (validating them is a lot quicker than repeating the computation) and "use things" without sacrificing privacy. You can combine the two and have private transactions which are then rolled up in a computation, and then post the proof of the computation to mainnet. You get both cheap and private transactions and infra on top of the base chain. But this goes beyond blockchain: we can hand code to other people to run and then have proof they haven't altered what we agreed upon running, so we can trust the results of someone else running something. That is useful in all sorts of research for replicability in science/engineering. WIRED Computer Scientist Explains One Concept in 5 Levels of Difficulty : [VIDEO] [LINK] [LINK] [LINK]

Read original comment ↗
jimmySixDOF · 2022-09 · reference

On YouTube (23 min) Computer scientist Amit Sahai, PhD, is asked to explain the concept of zero-knowledge proofs to 5 different people; a child, a teen, a college student, a grad student, and an expert. Using a variety of techniques, Amit breaks down what zero-knowledge proofs are and why it's so exciting in the world of cryptography. Amit Sahai, PhD, is a professor of computer science at UCLA Samueli School of Engineering. From S1 E16 of Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED [VIDEO]

Read original comment ↗
ghywertelling · 2026-03 · reference

> With agents, does it become practical to have large codebases that can be read like a narrative, whose prose is kept in sync with changes to the code by tireless machines? I think this is true. Your point supports it. If either the explanation / intention or the code changes, the other can be brought into sync. Beautiful post. I always hated the fact that research papers don't read like novels, eg "ohk, we tried this which was unsuccessful but then we found another adjacent approach and it helped." Computer Scientist Explains One Concept in 5 Levels of Difficulty | WIRED [VIDEO] Computer scientist Amit Sahai, PhD, is asked to explain the concept of zero-knowledge proofs to 5 different people; a child, a teen, a college student, a grad student, and an expert. Using a variety of techniques, Amit breaks down what zero-knowledge proofs are and why it's so exciting in the world of cryptography.

Read original comment ↗