Distributed zkSNARKs Achieve Linear Prover Scalability with Constant Communication
A new distributed zkSNARK protocol, Pianist, achieves linear prover scalability by parallelizing proof generation with constant communication overhead, resolving the ZKP bottleneck for zkRollups.
Black-Box Commit-and-Prove SNARKs Unlock Verifiable Computation Scaling
Artemis, a new black-box SNARK construction, modularly solves the commitment verification bottleneck, enabling practical, large-scale zero-knowledge machine learning.
zk-STARKs Enable Scalable Private Identity and Verifiable Credential Revocation
A zk-STARKs-based framework uses cryptographic accumulators to resolve the privacy-transparency conflict, enabling scalable, anonymous credential revocation.
Equifficient Polynomial Commitments Enable Faster, Smaller zk-SNARKs
Research introduces Equifficient Polynomial Commitments, a new primitive that yields Pari, the smallest SNARK at 160 bytes, and Garuda, a prover three times faster than Groth16.
