# Protocols for Univariate Sumcheck

Source: [Protocols for Univariate Sumcheck](<https://www.sota2.com/research/paper/68fa7bf31e209131cea8b88e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-03-25T05:00:04.213Z

Authors: Malcom Mohamed

Published: 2025-05-01T14:29:32.000Z

## Abstract

Three candidate approaches for univariate sumcheck over roots of unity are presented. The first takes the form of a multilinear evaluation protocol, which can be combined with the standard multivariate sumcheck protocol. The other two are reductions from univariate domain identity and univariate sumcheck to multivariate evaluation, respectively, and each can be combined with Gemini (Bootle et al., Eurocrypt 2022). Optionally, natural round reductions from $m$ to $\\log(m)$ or $O(\\sqrt{m})$ are supported, while retaining linear prover time.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Univariate Sumcheck](<https://www.sota2.com/research/sota/univariate-sumcheck.md>): Univariate Sumcheck; Univariate Sumcheck; Prover Complexity: 2.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2505.00554>)

[PDF](<https://arxiv.org/pdf/2505.00554.pdf>)
