Article Dans Une Revue IACR Communications in Cryptology Année : 2025

A divide-and-conquer sumcheck protocol

Résumé

We present a new sumcheck protocol called Fold-DCS (Fold-Divide-and-Conquer-Sumcheck) for multivariate polynomials based on a divide-and-conquer strategy. Its round complexity and soundness error are logarithmic in the number of variables, whereas they are linear in the classical sumcheck protocol. This drastic improvement in number of rounds and soundness comes at the expense of exchanging multivariate polynomials, which can be alleviated using polynomial commitment schemes. We first present Fold-DCS in the PIOP model, where the prover provides oracle access to a multivariate polynomial at each round. We then replace this oracle access in practice with a multivariate polynomial commitment scheme; we illustrate this with an adapted version of the recent commitment scheme Zeromorph [KT24], which allows us to replace most of the queries made by the verifier with a single batched evaluation check.

Fichier principal
Vignette du fichier
main.pdf (819.45 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05010610 , version 1 (01-04-2025)

Licence

Identifiants

Citer

Christophe Levrat, Tanguy Medevielle, Jade Nardi. A divide-and-conquer sumcheck protocol. IACR Communications in Cryptology, In press, 2 (1), ⟨10.62056/abksdk5vt⟩. ⟨hal-05010610⟩
180 Consultations
111 Téléchargements

Altmetric

Partager

  • More