This blog post introduces a more efficient lattice-based folding scheme by replacing expensive ℓ∞-norm checks with ℓ₂-norm checks, leveraging techniques from Johnson-Lindenstrauss projections. The approach improves prover efficiency while maintaining security, and proposes a final "shortening" step to ensure exact norm bounds during extraction. It advances the practicality of post-quantum folding schemes for real-world applications.
ZKSecurity has launched an interactive tutorial on Sumcheck, Multilinear Extensions (MLE), and HyperPlonk, featuring hands-on SageMath code and exercises. Designed for learners of all levels, the course focuses on implementation over theory, helping users understand and build modern ZK protocols from the ground up.
'In this module, Nicolas Mohnblatt and Ying Tong explain the critical need for privacy-preserving digital ID systems using zk-SNARKs. She first covers existing systems, but shows how the methods used are flawed. These existing systems may inadvertently expose linkability and observability, allowing issuers and verifiers to track users across different presentations. The proposed solution, zkID, is a zk-SNARK architecture, which acts as a privacy layer over existing credentials. This method conceals the static signature and data, enabling private, unlinkable presentations to be verified without requiring issuers to change the cryptography underlying their systems. The discussion also covers advanced topics like credential revocation, deniable presentation, the out-of-protocol risks of de-anonymization, and the technical trade-offs between different ZK proof systems and the importance of standardization in the road to wide-scale adoption.'
'In this episode, Anna Rose and Nico Mohnblatt catch up with Pratyush Mishra, Assistant Professor of Computer and Information Science at the University of Pennsylvania. They discuss the various themes in his ZK research and some of the works he has been a part of in the last few years. They explore how Garuda and Pari achieve extremely small SNARK proofs, how Arc facilitates hash-based folding, proximity proofs with FICS and FACS, his work on low-memory SNARKs, and ZK applications outside the blockchain space.
Pratyush shares how these ideas intersect with one another, from faster proving to smallest proof sizes to real-world uses. He also touches on his collaborations with other leading cryptographers like Benedikt Bünz and Alessandro Chiesa, and how ZK is finding its place in broader computer science.'
This post details the Rust implementation of Algorithm 6 from the BDDT paper, optimizing the sumcheck protocol for Ethereum’s Lean zkVM. By combining Small Value Optimization (SVO) and Eq-Poly techniques, it reduces prover time and proof size, enabling efficient base-to-extension field transitions and communication savings.
If you're interested in our ZK Insights or have ideas for similar content to share, we highly encourage everyone to head over to our Github repo and submit a Pull Request. Join forces with like-minded ZKPunks to co-create!
✨ Github repo link: https://github.com/ZKPunk-Org/zk-insights
✨ Web collection version: https://insights.zkpunk.pro/
Special thanks to: Kurt
Editor: Purple
No comments yet