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 spansThe 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§
- Reduction
Output - What
reduce_constraintsleaves 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_instancesinstances to operand claims at one point. - verify_
public_ eval - Reads the public segment’s evaluation and reduces it onto the segment’s packed form.