Episode Details

To the contrary! Zero-knowledge proofs (ZKPs) let you prove that something is true without revealing why it’s true. That may sound like a magic trick, but it’s immensely practical: verifying that a computation was done correctly without re-running it, proving you’re over 18 without showing your ID or revealing your date of birth, or even checking the integrity of an election without exposing any ballots. This talk introduces ZKPs for programmers who haven’t studied cryptography. We’ll explore where they can be applied, and build an intuitive, qualitative understanding of how they work. You’ll learn the key mathematical ideas, like polynomial commitments and arithmetic circuits, only to the depth needed to see why they matter, not to prove the theorems behind them. To round things off, we will look at ways of implementing ZKPs. Luckily, the days where you needed to manually construct a circuit representing your calculation are gone, and there are Domain Specific Languages (DSLs) available that can do the heavy lifting for you. To demonstrate how that works, we will look at a concrete example of a ZKP written in the Noir language. By the end, you’ll know what ZKPs are, why they’re useful, and how to start experimenting with them yourself -- no crypto background required. Licensed to the public under https://creativecommons.org/licenses/by/3.0/de about this event: https://bobkonf.de/2026/kant.html