use crate::{Domain, fft, ifft};
use bls12_381::Scalar;
#[derive(Debug, PartialEq)]
pub struct Polynomial(Vec<Scalar>);
impl Polynomial {
pub fn new(coeffs: Vec<Scalar>) -> Self {
Polynomial(coeffs)
}
pub fn evaluate(&self, domain: &Domain) -> Evaluations {
let mut evaluations = Evaluations(vec![Scalar::zero(); domain.len()]);
evaluations.0[..self.len()].copy_from_slice(self.0.as_slice());
fft(&mut evaluations.0, &domain.roots(), domain.len());
evaluations
}
pub fn len(&self) -> usize {
self.0.len()
}
pub fn is_empty(&self) -> bool {
self.0.len() == 0
}
}
#[derive(Debug)]
pub struct Evaluations(Vec<Scalar>);
impl Evaluations {
pub fn interpolate(&self, domain: &Domain) -> Polynomial {
let mut polynomial = Polynomial(self.0.clone());
ifft(&mut polynomial.0, &domain.roots());
while polynomial.0.last() == Some(&Scalar::zero()) {
polynomial.0.pop();
}
polynomial
}
pub fn len(&self) -> usize {
self.0.len()
}
pub fn is_empty(&self) -> bool {
self.0.len() == 0
}
}