How to Optimize Your Linear Time Encodable Code

This week, host Anna Rose and Nico Mohnblatt chat with Ron Rothblum, Professor of Computer Science at Technion. They explore information theory and ZK, diving into the weeds on multiple topics including error correcting codes, FRI, FFTs, Reed-Solomon encoding, Fiat-Shamir and more.

Here’s some additional links for this episode:

• Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge) by Holmgren, Lombardi and Rothblum
• Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead by Ron-Zewi and Rothblum
• Faster Sounder Succinct Arguments and IOPs by Holmgren and Rothblum
• The Random Oracle Methodology, Revisited by Canetti, Goldreich and Halevi
• Linear-Time Arguments with Sublinear Verification from Tensor Codes by Bootle, Chiesa and Groth
• Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup by Campanelli, Gailly, Gennaro, Jovanovic, Mihali and Thaler
• Reed-Solomon Codes
• Shannon’s Source Coding Theorem
• Guy Rothblum Publications
• Episode 274: SNARKs: A Trilogy with Ariel Gabizon

zkSummit 10 is happening in London on September 20, 2023! Apply to attend now -> https://9lcje6jbgv1.typeform.com/zkSummit10

Aleo is a new Layer-1 blockchain that achieves the programmability of Ethereum, the privacy of Zcash, and the scalability of a rollup.

Interested in building private applications? Check out Aleo’s programming language called Leo that enables non-cryptographers to harness the power of ZKPs to deploy decentralized exchanges, hidden information games, regulated stablecoins, and more. Visit http://developer.aleo.org.

For questions, join their Discord at aleo.org/discord.

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