Lattice-Based Polynomial Commitments Achieve Post-Quantum Succinctness and Efficiency
Greyhound is the first concretely efficient polynomial commitment scheme from standard lattice assumptions, securing ZK-proof systems against future quantum threats.
Logarithmic-Depth Commitments Enable Truly Stateless Blockchain Verification
A new Logarithmic-Depth Merkle-Trie Commitment scheme achieves constant-time verification, enabling light clients to securely validate state without storing it.
Transparent Polynomial Commitment Achieves Succinct Proofs without Trusted Setup
A novel polynomial commitment scheme achieves cryptographic transparency and logarithmic verification, eliminating the reliance on a trusted setup for scalable zero-knowledge proofs.
Proof-of-Useful-Work Decouples Consensus Security from Wasted Energy
A novel Doubly Parallel Local Search mechanism transforms PoW's wasted energy into a decentralized, provably secure combinatorial optimization engine.
Hyper-Efficient Prover Unlocks Universal Transparent Zero-Knowledge Scaling
This new HyperPlonk scheme achieves linear prover time for universal transparent SNARKs, fundamentally accelerating verifiable computation for all decentralized applications.
Hyper-Dimensional Commitment Secures Data Availability Sampling Efficiency and Scalability
A new $k$-dimensional polynomial commitment scheme drastically reduces data availability overhead, unlocking massive throughput for decentralized rollups.
Decentralized Key Generation Eliminates Single-Point-of-Failure in Threshold Cryptography
A new Distributed Key Generation framework implements Pedersen's protocol over a BFT channel, solving the centralized dealer problem for robust threshold signature schemes.
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.
Mercury Multi-Linear Commitment Scheme Achieves Optimal Succinctness
The Mercury Multi-Linear Polynomial Commitment Scheme achieves constant proof size and near-optimal prover work, eliminating the efficiency trade-off in verifiable computation.
