Compare commits
9 Commits
c5b5504dce
...
1f5587c8e6
Author | SHA1 | Date |
---|---|---|
Roman Zajic | 1f5587c8e6 | |
Daniel Sanchez | 9adfbdddc6 | |
Roman | 1612a7d83d | |
Roman | f51a763ca3 | |
Roman | f1a621fa11 | |
Roman | 2e4ec9a586 | |
Roman Zajic | 21388e142a | |
Roman | 59169be873 | |
Roman | 39ace002e9 |
|
@ -22,6 +22,7 @@ pub struct Branches<Id> {
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
#[derive(Clone, Debug)]
|
||||||
|
#[cfg_attr(test, derive(PartialEq))]
|
||||||
pub struct Branch<Id> {
|
pub struct Branch<Id> {
|
||||||
id: Id,
|
id: Id,
|
||||||
parent: Id,
|
parent: Id,
|
||||||
|
@ -131,6 +132,7 @@ where
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Debug, Clone, Error)]
|
#[derive(Debug, Clone, Error)]
|
||||||
|
#[cfg_attr(test, derive(PartialEq))]
|
||||||
pub enum Error<Id> {
|
pub enum Error<Id> {
|
||||||
#[error("Parent block: {0:?} is not know to this node")]
|
#[error("Parent block: {0:?} is not know to this node")]
|
||||||
ParentMissing(Id),
|
ParentMissing(Id),
|
||||||
|
@ -220,7 +222,7 @@ where
|
||||||
|
|
||||||
#[cfg(test)]
|
#[cfg(test)]
|
||||||
pub mod tests {
|
pub mod tests {
|
||||||
use super::Cryptarchia;
|
use super::{Cryptarchia, Error, Slot};
|
||||||
use crate::Config;
|
use crate::Config;
|
||||||
use std::hash::{DefaultHasher, Hash, Hasher};
|
use std::hash::{DefaultHasher, Hash, Hasher};
|
||||||
|
|
||||||
|
@ -320,4 +322,58 @@ pub mod tests {
|
||||||
res[..8].copy_from_slice(&hash.to_be_bytes());
|
res[..8].copy_from_slice(&hash.to_be_bytes());
|
||||||
res
|
res
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn test_getters() {
|
||||||
|
let engine = Cryptarchia::from_genesis([0; 32], config());
|
||||||
|
let parent = engine.genesis();
|
||||||
|
|
||||||
|
// Get branch directly from HashMap
|
||||||
|
let branch1 = engine
|
||||||
|
.branches
|
||||||
|
.get(&parent)
|
||||||
|
.ok_or("At least one branch should be there");
|
||||||
|
|
||||||
|
let branches = engine.branches();
|
||||||
|
|
||||||
|
// Get branch using getter
|
||||||
|
let branch2 = branches
|
||||||
|
.get(&parent)
|
||||||
|
.ok_or("At least one branch should be there");
|
||||||
|
|
||||||
|
assert_eq!(branch1, branch2);
|
||||||
|
assert_eq!(
|
||||||
|
branch1.expect("id is not set").id(),
|
||||||
|
branch2.expect("id is not set").id()
|
||||||
|
);
|
||||||
|
assert_eq!(
|
||||||
|
branch1.expect("parent is not set").parent(),
|
||||||
|
branch2.expect("parent is not set").parent()
|
||||||
|
);
|
||||||
|
assert_eq!(
|
||||||
|
branch1.expect("slot is not set").slot(),
|
||||||
|
branch2.expect("slot is not set").slot()
|
||||||
|
);
|
||||||
|
assert_eq!(
|
||||||
|
branch1.expect("length is not set").length(),
|
||||||
|
branch2.expect("length is not set").length()
|
||||||
|
);
|
||||||
|
|
||||||
|
let slot = Slot::genesis();
|
||||||
|
|
||||||
|
assert_eq!(slot + 10u64, Slot::from(10));
|
||||||
|
|
||||||
|
let strange_engine = Cryptarchia::from_genesis([100; 32], config());
|
||||||
|
let not_a_parent = strange_engine.genesis();
|
||||||
|
|
||||||
|
_ = match branches
|
||||||
|
.get(¬_a_parent)
|
||||||
|
.ok_or(Error::ParentMissing(not_a_parent))
|
||||||
|
{
|
||||||
|
Ok(_) => panic!("Parent should not be related to this branch"),
|
||||||
|
Err(e) => {
|
||||||
|
assert_ne!(e, Error::ParentMissing(parent));
|
||||||
|
}
|
||||||
|
};
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -15,23 +15,34 @@ ark-poly = { version = "0.4.2" }
|
||||||
ark-poly-commit = { version = "0.4.0" }
|
ark-poly-commit = { version = "0.4.0" }
|
||||||
ark-serialize = { version = "0.4" }
|
ark-serialize = { version = "0.4" }
|
||||||
blst = "0.3.11"
|
blst = "0.3.11"
|
||||||
|
derive_more = "0.99"
|
||||||
num-bigint = "0.4.4"
|
num-bigint = "0.4.4"
|
||||||
thiserror = "1.0.58"
|
thiserror = "1.0.58"
|
||||||
num-traits = "0.2.18"
|
num-traits = "0.2.18"
|
||||||
rand = "0.8.5"
|
rand = "0.8.5"
|
||||||
|
rayon = { version = "1.10", optional = true }
|
||||||
|
|
||||||
|
|
||||||
[dev-dependencies]
|
[dev-dependencies]
|
||||||
divan = "0.1"
|
divan = "0.1"
|
||||||
rayon = "1.10"
|
|
||||||
|
|
||||||
[[bench]]
|
[[bench]]
|
||||||
name = "kzg"
|
name = "kzg"
|
||||||
harness = false
|
harness = false
|
||||||
|
|
||||||
|
[[bench]]
|
||||||
|
name = "fft"
|
||||||
|
harness = false
|
||||||
|
|
||||||
|
[[bench]]
|
||||||
|
name = "fk20"
|
||||||
|
harness = false
|
||||||
|
|
||||||
[features]
|
[features]
|
||||||
default = ["single"]
|
default = ["single"]
|
||||||
single = []
|
single = []
|
||||||
parallel = [
|
parallel = [
|
||||||
|
"rayon",
|
||||||
"ark-ff/parallel",
|
"ark-ff/parallel",
|
||||||
"ark-ff/asm",
|
"ark-ff/asm",
|
||||||
"ark-ff/rayon",
|
"ark-ff/rayon",
|
||||||
|
|
|
@ -0,0 +1,23 @@
|
||||||
|
use ark_bls12_381::{Fr, G1Affine, G1Projective};
|
||||||
|
use ark_ec::AffineRepr;
|
||||||
|
use ark_ff::BigInt;
|
||||||
|
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain};
|
||||||
|
use divan::counter::ItemsCount;
|
||||||
|
use divan::{black_box, Bencher};
|
||||||
|
fn main() {
|
||||||
|
divan::main()
|
||||||
|
}
|
||||||
|
|
||||||
|
#[divan::bench(args = [16, 32, 64, 128, 256, 512, 1024, 2048, 4096])]
|
||||||
|
fn compute_ark_fft_for_size(bencher: Bencher, size: usize) {
|
||||||
|
bencher
|
||||||
|
.with_inputs(|| {
|
||||||
|
let domain = GeneralEvaluationDomain::<Fr>::new(size).unwrap();
|
||||||
|
let buff: Vec<G1Projective> = (0..size)
|
||||||
|
.map(|i| G1Affine::identity().mul_bigint(BigInt::<4>::from(i as u64)))
|
||||||
|
.collect();
|
||||||
|
(buff, domain)
|
||||||
|
})
|
||||||
|
.input_counter(move |_| ItemsCount::new(size))
|
||||||
|
.bench_refs(|(buff, domain)| black_box(domain.fft(buff)));
|
||||||
|
}
|
|
@ -0,0 +1,67 @@
|
||||||
|
use ark_bls12_381::{Bls12_381, Fr, G1Affine, G1Projective};
|
||||||
|
use ark_ec::AffineRepr;
|
||||||
|
use ark_ff::BigInt;
|
||||||
|
use ark_poly::univariate::DensePolynomial;
|
||||||
|
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain};
|
||||||
|
use ark_poly_commit::kzg10::KZG10;
|
||||||
|
use divan::counter::ItemsCount;
|
||||||
|
use divan::Bencher;
|
||||||
|
use kzgrs::fk20::fk20_batch_generate_elements_proofs;
|
||||||
|
use kzgrs::{bytes_to_polynomial, GlobalParameters, BYTES_PER_FIELD_ELEMENT};
|
||||||
|
use once_cell::sync::Lazy;
|
||||||
|
use rand::SeedableRng;
|
||||||
|
#[cfg(feature = "parallel")]
|
||||||
|
use rayon::iter::{IntoParallelIterator, ParallelIterator};
|
||||||
|
use std::hint::black_box;
|
||||||
|
|
||||||
|
fn main() {
|
||||||
|
divan::main()
|
||||||
|
}
|
||||||
|
|
||||||
|
static GLOBAL_PARAMETERS: Lazy<GlobalParameters> = Lazy::new(|| {
|
||||||
|
let mut rng = rand::rngs::StdRng::seed_from_u64(1987);
|
||||||
|
KZG10::<Bls12_381, DensePolynomial<Fr>>::setup(4096, true, &mut rng).unwrap()
|
||||||
|
});
|
||||||
|
|
||||||
|
#[divan::bench(args = [16, 32, 64, 128, 256, 512, 1024, 2048, 4096])]
|
||||||
|
fn compute_fk20_proofs_for_size(bencher: Bencher, size: usize) {
|
||||||
|
bencher
|
||||||
|
.with_inputs(|| {
|
||||||
|
let buff: Vec<_> = (0..BYTES_PER_FIELD_ELEMENT * size)
|
||||||
|
.map(|i| (i % 255) as u8)
|
||||||
|
.rev()
|
||||||
|
.collect();
|
||||||
|
let domain = GeneralEvaluationDomain::new(size).unwrap();
|
||||||
|
let (_, poly) = bytes_to_polynomial::<BYTES_PER_FIELD_ELEMENT>(&buff, domain).unwrap();
|
||||||
|
poly
|
||||||
|
})
|
||||||
|
.input_counter(move |_| ItemsCount::new(size))
|
||||||
|
.bench_refs(|(poly)| {
|
||||||
|
black_box(fk20_batch_generate_elements_proofs(
|
||||||
|
poly,
|
||||||
|
&GLOBAL_PARAMETERS,
|
||||||
|
))
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
#[cfg(feature = "parallel")]
|
||||||
|
#[divan::bench(args = [16, 32, 64, 128, 256, 512, 1024, 2048, 4096])]
|
||||||
|
fn compute_parallel_fk20_proofs_for_size(bencher: Bencher, size: usize) {
|
||||||
|
let thread_count: usize = rayon::max_num_threads().min(rayon::current_num_threads());
|
||||||
|
bencher
|
||||||
|
.with_inputs(|| {
|
||||||
|
let buff: Vec<_> = (0..BYTES_PER_FIELD_ELEMENT * size)
|
||||||
|
.map(|i| (i % 255) as u8)
|
||||||
|
.rev()
|
||||||
|
.collect();
|
||||||
|
let domain = GeneralEvaluationDomain::new(size).unwrap();
|
||||||
|
let (_, poly) = bytes_to_polynomial::<BYTES_PER_FIELD_ELEMENT>(&buff, domain).unwrap();
|
||||||
|
poly
|
||||||
|
})
|
||||||
|
.input_counter(move |_| ItemsCount::new(size * thread_count))
|
||||||
|
.bench_refs(|(poly)| {
|
||||||
|
black_box((0..thread_count).into_par_iter().for_each(|_| {
|
||||||
|
fk20_batch_generate_elements_proofs(poly, &GLOBAL_PARAMETERS);
|
||||||
|
}))
|
||||||
|
});
|
||||||
|
}
|
|
@ -3,10 +3,12 @@ use ark_poly::univariate::DensePolynomial;
|
||||||
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain};
|
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain};
|
||||||
use ark_poly_commit::kzg10::{UniversalParams, KZG10};
|
use ark_poly_commit::kzg10::{UniversalParams, KZG10};
|
||||||
use divan::counter::ItemsCount;
|
use divan::counter::ItemsCount;
|
||||||
use divan::{black_box, counter::BytesCount, AllocProfiler, Bencher};
|
use divan::{black_box, Bencher};
|
||||||
use once_cell::sync::Lazy;
|
use once_cell::sync::Lazy;
|
||||||
use rand::RngCore;
|
use rand::RngCore;
|
||||||
|
#[cfg(feature = "parallel")]
|
||||||
use rayon::iter::IntoParallelIterator;
|
use rayon::iter::IntoParallelIterator;
|
||||||
|
#[cfg(feature = "parallel")]
|
||||||
use rayon::iter::ParallelIterator;
|
use rayon::iter::ParallelIterator;
|
||||||
|
|
||||||
use kzgrs::{common::bytes_to_polynomial_unchecked, kzg::*};
|
use kzgrs::{common::bytes_to_polynomial_unchecked, kzg::*};
|
||||||
|
@ -46,6 +48,7 @@ fn commit_single_polynomial_with_element_count(bencher: Bencher, element_count:
|
||||||
.bench_refs(|(_evals, poly)| black_box(commit_polynomial(poly, &GLOBAL_PARAMETERS)));
|
.bench_refs(|(_evals, poly)| black_box(commit_polynomial(poly, &GLOBAL_PARAMETERS)));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[cfg(feature = "parallel")]
|
||||||
#[allow(non_snake_case)]
|
#[allow(non_snake_case)]
|
||||||
#[divan::bench(args = [16, 32, 64, 128, 256, 512, 1024, 2048, 4096])]
|
#[divan::bench(args = [16, 32, 64, 128, 256, 512, 1024, 2048, 4096])]
|
||||||
fn commit_polynomial_with_element_count_parallelized(bencher: Bencher, element_count: usize) {
|
fn commit_polynomial_with_element_count_parallelized(bencher: Bencher, element_count: usize) {
|
||||||
|
@ -58,7 +61,7 @@ fn commit_polynomial_with_element_count_parallelized(bencher: Bencher, element_c
|
||||||
})
|
})
|
||||||
.input_counter(move |(_evals, _poly)| ItemsCount::new(threads))
|
.input_counter(move |(_evals, _poly)| ItemsCount::new(threads))
|
||||||
.bench_refs(|(_evals, poly)| {
|
.bench_refs(|(_evals, poly)| {
|
||||||
let commitments: Vec<_> = (0..threads)
|
let _commitments: Vec<_> = (0..threads)
|
||||||
.into_par_iter()
|
.into_par_iter()
|
||||||
.map(|_| commit_polynomial(poly, &GLOBAL_PARAMETERS))
|
.map(|_| commit_polynomial(poly, &GLOBAL_PARAMETERS))
|
||||||
.collect();
|
.collect();
|
||||||
|
@ -114,6 +117,7 @@ fn compute_batch_proofs(bencher: Bencher, element_count: usize) {
|
||||||
// This is a test on how will perform by having a wrapping rayon on top of the proof computation
|
// This is a test on how will perform by having a wrapping rayon on top of the proof computation
|
||||||
// ark libraries already use rayon underneath so no great improvements are probably come up from this.
|
// ark libraries already use rayon underneath so no great improvements are probably come up from this.
|
||||||
// But it should help reusing the same thread pool for all jobs saving a little time.
|
// But it should help reusing the same thread pool for all jobs saving a little time.
|
||||||
|
#[cfg(feature = "parallel")]
|
||||||
#[allow(non_snake_case)]
|
#[allow(non_snake_case)]
|
||||||
#[divan::bench(args = [128, 256, 512, 1024], sample_count = 3, sample_size = 5)]
|
#[divan::bench(args = [128, 256, 512, 1024], sample_count = 3, sample_size = 5)]
|
||||||
fn compute_parallelize_batch_proofs(bencher: Bencher, element_count: usize) {
|
fn compute_parallelize_batch_proofs(bencher: Bencher, element_count: usize) {
|
||||||
|
|
|
@ -8,6 +8,7 @@ use ark_ff::Zero;
|
||||||
use ark_poly::domain::general::GeneralEvaluationDomain;
|
use ark_poly::domain::general::GeneralEvaluationDomain;
|
||||||
use ark_poly::evaluations::univariate::Evaluations;
|
use ark_poly::evaluations::univariate::Evaluations;
|
||||||
use ark_poly::univariate::DensePolynomial;
|
use ark_poly::univariate::DensePolynomial;
|
||||||
|
use ark_poly::EvaluationDomain;
|
||||||
use blst::BLST_ERROR;
|
use blst::BLST_ERROR;
|
||||||
use num_bigint::BigUint;
|
use num_bigint::BigUint;
|
||||||
use thiserror::Error;
|
use thiserror::Error;
|
||||||
|
@ -122,6 +123,11 @@ pub fn field_element_from_bytes_le(b: &[u8]) -> FieldElement {
|
||||||
FieldElement::from(BigUint::from_bytes_le(b))
|
FieldElement::from(BigUint::from_bytes_le(b))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
pub fn compute_roots_of_unity(size: usize) -> Vec<Fr> {
|
||||||
|
let domain = GeneralEvaluationDomain::new(size).unwrap();
|
||||||
|
domain.elements().take(size).collect()
|
||||||
|
}
|
||||||
|
|
||||||
#[cfg(test)]
|
#[cfg(test)]
|
||||||
mod test {
|
mod test {
|
||||||
use super::{bytes_to_evaluations, bytes_to_polynomial, KzgRsError};
|
use super::{bytes_to_evaluations, bytes_to_polynomial, KzgRsError};
|
||||||
|
|
|
@ -0,0 +1,114 @@
|
||||||
|
use crate::{GlobalParameters, Polynomial, Proof};
|
||||||
|
use ark_bls12_381::{Fr, G1Affine, G1Projective};
|
||||||
|
use ark_ec::CurveGroup;
|
||||||
|
use ark_ff::Field;
|
||||||
|
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain};
|
||||||
|
use num_traits::Zero;
|
||||||
|
|
||||||
|
fn toeplitz1(global_parameters: &[G1Affine], polynomial_degree: usize) -> Vec<G1Projective> {
|
||||||
|
debug_assert_eq!(global_parameters.len(), polynomial_degree);
|
||||||
|
debug_assert!(polynomial_degree.is_power_of_two());
|
||||||
|
let domain: GeneralEvaluationDomain<Fr> = GeneralEvaluationDomain::new(polynomial_degree * 2)
|
||||||
|
.expect("Domain should be able to build");
|
||||||
|
let vector_extended: Vec<G1Projective> = global_parameters
|
||||||
|
.iter()
|
||||||
|
.copied()
|
||||||
|
.map(G1Projective::from)
|
||||||
|
.chain(std::iter::repeat_with(G1Projective::zero).take(polynomial_degree))
|
||||||
|
.collect();
|
||||||
|
domain.fft(&vector_extended)
|
||||||
|
}
|
||||||
|
|
||||||
|
fn toeplitz2(coefficients: &[Fr], extended_vector: &[G1Projective]) -> Vec<G1Projective> {
|
||||||
|
debug_assert!(coefficients.len().is_power_of_two());
|
||||||
|
let domain: GeneralEvaluationDomain<Fr> =
|
||||||
|
GeneralEvaluationDomain::new(coefficients.len()).expect("Domain should be able to build");
|
||||||
|
let toeplitz_coefficients_fft = domain.fft(coefficients);
|
||||||
|
extended_vector
|
||||||
|
.iter()
|
||||||
|
.copied()
|
||||||
|
.zip(toeplitz_coefficients_fft)
|
||||||
|
.map(|(v, c)| (v * c))
|
||||||
|
.collect()
|
||||||
|
}
|
||||||
|
|
||||||
|
fn toeplitz3(h_extended_fft: &[G1Projective]) -> Vec<G1Projective> {
|
||||||
|
let domain: GeneralEvaluationDomain<Fr> =
|
||||||
|
GeneralEvaluationDomain::new(h_extended_fft.len()).expect("Domain should be able to build");
|
||||||
|
domain.ifft(h_extended_fft)
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn fk20_batch_generate_elements_proofs(
|
||||||
|
polynomial: &Polynomial,
|
||||||
|
global_parameters: &GlobalParameters,
|
||||||
|
) -> Vec<Proof> {
|
||||||
|
let polynomial_degree = polynomial.len();
|
||||||
|
debug_assert!(polynomial_degree <= global_parameters.powers_of_g.len());
|
||||||
|
debug_assert!(polynomial_degree.is_power_of_two());
|
||||||
|
let domain: GeneralEvaluationDomain<Fr> =
|
||||||
|
GeneralEvaluationDomain::new(polynomial_degree).expect("Domain should be able to build");
|
||||||
|
let global_parameters: Vec<G1Affine> = global_parameters
|
||||||
|
.powers_of_g
|
||||||
|
.iter()
|
||||||
|
.copied()
|
||||||
|
.take(polynomial_degree)
|
||||||
|
.rev()
|
||||||
|
.collect();
|
||||||
|
|
||||||
|
let extended_vector = toeplitz1(&global_parameters, polynomial_degree);
|
||||||
|
let toeplitz_coefficients: Vec<Fr> = std::iter::repeat(Fr::ZERO)
|
||||||
|
.take(polynomial_degree)
|
||||||
|
.chain(polynomial.coeffs.iter().copied())
|
||||||
|
.collect();
|
||||||
|
let h_extended_vector = toeplitz2(&toeplitz_coefficients, &extended_vector);
|
||||||
|
let h_vector = toeplitz3(&h_extended_vector);
|
||||||
|
domain
|
||||||
|
.fft(&h_vector)
|
||||||
|
.into_iter()
|
||||||
|
.map(|g1| Proof {
|
||||||
|
w: g1.into_affine(),
|
||||||
|
random_v: None,
|
||||||
|
})
|
||||||
|
.collect()
|
||||||
|
}
|
||||||
|
|
||||||
|
#[cfg(test)]
|
||||||
|
mod test {
|
||||||
|
use crate::fk20::fk20_batch_generate_elements_proofs;
|
||||||
|
use crate::{
|
||||||
|
common::bytes_to_polynomial, kzg::generate_element_proof, GlobalParameters, Proof,
|
||||||
|
BYTES_PER_FIELD_ELEMENT,
|
||||||
|
};
|
||||||
|
use ark_bls12_381::{Bls12_381, Fr};
|
||||||
|
use ark_poly::univariate::DensePolynomial;
|
||||||
|
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain};
|
||||||
|
use ark_poly_commit::kzg10::KZG10;
|
||||||
|
use once_cell::sync::Lazy;
|
||||||
|
use rand::SeedableRng;
|
||||||
|
|
||||||
|
static GLOBAL_PARAMETERS: Lazy<GlobalParameters> = Lazy::new(|| {
|
||||||
|
let mut rng = rand::rngs::StdRng::seed_from_u64(1987);
|
||||||
|
KZG10::<Bls12_381, DensePolynomial<Fr>>::setup(4096, true, &mut rng).unwrap()
|
||||||
|
});
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn test_generate_proofs() {
|
||||||
|
for size in [16, 32, 64, 128, 256] {
|
||||||
|
let buff: Vec<_> = (0..BYTES_PER_FIELD_ELEMENT * size)
|
||||||
|
.map(|i| (i % 255) as u8)
|
||||||
|
.rev()
|
||||||
|
.collect();
|
||||||
|
let domain = GeneralEvaluationDomain::new(size).unwrap();
|
||||||
|
let (evals, poly) =
|
||||||
|
bytes_to_polynomial::<BYTES_PER_FIELD_ELEMENT>(&buff, domain).unwrap();
|
||||||
|
let polynomial_degree = poly.len();
|
||||||
|
let slow_proofs: Vec<Proof> = (0..polynomial_degree)
|
||||||
|
.map(|i| {
|
||||||
|
generate_element_proof(i, &poly, &evals, &GLOBAL_PARAMETERS, domain).unwrap()
|
||||||
|
})
|
||||||
|
.collect();
|
||||||
|
let fk20_proofs = fk20_batch_generate_elements_proofs(&poly, &GLOBAL_PARAMETERS);
|
||||||
|
assert_eq!(slow_proofs, fk20_proofs);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,4 +1,5 @@
|
||||||
pub mod common;
|
pub mod common;
|
||||||
|
pub mod fk20;
|
||||||
pub mod global_parameters;
|
pub mod global_parameters;
|
||||||
pub mod kzg;
|
pub mod kzg;
|
||||||
pub mod rs;
|
pub mod rs;
|
||||||
|
|
Loading…
Reference in New Issue