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:
- Succinct Proofs in Linear Algebra by Evans and Angeris
- Algebraic Reductions of Knowledge by Kothapalli and Parno
- Proximity Testing with Logarithmic Randomness by Diamond and Posen
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup by Ames, Hazay, Ishai and Venkitasubramaniam
- Sumcheck Arguments and their Applications by Bootle, Chiesa and Sotiraki
- Proofs, Arguments, and Zero-Knowledge by Thaler
- Stephen Boyd Papers
- Episode 140: Staking derivatives & DeFi with Alex Evans (and Tarun!)
- Episode 206: Distilling DeFi Primitives with Guillermo, Alex and Tarun
- Episode 271: Between Two ZK Events with Nico and Guillermo
- Episode 282: Error Correcting Codes & Information Theory with Ron Rothblum
- Episode 293: Exploring Security of ZK Systems with Nethermind’s Michał & Albert
- ZK Hack Discord
- ZK Whiteboard Sessions
Applications are now open to attend zkHack Istanbul – Nov 10-12! Apply here: https://www.zkistanbul.com/
Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.
As Aleo is gearing up for their mainnet launch in Q4, this is an invitation to be part of a transformational ZK journey.
Dive deeper and discover more about Aleo at aleo.org
If you like what we do: