Orion Achieves Linear Prover Time for Scalable Zero-Knowledge Proofs
Orion introduces a linear-time encoding circuit and novel proof composition, shattering the ZKP prover bottleneck for massive on-chain computation.
New Accumulation Scheme Enables Post-Quantum, Symmetric-Key Verifiable Computation
Symmetric-key accumulation via error-correcting codes removes public-key reliance, establishing a path toward efficient, post-quantum verifiable computation.
Lattice-Based zkSNARKs Achieve Practical Post-Quantum Proof Efficiency
This new lattice-based zkSNARK construction dramatically reduces post-quantum proof size and prover time, enabling practical, quantum-secure privacy on-chain.
Encrypted Multi-Scalar Multiplication Enables Private Single-Server zk-SNARK Outsourcing
The new Encrypted Multi-Scalar Multiplication primitive allows clients to privately offload costly zk-SNARK proving to an untrusted server with $O(1)$ overhead.
Constant-Time Vector Commitment Decouples Prover Work from Circuit Size
This new Constant-Time Vector Commitment scheme shifts prover complexity to pre-processing, enabling $O(1)$ online proofs for massive circuits.
WARP Accumulation Scheme Achieves Optimal Verifiable Computation Efficiency
The WARP accumulation primitive achieves linear proving and logarithmic verification time, fundamentally enabling truly scalable recursive zero-knowledge systems.
Encrypted Multi-Scalar Multiplication Privately Outsourced ZK-SNARK Proving
A new cryptographic primitive, Encrypted MSM, offloads zk-SNARK proving complexity to an untrusted server while preserving total witness privacy.
Recursive Zero-Knowledge Secures Private Verifiable AI Model Inference
The new recursive ZK framework allows constant-size proofs for massive AI models, solving the critical trade-off between model privacy and verifiability.
