# ZK Insights | 16 Oct 2026

*#133*

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

---

This week we cover Aztec's post-quantum roadmap, cryptographic package integrity, Lean proof guarantees, useful proof of work, reusable execution proofs, post-quantum proof verification and account keys, private stablecoins, distributed key generation, Magnetar, asynchronous threshold FHE, Bitcoin vaults, private face recognition, post-quantum secure aggregation, efficient edabits, inclusion proofs, and private Transformer inference benchmarks.

Blogs
-----

### Post-Quantum Aztec

*   Zac Williamson, Mike Connor
    
*   Recommend: 🌟
    
*   Distinguishes protecting today's private data against harvest-now-decrypt-later attacks from a full post-quantum migration, with a 2030 migration target spanning proving, authentication, encryption, and Ethereum settlement.
    
*   [https://aztec.network/blog/post-quantum-aztec](https://aztec.network/blog/post-quantum-aztec)
    

### Package managers have an integrity problem

*   Keegan Ryan, Trail of Bits
    
*   Tests 25 package managers against compromised repositories and examines why hashes, signatures, and lockfiles do not always translate into effective integrity checks.
    
*   [https://blog.trailofbits.com/2026/10/14/package-managers-have-an-integrity-problem/](https://blog.trailofbits.com/2026/10/14/package-managers-have-an-integrity-problem/)
    

### When the Natural-Language Paper and the Lean Proof Disagree

*   Zero Knowledge Podcast
    
*   Recommend: 🌟
    
*   A discussion of what Lean verification guarantees when formal and natural-language proofs differ, and why theorem statements, definitions, and the correspondence between proofs still need review.
    
*   [https://zeroknowledge.substack.com/p/when-the-natural-language-paper-and](https://zeroknowledge.substack.com/p/when-the-natural-language-paper-and)
    

### How LLMs might make crypto mining useful

*   Byron Gilliam, Blockworks
    
*   Explores Pearl's matrix-multiplication-based proof of useful work, including the distinction between proving computation and proving that it served a useful AI workload.
    
*   [https://mail.blockworks.com/p/how-llms-might-make-crypto-mining-useful](https://mail.blockworks.com/p/how-llms-might-make-crypto-mining-useful)
    

### Proof of useful work for verifying AI treaties

*   Ondrej Kubu
    
*   Reviews software-based compute verification and the missing link between proving how much work a GPU performed and proving that it ran the declared model.
    
*   [https://kubuondr.substack.com/p/proof-of-useful-work-for-verifying](https://kubuondr.substack.com/p/proof-of-useful-work-for-verifying)
    

Research Discussions
--------------------

### Rapidblocks with split proofs: execution proofs that outlive their state

*   cskiraly, Ethereum Research
    
*   Recommend: 🌟
    
*   Splits execution proofs from input/output state-binding proofs so that unrelated state changes need not trigger reproving. An exploratory design with small-model checks, without a full proof or performance evaluation yet.
    
*   [https://ethresear.ch/t/rapidblocks-with-split-proofs-execution-proofs-that-outlive-their-state/26157](https://ethresear.ch/t/rapidblocks-with-split-proofs-execution-proofs-that-outlive-their-state/26157)
    

### ERC-8403: an account as one hash, and post-quantum keys

*   AnkushinDaniil, Ethereum Research
    
*   Uses a Merkle root to manage account authorities and explores key rotation and post-quantum migration without changing the address. Includes a demo; the account demo uses classical keys, and the full post-quantum integration remains incomplete.
    
*   [https://ethresear.ch/t/erc-8403-an-account-as-one-hash-and-post-quantum-keys/26147](https://ethresear.ch/t/erc-8403-an-account-as-one-hash-and-post-quantum-keys/26147)
    

### Private Stablecoin on Ethereum

*   JiangXb-son, Ethereum Research
    
*   Proposes private stablecoins backed by USDC/USDT with contract-enforced minting and redemption, selective disclosure, and private DeFi applications. The discussion links to the full proposal paper.
    
*   [https://ethresear.ch/t/private-stablecoin-on-ethereum/26140](https://ethresear.ch/t/private-stablecoin-on-ethereum/26140)
    

### Exposing an ISA for post-quantum proofs on Ethereum

*   soispoke, Ethereum Research
    
*   Recommend: 🌟
    
*   Explores EIP-8288 proof dependencies verified outside the EVM and the tradeoffs between RISC-V, EVM, and dedicated instruction sets. First posted October 8, with follow-up discussion on October 12.
    
*   [https://ethresear.ch/t/exposing-an-isa-for-post-quantum-proofs-on-ethereum/26136](https://ethresear.ch/t/exposing-an-isa-for-post-quantum-proofs-on-ethereum/26136)
    

Talks and Resources
-------------------

### TORTL DKG: Two-Round Trustless Distributed Key Generation

*   Florian Le Mouël, NIST TCPT3
    
*   An October 13 presentation covering elliptic-curve and module-lattice DKG variants, using secret sharing and zero-knowledge proofs to check correctness. The official page provides an abstract and a technical writeup; a recording link has not been confirmed.
    
*   [https://csrc.nist.gov/presentations/2026/tcpt3-4b1](https://csrc.nist.gov/presentations/2026/tcpt3-4b1)
    

Papers
------

### Magnetar: High-speed post-quantum RV64 zkVM from standard hashes

*   Srinath Setty
    
*   Recommend: 🌟
    
*   A transparent RV64I proof system based on standard hashes such as SHA-256 and SHA-3, with BinarySpartan enabling efficient recursion. First submitted October 9 and revised October 15.
    
*   [https://eprint.iacr.org/2026/2423](https://eprint.iacr.org/2026/2423)
    
*   Official introduction: [https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/](https://www.microsoft.com/en-us/research/blog/proof-based-general-purpose-computing-with-magnetar/)
    

### Tulva: Practical Asynchronous Threshold FHE

*   Valerio Cini, Antonio Guimarães, Russell W. F. Lai, Michał Osadnik, Ivy K. Y. Woo
    
*   Recommend: 🌟
    
*   Enables threshold decryption without requiring participants to coordinate or be online simultaneously, with an implementation and evaluations for privacy-preserving EVM use cases.
    
*   [https://eprint.iacr.org/2026/2485](https://eprint.iacr.org/2026/2485)
    

### Trustless Bitcoin Vaults

*   Lukas Aumayr, Xinshu Dong, Runchao Han, Srivatsan Sridhar, David Tse, Nikhil Vanjani
    
*   Recommend: 🌟
    
*   Constructs vaults for collateral-based applications where withdrawals follow application contract logic without trusting a third party, including an Aave v4 lending example. First submitted October 14 and revised October 15.
    
*   [https://eprint.iacr.org/2026/2466](https://eprint.iacr.org/2026/2466)
    

### GhostFaceMPC: Privacy-Preserving Face Recognition with Multi-Party Computation

*   Davide Carnemolla, Dario Catalano, Mario Di Raimondo
    
*   Covers facial feature extraction and matching under MPC without exposing raw images or biometric embeddings, using model quantization and circuit optimizations with open-source code.
    
*   [https://eprint.iacr.org/2026/2499](https://eprint.iacr.org/2026/2499)
    

### SecAgg++: A Post-Quantum Privacy Preserving Federated Learning Protocol

*   Alessandro Perez, Giulia Cavicchioni, Silvio Cretti, Riccardo Longo, Alessandro Tomasi, Silvio Ranise
    
*   Integrates post-quantum primitives into single-server secure aggregation while preserving efficiency and supporting recovery when clients drop out.
    
*   [https://eprint.iacr.org/2026/2497](https://eprint.iacr.org/2026/2497)
    

### Edabits Generation with Quasi-Linear Communication Complexity

*   Alexander Bienstock, Daniel Escudero, Qijia Fan, Fengrun Liu, Yifan Song
    
*   Reduces edabit generation communication from quadratic to quasi-linear when a constant fraction of parties are honest, improving building blocks for MPC comparison, truncation, and bit decomposition.
    
*   [https://eprint.iacr.org/2026/2482](https://eprint.iacr.org/2026/2482)
    

### FlatMerkle: Logarithmic-Space Inclusion Proofs over a Single Linear Hash Stream

*   Sergio Demian Lerner
    
*   Supports logarithmic-size inclusion proofs over a single linear hash stream, with applications to Bitcoin transaction annexes, data availability, and cross-chain cost comparisons.
    
*   [https://eprint.iacr.org/2026/2468](https://eprint.iacr.org/2026/2468)
    

### A Graph-Based Analysis of Comparability, Scale, and Attribution in Private Transformer Inference

*   Souvik Das, Ariful Azad, Nitesh Saxena
    
*   Analyzes 62 private Transformer inference systems; only one of 1,891 candidate system pairs is directly comparable under shared assumptions, highlighting pitfalls in performance comparisons.
    
*   [https://eprint.iacr.org/2026/2464](https://eprint.iacr.org/2026/2464)
    

### Heterogeneous CPU–NPU Implementation of the AIMer Post-Quantum Signature for Low Latency on a Mobile SoC

*   Myoungsu Shin, Jihoon Jang, Hanbeom Shin, Insung Kim, Dongjae Lee, Donggeun Kwon
    
*   [https://eprint.iacr.org/2026/2486](https://eprint.iacr.org/2026/2486)
    

### Robust ECDSA Threshold Signing at Scale

*   Carsten Baum, Anders Dalskov
    
*   [https://eprint.iacr.org/2026/2493](https://eprint.iacr.org/2026/2493)
    

### Speeding up Sumcheck using Algebraic Geometry

*   Rahul Dalal, Benedikt Bunz, Tamir Hemo, Ron D. Rothblum
    
*   Recommend: 🌟
    
*   [https://eprint.iacr.org/2026/2494](https://eprint.iacr.org/2026/2494)
    

### Issuer-Independent Decentralized Exchange for E-Cash

*   Roozbeh Sarenche, Omid Mirzamohammadi
    
*   [https://eprint.iacr.org/2026/2495](https://eprint.iacr.org/2026/2495)
    

### TenseUp: Doubly-Efficient Lookup Arguments from Tensor Codes and Applications to Dynamic SNARKs

*   Christodoulos Pappas, Pariya Akhiani, Yupeng Zhang, Dimitrios Papadopoulos
    
*   [https://eprint.iacr.org/2026/2435](https://eprint.iacr.org/2026/2435)
    

### Censorship Resistance in Credential Systems and Application to the EUDI Wallet

*   Pierpaolo Della Monica, Ivan Visconti, Andrea Vitaletti, Marco Zecchini
    
*   [https://eprint.iacr.org/2026/2438](https://eprint.iacr.org/2026/2438)
    

### A Black-Box Compiler from Static to Dynamic SNARKs

*   Anubhav Baweja, Charalampos Papamanthou
    
*   [https://eprint.iacr.org/2026/2445](https://eprint.iacr.org/2026/2445)
    

### CUTS: Chained Uniform-sum Tree Signatures

*   Jamie Judd, Louis Tajan, Conor Deegan, Furkan Akal
    
*   [https://eprint.iacr.org/2026/2455](https://eprint.iacr.org/2026/2455)
    

### Secret Sharing from Non-Extractable Randomness

*   Divesh Aggarwal
    
*   [https://eprint.iacr.org/2026/2477](https://eprint.iacr.org/2026/2477)
    

### Witness-Succinct UC-Secure SNARKs with Weaker Trust Assumptions

*   Nahid Roustaeifar, Maryam Zarezadeh, Neel Mehendale, Behzad Abdolmaleki, Mahshid Delavar, Stefan Köpsell
    
*   [https://eprint.iacr.org/2026/2434](https://eprint.iacr.org/2026/2434)
    

* * *

---

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