Zero Knowledge Implementing LatticeFold with Matthew and Albert from Nethermind
May 14, 2025
Matthew Klein and Albert Garreta from Nethermind dive into cutting-edge lattice-based cryptography. They discuss the dynamics of their LatticeFold implementation and innovations like LatticeFold+ and Neo. The conversation highlights challenges and optimizations in zero-knowledge proofs and the significance of post-quantum signatures for Ethereum. They also touch on the efficient use of zinc for handling constraints, exploring how lattice-based techniques outperform traditional methods in both security and performance.
AI Snips
Chapters
Books
Transcript
Episode notes
Lattice ZK Systems Overview
- Lattice-based zero-knowledge (ZK) systems include folding schemes like LatticeFold, proof systems like Labrador, and polynomial commitment schemes like Greyhound.
- These components solve different parts of the ZK stack and can be combined for a fully lattice-based solution.
Norm Management in LatticeFold
- LatticeFold adapts elliptic curve-based folding to lattices but must manage vector norms to preserve security.
- This involves extra steps like decomposition and norm checks to keep vector entries small enough to maintain commitment binding.
ITI Commitment Efficiency
- ITAI commitment scheme in lattices is faster than hash-based (Merkle tree) commitments and more recursion-friendly.
- ITAI commitments produce smaller arithmetic circuits, making recursive proofs more practical than with hash functions like Ketchak.
