WHIR has a faster verifier asymptotically and in practice. I also think that with optimized folding parameters, WHIR should have smaller proofs than Ligerito for RS codes. Bonus mention of Blaze in the blogpost nmohnblatt.github.io/ligerito-and-w…

too much research on prover speed and improving our protocols is not a good thing, we should not forget the foundation of zk protocols

[Revised] Constructing More Super-optimal Pairings via Small Degree Endomorphisms (Jianming Lin and Chang-An Zhao and Yuhao Zheng) ia.cr/2024/1195

Takeaways from zkSummit13: 1. War of zkVMs is still heating up. More new entrants & upgrades/redesigns will shake up the performance landscape. 2. VC attendance/attention on ZK has bottomed--someone (half jokingly) told me after the summit that I was the only VC in attendance

[Revised] Fast amortized KZG proofs (Dankrad Feist and Dmitry Khovratovich) ia.cr/2023/033

[New] At the Top of the Hypercube -- Better Size-Time Tradeoffs for Hash-Based Signatures (Dmitry Khovratovich and Mikhail Kudinov and Benedikt Wagner) ia.cr/2025/889

great stuff happening in ZK these days o_O

[New] A Generic Framework for Practical Lattice-Based Non-interactive Publicly Verifiable Secret Sharing (Behzad Abdolmaleki and Mohammad Foroutani and Shahram Khazaei and Sajjad Nasirzadeh) ia.cr/2025/901

interesting to put two GOLDs in one diagram

Joint work with Linea and Alpen Labs to reduce ECC proving time. This is the opportunity to update protocols to bls12-381 without extra proving cost. eprint.iacr.org/2025/933

Good bye elliptic curves, it has been a great journey. 😂

Wrote a post on the Google Wallet ZKP This is not "just a simple application of ZK", it has a very interesting proof system and many brilliant insights. Highly recommend to have a closer look! Summary and link below (and Zero Knowledge Podcast episode coming soon 👀)

A quick summary of my highlights, I expand on all of these in the post nmohnblatt.github.io/libzk-highligh…

[Revised] Polylogarithmic Proofs for Multilinears over Binary Towers (Benjamin E. Diamond and Jim Posen) ia.cr/2024/504

BitVM mainnet experiment completed. Entire unhappy path took a total of less than 8 hours and $16K of transaction fees. Details: The first tx was included 2025-06-04 07:37:25 UTC+8 The last tx was included 2025-06-04 15:13:40 UTC+8 lasting 7 hours 36 mins, spanning 42 blocks

Lots of recent "BitVM" breakthroughs and announcement(s). The core 1-of-N trust assumption still holds, but nearly every other tradeoff is being chipped away. I'll describe it all below. -- Disclaimer: This post is a bit dense if you're not in the weeds of BitVM already and

[Revised] Garbled Lookup Tables from Homomorphic Secret Sharing (Liqiang Liu and Tianren Liu and Bo Peng) ia.cr/2025/254

[New] SmallWood: Hash-Based Polynomial Commitments and Zero-Knowledge Arguments for Relatively Small Instances (Thibauld Feneuil and Matthieu Rivain) ia.cr/2025/1085

arkwork is still growing

I've written this short note on how Neo compares to LatticeFold in their embedding from fields to polynomial rings, and how this relates to "pay-per-bit" commitment schemes and NTTs. Especially targeted to ZK practitioners who may be new to lattices! blog.icme.io/folding-scheme…