mirror of https://github.com/zcash/halo2.git
Merge pull request #86 from pinkiebell/params_pub
Params,ParamsVerifier: make k & n public
This commit is contained in:
commit
763335c95e
|
@ -20,8 +20,11 @@ use std::io;
|
|||
/// These are the prover parameters for the polynomial commitment scheme.
|
||||
#[derive(Debug)]
|
||||
pub struct Params<C: CurveAffine> {
|
||||
pub(crate) k: u32,
|
||||
pub(crate) n: u64,
|
||||
/// This is a common term used for deriving the amount of field elements `n = 1 << k`.
|
||||
/// Also known as the domain size.
|
||||
pub k: u32,
|
||||
/// This represents the amount of available field elements
|
||||
pub n: u64,
|
||||
pub(crate) g: Vec<C>,
|
||||
pub(crate) g_lagrange: Vec<C>,
|
||||
pub(crate) additional_data: Vec<u8>,
|
||||
|
@ -30,8 +33,11 @@ pub struct Params<C: CurveAffine> {
|
|||
/// These are the verifier parameters for the polynomial commitment scheme.
|
||||
#[derive(Debug)]
|
||||
pub struct ParamsVerifier<E: Engine> {
|
||||
pub(crate) k: u32,
|
||||
pub(crate) n: u64,
|
||||
/// This is a common term used for deriving the amount of field elements `n = 1 << k`.
|
||||
/// Also known as the domain size.
|
||||
pub k: u32,
|
||||
/// This represents the amount of available field elements
|
||||
pub n: u64,
|
||||
pub(crate) g1: E::G1Affine,
|
||||
pub(crate) g2: E::G2Affine,
|
||||
pub(crate) s_g2: E::G2Affine,
|
||||
|
|
Loading…
Reference in New Issue