Learn about lattice-based folding schemes in this conference talk that explores powerful tools for building scalable and efficient proof systems. Discover how lattice-based constructions maintain desirable properties of elliptic curve-based schemes while offering potentially faster provers and plausible post-quantum security. Examine key technical challenges in designing lattice-based folding schemes and explore several techniques, primarily related to lattice-based range proofs, for addressing these challenges. Gain insights into this cutting-edge research area that combines cryptographic theory with practical applications in proof systems, presented as part of ongoing collaborative work between Stanford University researchers.