Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix-tob-scroll-21 #59

Merged
merged 2 commits into from
Nov 30, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions halo2_proofs/src/helpers.rs
Original file line number Diff line number Diff line change
Expand Up @@ -48,6 +48,10 @@ pub fn field_to_bn<F: FieldExt>(f: &F) -> BigUint {

/// Input a big integer `bn`, compute a field element `f`
/// such that `f == bn % F::MODULUS`.
/// Require:
/// - bn is less than 512 bits.
/// Return:
/// - bn mod F::MODULUS when bn > F::MODULUS
pub fn bn_to_field<F: FieldExt>(bn: &BigUint) -> F {
let mut buf = bn.to_bytes_le();
buf.resize(64, 0u8);
Expand Down
8 changes: 4 additions & 4 deletions halo2_proofs/src/poly/kzg/commitment.rs
Original file line number Diff line number Diff line change
Expand Up @@ -21,12 +21,12 @@ use super::msm::MSMKZG;
/// These are the public parameters for the polynomial commitment scheme.
#[derive(Debug, Clone)]
pub struct ParamsKZG<E: Engine> {
pub(crate) k: u32,
pub k: u32,
pub n: u64,
pub(crate) g: Vec<E::G1Affine>,
pub g: Vec<E::G1Affine>,
pub g_lagrange: Vec<E::G1Affine>,
pub(crate) g2: E::G2Affine,
pub(crate) s_g2: E::G2Affine,
pub g2: E::G2Affine,
pub s_g2: E::G2Affine,
}

/// Umbrella commitment scheme construction for all KZG variants
Expand Down
Loading