polynomials_ecc/
polynomials.rs1use crate::{Domain, fft, ifft};
2use bls12_381::Scalar;
3
4#[derive(Debug, PartialEq)]
6pub struct Polynomial(Vec<Scalar>);
7
8impl Polynomial {
9 pub fn new(coeffs: Vec<Scalar>) -> Self {
11 Polynomial(coeffs)
12 }
13
14 pub fn evaluate(&self, domain: &Domain) -> Evaluations {
16 let mut evaluations = Evaluations(vec![Scalar::zero(); domain.len()]);
17 evaluations.0[..self.len()].copy_from_slice(self.0.as_slice());
18
19 fft(&mut evaluations.0, &domain.roots(), domain.len());
20 evaluations
21 }
22
23 pub fn len(&self) -> usize {
25 self.0.len()
26 }
27
28 pub fn is_empty(&self) -> bool {
30 self.0.len() == 0
31 }
32}
33
34#[derive(Debug)]
36pub struct Evaluations(Vec<Scalar>);
37
38impl Evaluations {
39 pub fn interpolate(&self, domain: &Domain) -> Polynomial {
41 let mut polynomial = Polynomial(self.0.clone());
42
43 ifft(&mut polynomial.0, &domain.roots());
44
45 while polynomial.0.last() == Some(&Scalar::zero()) {
46 polynomial.0.pop();
47 }
48
49 polynomial
50 }
51
52 pub fn len(&self) -> usize {
54 self.0.len()
55 }
56
57 pub fn is_empty(&self) -> bool {
59 self.0.len() == 0
60 }
61}