Efficient Transparent Zero-Knowledge Proofs Eliminate Trusted Setup for Scalability
A new recursive polynomial commitment scheme, LUMEN, achieves the efficiency of trusted-setup SNARKs while maintaining full transparency, unlocking truly scalable and trustless rollups.
Black-Box Succinct Proofs Achieve Statistical Zero-Knowledge Security
A new polynomial commitment scheme enables succinct zero-knowledge proofs from minimal assumptions, establishing a theoretically optimal foundation for verifiable computation.
Aztec Network Pioneers Transparent Token Launch with Uniswap Continuous Clearing Auction
The CCA primitive re-architects token distribution, leveraging zero-knowledge proofs for compliant, fair, and accessible on-chain capital formation.
Complexity-Preserving SNARKs via Recursive Composition and Proof-Carrying Data
The first complexity-preserving SNARK in the plain model eliminates expensive setup, enabling efficient, publicly verifiable, and composable computation.
Deutsche Bank Unveils Institutional Tokenization Platform for Real-World Asset Servicing
The Blockchain-as-a-Service model utilizes a ZK-powered Ethereum Layer 2 to provide compliant, multichain token issuance, minimizing capital expenditure for asset managers.
Unified Framework Achieves Private Scalable Verifiable Machine Learning
The new proof-composition framework casts verifiable machine learning as succinct matrix computations, delivering linear prover time and architecture privacy for decentralized AI.
Democratic Randomness Protocol Eliminates Leader Bottlenecks for Scalability
Kleroterion, a democratic random beacon using Pinakion PVSS, achieves linear complexity by distributing input sharing, enabling scalable, bias-resistant randomness.
Generic Compiler Achieves Full SNARK Succinctness and Rate-1 Optimality
A generic compiler upgrades mild SNARKs to full succinctness, proving the optimality of rate-1 arguments and defining new cryptographic limits.
Folding Schemes Enable Constant-Time Recursive Zero-Knowledge Proofs
Introducing the folding scheme primitive, Nova bypasses complex SNARK recursion, achieving the fastest prover time and a constant-sized verifier circuit for scalable verifiable computation.
