mirror of
https://github.com/arnaucube/hyperplonk.git
synced 2026-01-12 00:51:27 +01:00
perm check (#62)
Co-authored-by: Charles Chen <chancharles92@gmail.com>
This commit is contained in:
@@ -1,11 +1,14 @@
|
||||
use arithmetic::{VPAuxInfo, VirtualPolynomial};
|
||||
use ark_bls12_381::Fr;
|
||||
use ark_bls12_381::{Bls12_381, Fr};
|
||||
use ark_poly::{DenseMultilinearExtension, MultilinearExtension};
|
||||
use ark_std::{test_rng, UniformRand};
|
||||
use ark_std::test_rng;
|
||||
use pcs::{prelude::KZGMultilinearPCS, PolynomialCommitmentScheme};
|
||||
use poly_iop::prelude::{
|
||||
identity_permutation_mle, PermutationCheck, PolyIOP, PolyIOPErrors, SumCheck, ZeroCheck,
|
||||
};
|
||||
use std::{marker::PhantomData, time::Instant};
|
||||
use std::{marker::PhantomData, rc::Rc, time::Instant};
|
||||
|
||||
type KZG = KZGMultilinearPCS<Bls12_381>;
|
||||
|
||||
fn main() -> Result<(), PolyIOPErrors> {
|
||||
bench_permutation_check()?;
|
||||
@@ -135,6 +138,9 @@ fn bench_permutation_check() -> Result<(), PolyIOPErrors> {
|
||||
let mut rng = test_rng();
|
||||
|
||||
for nv in 4..20 {
|
||||
let srs = KZG::gen_srs_for_testing(&mut rng, nv + 1)?;
|
||||
let (pcs_param, _) = KZG::trim(&srs, nv + 1, Some(nv + 1))?;
|
||||
|
||||
let repetition = if nv < 10 {
|
||||
100
|
||||
} else if nv < 20 {
|
||||
@@ -143,34 +149,22 @@ fn bench_permutation_check() -> Result<(), PolyIOPErrors> {
|
||||
10
|
||||
};
|
||||
|
||||
let w = DenseMultilinearExtension::rand(nv, &mut rng);
|
||||
let w = Rc::new(DenseMultilinearExtension::rand(nv, &mut rng));
|
||||
|
||||
// s_perm is the identity map
|
||||
let s_perm = identity_permutation_mle(nv);
|
||||
|
||||
let proof = {
|
||||
let start = Instant::now();
|
||||
let mut transcript = <PolyIOP<Fr> as PermutationCheck<Fr>>::init_transcript();
|
||||
let mut transcript =
|
||||
<PolyIOP<Fr> as PermutationCheck<Bls12_381, KZG>>::init_transcript();
|
||||
transcript.append_message(b"testing", b"initializing transcript for testing")?;
|
||||
|
||||
let mut challenge =
|
||||
<PolyIOP<Fr> as PermutationCheck<Fr>>::generate_challenge(&mut transcript)?;
|
||||
|
||||
let prod_x_and_aux = <PolyIOP<Fr> as PermutationCheck<Fr>>::compute_prod_evals(
|
||||
&challenge, &w, &w, &s_perm,
|
||||
)?;
|
||||
|
||||
let prod_x_binding = mock_commit(&prod_x_and_aux[0]);
|
||||
|
||||
<PolyIOP<Fr> as PermutationCheck<Fr>>::update_challenge(
|
||||
&mut challenge,
|
||||
&mut transcript,
|
||||
&prod_x_binding,
|
||||
)?;
|
||||
|
||||
let proof = <PolyIOP<Fr> as PermutationCheck<Fr>>::prove(
|
||||
&prod_x_and_aux,
|
||||
&challenge,
|
||||
let (proof, _q_x) = <PolyIOP<Fr> as PermutationCheck<Bls12_381, KZG>>::prove(
|
||||
&pcs_param,
|
||||
&w,
|
||||
&w,
|
||||
&s_perm,
|
||||
&mut transcript,
|
||||
)?;
|
||||
|
||||
@@ -190,10 +184,14 @@ fn bench_permutation_check() -> Result<(), PolyIOPErrors> {
|
||||
};
|
||||
|
||||
let start = Instant::now();
|
||||
let mut transcript = <PolyIOP<Fr> as PermutationCheck<Fr>>::init_transcript();
|
||||
let mut transcript =
|
||||
<PolyIOP<Fr> as PermutationCheck<Bls12_381, KZG>>::init_transcript();
|
||||
transcript.append_message(b"testing", b"initializing transcript for testing")?;
|
||||
let _subclaim =
|
||||
<PolyIOP<Fr> as PermutationCheck<Fr>>::verify(&proof, &poly_info, &mut transcript)?;
|
||||
let _perm_check_sum_claim = <PolyIOP<Fr> as PermutationCheck<Bls12_381, KZG>>::verify(
|
||||
&proof,
|
||||
&poly_info,
|
||||
&mut transcript,
|
||||
)?;
|
||||
println!(
|
||||
"permutation check verification time for {} variables: {} ns",
|
||||
nv,
|
||||
@@ -206,8 +204,3 @@ fn bench_permutation_check() -> Result<(), PolyIOPErrors> {
|
||||
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn mock_commit(_f: &DenseMultilinearExtension<Fr>) -> Fr {
|
||||
let mut rng = test_rng();
|
||||
Fr::rand(&mut rng)
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user