1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
// Copyright (C) 2019-2021 Aleo Systems Inc. // This file is part of the snarkVM library. // The snarkVM library is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // The snarkVM library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with the snarkVM library. If not, see <https://www.gnu.org/licenses/>. use snarkvm_utilities::biginteger::BigInteger; /// A trait that defines parameters for a field that can be used for FFTs. pub trait FftParameters: 'static + Send + Sync + Sized { type BigInteger: BigInteger; /// Let `N` be the size of the multiplicative group defined by the field. /// Then `TWO_ADICITY` is the two-adicity of `N`, i.e. the integer `s` /// such that `N = 2^s * t` for some odd integer `t`. /// 2^s * t = MODULUS - 1 with t odd. This is the two-adicity of the prime. const TWO_ADICITY: u32; /// 2^s root of unity computed by GENERATOR^t const TWO_ADIC_ROOT_OF_UNITY: Self::BigInteger; /// An integer `b` such that there exists a multiplicative subgroup /// of size `b^k` for some integer `k`. const SMALL_SUBGROUP_BASE: Option<u32> = None; /// The integer `k` such that there exists a multiplicative subgroup /// of size `Self::SMALL_SUBGROUP_BASE^k`. const SMALL_SUBGROUP_BASE_ADICITY: Option<u32> = None; /// GENERATOR^((MODULUS-1) / (2^s * /// SMALL_SUBGROUP_BASE^SMALL_SUBGROUP_BASE_ADICITY)) Used for mixed-radix FFT. const LARGE_SUBGROUP_ROOT_OF_UNITY: Option<Self::BigInteger> = None; }