正在加载视频...

视频加载失败

Magic tricks are zero-knowledge proofs. And zero-knowledge proofs are indistinguishable from magic. 🪄 Learn more:

247,421 次观看 • 3 年前 •via X (Twitter)

10 条评论

Ross Shuel 的头像
Ross Shuel3 年前

@blauyourmind after successfully combining crypto and magic

Michael Blau 的头像
Michael Blau3 年前

😂😂😂

Michael Blau 的头像
Michael Blau3 年前

😂

Will Hunter 的头像
Will Hunter3 年前

I’ve rewatched this 5 times and still have 0 clue how those cards turned

Michael Blau 的头像
Michael Blau3 年前

🙃

mareko.eth 🪨🪨🍴 的头像
mareko.eth 🪨🪨🍴3 年前

Awesome! Maybe we should be calling them abracadabra proofs!

Michael Blau 的头像
Michael Blau3 年前

😂❤️

BLAU 的头像
BLAU3 年前

Insane vid 🔥

Andrew Jiang 🛡️ 的头像
Andrew Jiang 🛡️3 年前

Did @a16zcrypto hire a magician or did you have to learn magic for this video?

Michael Blau 的头像
Michael Blau3 年前

@a16zcrypto They hired a magician :) I have been performing magic for many years :)

相关视频

First Principles Ep. 6 with Shafi Goldwasser What if you could prove something is true without revealing why it’s true? Turing Award winner Shafi Goldwasser tells the origin story of zero-knowledge proofs: how a playful question about playing poker securely over the telephone led her, Silvio Micali, and Charles Rackoff to rethink what a mathematical proof could be. Goldwasser traces those ideas through interactive proofs, the sum-check protocol, SNARKs, and the systems now used to verify computation and preserve privacy on blockchains. She also reflects on why breakthrough ideas are often rejected at first, how toy problems can produce foundational theories, and whether AI systems should have to prove their answers. Hosted by Tim Roughgarden with Justin Thaler 00:00 Intro 03:36 How mental poker inspired zero-knowledge proofs: Proving that something is true without revealing the underlying information 06:30 The simulation paradigm and the meaning of “zero knowledge” 08:33 Why the original paper was repeatedly rejected 10:33 How interactive proofs became more powerful than conventional proofs 13:36 The road to modern SNARKs 19:02 Why the sum-check protocol is so useful for verifiable computation 25:31 Why many so-called “zk proofs” are not actually zero knowledge 34:06 Why toy examples, playfulness, and narratives can produce deep theory 37:23 The role of rigor and computational assumptions in cryptography 42:44 Applying zero-knowledge proofs to law, evidence, and secret software 45:23 Training AI systems to provide proofs alongside their answers 54:27 Why genuinely new ideas are often difficult for experts to recognize

a16z crypto

196,210 次观看 • 28 天前