Struct MultithreadedNTT

pub struct MultithreadedNTT<F: BinaryField, TA: TwiddleAccess<F> + Sync = OnTheFlyTwiddleAccess<F, Vec<F>>> { /* private fields */ }

Implementation of AdditiveNTT that performs the computation multithreaded.

Implementations

impl<F: BinaryField, TA: TwiddleAccess<F> + Sync> MultithreadedNTT<F, TA>

pub fn log_domain_size(&self) -> usize

Base-2 logarithm of the size of the NTT domain.

pub fn get_subspace_eval(&self, i: usize, j: usize) -> F

Get the normalized subspace polynomial evaluation $\hat{W}_i(\beta_j)$.

Preconditions

• i must be less than self.log_domain_size()
• j must be less than self.log_domain_size() - i

Trait Implementations

impl<F, TA, P> AdditiveNTT<P> for MultithreadedNTT<F, TA>

where F: BinaryField, TA: TwiddleAccess<F> + Sync, P: PackedField<Scalar = F>,

fn log_domain_size(&self) -> usize

Base-2 logarithm of the size of the NTT domain.

fn get_subspace_eval(&self, i: usize, j: usize) -> F

Get the normalized subspace polynomial evaluation $\hat{W}_i(\beta_j)$.

fn forward_transform( &self, data: &mut [P], coset: u32, log_batch_size: usize, ) -> Result<(), Error>

Forward transformation defined in LCH14 on a batch of inputs.

fn inverse_transform( &self, data: &mut [P], coset: u32, log_batch_size: usize, ) -> Result<(), Error>

Inverse transformation defined in LCH14 on a batch of inputs.

fn forward_transform_ext<PE>( &self, data: &mut [PE], coset: u32, ) -> Result<(), Error>

where PE: RepackedExtension<P>, PE::Scalar: ExtensionField<P::Scalar>,

fn inverse_transform_ext<PE>( &self, data: &mut [PE], coset: u32, ) -> Result<(), Error>

where PE: RepackedExtension<P>, PE::Scalar: ExtensionField<P::Scalar>,

impl<F: Debug + BinaryField, TA: Debug + TwiddleAccess<F> + Sync> Debug for MultithreadedNTT<F, TA>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.