✳flâneur — a map of the web's best reading

Interactive & Zero-Knowledge Proof | by Mia Tang | Medium

mia-tang.medium.com · 1,613 words · saved by 1 readers

In the world of mathematical logic, the most rigorous and formal proof is a deduction where each line is either an assumption, an instance of an axiom scheme, or a result of applying some inference rules on previous lines depending on the given logic language. But, normally (& luckily ✨), writing a proof does not require such formality, and the word proof in our daily life requires some form of evidence being passed on from the person who wishes to prove something (the prover) to the person who verifies the evidence (the verifier). The verifier can ask for additional evidence if not convinced. In short, a proof can be defined as an interaction between two sides. Before diving into how Interactive Proof works with a concrete example and why it is so useful, we first explore the basic machinery needed for learning this topic rigorously. First, we have Mr.Prover and Mr.Verifier, with the verifier asking questions and the prover responding, and at the end, the verifier can either accept or

Interactive & Zero-Knowledge Proof A Creative Guide Into the Theoretical CS’s Complexity Class I.P. Mia Tang 7 min read · Dec 5, 2020 -- Listen Share 🌠 Motivation In the world of mathematical logic, the most rigorous and formal proof is a deduction where each line is either an assumption, an instance of an axiom scheme, or a result of applying some inference rules on previous lines depending on the given logic language. But, normally (& luckily ✨), writing a proof does not require such formality, and the word proof in our daily life requires some form of evidence being passed on from the pers

Explore this link on the map →

related reading