Paper 2026/751

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

Hancheng Lou, Shanghai Jiao Tong University

Wenjie Qu, National University of Singapore

Zhuoyuan Xu, Shanghai Jiao Tong University

Jiaheng Zhang, National University of Singapore

Abstract

Polynomial commitment schemes (PCS) are a fundamental building block of modern proof systems. As proof system applications scale to increasingly large workloads, distributed PCS become essential for reducing prover time and memory pressure. Among existing PCS constructions, code-based PCS achieve significantly better concrete prover performance than group-based schemes by avoiding expensive elliptic-curve operations and operating over small-characteristic fields. However, despite these advantages, code-based PCS are notoriously difficult to distribute. In this work, we present LigeSIS, the first distribution-friendly code-based multilinear PCS. LigeSIS achieves sublinear cross-node communication while keeping the final proof size independent of the number of machines. Our key insight is to replace Merkle-tree hashing with a homomorphic subset-sum hash over Goldilocks64, enabling algebraic aggregation of partial commitments produced by different nodes. To make this approach practical, we further introduce a preprocessing-accelerated subset-sum hash that reduces hashing overhead by up to $8\times$. Our evaluation shows that, on a single node, LigeSIS achieves performance comparable to the state-of-the-art RS-based PCS WHIR (Eurocrypt’25). In distributed settings, LigeSIS exhibits near-linear scalability in prover time. Compared with distributed MKZG (S\&P’25), LigeSIS achieves a $24 \times$ improvement in prover time. Compared with PIP (Security’26), LigeSIS reduces cross-node communication by up to $20\times$.

@misc{cryptoeprint:2026/751,
      author = {Yanpei Guo and Hancheng Lou and Wenjie Qu and Zhuoyuan Xu and Jiaheng Zhang},
      title = {{LigeSIS}: Distribution-friendly Polynomial Commitment \\ Based on Error-correcting Code},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/751},
      year = {2026},
      url = {https://eprint.iacr.org/2026/751}
}