What unexpected connection emerged between random self-reducibility and interactive proofs for hard computational problems?
Answered at 22:54 in The 'Useless' Theory Behind Modern SNARKs (ft. Gödel Prize Winner Noam Nisan) · a16z crypto show
What unexpected connection emerged between random self-reducibility and interactive proofs for hard computational problems?
Nisan discovered that Richard Lipton's proof of random self-reducibility for the permanent function could lead to an interactive proof. Initially Nisan could not believe Lipton's result because he knew that random self-reducibility could imply an interactive proof, yet the permanent is a notoriously difficult function. Upon closer inspection, he realized Lipton's approach worked because Lipton handled multiple instances rather than just one, enabling an interactive proof for this extremely hard problem.
Full answer and detailsRead the whole answer, key facts and every other question from this episode
In short
Nisan discovered that Richard Lipton's proof of random self-reducibility for the permanent function could lead to an interactive proof.
Noam Nisan · The 'Useless' Theory Behind Modern SNARKs (ft. Gödel Prize Winner Noam Nisan) · a16z crypto show · answer at 22:54
Key takeaways
- Nisan discovered that Richard Lipton's proof of random self-reducibility for the permanent function could lead to an interactive proof.
The full answer · about 2 min
Nisan discovered that Richard Lipton's proof of random self-reducibility for the permanent function could lead to an interactive proof. Initially Nisan could not believe Lipton's result because he knew that random self-reducibility could imply an interactive proof, yet the permanent is a notoriously difficult function. Upon closer inspection, he realized Lipton's approach worked because Lipton handled multiple instances rather than just one, enabling an interactive proof for this extremely hard problem.
More answers from this episode
- 0:17What role did the LFKN paper play in establishing interactive proof systems for modern verification?
- 4:00What motivated a leading complexity theorist to pivot toward algorithmic game theory and economic computation in the mid-1990s?
- 9:18How did the Popcorn project relate to ideas about verifying delegated computation?
- 16:16How does the SumCheck protocol enable verification of computation across massive datasets and cloud computing?
- 19:00How do modern SNARKs relate to interactive proofs and why is the SumCheck protocol central to current SNARK design?
- 20:00What is an interactive proof and why did it represent a fundamental extension of mathematical proof?