# ZK Insights | 13 Nov 2026

*#137*

By [ZK Insights](https://paragraph.com/@zkinsights) · 2026-11-13

---

This week we cover zkVM experiments, tools for writing and verifying ZK circuits, and research on succinct proofs and anonymous credentials.

Blogs
-----

### 2026 ZK Industry Report | Zero Knowledge Podcast and Succinct

*   Surveys advances in proving performance and how governments, technology companies, and banks are deploying ZK.
    
*   [https://zeroknowledge.fm/zk-industry-report-2026/](https://zeroknowledge.fm/zk-industry-report-2026/)
    

### The last two curves | ZKM

*   Describes experimental replacements for Ziren's elliptic-curve memory check and its pairing-based on-chain proof wrapper.
    
*   [https://www.zkm.io/blog/the-last-two-curves](https://www.zkm.io/blog/the-last-two-curves)
    

### Folding vs full-verifier recursion for PQ signature aggregation in leanVM: measurements and negative results

*   Benchmarks folding and full-verifier recursion for post-quantum signature aggregation in leanVM.
    
*   [https://ethresear.ch/t/folding-vs-full-verifier-recursion-for-pq-signature-aggregation-in-leanvm-measurements-and-negative-results/26227](https://ethresear.ch/t/folding-vs-full-verifier-recursion-for-pq-signature-aggregation-in-leanvm-measurements-and-negative-results/26227)
    

### Seam: verifying Zcash headers on Base with EIP-152, and proving shielded payments without linking the chains

*   A prototype that verifies Zcash headers on Base and proves shielded payments without revealing the underlying transaction.
    
*   [https://ethresear.ch/t/seam-verifying-zcash-headers-on-base-with-eip-152-and-proving-shielded-payments-without-linking-the-chains/26239](https://ethresear.ch/t/seam-verifying-zcash-headers-on-base-with-eip-152-and-proving-shielded-payments-without-linking-the-chains/26239)
    
*   [https://github.com/Himess/seam](https://github.com/Himess/seam)
    

### Zero Knowledge Proof from First Principles to Production | Pawel Jakubas, Cardano Foundation

*   Walks through building a small circuit, generating a Groth16 proof, and verifying it on Cardano.
    
*   [https://cardanofoundation.org/blog/zkp-principles-to-production](https://cardanofoundation.org/blog/zkp-principles-to-production)
    

### Noir 1.0 Is Live | Aztec

*   The first stable Noir release brings a versioned toolchain and a stable ACIR interface for proving backends.
    
*   [https://aztec.network/blog/noir-1-0-is-live](https://aztec.network/blog/noir-1-0-is-live)
    

### CertiPlonk | Nethermind

*   Extracts constraint systems from the Plonky3 zkDSL and supports verifying their properties in Lean.
    
*   [https://github.com/NethermindEth/CertiPlonk](https://github.com/NethermindEth/CertiPlonk)
    

Videos
------

### When Math Meets Auto Research with Bartosz Naskręcki

*   ZK Podcast, Episode 416
    
*   Discusses AI-assisted mathematics and the role of Lean in checking generated proofs.
    
*   [https://zeroknowledge.fm/podcast/416/](https://zeroknowledge.fm/podcast/416/)
    

Papers
------

### Bulletproofs are Optimal: Lower Bounds for Vector Commitments from Fiat-Shamir in Pairing-Free Groups

*   Marian Dietz, Emanuele Giunta
    
*   Proves lower bounds on opening proofs for constant-size vector commitments built via Fiat–Shamir in pairing-free generic groups.
    
*   [https://eprint.iacr.org/2026/2868](https://eprint.iacr.org/2026/2868)
    

### Revisiting Fiat-Shamir NIZKPs and Signatures from Seed-Friendly Sigma Protocols

*   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.
    
*   [https://eprint.iacr.org/2026/2858](https://eprint.iacr.org/2026/2858)
    

### ASCENT: Algebraic Structured Compilation of Exact Norms for Succinct Lattice Proofs

*   Lizhen Zhang, Shang Gao, Bin Xiao
    
*   Compiles exact Euclidean norm constraints for committed lattice witnesses into structured inner-product claims and relaxed shortness bounds.
    
*   [https://eprint.iacr.org/2026/2853](https://eprint.iacr.org/2026/2853)
    

### Delegatable Keyed-Verification Anonymous Credentials

*   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.
    
*   [https://eprint.iacr.org/2026/2860](https://eprint.iacr.org/2026/2860)
    

### BMRaccoon: Blind Multi-Signatures from Lattices

*   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.
    
*   [https://eprint.iacr.org/2026/2870](https://eprint.iacr.org/2026/2870)
    

### Anamorphic NIZK: Definition, Construction and More

*   Wenhui Kong, Gongxian Zeng, Zhengan Huang
    
*   Constructs publicly verifiable zero-knowledge proofs that can carry covert messages recoverable with a secret key.
    
*   [https://eprint.iacr.org/2026/2866](https://eprint.iacr.org/2026/2866)
    

### Revisiting Witness-Succinct UC-lifting Compilers

*   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.
    
*   [https://eprint.iacr.org/2026/2453](https://eprint.iacr.org/2026/2453)
    

### SNARKs from LWE via Non-black-box Reductions

*   Zhengzhong Jin, Mingqi Lu, Bo Peng
    
*   Constructs SNARKs from LWE for certain languages with efficiently provable witness uniqueness, with an infinitely-often soundness guarantee.
    
*   [https://eprint.iacr.org/2026/2805](https://eprint.iacr.org/2026/2805)
    

### On Proximity Gaps for Expander Codes

*   Kobi Gurkan, Andrija Novakovic, Ron D. Rothblum
    
*   Establishes proximity gaps for low-degree expander codes, a property used to analyze soundness in proof systems.
    
*   [https://eprint.iacr.org/2026/2806](https://eprint.iacr.org/2026/2806)
    

### Polygero: Proximity Testing From Polynomial Challenges

*   Matteo Frigo, abhi shelat
    
*   Uses low-degree polynomial challenges for Reed–Solomon proximity testing in a Ligero-style IOP with Lean-checked soundness.
    
*   [https://eprint.iacr.org/2026/2481](https://eprint.iacr.org/2026/2481)
    

### Nowhere Man: Device Binding for Post-Quantum Anonymous Credentials

*   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.
    
*   [https://eprint.iacr.org/2026/2472](https://eprint.iacr.org/2026/2472)
    

### Post-Quantum Sublinear Lookup Arguments from Polynomial Preprocessing

*   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.
    
*   [https://eprint.iacr.org/2026/2581](https://eprint.iacr.org/2026/2581)
    

* * *

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/**](https://insights.zkpunk.pro/)  
✨ **GitHub repo link:** [**https://github.com/ZKPunk-Org/zk-insights**](https://github.com/ZKPunk-Org/zk-insights)

---

*Originally published on [ZK Insights](https://paragraph.com/@zkinsights/zk-insights-or-13-nov-2026)*
