diff --git a/rustdoc/arrabbiata/columns/enum.ChallengeTerm.html b/rustdoc/arrabbiata/columns/enum.ChallengeTerm.html index 1634274e94..efcf79b029 100644 --- a/rustdoc/arrabbiata/columns/enum.ChallengeTerm.html +++ b/rustdoc/arrabbiata/columns/enum.ChallengeTerm.html @@ -8,7 +8,7 @@
§

Beta

Both challenges used in the permutation argument

§

Gamma

§

HomogenousChallenge

Challenge to homogenize the constraints

§

R

Random coin used to aggregate witnesses while folding

-

Trait Implementations§

source§

impl<'a> AlphaChallengeTerm<'a> for ChallengeTerm

source§

const ALPHA: Self = Self::Alpha

source§

impl Clone for ChallengeTerm

source§

fn clone(&self) -> ChallengeTerm

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for ChallengeTerm

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for ChallengeTerm

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where +

Trait Implementations§

source§

impl<'a> AlphaChallengeTerm<'a> for ChallengeTerm

source§

const ALPHA: Self = Self::Alpha

source§

impl Clone for ChallengeTerm

source§

fn clone(&self) -> ChallengeTerm

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for ChallengeTerm

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for ChallengeTerm

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl Display for ChallengeTerm

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<F: Field> Index<ChallengeTerm> for Challenges<F>

§

type Output = F

The returned type after indexing.
source§

fn index(&self, term: ChallengeTerm) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl PartialEq<ChallengeTerm> for ChallengeTerm

source§

fn eq(&self, other: &ChallengeTerm) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Serialize for ChallengeTerm

source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where @@ -17,16 +17,16 @@ T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, - K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<'a, ChallengeTerm> FormattedOutput for ChallengeTermwhere - ChallengeTerm: AlphaChallengeTerm<'a>,

§

fn is_alpha(&self) -> bool

§

fn ocaml( + K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<'a, ChallengeTerm> FormattedOutput for ChallengeTermwhere + ChallengeTerm: AlphaChallengeTerm<'a>,

source§

fn is_alpha(&self) -> bool

source§

fn ocaml( &self, - _cache: &mut HashMap<CacheId, ChallengeTerm, RandomState> -) -> String

§

fn latex( + _cache: &mut HashMap<CacheId, ChallengeTerm, RandomState> +) -> String

source§

fn latex( &self, - _cache: &mut HashMap<CacheId, ChallengeTerm, RandomState> -) -> String

§

fn text( + _cache: &mut HashMap<CacheId, ChallengeTerm, RandomState> +) -> String

source§

fn text( &self, - _cache: &mut HashMap<CacheId, ChallengeTerm, RandomState> + _cache: &mut HashMap<CacheId, ChallengeTerm, RandomState> ) -> String

source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

diff --git a/rustdoc/arrabbiata/columns/enum.Column.html b/rustdoc/arrabbiata/columns/enum.Column.html index 5923c13099..6afa65133f 100644 --- a/rustdoc/arrabbiata/columns/enum.Column.html +++ b/rustdoc/arrabbiata/columns/enum.Column.html @@ -2,7 +2,7 @@ Selector(Gadget), PublicInput(usize), X(usize), -}

Variants§

§

Selector(Gadget)

§

PublicInput(usize)

§

X(usize)

Trait Implementations§

source§

impl Clone for Column

source§

fn clone(&self) -> Column

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Column

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl FormattedOutput for Column

source§

fn latex(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn text(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn ocaml(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn is_alpha(&self) -> bool

source§

impl From<Column> for usize

Convert a column to a usize. This is used by the library [mvpoly] when we +}

Variants§

§

Selector(Gadget)

§

PublicInput(usize)

§

X(usize)

Trait Implementations§

source§

impl Clone for Column

source§

fn clone(&self) -> Column

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Column

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl FormattedOutput for Column

source§

fn latex(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn text(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn ocaml(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn is_alpha(&self) -> bool

source§

impl From<Column> for usize

Convert a column to a usize. This is used by the library [mvpoly] when we need to compute the cross-terms. For now, only the private inputs and the public inputs are converted, because there might not need to treat the selectors in the polynomial while diff --git a/rustdoc/arrabbiata/columns/type.E.html b/rustdoc/arrabbiata/columns/type.E.html index 14ad6fd386..6512cd0960 100644 --- a/rustdoc/arrabbiata/columns/type.E.html +++ b/rustdoc/arrabbiata/columns/type.E.html @@ -1 +1 @@ -E in arrabbiata::columns - Rust

Type Definition arrabbiata::columns::E

source · 
pub type E<Fp> = Expr<ConstantExpr<Fp, ChallengeTerm>, Column>;
\ No newline at end of file +E in arrabbiata::columns - Rust

Type Definition arrabbiata::columns::E

source · 
pub type E<Fp> = Expr<ConstantExpr<Fp, ChallengeTerm>, Column>;
\ No newline at end of file diff --git a/rustdoc/arrabbiata/constraints/struct.Env.html b/rustdoc/arrabbiata/constraints/struct.Env.html index eb7a3c2e45..9af99af8bb 100644 --- a/rustdoc/arrabbiata/constraints/struct.Env.html +++ b/rustdoc/arrabbiata/constraints/struct.Env.html @@ -50,7 +50,7 @@
Safety
y1: Self::Variable ) -> (Self::Variable, Self::Variable)

Double the elliptic curve point given by the affine coordinates (x1, y1) and save the result in the registers pos_x and pos_y.

-
§

type Position = (Column, CurrOrNext)

§

type Variable = Operations<ExprInner<Operations<ConstantExprInner<<C as AffineRepr>::ScalarField, ChallengeTerm>>, Column>>

The variable should be seen as a certain object that can be built by +
§

type Position = (Column, CurrOrNext)

§

type Variable = Operations<ExprInner<Operations<ConstantExprInner<<C as AffineRepr>::ScalarField, ChallengeTerm>>, Column>>

The variable should be seen as a certain object that can be built by multiplying and adding, i.e. the variable can be seen as a solution to a polynomial. When instantiating as expressions - “constraints” - it defines diff --git a/rustdoc/arrabbiata/curve/index.html b/rustdoc/arrabbiata/curve/index.html index 6f4a12e634..c5ca8c40ce 100644 --- a/rustdoc/arrabbiata/curve/index.html +++ b/rustdoc/arrabbiata/curve/index.html @@ -1,4 +1,4 @@ -arrabbiata::curve - Rust

Module arrabbiata::curve

source ·
Expand description

This file defines a trait similar to [kimchi::curve::KimchiCurve] for Pallas and +arrabbiata::curve - Rust

Module arrabbiata::curve

source ·
Expand description

This file defines a trait similar to kimchi::curve::KimchiCurve for Pallas and Vesta. It aims to define all the parameters that are needed by a curve to be used in Arrabbiata. For instance, the sponge parameters, the endomorphism coefficients, etc. diff --git a/rustdoc/arrabbiata/index.html b/rustdoc/arrabbiata/index.html index f70c9d0ad2..c030a13640 100644 --- a/rustdoc/arrabbiata/index.html +++ b/rustdoc/arrabbiata/index.html @@ -1,4 +1,4 @@ -arrabbiata - Rust

Crate arrabbiata

source ·

Modules

  • column_env
    This module will be used by the prover to evaluate at a certain point.
  • columns
  • constraints
  • curve
    This file defines a trait similar to [kimchi::curve::KimchiCurve] for Pallas and +arrabbiata - Rust

    Crate arrabbiata

    source ·

    Modules

    • column_env
      This module will be used by the prover to evaluate at a certain point.
    • columns
    • constraints
    • curve
      This file defines a trait similar to kimchi::curve::KimchiCurve for Pallas and Vesta. It aims to define all the parameters that are needed by a curve to be used in Arrabbiata. For instance, the sponge parameters, the endomorphism coefficients, etc. diff --git a/rustdoc/arrabbiata/interpreter/trait.InterpreterEnv.html b/rustdoc/arrabbiata/interpreter/trait.InterpreterEnv.html index f11b08002b..ea9c347faf 100644 --- a/rustdoc/arrabbiata/interpreter/trait.InterpreterEnv.html +++ b/rustdoc/arrabbiata/interpreter/trait.InterpreterEnv.html @@ -238,6 +238,6 @@
      Safety
      proof. The constraint environment must be instantiated only once, at the last step of the computation.

      -
      §

      type Position = (Column, CurrOrNext)

      §

      type Variable = Operations<ExprInner<Operations<ConstantExprInner<<C as AffineRepr>::ScalarField, ChallengeTerm>>, Column>>

source§

impl<Fp: PrimeField, Fq: PrimeField, E1: ArrabbiataCurve<ScalarField = Fp, BaseField = Fq>, E2: ArrabbiataCurve<ScalarField = Fq, BaseField = Fp>> InterpreterEnv for arrabbiata::witness::Env<Fp, Fq, E1, E2>where +

§

type Position = (Column, CurrOrNext)

§

type Variable = Operations<ExprInner<Operations<ConstantExprInner<<C as AffineRepr>::ScalarField, ChallengeTerm>>, Column>>

source§

impl<Fp: PrimeField, Fq: PrimeField, E1: ArrabbiataCurve<ScalarField = Fp, BaseField = Fq>, E2: ArrabbiataCurve<ScalarField = Fq, BaseField = Fp>> InterpreterEnv for arrabbiata::witness::Env<Fp, Fq, E1, E2>where <E1::Params as CurveConfig>::BaseField: PrimeField, - <E2::Params as CurveConfig>::BaseField: PrimeField,

§

type Position = (Column, CurrOrNext)

§

type Variable = BigInt

\ No newline at end of file + <E2::Params as CurveConfig>::BaseField: PrimeField,
§

type Position = (Column, CurrOrNext)

§

type Variable = BigInt

\ No newline at end of file diff --git a/rustdoc/arrabbiata/witness/struct.Env.html b/rustdoc/arrabbiata/witness/struct.Env.html index 64bd951984..53ede2a057 100644 --- a/rustdoc/arrabbiata/witness/struct.Env.html +++ b/rustdoc/arrabbiata/witness/struct.Env.html @@ -1,6 +1,6 @@ Env in arrabbiata::witness - Rust

Struct arrabbiata::witness::Env

source · 
pub struct Env<Fp: PrimeField, Fq: PrimeField, E1: ArrabbiataCurve<ScalarField = Fp, BaseField = Fq>, E2: ArrabbiataCurve<ScalarField = Fq, BaseField = Fp>> {
Show 29 fields
-    pub domain_fp: EvaluationDomains<Fp>,
-    pub domain_fq: EvaluationDomains<Fq>,
+    pub domain_fp: EvaluationDomains<Fp>,
+    pub domain_fq: EvaluationDomains<Fq>,
     pub srs_e1: SRS<E1>,
     pub srs_e2: SRS<E2>,
     pub ivc_accumulator_e1: Vec<PolyComm<E1>>,
@@ -34,8 +34,8 @@
 
The environment is run over big integers to avoid performing
 reduction at all step. Instead the user implementing the interpreter can
 reduce in the corresponding field when they want.

-

Fields§

§domain_fp: EvaluationDomains<Fp>

Domain for Fp

-
§domain_fq: EvaluationDomains<Fq>

Domain for Fq

+

Fields§

§domain_fp: EvaluationDomains<Fp>

Domain for Fp

+
§domain_fq: EvaluationDomains<Fq>

Domain for Fq

§srs_e1: SRS<E1>

SRS for the first curve

§srs_e2: SRS<E2>

SRS for the second curve

§ivc_accumulator_e1: Vec<PolyComm<E1>>§ivc_accumulator_e2: Vec<PolyComm<E2>>§previous_commitments_e1: Vec<PolyComm<E1>>

Commitments to the previous instances

@@ -178,7 +178,7 @@
Safety
y1: Self::Variable ) -> (Self::Variable, Self::Variable)

Double the elliptic curve point given by the affine coordinates (x1, y1) and save the result in the registers pos_x and pos_y.

-
§

type Position = (Column, CurrOrNext)

source§

fn allocate(&mut self) -> Self::Position

Allocate a new variable in the circuit for the current row
source§

fn allocate_next_row(&mut self) -> Self::Position

Allocate a new variable in the circuit for the next row
source§

fn read_position(&self, pos: Self::Position) -> Self::Variable

Return the corresponding variable at the given position
source§

fn allocate_public_input(&mut self) -> Self::Position

source§

fn write_column( +

§

type Position = (Column, CurrOrNext)

source§

fn allocate(&mut self) -> Self::Position

Allocate a new variable in the circuit for the current row
source§

fn allocate_next_row(&mut self) -> Self::Position

Allocate a new variable in the circuit for the next row
source§

fn read_position(&self, pos: Self::Position) -> Self::Variable

Return the corresponding variable at the given position
source§

fn allocate_public_input(&mut self) -> Self::Position

source§

fn write_column( &mut self, pos: Self::Position, v: Self::Variable diff --git a/rustdoc/help.html b/rustdoc/help.html index 5b57a161fa..20c79678f5 100644 --- a/rustdoc/help.html +++ b/rustdoc/help.html @@ -1 +1 @@ -Rustdoc help

Rustdoc help

Back
\ No newline at end of file +Rustdoc help

Rustdoc help

Back
\ No newline at end of file diff --git a/rustdoc/implementors/folding/expressions/trait.FoldingColumnTrait.js b/rustdoc/implementors/folding/expressions/trait.FoldingColumnTrait.js index 14fbaa0521..f3e889c4de 100644 --- a/rustdoc/implementors/folding/expressions/trait.FoldingColumnTrait.js +++ b/rustdoc/implementors/folding/expressions/trait.FoldingColumnTrait.js @@ -1,4 +1,4 @@ (function() {var implementors = { "folding":[], -"kimchi_msm":[["impl FoldingColumnTrait for Column"]] +"kimchi_msm":[["impl FoldingColumnTrait for Column"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rustdoc/implementors/folding/instance_witness/trait.Foldable.js b/rustdoc/implementors/folding/instance_witness/trait.Foldable.js index f8f0078f6f..e806ed4e18 100644 --- a/rustdoc/implementors/folding/instance_witness/trait.Foldable.js +++ b/rustdoc/implementors/folding/instance_witness/trait.Foldable.js @@ -1,5 +1,5 @@ (function() {var implementors = { "folding":[], "ivc":[["impl<G: CommitmentCurve, const N_COL: usize, const N_CHALS: usize, const N_ALPHAS: usize> Foldable<<G as AffineRepr>::ScalarField> for PlonkishInstance<G, N_COL, N_CHALS, N_ALPHAS>"],["impl<const N_COL: usize, const N_FSEL: usize, F: Field, Evals: CombinableEvals<F>> Foldable<F> for PlonkishWitnessGeneric<N_COL, N_FSEL, F, Evals>"]], -"kimchi_msm":[["impl<const N: usize, F: FftField> Foldable<F> for Witness<N, Evaluations<F, Radix2EvaluationDomain<F>>>"]] +"kimchi_msm":[["impl<const N: usize, F: FftField> Foldable<F> for Witness<N, Evaluations<F, Radix2EvaluationDomain<F>>>"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rustdoc/implementors/folding/instance_witness/trait.Witness.js b/rustdoc/implementors/folding/instance_witness/trait.Witness.js index 695b4e4ede..5c2b6a6ece 100644 --- a/rustdoc/implementors/folding/instance_witness/trait.Witness.js +++ b/rustdoc/implementors/folding/instance_witness/trait.Witness.js @@ -1,5 +1,5 @@ (function() {var implementors = { "folding":[], "ivc":[["impl<const N_COL: usize, const N_FSEL: usize, Curve: CommitmentCurve, Evals: CombinableEvals<Curve::ScalarField>> Witness<Curve> for PlonkishWitnessGeneric<N_COL, N_FSEL, Curve::ScalarField, Evals>"]], -"kimchi_msm":[["impl<const N: usize, G: CommitmentCurve> Witness<G> for Witness<N, Evaluations<G::ScalarField, Radix2EvaluationDomain<G::ScalarField>>>"]] +"kimchi_msm":[["impl<const N: usize, G: CommitmentCurve> Witness<G> for Witness<N, Evaluations<G::ScalarField, Radix2EvaluationDomain<G::ScalarField>>>"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rustdoc/implementors/kimchi/circuits/expr/trait.AlphaChallengeTerm.js b/rustdoc/implementors/kimchi/circuits/expr/trait.AlphaChallengeTerm.js index de3e471e33..6ade9acac3 100644 --- a/rustdoc/implementors/kimchi/circuits/expr/trait.AlphaChallengeTerm.js +++ b/rustdoc/implementors/kimchi/circuits/expr/trait.AlphaChallengeTerm.js @@ -1,4 +1,4 @@ (function() {var implementors = { -"arrabbiata":[["impl<'a> AlphaChallengeTerm<'a> for ChallengeTerm"]], +"arrabbiata":[["impl<'a> AlphaChallengeTerm<'a> for ChallengeTerm"]], "kimchi":[] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rustdoc/implementors/kimchi/circuits/expr/trait.FormattedOutput.js b/rustdoc/implementors/kimchi/circuits/expr/trait.FormattedOutput.js index 02af0f487e..b4435f260e 100644 --- a/rustdoc/implementors/kimchi/circuits/expr/trait.FormattedOutput.js +++ b/rustdoc/implementors/kimchi/circuits/expr/trait.FormattedOutput.js @@ -1,5 +1,5 @@ (function() {var implementors = { -"arrabbiata":[["impl FormattedOutput for Column"]], +"arrabbiata":[["impl FormattedOutput for Column"]], "kimchi":[], "kimchi_msm":[["impl FormattedOutput for Column"]] };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})() \ No newline at end of file diff --git a/rustdoc/index.html b/rustdoc/index.html index 8cdadf2824..aade5c60c5 100644 --- a/rustdoc/index.html +++ b/rustdoc/index.html @@ -1 +1 @@ -Index of crates

List of all crates

\ No newline at end of file +Index of crates

List of all crates

\ No newline at end of file diff --git a/rustdoc/kimchi_msm/columns/enum.Column.html b/rustdoc/kimchi_msm/columns/enum.Column.html index b6ee919653..930f9b7db1 100644 --- a/rustdoc/kimchi_msm/columns/enum.Column.html +++ b/rustdoc/kimchi_msm/columns/enum.Column.html @@ -17,7 +17,7 @@

§

LookupAggregation

The lookup aggregation, i.e. phi

§

LookupFixedTable(u32)

The fixed tables. The parameter is considered to the indexed table.

Implementations§

source§

impl Column

source

pub fn add_rel_offset(self, offset: usize) -> Column

Adds offset if the column is Relation. Fails otherwise.

-

Trait Implementations§

source§

impl Clone for Column

source§

fn clone(&self) -> Column

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Column

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl FoldingColumnTrait for Column

source§

fn is_witness(&self) -> bool

source§

fn degree(&self) -> Degree

Return the degree of the column Read more
source§

impl FormattedOutput for Column

source§

fn latex(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn text(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn ocaml(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn is_alpha(&self) -> bool

source§

impl Hash for Column

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where +

Trait Implementations§

source§

impl Clone for Column

source§

fn clone(&self) -> Column

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for Column

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl FoldingColumnTrait for Column

source§

fn is_witness(&self) -> bool

§

fn degree(&self) -> Degree

Return the degree of the column Read more
source§

impl FormattedOutput for Column

source§

fn latex(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn text(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn ocaml(&self, _cache: &mut HashMap<CacheId, Self>) -> String

source§

fn is_alpha(&self) -> bool

source§

impl Hash for Column

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl PartialEq<Column> for Column

source§

fn eq(&self, other: &Column) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always diff --git a/rustdoc/kimchi_msm/witness/struct.Witness.html b/rustdoc/kimchi_msm/witness/struct.Witness.html index bca4c1075f..d6a8787cfd 100644 --- a/rustdoc/kimchi_msm/witness/struct.Witness.html +++ b/rustdoc/kimchi_msm/witness/struct.Witness.html @@ -10,7 +10,7 @@

Fields§

§cols: Box<[T; N_WIT]>

A witness row is represented by an array of N witness columns When T is a vector, then the witness describes the rows of the circuit.

-

Implementations§

source§

impl<const N_WIT: usize, T> Witness<N_WIT, T>

source

pub fn len(&self) -> usize

source

pub fn is_empty(&self) -> bool

source§

impl<const N_WIT: usize, T: Zero + Clone> Witness<N_WIT, Vec<T>>

source

pub fn zero_vec(domain_size: usize) -> Self

source

pub fn to_pub_columns<const NPUB: usize>(&self) -> Witness<NPUB, Vec<T>>

Trait Implementations§

source§

impl<const N_WIT: usize, T: Clone> Clone for Witness<N_WIT, T>

source§

fn clone(&self) -> Witness<N_WIT, T>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<const N_WIT: usize, T: Debug> Debug for Witness<N_WIT, T>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<const N_WIT: usize, T: Zero + Clone> Default for Witness<N_WIT, T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<const N: usize, F: FftField> Foldable<F> for Witness<N, Evaluations<F, Radix2EvaluationDomain<F>>>

source§

fn combine(a: Self, b: Self, challenge: F) -> Self

Combine two objects ‘a’ and ‘b’ into a new object using the challenge.
source§

impl<const N_WIT: usize, G: Send + Debug> FromParallelIterator<G> for Witness<N_WIT, G>

source§

fn from_par_iter<I>(par_iter: I) -> Selfwhere +

Implementations§

source§

impl<const N_WIT: usize, T> Witness<N_WIT, T>

source

pub fn len(&self) -> usize

source

pub fn is_empty(&self) -> bool

source§

impl<const N_WIT: usize, T: Zero + Clone> Witness<N_WIT, Vec<T>>

source

pub fn zero_vec(domain_size: usize) -> Self

source

pub fn to_pub_columns<const NPUB: usize>(&self) -> Witness<NPUB, Vec<T>>

Trait Implementations§

source§

impl<const N_WIT: usize, T: Clone> Clone for Witness<N_WIT, T>

source§

fn clone(&self) -> Witness<N_WIT, T>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<const N_WIT: usize, T: Debug> Debug for Witness<N_WIT, T>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<const N_WIT: usize, T: Zero + Clone> Default for Witness<N_WIT, T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<const N: usize, F: FftField> Foldable<F> for Witness<N, Evaluations<F, Radix2EvaluationDomain<F>>>

source§

fn combine(a: Self, b: Self, challenge: F) -> Self

Combine two objects ‘a’ and ‘b’ into a new object using the challenge.
source§

impl<const N_WIT: usize, G: Send + Debug> FromParallelIterator<G> for Witness<N_WIT, G>

source§

fn from_par_iter<I>(par_iter: I) -> Selfwhere I: IntoParallelIterator<Item = G>,

Creates an instance of the collection from the parallel iterator par_iter. Read more
source§

impl<const N_WIT: usize, T: Hash> Hash for Witness<N_WIT, T>

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<const N_WIT: usize, T> Index<usize> for Witness<N_WIT, T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<'lt, const N_WIT: usize, G> IntoIterator for &'lt Witness<N_WIT, G>

§

type Item = &'lt G

The type of the elements being iterated over.
§

type IntoIter = IntoIter<&'lt G, Global>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<const N_WIT: usize, F: Clone> IntoIterator for Witness<N_WIT, F>

source§

fn into_iter(self) -> Self::IntoIter

Iterate over the columns in the circuit.

@@ -20,7 +20,7 @@ Vec<G>: IntoParallelIterator,
source§

fn into_par_iter(self) -> Self::Iter

Iterate over the columns in the circuit, in parallel.

§

type Iter = <Vec<G, Global> as IntoParallelIterator>::Iter

The parallel iterator type that will be created.
§

type Item = <Vec<G, Global> as IntoParallelIterator>::Item

The type of item that the parallel iterator will produce.
source§

impl<const N_WIT: usize, T: PartialEq> PartialEq<Witness<N_WIT, T>> for Witness<N_WIT, T>

source§

fn eq(&self, other: &Witness<N_WIT, T>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
source§

impl<const N_WIT: usize, T> TryFrom<Vec<T, Global>> for Witness<N_WIT, T>

§

type Error = String

The type returned in the event of a conversion error.
source§

fn try_from(value: Vec<T>) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl<const N_WIT: usize, T: Eq> Eq for Witness<N_WIT, T>

source§

impl<const N_WIT: usize, T> StructuralEq for Witness<N_WIT, T>

source§

impl<const N_WIT: usize, T> StructuralPartialEq for Witness<N_WIT, T>

source§

impl<const N: usize, G: CommitmentCurve> Witness<G> for Witness<N, Evaluations<G::ScalarField, Radix2EvaluationDomain<G::ScalarField>>>

Auto Trait Implementations§

§

impl<const N_WIT: usize, T> RefUnwindSafe for Witness<N_WIT, T>where +sufficient, and should not be overridden without very good reason.

source§

impl<const N_WIT: usize, T> TryFrom<Vec<T, Global>> for Witness<N_WIT, T>

§

type Error = String

The type returned in the event of a conversion error.
source§

fn try_from(value: Vec<T>) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl<const N_WIT: usize, T: Eq> Eq for Witness<N_WIT, T>

source§

impl<const N_WIT: usize, T> StructuralEq for Witness<N_WIT, T>

source§

impl<const N_WIT: usize, T> StructuralPartialEq for Witness<N_WIT, T>

source§

impl<const N: usize, G: CommitmentCurve> Witness<G> for Witness<N, Evaluations<G::ScalarField, Radix2EvaluationDomain<G::ScalarField>>>

Auto Trait Implementations§

§

impl<const N_WIT: usize, T> RefUnwindSafe for Witness<N_WIT, T>where T: RefUnwindSafe,

§

impl<const N_WIT: usize, T> Send for Witness<N_WIT, T>where T: Send,

§

impl<const N_WIT: usize, T> Sync for Witness<N_WIT, T>where T: Sync,

§

impl<const N_WIT: usize, T> Unpin for Witness<N_WIT, T>

§

impl<const N_WIT: usize, T> UnwindSafe for Witness<N_WIT, T>where @@ -42,12 +42,12 @@ &'data mut I: IntoParallelIterator,

§

type Iter = <&'data mut I as IntoParallelIterator>::Iter

The type of iterator that will be created.
§

type Item = <&'data mut I as IntoParallelIterator>::Item

The type of item that will be produced; this is typically an &'data mut T reference.
§

fn par_iter_mut( &'data mut self -) -> <I as IntoParallelRefMutIterator<'data>>::Iter

Creates the parallel iterator from self. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<G, W> RelaxableWitness<G, W> for Wwhere +) -> <I as IntoParallelRefMutIterator<'data>>::Iter

Creates the parallel iterator from self. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<G, W> RelaxableWitness<G, W> for Wwhere G: CommitmentCurve, - W: Witness<G>,

source§

fn relax( + W: Witness<G>,

§

fn relax( self, zero_poly: &Evaluations<<G as AffineRepr>::ScalarField, Radix2EvaluationDomain<<G as AffineRepr>::ScalarField>> -) -> RelaxedWitness<G, W>

This method takes a witness and a vector of evaluations to the zero +) -> RelaxedWitness<G, W>

This method takes a witness and a vector of evaluations to the zero polynomial, returning a relaxed witness which is composed by the extended witness and the error vector that is set to the zero polynomial.

diff --git a/rustdoc/settings.html b/rustdoc/settings.html index 78856e0fed..9f421508ce 100644 --- a/rustdoc/settings.html +++ b/rustdoc/settings.html @@ -1 +1 @@ -Rustdoc settings

Rustdoc settings

Back
\ No newline at end of file +Rustdoc settings

Rustdoc settings

Back
\ No newline at end of file