Zero Knowledge

In this week’s episode, host Anna Rose and co-host Kobi Gurkan chat with Alex Evans and Guillermo Angeris about their new research paper on Succinct Proofs in Linear Algebra. The paper introduces a framework that simplifies the construction of succinct proofs and offers a toolkit of useful techniques. Their conversation also covers the use of randomized reductions in zero-knowledge proofs, the security of the FRI protocol, and the potential applications of the framework in other systems. Here’s some additional links for this episode:*PapersSuccinct Proofs in Linear Algebra by Evans and AngerisAlgebraic Reductions of Knowledge by Kothapalli and Parno Proximity Testing with Logarithmic Randomness by Diamond and PosenLigero: Lightweight Sublinear Arguments Without a Trusted Setup by Ames, Hazay, Ishai and VenkitasubramaniamSumcheck Arguments and their Applications by Bootle, Chiesa and Sotiraki Proofs, Arguments, and Zero-Knowledge by Thaler Stephen Boyd Papers *Other linksEpisode 140: Staking derivatives &