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:
*Papers
Proximity Testing with Logarithmic Randomness by Diamond and Posen
Sumcheck Arguments and their Applications by Bootle, Chiesa and Sotiraki
*Other links
Applications are now open to attend zkHack Istanbul - Nov 10-12! Apply here: https://www.zkistanbul.com/
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:
Find all our links here! @ZeroKnowledge | Linktree
Subscribe to our podcast newsletter
Follow us on Twitter @zeroknowledgefm
Join us on Telegram
Catch us on YouTube