Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation and Privacy
Sublinear memory scaling for ZKPs breaks the computation size bottleneck, enabling universal verifiable privacy on resource-constrained devices.
Double-Trapdoor Vector Commitment Enables Constant-Cost Verifiable Data Integrity
Introducing Double-trapdoor Chameleon Vector Commitment, a primitive that delivers constant-size proofs for unbounded data integrity verification.
Characterizing ZKP GPU Bottlenecks Accelerates Verifiable Computation Scaling
ZKProphet empirically identifies Number-Theoretic Transform as the 90% GPU bottleneck, shifting optimization focus to unlock practical ZKP scaling.
FHE Breakthrough Achieves Practical Encrypted AI Computation Eighty Times Faster
A novel FHE scheme optimizes encrypted matrix arithmetic, delivering an 80x speedup crucial for practical, privacy-preserving on-chain AI and data analysis.
Optimal ZKP Prover Time Unlocks Practical Succinct Verifiable Computation
Libra achieves the theoretical optimum for ZKP prover efficiency, utilizing a linear-time GKR algorithm to finally scale zero-knowledge proofs.
Distributed Zero-Knowledge Proofs Decouple Prover Efficiency from Centralization Risk
New fully distributed ZKP schemes cut prover time and communication to $O(1)$, decentralizing zkRollup block production and boosting throughput.
Proof of Useful Work Secures Consensus by Generating Zero-Knowledge Proofs
A new Proof of Useful Work protocol embeds zk-SNARK generation into consensus, solving PoW energy waste and bootstrapping a decentralized proof market.
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.
One-Time Batched Threshold Decryption Achieves Practical, Scalable Mempool Privacy
This new batched threshold decryption primitive enables practical MEV mitigation by securing transactions with a one-time cryptographic setup and constant-size partial decryptions.
