This week we cover zkVM experiments, tools for writing and verifying ZK circuits, and research on succinct proofs and anonymous credentials.
Surveys advances in proving performance and how governments, technology companies, and banks are deploying ZK.
Describes experimental replacements for Ziren's elliptic-curve memory check and its pairing-based on-chain proof wrapper.
Benchmarks folding and full-verifier recursion for post-quantum signature aggregation in leanVM.
A prototype that verifies Zcash headers on Base and proves shielded payments without revealing the underlying transaction.
Walks through building a small circuit, generating a Groth16 proof, and verifying it on Cardano.
https://cardanofoundation.org/blog/zkp-principles-to-production
The first stable Noir release brings a versioned toolchain and a stable ACIR interface for proving backends.
Extracts constraint systems from the Plonky3 zkDSL and supports verifying their properties in Lean.
ZK Podcast, Episode 416
Discusses AI-assisted mathematics and the role of Lean in checking generated proofs.
Marian Dietz, Emanuele Giunta
Proves lower bounds on opening proofs for constant-size vector commitments built via Fiat–Shamir in pairing-free generic groups.
Andrea Flamini, Federico Pintore, Edoardo Signorini
Shows that salted seed trees enable straight-line extraction for Fiat–Shamir proofs from seed-friendly Sigma protocols in the classical random-oracle model.
Lizhen Zhang, Shang Gao, Bin Xiao
Compiles exact Euclidean norm constraints for committed lattice witnesses into structured inner-product claims and relaxed shortness bounds.
Omid Mirzamohammadi, Varesh Mishra, Jan Bobolz, Emad Heydari Beni, Aysajan Abidin, Dave Singelée, Bart Preneel
Gives two pairing-free constructions that let holders delegate restricted versions of their keyed-verification anonymous credentials.
Keerthi Aiswarya Varshini, Kanchan Bisht, Palkesh Jain, Maria Francis, R. Kabaleeshwaran
Builds a two-round lattice-based blind multi-signature scheme that supports concurrent signing sessions and produces Raccoon-compatible signatures.
Wenhui Kong, Gongxian Zeng, Zhengan Huang
Constructs publicly verifiable zero-knowledge proofs that can carry covert messages recoverable with a secret key.
Davide Li Calsi, Luigi Russo, Dominique Schröder, Federico Valbusa
Identifies a proof-rerandomization attack on a prior UC compiler and gives a new compiler that binds openings to their respective repetitions.
Zhengzhong Jin, Mingqi Lu, Bo Peng
Constructs SNARKs from LWE for certain languages with efficiently provable witness uniqueness, with an infinitely-often soundness guarantee.
Kobi Gurkan, Andrija Novakovic, Ron D. Rothblum
Establishes proximity gaps for low-degree expander codes, a property used to analyze soundness in proof systems.
Matteo Frigo, abhi shelat
Uses low-degree polynomial challenges for Reed–Solomon proximity testing in a Ligero-style IOP with Lean-checked soundness.
Calvin Abou Haidar, Ryo Kikuchi, Octavio Perez-Kempner, Marcel Tiepelt
Binds anonymous credentials to a device using ML-DSA signatures and zero-knowledge proofs at presentation.
Adarsh Basumata, Chaya Ganesh, Varun Narayanan, Sikhar Patranabis, Surbhi Shaw, Nitin Singh
Uses polynomial preprocessing and Reed–Muller proximity tests to obtain plausibly post-quantum lookups with sublinear online prover time.
If you're interested in our ZK Insights or have ideas for similar content, 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!
✨ Web collection version: https://insights.zkpunk.pro/
✨ GitHub repo link: https://github.com/ZKPunk-Org/zk-insights

