zkDaily - 2026-05-01

零知识证明 zkDaily

ZKP Frontier Tracker 🎯

Fri

05.01

2026

LigeSIS: Distribution-friendly Polynomial Commitment Based on Error-correcting Code

Paper

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

Yanpei Guo PCS Error-correcting Code

Guo et al. proposed LigeSIS, the first distribution-friendly code-based multilinear PCS, achieving sublinear cross-node communication with proof size independent of machine count.

Notes

LigeSIS is the first distribution-friendly code-based multilinear PCS
Replaces Merkle-tree hashing with homomorphic subset-sum hash over Goldilocks64
Introduces preprocessing-accelerated subset-sum hash to reduce overhead
Single-node performance comparable to state-of-the-art RS-based PCS WHIR
Near-linear scalability in prover time in distributed settings
Improves prover time over distributed MKZG and reduces cross-node communication vs PIP

Collected by @icerdesign

零知识证明 zkDaily

Q&A Deep Dive 💬

Fri

05.01

2026

Why do we need distributed PCS?

As workloads grow, a single machine struggles with proving. Distributed PCS spreads computation across nodes, reducing time and memory pressure.

What is the key idea behind LigeSIS?

LigeSIS replaces Merkle trees with a homomorphic subset-sum hash, enabling algebraic aggregation of commitments from different nodes and reducing communication.

How does LigeSIS achieve low communication overhead?

Using homomorphic hashing, nodes send partial results that can be aggregated, avoiding full Merkle paths and achieving sublinear communication.

Prompted by @icerdesign