Zerocheck optimizations for Irreducible

Zerocheck optimizations for Irreducible

Zerocheck speedup

Created on 22nd June 2025

Zerocheck optimizations for Irreducible

Zerocheck optimizations for Irreducible

Zerocheck speedup

The problem Zerocheck optimizations for Irreducible solves

This project delivers improvements for zerocheck benchmark run at AWS ARM instance for the bounty, described below:
Accelerate our benchmark for the zerocheck protocol. The input is 3 multilinear polynomials---a, b, and c---over GF(2) with 24 variables each (2^24 coefficients). The protocol checks that the values a(i) * b(i) - c(i) = 0 for all coordinates i in the boolean hypercube. Variations of sumcheck that send more than 2 elements in the first round are allowed (ie. univariate skip), as long as the first round message is at most 1,024 GF(2^128) elements.

Tracks Applied (1)

1-bit Zerocheck

Irreducible

Cheer Project

Cheering for a project means supporting a project you like with as little as 0.0025 ETH. Right now, you can Cheer using ETH on Arbitrum, Optimism and Base.

Discussion

Builders also viewed

See more projects on Devfolio