Get the latest tech news

Zero-knowledge proofs, encoding Sudoku and Mario speedruns without semantic leak

We published our video on zero-knowledge proofs! Surprisingly, making this video took a lot of work. Zero-knowledge proofs for coloring are one of those algorithms that, in hindsight, seem beautifu…

This is closely connected to our video on NP-completeness —many problems can be formulated as “ here is a (polynomial-time) algorithm checking solutions: can you find an input that is accepted by it? The fact that all this is possible is supported by one of my favorite theorems from theoretical computer science, proven a few years after the introduction of zero-knowledge proofs. For example, you might imagine that a distant star emits light that we measure here on Earth, and we all agree on how to convert the tiny fluctuations in the strength of the signal into a stream of random bits.

Get the Android app