Functions — github.com/arkworks-rs/gemini

hub / github.com/arkworks-rs/gemini / functions

Functions388 in github.com/arkworks-rs/gemini

⨍ Functions 388◇ Types & classes 125

↓ 119 callersMethoditer

Iterate over the indexed polynomials.

src/psnark/constraint_system.rs:160

↓ 96 callersMethodappend_serializable

( &mut self, label: &'static [u8], serializable: &S, )

src/transcript.rs:16

↓ 53 callersMethodlen

(&self)

src/herring/ipa.rs:167

↓ 46 callersMethoditer

(&self)

src/herring/ipa.rs:163

↓ 43 callersMethodlen

(&self)

src/psnark/streams/val_stream.rs:63

↓ 39 callersMethoditer

(&self)

src/subprotocols/sumcheck/streams.rs:49

↓ 30 callersFunctionip

(lhs: &[F], rhs: &[F])

src/misc.rs:215

↓ 30 callersFunctionpowers

Return a vector of length `len` containing the consecutive powers of element.

src/misc.rs:59

↓ 25 callersFunctionhadamard

(lhs: &[F], rhs: &[F])

src/misc.rs:205

↓ 24 callersMethoditer

(&self)

src/snark/streams.rs:50

↓ 24 callersFunctionproduct_matrix_vector

Given a sparse matrix `matrix` and a vector `z`, compute `matrix * z`.

src/misc.rs:100

↓ 23 callersMethodget_challenge

(&mut self, label: &'static [u8])

src/transcript.rs:26

↓ 23 callersMethodlen

(&self)

src/subprotocols/sumcheck/streams.rs:57

↓ 21 callersMethodcommit

Given a polynomial `polynomial` of degree less than `max_degree`, return a commitment to `polynomial`.

src/kzg/time.rs:81

↓ 20 callersFunctionevaluate_le

(polynomial: &[F], x: &F)

src/misc.rs:194

↓ 20 callersMethoditer

(&self)

src/subprotocols/plookup/streams/set_stream.rs:32

↓ 20 callersMethodnext_message

Time-efficient, next-message function.

src/herring/time_prover.rs:91

↓ 18 callersMethodfold

(mut self, challenge: &P::ScalarField)

src/herring/ipa.rs:203

↓ 15 callersFunctionevaluate_be

(polynomial: I, x: &F)

src/misc.rs:180

↓ 14 callersFunctionentry_product_streams

( streamer: &'a S, )

src/subprotocols/entryproduct/streams/mod.rs:12

↓ 13 callersFunctionfold_polynomial

(f: &[F], r: F)

src/misc.rs:52

↓ 13 callersMethoditer

(&self)

src/subprotocols/entryproduct/streams/mod.rs:32

↓ 13 callersFunctionmatrix_into_colmaj

Return a matrix stream, col major. XXX. can this be done without the hint for the number of columns?

src/circuit.rs:179

↓ 13 callersFunctionmatrix_into_rowmaj

Return a matrix stream, row major.

src/circuit.rs:208

↓ 12 callersMethodadvance_by

(&mut self, n: usize)

src/psnark/streams/tensor_stream.rs:67

↓ 12 callersFunctioncompute_plookup_set_eval

( set_eval: F, eval_point: F, y: F, z: F, _zeta: F, n: usize, )

src/psnark/verifier.rs:72

↓ 12 callersFunctionevaluate_folding

Evaluate a folded polynomial tree at the point `x`. Make a single pass over the [`FoldedPolynomialTree`](crate::subprotocols::sumcheck::streams::Fold

src/subprotocols/tensorcheck/mod.rs:73

↓ 12 callersMethodlen

(&self)

src/snark/streams.rs:57

↓ 12 callersMethodnext

(&mut self)

src/subprotocols/sumcheck/streams.rs:112

↓ 12 callersMethodnext

(&mut self)

src/herring/streams.rs:122

↓ 10 callersMethodbatch_commit

Given an iterator over `polynomials`, expressed as vectors of coefficients, return a vector of commitmetns to all of them.

src/kzg/time.rs:98

↓ 10 callersMethodlen

(&self)

src/herring/streams.rs:62

↓ 9 callersMethodfinalize

(mut self)

src/kzg/msm/stream_pippenger.rs:190

↓ 9 callersFunctiontensor

Given as input `elements`, an array of field elements \$\rho_0, \dots, \rho_{n-1}\$ compute the tensor product \$ \otimes_j (1, \rho_j )\$

src/misc.rs:133

↓ 8 callersMethodlen

(&self)

src/psnark/streams/hadamard_stream.rs:82

↓ 8 callersMethodnext

(&mut self)

src/snark/streams.rs:80

↓ 8 callersMethodprover_messages

Return the prover's messages.

src/herring/proof.rs:136

↓ 8 callersMethodtruncate

( &mut self, rounds: usize, )

src/herring/ipa.rs:120

↓ 7 callersFunctionevaluate_index_poly

(x: F, n: usize)

src/misc.rs:394

↓ 7 callersMethodfinal_foldings

(&self)

src/herring/time_prover.rs:135

↓ 7 callersFunctiongenerate_relation

(circuit: C)

src/circuit.rs:152

↓ 7 callersMethoditer

(&self)

src/psnark/streams/val_stream.rs:55

↓ 7 callersFunctionrandom_circuit

( rng: &mut impl RngCore, num_constraints: usize, num_variables: usize, )

src/circuit.rs:284

↓ 7 callersMethodrounds

(&self)

src/herring/time_prover.rs:127

↓ 7 callersFunctionstrip_last

Given the slice `v` as input, return a slice of length `v.len()-1` with all elements of `v` but the last.

src/misc.rs:25

↓ 6 callersMethodadd

(&mut self, base: B, scalar: S)

src/kzg/msm/stream_pippenger.rs:162

↓ 6 callersMethodcommit_folding

The commitment procedures for our tensor check protocol. The algorithm takes advantage of the tree structure of folding polynomials in our protocol. P

src/kzg/space.rs:192

↓ 6 callersFunctioncompute_plookup_subset_eval

( subset_eval: F, index_eval: F, eval_point: F, y: F, _z: F, zeta: F, n: usize, )

src/psnark/verifier.rs:50

↓ 6 callersMethoddepth

(&self)

src/herring/streams.rs:39

↓ 6 callersFunctionip_unsafe

Return the inner product of two iterators `lhs` and `rhs`, assuming that the elements have the same length.

src/misc.rs:235

↓ 6 callersMethodopen_folding

The commitment procedures for our tensor check protocol. The algorithm takes advantage of the tree structure of folding polynomials in our protocol. P

src/kzg/space.rs:229

↓ 6 callersMethodprover_messages

Return the prover's messages.

src/subprotocols/sumcheck/proof.rs:157

↓ 6 callersMethodsum

(iter: I)

src/herring/prover.rs:28

↓ 5 callersFunctionalg_hash

(v: &[F], index: J, chal: &F)

src/subprotocols/plookup/time_prover.rs:11

↓ 5 callersFunctionceil_div

(x: usize, y: usize)

src/misc.rs:31

↓ 5 callersFunctionevaluate_geometric_poly

(rx: F, n: usize)

src/misc.rs:387

↓ 5 callersFunctionlinear_combination

Compute a linear combination of the polynomials `polynomials` with the given challenges.

src/misc.rs:37

↓ 5 callersFunctionmonic

Given as input \$f(x) \in \FF[x]\$ of degree \$N\$ represented as a vector of its coefficient (in little-endian), return \$f(x) + x^N\$.

src/subprotocols/entryproduct/time_prover.rs:50

↓ 5 callersMethodopen

Given a polynomial `polynomial` and an evaluation point `evaluation_point`, return the evaluation of `polynomial in `evaluation_point`, together with

src/kzg/time.rs:112

↓ 5 callersFunctionplookup

( subset: &[F], set: &[F], index: &[usize], y: &F, z: &F, zeta: &F, )

src/subprotocols/plookup/time_prover.rs:89

↓ 5 callersFunctionpowers2

Return a vector of length `len` containing the 2^j-th powers of element.

src/misc.rs:68

↓ 5 callersFunctionright_rotation

Perform the right notation of a vector `v`.

src/subprotocols/entryproduct/time_prover.rs:15

↓ 5 callersFunctionvanishing_polynomial

The polynomial in $\FF$ that vanishes in all the points `points`.

src/kzg/mod.rs:262

↓ 4 callersFunctionaccumulated_product

Given as input a vector \$\vec f \in \FF^n\$ of the form: \\[ (f_0 , f_1, f_2, \dots, f_i, \dots, f_{n-2}, f_{n-1} ) \\] return the vector \\(\vec

src/subprotocols/entryproduct/time_prover.rs:34

↓ 4 callersMethodbatch_open_multi_points

Evaluate a set of polynomials at a set of points `eval_points`, and provide a single batched evaluation proof. `eval_chal` is the random challenge for

src/kzg/time.rs:149

↓ 4 callersFunctiong1sm_to_posm

(sm: SumcheckMsg<P::G1>)

src/herring/ipa.rs:47

↓ 4 callersFunctiong2sm_to_posm

(sm: SumcheckMsg<P::G2>)

src/herring/ipa.rs:50

↓ 4 callersMethodindex_by

Obtain a new preprocessed committer key defined by the indices `indices`.

src/kzg/time.rs:86

↓ 4 callersMethoditer

(&self)

src/subprotocols/plookup/streams/sorted_stream.rs:41

↓ 4 callersMethodlen

(&self)

src/subprotocols/plookup/streams/set_stream.rs:36

↓ 4 callersMethodlen

(&self)

src/subprotocols/plookup/streams/sorted_stream.rs:51

↓ 4 callersFunctionlookup

(v: &[T], index: &[usize])

src/subprotocols/plookup/time_prover.rs:6

↓ 4 callersFunctionmsm

Streaming multi-scalar multiplication algorithm.

src/kzg/msm/stream_pippenger.rs:13

↓ 4 callersMethodnext

(&mut self)

src/psnark/streams/val_stream.rs:76

↓ 4 callersMethodopen_multi_points

Evaluate a single polynomial at a set of points `points`, and provide an evaluation proof along with evaluations.

src/kzg/space.rs:128

↓ 4 callersMethodopen_multi_points

Evaluate a single polynomial at a set of points `eval_points`, and provide a single evaluation proof.

src/kzg/time.rs:134

↓ 4 callersFunctionplookup_set

(v: &[F], y: &F, &z: &F)

src/subprotocols/plookup/time_prover.rs:23

↓ 4 callersMethodreduce

( transcript: &mut Transcript, messages: &[RoundMsg<F>], asserted_sum: F, )

src/subprotocols/sumcheck/subclaim.rs:77

↓ 4 callersFunctionscalarfieldsm_to_posm

( sm: SumcheckMsg<P::ScalarField>, )

src/herring/ipa.rs:41

↓ 4 callersFunctionsorted

(set: &[F], frequency: &[usize])

src/subprotocols/plookup/time_prover.rs:80

↓ 4 callersMethodverify_multi_points

The verification procedure for the EvaluationProof with a set of polynomials evaluated at a set of evaluation points. All the polynomials are evaluate

src/kzg/mod.rs:180

↓ 3 callersFunctionaccproduct3

(v: &[Vec<F>; 3])

src/psnark/time_prover.rs:40

↓ 3 callersFunctioncompute_frequency

(set_len: usize, index: &[usize])

src/subprotocols/plookup/time_prover.rs:65

↓ 3 callersMethoddepth

(&self)

src/subprotocols/sumcheck/streams.rs:34

↓ 3 callersFunctiondummy_r1cs

(rng: &mut impl RngCore, n: usize)

src/circuit.rs:349

↓ 3 callersMethodhalve

(&mut self)

src/herring/ipa.rs:133

↓ 3 callersMethoditer

(&self)

src/psnark/streams/tensor_stream.rs:104

↓ 3 callersMethoditer

(&self)

src/psnark/streams/hadamard_stream.rs:62

↓ 3 callersFunctionjoint_matrices

( joint_matrix: &[Vec<usize>], _num_constraints: usize, _num_variables: usize, a: &Matrix<F>,

src/misc.rs:299

↓ 3 callersMethodmul

(self, rhs: &F)

src/subprotocols/sumcheck/prover.rs:24

↓ 3 callersFunctionplookup_streams

Given a lookup instance of the form `subset` (denoted \$\vec f^*\$), `set` (denoted \$\vec f\$ of length \$n\$), and the `index` (denoted \\(I\\

src/subprotocols/plookup/streams/mod.rs:23

↓ 3 callersFunctionpo_from_scalarfield

(scalar: &P::ScalarField)

src/herring/ipa.rs:37

↓ 3 callersFunctionproduct3

(v: &[Vec<F>; 3])

src/psnark/time_prover.rs:31

↓ 3 callersMethodrounds

(&self)

src/subprotocols/sumcheck/prover.rs:56

↓ 3 callersFunctionsum_matrices

( a: &Matrix<F>, b: &Matrix<F>, c: &Matrix<F>, num_variables: usize, )

src/misc.rs:269

↓ 2 callersMethodadd

(self, other: Self)

src/herring/prover.rs:23

↓ 2 callersMethodadvance_by

(&mut self, n: usize)

src/psnark/streams/hadamard_stream.rs:45

↓ 2 callersMethodcommit_g1

(&self, scalars: SF)

src/herring/ipa.rs:94

↓ 2 callersFunctioncompute_timestamp

( non_zero: usize, num_constraints: usize, addrs: &Vec<usize>, )

src/psnark/constraint_system.rs:258

↓ 2 callersFunctiondigits

(a: &impl BigInteger, w: usize, num_bits: usize)

src/kzg/msm/variable_base.rs:21

next →1–100 of 388, ranked by callers