zkDaily - 2026-04-29

零知识证明 zkDaily

ZKP Frontier Tracker 🎯

Wed

04.29

2026

Code-based Scalable Collaborative SNARKs

Paper

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

Christodoulos Pappas CoSNARK

Pappas et al. proposed the first scalable collaborative SNARK based on error-correcting codes in their paper, enabling efficient, transparent, and post-quantum secure proof systems through distributed computation and zero-knowledge collaborative codes.

Notes

First scalable collaborative SNARK based on error-correcting codes with distributed proof computation
Introduces zero-knowledge collaborative codes for message privacy in distributed settings
Uses tensor codes (composition of two Reed-Solomon codes) that are foldable
Builds collaborative IOPP with logarithmic randomness for zero-knowledge
Extends compiler to preserve round-by-round soundness against quantum adversaries
Experimental results show outperformance in prover time and communication over existing schemes

Collected by @icerdesign

零知识证明 zkDaily

Q&A Deep Dive 💬

Wed

04.29

2026

What are collaborative codes?

Collaborative codes are distributed encoding schemes where multiple parties jointly compute a codeword while ensuring that corrupted subsets learn nothing about the original message.

What is the role of coIOPP in the system?

coIOPP verifies that a distributed codeword is close to a valid encoding and extends to polynomial evaluation proofs, serving as a core building block for the SNARK.

How does the scheme achieve post-quantum security?

It relies on error-correcting codes like tensor Reed-Solomon codes instead of elliptic curves or pairings, avoiding assumptions vulnerable to quantum attacks.

Prompted by @icerdesign