Skip to main content

Module zero

Module zero 

Source
Expand description

The Zero reduction.

A ZERO constraint asserts that one constraint array vanishes. Because the constraint is linear, the polynomial whose vanishing is at stake is the array’s oblong-multilinearization d_hat itself, rather than a product of witness multilinears. A multilinear that vanishes on the cube is the zero polynomial, so a single evaluation at a point the prover could not predict certifies the constraints outright.

The reduction therefore carries no prover message and no sumcheck round. Its whole output is the claim

d_hat(r_zhat_prime, rho) = 0

which joins the BitAnd, IntMul and BinMul claims in the batch the shift reduction consumes. The shift reduction, running against the committed witness, is what certifies it: a violated ZERO constraint makes the true batched evaluation differ from the claimed one, and its final check fails.

Functions§

reduction_point
Builds the constraint point the Zero reduction closes at.