Hash-Based Multi-Signatures for Post-Quantum Ethereum by Justin Drake, Dmitry Khovratovich, Mikhail Kudinov and Benedikt Wagner: https://eprint.iacr.org/2025/055
This paper proposes a hash-based multi-signature scheme to enhance @ethereum's resistance to quantum computing threats. By transitioning from BLS signatures to post-quantum secure alternatives, the system safeguards its PoS consensus mechanism. Leveraging a novel generalized framework for XMSS-like signatures, the approach minimizes security loss while enhancing efficiency. Key innovations include bypassing random oracle dependency and offering practical parameters for secure, scalable Ethereum transactions in a post-quantum era.
Mira: Efficient Folding for Pairing-based Arguments by Josh Beal and Ben Fisch: https://eprint.iacr.org/2024/2025
This paper introduced Mira, a novel folding scheme tailored for pairing-based cryptographic arguments like Groth16 SNARKs and KZG polynomial commitments. Mira significantly enhances efficiency, achieving 5.8x faster prover time and 9.7x lower memory usage compared to existing solutions. It supports applications such as proof aggregation and verifiable ML inference, effectively addressing scalability and resource bottlenecks. Notably, Mira introduces an optimized lincheck protocol with verifier degree independent of matrix size, enabling deployment for larger models on constrained devices.
Zero Knowledge Memory-Checking Techniques for Stacks and Queues by Alexander Frolov: https://eprint.iacr.org/2024/2084
This paper says introduces new techniques for streamlining ZKP apps by optimizing memory-checking methods for stacks and queues. Employing polynomial evaluations and universal hashing, the proposed schemes reduce computation costs compared to general RAM techniques. Queues achieve 2.5 multiplications per access, while stacks require 3.5. These advancements could bolster VMs, automata, and parsing systems, promising enhanced efficiency and scalability for ZKP implementations.
A Survey of Interactive Verifiable Computing: Utilizing Randomness in Low-Degree Polynomials by Angold Wang: https://eprint.iacr.org/2025/008
Presented here is a comprehensive survey highlighting advancements in interactive verifiable computing, focusing on the role of low-degree polynomials in enhancing computational integrity. The study covers foundational concepts, such as NP-completeness and the Cook-Levin theorem, and delves into modern protocols like the sum-check and GKR frameworks. By leveraging randomness and mathematical rigor, these methods enable efficient verification of computations, paving the way for practical apps in secure computation and blockchain technology.
Xiezhi: Toward Succinct Proofs of Solvency by Youwei Deng and Jeremy Clark: https://eprint.iacr.org/2024/2001
The paper introduces a novel protocol, Xiezhi, which proposes advancements for ZKPs of solvency for cryptocurrency exchanges, ensuring robust transparency and privacy. Unlike traditional methods, Xiezhi efficiently verifies ownership of assets across different blockchain cryptographic standards while minimizing proof size and verification time. The protocol enhances scalability, offering practical solutions for high-volume exchanges. With its focus on privacy-preserving proofs and adaptability to real-world cryptographic constraints, Xiezhi paves the way for more secure and transparent digital asset ecosystems.
Extending Groth16 for Disjunctive Statements by Xudong Zhu, Xinxuan Zhang, Xuyang Song, Yi Deng, Yuanju Wei and Liuyu Yang: https://eprint.iacr.org/2025/028
This paper introduces CompGroth16, an innovative variant of the zk-SNARK framework Groth16. This model extends Groth16’s capabilities to efficiently handle disjunctive statements involving both algebraic and arithmetic components. By bridging Groth16 with Σ-protocols, the framework enhances prover efficiency, reduces circuit sizes, and avoids the need for regenerating CRS. With practical apps in privacy-preserving systems, CompGroth16 enables broader cryptographic use cases, including secure voting and anonymous transactions, while optimizing performance and scalability.
Founding Zero-Knowledge Proofs of Training on Optimum Vicinity by Gefei Tan, Adrià Gascón, Sarah Meiklejohn, Mariana Raykova, Xiao Wang and Ning Luo: https://eprint.iacr.org/2025/053
This paper introduces the concept of "optimum vicinity," enabling efficient verification of model training correctness without revealing sensitive details. Unlike traditional approaches requiring proof for each training step, this method directly validates a model’s proximity to an optimal solution. By incorporating interval arithmetic and precise approximations, the framework enhances computational integrity and security while reducing complexity. This advancement opens new possibilities for secure and transparent apps in machine learning.
Crescent: Stronger Privacy for Existing Credentials by Christian Paquin, Guru-Vamsi Policharla and Greg Zaverucha: https://eprint.iacr.org/2024/2013
This paper introduces Crescent - a mechanism for enhancing existing systems like JSON Web Tokens and Mobile Driver’s Licenses. Leveraging ZKPs, it enables selective disclosure and unlinkability without altering credential issuers' operations. With rapid proof generation (milliseconds) following a one-time setup, Crescent demonstrates practical use in scenarios like employment verification and age validation.
Bypassing the characteristic bound in logUp by Liam Eagen and Ulrich Haböck: https://eprint.iacr.org/2024/2067
This study by Liam Eagen and Ulrich Haböck from @0xPolygon addresses a long-standing limitation in the logUp protocol, enabling it to bypass the characteristic bound of finite fields. This advancement makes fractional decomposition techniques applicable to binary fields, unlocking new possibilities for STARK-based systems and multi-chip architectures. By utilizing algebraic bases and randomization, the solution ensures soundness even in high-demand environments. This innovation has significant implications for scalable, efficient ZKPs in modern cryptographic apps.
Morgana: a laconic circuit builder by Lev Soukhanov and Yaroslav Rebenko: https://eprint.iacr.org/2025/065
This paper introduces “Morgana”, a new SNARK proof system. Unlike traditional methods requiring complex universal circuits, Morgana employs small circuit keys proportional to circuit descriptions, reducing overhead and boosting speed compared to existing systems like Spartan. This innovation enables faster zkVMs by generating commitments and executing proofs dynamically, bridging the gap between application-specific circuits and universal approaches. Its modular design streamlines cryptographic proofs, setting a new standard for secure and efficient computations.
