mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-04 14:53:08 +00:00
* Working "faster" inverse algo, using u128s. * Faster inverse_2exp for large exp. * More inverse tests. * Make f, g u64. * Comments. * Unroll first two iterations. * Fix bug and re-unroll first two iterations. * Simplify loop. * Refactoring and documentation. * Clean up testing. * Move inverse code to inversion.rs; use in GoldilocksField. * Bench quartic Goldilocks extension too. * cargo fmt * Add more documentation. * Address Jakub's comments.
101 lines
3.0 KiB
Rust
101 lines
3.0 KiB
Rust
#![feature(destructuring_assignment)]
|
|
|
|
use criterion::{criterion_group, criterion_main, BatchSize, Criterion};
|
|
use plonky2::field::crandall_field::CrandallField;
|
|
use plonky2::field::extension_field::quartic::QuarticExtension;
|
|
use plonky2::field::field_types::Field;
|
|
use plonky2::field::goldilocks_field::GoldilocksField;
|
|
use tynm::type_name;
|
|
|
|
pub(crate) fn bench_field<F: Field>(c: &mut Criterion) {
|
|
c.bench_function(&format!("mul-throughput<{}>", type_name::<F>()), |b| {
|
|
b.iter_batched(
|
|
|| (F::rand(), F::rand(), F::rand(), F::rand()),
|
|
|(mut x, mut y, mut z, mut w)| {
|
|
for _ in 0..25 {
|
|
(x, y, z, w) = (x * y, y * z, z * w, w * x);
|
|
}
|
|
(x, y, z, w)
|
|
},
|
|
BatchSize::SmallInput,
|
|
)
|
|
});
|
|
|
|
c.bench_function(&format!("mul-latency<{}>", type_name::<F>()), |b| {
|
|
b.iter_batched(
|
|
|| F::rand(),
|
|
|mut x| {
|
|
for _ in 0..100 {
|
|
x = x * x;
|
|
}
|
|
x
|
|
},
|
|
BatchSize::SmallInput,
|
|
)
|
|
});
|
|
|
|
c.bench_function(&format!("add-throughput<{}>", type_name::<F>()), |b| {
|
|
b.iter_batched(
|
|
|| {
|
|
(
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
F::rand(),
|
|
)
|
|
},
|
|
|(mut a, mut b, mut c, mut d, mut e, mut f, mut g, mut h, mut i, mut j)| {
|
|
for _ in 0..10 {
|
|
(a, b, c, d, e, f, g, h, i, j) = (
|
|
a + b,
|
|
b + c,
|
|
c + d,
|
|
d + e,
|
|
e + f,
|
|
f + g,
|
|
g + h,
|
|
h + i,
|
|
i + j,
|
|
j + a,
|
|
);
|
|
}
|
|
(a, b, c, d, e, f, g, h, i, j)
|
|
},
|
|
BatchSize::SmallInput,
|
|
)
|
|
});
|
|
|
|
c.bench_function(&format!("add-latency<{}>", type_name::<F>()), |b| {
|
|
b.iter_batched(
|
|
|| F::rand(),
|
|
|mut x| {
|
|
for _ in 0..100 {
|
|
x = x + x;
|
|
}
|
|
x
|
|
},
|
|
BatchSize::SmallInput,
|
|
)
|
|
});
|
|
|
|
c.bench_function(&format!("try_inverse<{}>", type_name::<F>()), |b| {
|
|
b.iter_batched(|| F::rand(), |x| x.try_inverse(), BatchSize::SmallInput)
|
|
});
|
|
}
|
|
|
|
fn criterion_benchmark(c: &mut Criterion) {
|
|
bench_field::<CrandallField>(c);
|
|
bench_field::<GoldilocksField>(c);
|
|
bench_field::<QuarticExtension<CrandallField>>(c);
|
|
bench_field::<QuarticExtension<GoldilocksField>>(c);
|
|
}
|
|
|
|
criterion_group!(benches, criterion_benchmark);
|
|
criterion_main!(benches);
|