logos-co
/
nomos-node
mirror of
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Remove innecesary collect in fft_g1

This commit is contained in:
Daniel Sanchez Quiros 2024-06-20 16:28:33 +02:00
parent b187067623
commit c8f2a8f4c9
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
nomos-da/kzgrs/src/fft.rs
View File

@ -4,6 +4,7 @@ use ark_ec::{AffineRepr, CurveGroup};
use ark_ff::{BigInt, BigInteger, FftField, Field, PrimeField}; use ark_ff::{BigInt, BigInteger, FftField, Field, PrimeField};
#[cfg(feature = "parallel")] #[cfg(feature = "parallel")]
use rayon::iter::{IndexedParallelIterator, IntoParallelIterator, ParallelIterator}; use rayon::iter::{IndexedParallelIterator, IntoParallelIterator, ParallelIterator};
use std::ops::Neg;
pub fn fft_g1(vals: &[G1Affine], roots_of_unity: &[Fr]) -> Vec<G1Affine> { pub fn fft_g1(vals: &[G1Affine], roots_of_unity: &[Fr]) -> Vec<G1Affine> {
debug_assert_eq!(vals.len(), roots_of_unity.len()); debug_assert_eq!(vals.len(), roots_of_unity.len());
@ -48,8 +49,8 @@ pub fn fft_g1(vals: &[G1Affine], roots_of_unity: &[Fr]) -> Vec<G1Affine> {
} }
}; };
// Double sized so we can use iterator later on // Double sized so we can use iterator later on
let l: Vec<_> = l.into_iter().cycle().take(original_len).collect(); let l = l.into_iter().cycle().take(original_len);
let r: Vec<_> = r.into_iter().cycle().take(original_len).collect(); let r = r.into_iter().cycle().take(original_len);
let y_times_root = { let y_times_root = {
#[cfg(feature = "parallel")] #[cfg(feature = "parallel")]
@ -62,7 +63,7 @@ pub fn fft_g1(vals: &[G1Affine], roots_of_unity: &[Fr]) -> Vec<G1Affine> {
} }
} }
.enumerate() .enumerate()
.map(|(i, y)| (y * roots_of_unity[i % vals.len()]).into_affine()); .map(|(i, y)| (y * roots_of_unity[i % vals.len()]));
{ {
#[cfg(feature = "parallel")] #[cfg(feature = "parallel")]
@ -80,7 +81,7 @@ pub fn fft_g1(vals: &[G1Affine], roots_of_unity: &[Fr]) -> Vec<G1Affine> {
if i < vals.len() / 2 { if i < vals.len() / 2 {
x + y_times_root x + y_times_root
} else { } else {
x - y_times_root x + y_times_root.neg()
} }
.into_affine() .into_affine()
}) })