Struct EvalCost

pub struct EvalCost {
    pub n_adds: usize,
    pub n_muls: usize,
    pub n_squares: usize,
}

The breakdown of the number of operations it takes to evaluate this circuit.

Fields

n_adds: usize

Number of additions.

Addition is a relatively cheap operation.

n_muls: usize

Number of multiplications.

Multiplications are a dominating factor in the evaluation cost.

n_squares: usize

Number of squares.

Squares are a relatively cheap operation. Generally we assume that squaring takes the 1/5th of a single multiplication.

Implementations

impl EvalCost

pub fn add(n_adds: usize) -> Self

pub fn mul(n_muls: usize) -> Self

pub fn square(n_squares: usize) -> Self

pub fn mult_cost_approx(&self) -> usize

Returns an approximate cost to evaluate an expression as a single number.

Since the evaluation time is dominated by the number of multiplications we can roughly gauge the cost by the number of the multiplications. We count the number of squares as 1/5th of a single multiplication.

Trait Implementations

impl Add for EvalCost

type Output = EvalCost

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self

Performs the + operation.

impl Default for EvalCost

fn default() -> EvalCost

Returns the “default value” for a type.