Skip to main content

Module reduction

Module reduction 

Source
Expand description

The constraint reduction shared by the single-instance and batched Binius64 verifiers.

One circuit, and 2^k instances of one circuit, reduce the same way. The instance count joins every row count, instance index low, constraint index high. One circuit is the batch with k = 0.

The BitAnd sumcheck carries the IntMul and BinMul operand claims, each zero-padded on its high end. So it ends at one point, and every operation is claimed at a prefix of it:

r_rho      the instance, shared by every operation
r_x_star   the constraint; each operation reads the prefix its row count spans

The shift reduction takes every operation at the same constraint point r_x, its matrix padded with empty rows, so each claim is scaled up from its prefix to the whole point first.

Structs§

ReductionOutput
What reduce_constraints leaves for the caller: every operation’s operand claims, all at one constraint point, for the shift reduction to take.

Constants§

BINMUL_ARITY
BITAND_ARITY
INTMUL_ARITY
LOG_OPERANDS
The base-2 logarithm of the operand axis: the operand columns, padded to a power of two.
OPERATION_ARITIES
Each operation’s operand arity, in the order the shift reduction’s operand columns run.
ZERO_ARITY

Functions§

log_constraint_point
The length of the constraint point r_x: the widest operation’s row-variable count.
padding_scales
Each operation’s padding factor at the constraint point r_x, in [zero, bitand, intmul, binmul] order.
reduce_constraints
Reduces every constraint of 2^log_instances instances to operand claims at one point.
verify_public_eval
Reads the public segment’s evaluation and reduces it onto the segment’s packed form.