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 44 45 46 47 48 49 50 51
// 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/>. //! This crate implements functions for manipulating polynomials over finite fields, //! including FFTs. pub mod domain; pub use domain::EvaluationDomain; pub mod evaluations; pub use evaluations::Evaluations; pub mod polynomial; pub use polynomial::{DenseOrSparsePolynomial, DensePolynomial, SparsePolynomial}; #[cfg(test)] mod tests; use snarkvm_fields::FftField; /// Types that can be FFT-ed must implement this trait. pub trait DomainCoeff<F: FftField>: Copy + Send + Sync + snarkvm_fields::Zero + core::ops::AddAssign + core::ops::SubAssign + core::ops::MulAssign<F> { } impl<T, F> DomainCoeff<F> for T where F: FftField, T: Copy + Send + Sync + snarkvm_fields::Zero + core::ops::AddAssign + core::ops::SubAssign + core::ops::MulAssign<F>, { }