Lattice-Based Commitments Achieve Post-Quantum Zero-Knowledge with Transparent Setup
A new lattice-based polynomial commitment provides post-quantum security and a transparent setup, fundamentally advancing trustless, quantum-resistant verifiable computation.
Zero-Knowledge DKG Enables Cost-Effective Dynamic Threshold Cryptography
Integrating zk-SNARKs into Distributed Key Generation offloads costly on-chain computation, unlocking scalable, dynamic threshold cryptosystems for decentralized applications.
Recursive SNARKs Enable Constant-Size Proofs for Verifiable AI Inference
This framework uses recursive zero-knowledge proofs to achieve constant-size verification for large AI models, securing transparent, private computation.
SmallWood: Hash-Based Commitments Achieve Post-Quantum Zero-Knowledge for Small Instances
SmallWood introduces a post-quantum, hash-based commitment scheme, dramatically shrinking proof sizes for common, small-scale verifiable computation.
Lattice-Based Folding Achieves Post-Quantum, Incremental Succinct Proof Systems
Lattice-based folding schemes construct the first post-quantum recursive proof system, enabling quantum-secure, incrementally verifiable computation for massive data streams.
Zero-Knowledge Proofs Verify Cryptographic Hashing Integrity for Blockchain Scalability
This research introduces a Plonky2-based ZKP methodology to offload heavy SHA-256 computation, enabling efficient, trustless verification and scaling blockchain integrity.
Trustless Logarithmic Commitment Secures Verifiable Computation
This new vector-based commitment achieves logarithmic proof size and trustless setup, fundamentally accelerating ZK-proof verification and scaling.
MicroNova Enables Efficient On-Chain Recursive Proof Verification
MicroNova introduces a folding-based recursive argument that achieves step-independent proof size, dramatically lowering the gas cost for verifiable computation on resource-constrained blockchains.
Zero-Knowledge Proofs Unlock Unlimited Verifiable Computation for the EVM
This new zero-knowledge primitive decouples EVM computation from on-chain gas limits, enabling provable off-chain logic and complex state access.
