Lattice-Based Recursion Enables Transparent Post-Quantum Zero-Knowledge Proofs
LaBRADOR introduces a post-quantum, lattice-based ZK primitive that achieves sublinear proof size via recursive folding, securing future computation.
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.
Commit-and-Prove SNARKs Enable Efficient Verifiable Machine Learning
A new Commit-and-Prove SNARK architecture decouples witness commitment, achieving succinct verifier time for large, private inputs like ML models.
Universal Zero-Knowledge Proofs Eliminate Program-Specific Trusted Setup
A universal circuit construction for SNARKs decouples the setup from the program logic, establishing a single, secure, and permanent verifiable computation layer.
Transparent Recursive Proofs Secure Quantum-Resistant Decentralized State
Fractal introduces a hash-based, transparent SNARK, enabling recursive proofs for quantum-secure, constant-size verification of entire blockchain history.
Incremental Proofs Maintain Constant-Size Sequential Work for Continuous Verification
This new cryptographic primitive enables constant-size proofs for arbitrarily long sequential computations, fundamentally solving the accumulated overhead problem for VDFs.
zk-SNARKs Enable Trustless Universal Cross-Chain State Verification
The Zendoo protocol uses recursive zk-SNARKs to generate succinct, constant-size proofs of sidechain state, fundamentally securing decentralized interoperability.