zkDaily - 2026-04-16

零知识证明 zkDaily

ZKP Frontier Tracker 🎯

Thu

04.16

2026

Veloz: Efficient and Flexible Distribution Framework for Code-Based Polynomial Commitment Scheme

Paper

https://eprint.iacr.org/2026/714

Yuanzhuo Yu Polynomial Commitment

Yu et al. proposed Veloz, a distribution framework for code-based multilinear PCS, achieving sublinear communication cost and eliminating proof size dependence on sub-provers.

Notes

Existing code-based PCS distribution schemes suffer from high communication or proof size overhead.
Veloz uses a customized proof aggregation method from interleaved code to efficiently combine sub-proofs.
Two instantiations: Veloz-RS based on Reed-Solomon code and Veloz-Fast based on Brakedown's fast linear code.
Veloz-RS achieves O(n) proving time, O(√n) communication, and O(1) proof size.
Veloz-Fast achieves O(n log n) proving time, O(√n) communication, O(1) proof size, and field agnosticity.
Experiments show linear scalability; Veloz-Fast achieves 26.9s proof generation and 7.02× speedup for n=2²⁰.

Collected by @icerdesign

零知识证明 zkDaily

Q&A Deep Dive 💬

Thu

04.16

2026

Why do we need distributed PCS?

Large-scale polynomial proof generation is computationally expensive. Distributed PCS enables parallel proof generation, improving speed while preserving transparent setup and plausible quantum resilience.

What is the core innovation of Veloz?

Its core innovation is a proof aggregation method based on interleaved codes, which combines multiple sub-proofs with minimal communication and achieves sublinear communication cost for the first time.

How does Veloz improve over prior work?

It avoids total communication among sub-provers, and the proof size no longer grows with the number of sub-provers, while maintaining proving speed and security.

Prompted by @icerdesign