Skip to content

Commit

Permalink
Remove unused function. (#816)
Browse files Browse the repository at this point in the history
  • Loading branch information
alonh5 authored Sep 2, 2024
1 parent 5bd3f1d commit 1ee6a70
Showing 1 changed file with 1 addition and 19 deletions.
20 changes: 1 addition & 19 deletions crates/prover/src/core/utils.rs
Original file line number Diff line number Diff line change
Expand Up @@ -3,12 +3,9 @@ use std::ops::{Add, Mul, Sub};

use num_traits::{One, Zero};

use super::circle::CirclePoint;
use super::constraints::point_vanishing;
use super::fields::m31::BaseField;
use super::fields::qm31::SecureField;
use super::fields::{Field, FieldExpOps};
use super::poly::circle::CircleDomain;
use super::fields::Field;

pub trait IteratorMutExt<'a, T: 'a>: Iterator<Item = &'a mut T> {
fn assign(self, other: impl IntoIterator<Item = T>)
Expand Down Expand Up @@ -174,21 +171,6 @@ where
res - z
}

pub fn point_vanish_denominator_inverses(
domain: CircleDomain,
vanish_point: CirclePoint<BaseField>,
) -> Vec<BaseField> {
let mut denoms = vec![];
for point in domain.iter() {
// TODO(AlonH): Use `point_vanishing_fraction` instead of `point_vanishing` everywhere.
denoms.push(point_vanishing(vanish_point, point));
}
bit_reverse(&mut denoms);
let mut denom_inverses = vec![BaseField::zero(); 1 << (domain.log_size())];
BaseField::batch_inverse(&denoms, &mut denom_inverses);
denom_inverses
}

#[cfg(test)]
mod tests {
use itertools::Itertools;
Expand Down

0 comments on commit 1ee6a70

Please sign in to comment.