logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-06 07:43:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

make rest of gates public

Browse Source
This commit is contained in:
Sebastien La Duca 2022-08-02 16:20:58 -04:00
parent 002b568a12
commit 5563176bad
5 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
plonky2/src/gates/exponentiation.rs
View File

@ -23,7 +23,7 @@ use crate::plonk::vars::{
/// A gate for raising a value to a power. /// A gate for raising a value to a power.
#[derive(Clone, Debug)] #[derive(Clone, Debug)]
pub(crate) struct ExponentiationGate<F: RichField + Extendable<D>, const D: usize> { pub struct ExponentiationGate<F: RichField + Extendable<D>, const D: usize> {
pub num_power_bits: usize, pub num_power_bits: usize,
pub _phantom: PhantomData<F>, pub _phantom: PhantomData<F>,
} }

2
plonky2/src/gates/interpolation.rs
View File

@ -22,7 +22,7 @@ use crate::plonk::vars::{EvaluationTargets, EvaluationVars, EvaluationVarsBase};
/// Interpolation gate with constraints of degree at most `1<<subgroup_bits`. /// Interpolation gate with constraints of degree at most `1<<subgroup_bits`.
/// `eval_unfiltered_recursively` uses less gates than `LowDegreeInterpolationGate`. /// `eval_unfiltered_recursively` uses less gates than `LowDegreeInterpolationGate`.
#[derive(Copy, Clone, Debug)] #[derive(Copy, Clone, Debug)]
pub(crate) struct HighDegreeInterpolationGate<F: RichField + Extendable<D>, const D: usize> { pub struct HighDegreeInterpolationGate<F: RichField + Extendable<D>, const D: usize> {
pub subgroup_bits: usize, pub subgroup_bits: usize,
_phantom: PhantomData<F>, _phantom: PhantomData<F>,
} }

2
plonky2/src/gates/low_degree_interpolation.rs
View File

@ -23,7 +23,7 @@ use crate::plonk::vars::{EvaluationTargets, EvaluationVars, EvaluationVarsBase};
/// Interpolation gate with constraints of degree 2. /// Interpolation gate with constraints of degree 2.
/// `eval_unfiltered_recursively` uses more gates than `HighDegreeInterpolationGate`. /// `eval_unfiltered_recursively` uses more gates than `HighDegreeInterpolationGate`.
#[derive(Copy, Clone, Debug)] #[derive(Copy, Clone, Debug)]
pub(crate) struct LowDegreeInterpolationGate<F: RichField + Extendable<D>, const D: usize> { pub struct LowDegreeInterpolationGate<F: RichField + Extendable<D>, const D: usize> {
pub subgroup_bits: usize, pub subgroup_bits: usize,
_phantom: PhantomData<F>, _phantom: PhantomData<F>,
} }

2
plonky2/src/gates/random_access.rs
View File

@ -23,7 +23,7 @@ use crate::plonk::vars::{
/// A gate for checking that a particular element of a list matches a given value. /// A gate for checking that a particular element of a list matches a given value.
#[derive(Copy, Clone, Debug)] #[derive(Copy, Clone, Debug)]
pub(crate) struct RandomAccessGate<F: RichField + Extendable<D>, const D: usize> { pub struct RandomAccessGate<F: RichField + Extendable<D>, const D: usize> {
pub bits: usize, pub bits: usize,
pub num_copies: usize, pub num_copies: usize,
pub num_extra_constants: usize, pub num_extra_constants: usize,

2
plonky2/src/gates/selectors.rs
View File

@ -10,7 +10,7 @@ use crate::hash::hash_types::RichField;
pub(crate) const UNUSED_SELECTOR: usize = u32::MAX as usize; pub(crate) const UNUSED_SELECTOR: usize = u32::MAX as usize;
#[derive(Debug, Clone)] #[derive(Debug, Clone)]
pub(crate) struct SelectorsInfo { pub struct SelectorsInfo {
pub(crate) selector_indices: Vec<usize>, pub(crate) selector_indices: Vec<usize>,
pub(crate) groups: Vec<Range<usize>>, pub(crate) groups: Vec<Range<usize>>,
} }