twenty_first::math::ntt

Function ntt_noswap

Source
pub fn ntt_noswap<FF>(x: &mut [FF])
Expand description

Compute the NTT, but leave the array in bitreversed order.

This method can be expected to outperform regular NTT when

  • it is followed up by INTT (e.g. for fast multiplication)
  • the powers_of_omega_bitreversed can be precomputed (which is not the case here).

In that case, be sure to use the matching intt_noswap and don’t forget to unscale by n, e.g. using unscale.