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

WIRED · 7.2M views · 2022-01-18 · 22:36

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

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.

On Hacker News

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

Recommended by 3 HN people across 3 months · HN mentions 2022–2026

Topics

What people said

mohsen1 · 2026-07 · Strong recommendation
Computer Scientist Explains One Concept in 5 Levels of Difficult [VIDEO] This video is very beautifully explains it
Read the original HN comment ↗

jimmySixDOF · 2022-05 · Strong recommendation
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 the original HN comment ↗

abhv · 2025-07 · Recommendation
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 the original HN comment ↗

Sources

Video by WIRED, played through YouTube.

HN Library · Source license

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks

SaaS & AI candidates: Topic keywords do not match
Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources