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.
Lantern Achieves Short, Post-Quantum Zero-Knowledge Proofs via Polynomial Product Systems
Lantern is a post-quantum ZKP protocol that uses polynomial product proofs to prove vector norms, making proofs 2-3X smaller for scalable, quantum-safe privacy.
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.
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.
Zero-Knowledge Proofs Conceal Mechanism Rules for Private Commitment
A new cryptographic framework uses zero-knowledge proofs to commit to and execute any mechanism without revealing its private rules, enabling verifiable, non-mediated secrecy.
Bilinear Accumulators Enable Constant-Size Zero-Knowledge Batch Proofs
Zero-knowledge batch proofs using Bilinear Pairings achieve constant size and verification time, dramatically accelerating stateless blockchain and credential systems.
Zeromorph Unifies Multilinear Proofs with Efficient Univariate Commitments
Zeromorph is a cryptographic recipe that maps complex multilinear polynomials to simpler univariate forms, radically reducing ZK-SNARK verification cost.
Logical Unprovability Enables Perfectly Sound Transparent Zero-Knowledge Proofs
Leveraging Gödelian principles, this new cryptographic model achieves perfectly sound, non-interactive, transparent proofs, resolving the trusted setup dilemma.
