Module prio::benchmarked [−][src]
Expand description
This module provides wrappers around internal components of this crate that we want to benchmark, but which we don’t want to expose in the public API.
Functions
Sets outp
to inp[0] * inp[1]
, where inp[0]
and inp[1]
are polynomials. This function
does the multiplication directly.
Sets outp
to inp[0] * inp[1]
, where inp[0]
and inp[1]
are polynomials. This function
uses FFT for multiplication.
Sets outp
to the Discrete Fourier Transform (DFT) using an iterative FFT algorithm.
Sets outp
to the Discrete Fourier Transform (DFT) using a recursive FFT algorithm.
Returns a Prio v2 proof that data
is a valid boolean vector.