Skip to main content

padding_scales

Function padding_scales 

Source
pub fn padding_scales<E: FieldOps>(cs: &ConstraintSystem, r_x: &[E]) -> [E; 4]
Expand description

Each operation’s padding factor at the constraint point r_x, in [zero, bitand, intmul, binmul] order.

The constraint reductions claim an operation of 2^n rows at the prefix r_x[..n]. Its matrix, padded with empty rows up to the length of r_x, evaluates at r_x to that claim times eq(0, r_x[n..]): a padding row carries no operand term. Scaled by its factor, every operation’s claim is at the same full point, so one expansion of r_x serves them all.

§Soundness

A factor is zero only with negligible probability. A nonzero factor scales the claim and the multilinear it is about by the same unit, which is a bijection.

§Preconditions