MCPcopy Create free account

hub / github.com/WizardOfMenlo/stir / functions

Functions213 in github.com/WizardOfMenlo/stir

↓ 18 callersMethodabsorb
(&mut self, input: &impl Absorb)
src/crypto/fs/blake3.rs:21
↓ 15 callersMethodevaluate
(&self, x: F, y: F)
src/poly_utils/bs08.rs:49
↓ 12 callersMethodqueries
(self)
scripts/protocol.py:249
↓ 11 callersMethodaddMessage
(self, msg : Message)
scripts/protocol.py:232
↓ 11 callersMethodsize
(&self)
src/domain.rs:34
↓ 10 callersFunctionconvert_size
(size_bits)
scripts/utils.py:9
↓ 8 callersFunctiondedup
Deduplicates AND orders a vector
src/utils.rs:83
↓ 8 callersMethodrate_bits
(self)
scripts/protocol.py:84
↓ 7 callersMethodaddRound
(self, rnd : Round)
scripts/protocol.py:274
↓ 6 callersMethodcommit
TODO: Better name for testing
src/fri/prover.rs:61
↓ 6 callersMethodprove
(&self, witness: Witness<F, MerkleConfig>)
src/fri/prover.rs:96
↓ 6 callersFunctionsqueeze_integer
(sponge: &mut impl CryptographicSponge, range: usize)
src/utils.rs:72
↓ 6 callersFunctionstack_evaluations
Takes the vector of evaluations (assume that evals[i] = f(omega^i)) and folds them into a vector of such that folded_evals[i] = [f(omega^(i + k * j))
src/utils.rs:89
↓ 6 callersMethodverify
( &self, commitment: &Commitment<MerkleConfig>, proof: &Proof<F, MerkleConfig>, )
src/fri/verifier.rs:49
↓ 5 callersFunctiondefault_fs_config
()
src/crypto/fs/blake3.rs:7
↓ 5 callersMethodfield_size
(self)
scripts/protocol.py:17
↓ 5 callersMethodfold_amount
(self)
scripts/protocol.py:81
↓ 5 callersFunctionnaive_interpolation
Computes a polynomial that interpolates the given points with the given answers
src/poly_utils/interpolation.rs:21
↓ 5 callersFunctionpoly_fold
( f: &DensePolynomial<F>, folding_factor: usize, folding_randomness: F, )
src/poly_utils/folding.rs:8
↓ 5 callersMethodquery
(self, num = 1)
scripts/protocol.py:14
↓ 5 callersFunctionset_size
Set figure dimensions to avoid scaling in LaTeX. Parameters ---------- width: float or string Document width in points, or st
graph_script.py:40
↓ 4 callersMethod__init__
(self)
scripts/protocol.py:221
↓ 4 callersMethodargument_size
(self)
scripts/protocol.py:243
↓ 4 callersMethodauthentication_path_size
(self, num_committed_elements: int, num_queries: int)
scripts/arg.py:14
↓ 4 callersMethoddegree_real
(self)
scripts/protocol.py:87
↓ 4 callersMethoddegree_virtual
(self)
scripts/protocol.py:90
↓ 4 callersFunctionfft_interpolate
Given a generator and a coset offset, computes the interpolating offset Requires to be given the inversion of the generator and coset offset (and thus
src/poly_utils/interpolation.rs:86
↓ 4 callersFunctionget_table
(data, stir_key, fri_key, xs, rates)
graph_script.py:225
↓ 4 callersMethodhash_size
(self)
scripts/protocol.py:32
↓ 4 callersMethodscale
(&self, power: usize)
src/domain.rs:142
↓ 4 callersMethodscale_offset
(&self, power: usize)
src/domain.rs:149
↓ 4 callersMethodsqueeze_bytes
(&mut self, num_bytes: usize)
src/crypto/fs/blake3.rs:25
↓ 4 callersFunctionto_coefficient_matrix
Takes a polynomial and interprets it as a matrix of coefficients this exactly corresponds to computing the BS08 bivariate polynomial with q(X) = X^col
src/poly_utils/bs08.rs:11
↓ 4 callersFunctionvanishing_poly
Computes a polynomial that vanishes on points
src/poly_utils/interpolation.rs:9
↓ 3 callersMethodauth_path_size
(self)
scripts/protocol.py:99
↓ 3 callersMethodcommitment_size
(self)
scripts/protocol.py:112
↓ 3 callersMethodfold
(self, k)
scripts/protocol.py:76
↓ 3 callersFunctionformat_table
(table, rates, round_precision=None)
graph_script.py:258
↓ 3 callersMethodisStopped
(self)
scripts/protocol.py:229
↓ 3 callersMethodopening_size
(self)
scripts/protocol.py:109
↓ 3 callersFunctionplot_per_rate
(rate)
graph_script.py:96
↓ 3 callersMethodproof_length
(self)
scripts/protocol.py:237
↓ 3 callersFunctionproof_of_work
( sponge: &mut impl CryptographicSponge, proof_of_work_bits: usize, )
src/utils.rs:23
↓ 3 callersFunctionproof_of_work_verify
( sponge: &mut impl CryptographicSponge, proof_of_work_bits: usize, pow_nonce: Option<usize>, )
src/utils.rs:50
↓ 3 callersMethodrepetition_parameter
(self, rhobits)
scripts/ldt_params.py:21
↓ 3 callersMethodrepetitions
(&self, log_inv_rate: usize)
src/parameters.rs:59
↓ 2 callersMethodauth_path_size
(self)
scripts/protocol.py:40
↓ 2 callersFunctionbegin_aurora
(params :LDTParameters)
scripts/aurora.py:7
↓ 2 callersMethodcols
(&self)
src/poly_utils/bs08.rs:45
↓ 2 callersMethodcommitment_size
(self)
scripts/protocol.py:53
↓ 2 callersMethodcompute_folded_evaluations
( &self, verification_state: &VerificationState<F>, stir_randomness_indexes: Vec<usize
src/stir/verifier.rs:222
↓ 2 callersFunctionfri_round
(params : LDTParameters, oracle : Polynomial, fold, stopping_condition)
scripts/fri.py:4
↓ 2 callersMethodgetLastOracle
(self)
scripts/protocol.py:259
↓ 2 callersMethodgetLastOracle
(self)
scripts/protocol.py:280
↓ 2 callersMethodisStopped
(self)
scripts/protocol.py:286
↓ 2 callersMethodopening_size
(self)
scripts/protocol.py:50
↓ 2 callersMethodpow_bits
(&self, log_inv_rate: usize)
src/parameters.rs:67
↓ 2 callersMethodprint
(self)
scripts/protocol.py:255
↓ 2 callersMethodproof_length
(self)
scripts/protocol.py:118
↓ 2 callersMethodreps_full_sec
(self)
scripts/protocol.py:121
↓ 2 callersFunctionround_to_n
(x, n)
graph_script.py:219
↓ 2 callersMethodrows
(&self)
src/poly_utils/bs08.rs:37
↓ 2 callersFunctionstir_round
(params : LDTParameters, oracle : Polynomial, fold, max_len_ratio, stopping_condition)
scripts/stir.py:12
↓ 2 callersMethodstop_protocol
(self)
scripts/protocol.py:226
↓ 2 callersFunctiontest_bivariate
( poly: &DensePolynomial<TestField>, matrix: &BivariatePolynomial<TestField>, cols: us
src/poly_utils/bs08.rs:82
↓ 1 callersMethodargument_size
(self)
scripts/protocol.py:56
↓ 1 callersMethodargument_size
(self)
scripts/protocol.py:115
↓ 1 callersMethodargument_size
(self)
scripts/protocol.py:206
↓ 1 callersMethodcommitment_size
(self)
scripts/arg.py:9
↓ 1 callersFunctioncorrect_rate
(ldt_params, rho_bit)
scripts/stir.py:6
↓ 1 callersFunctionevaluate_interpolation
Computes a polynomial that interpolates the given points with the given answers
src/poly_utils/interpolation.rs:118
↓ 1 callersFunctionfft_interpolate_naive
Given a generator and a coset offset, computes the interpolating offset
src/poly_utils/interpolation.rs:48
↓ 1 callersMethodfixed_proof_of_work
(self)
scripts/protocol.py:124
↓ 1 callersMethodfold_by_col
(&self, alpha: F)
src/poly_utils/bs08.rs:59
↓ 1 callersFunctionfold_evaluations
(folding: usize, evals: Vec<F>)
src/stir/prover.rs:343
↓ 1 callersFunctionformat_prover
(table, rates)
graph_script.py:240
↓ 1 callersMethodlength_real
(self)
scripts/protocol.py:93
↓ 1 callersMethodlength_virtual
(self)
scripts/protocol.py:96
↓ 1 callersFunctionmake_latex_tables
(rates)
graph_script.py:277
↓ 1 callersFunctionplot_all
(rates)
graph_script.py:146
↓ 1 callersFunctionplot_table_values
()
scripts/main.py:6
↓ 1 callersFunctionpoly_quotient
Compute the quotient
src/poly_utils/quotient.rs:7
↓ 1 callersMethodproof_length
(self)
scripts/protocol.py:156
↓ 1 callersMethodproof_length
(self)
scripts/protocol.py:209
↓ 1 callersMethodquery
Now, I need to query f_i at a given point. This induces some query to the previous oracle, whose answer I get
src/stir/verifier.rs:30
↓ 1 callersFunctionquotient_with_hint
Allows to amortize the evaluation of the quotient polynomial
src/poly_utils/quotient.rs:45
↓ 1 callersMethodround
( &self, sponge: &mut impl CryptographicSponge, round_proof: &RoundProof<F, MerkleConf
src/stir/verifier.rs:403
↓ 1 callersMethodround
TODO: Rename to better name
src/stir/prover.rs:191
↓ 1 callersFunctionrun_aurora_FRI
(params : LDTParameters, fold, stopping_condition)
scripts/aurora.py:23
↓ 1 callersFunctionrun_aurora_STIR
(params : LDTParameters, fold, max_len_ratio, stopping_condition)
scripts/aurora.py:32
↓ 1 callersMethodscale_generator_by
Takes the underlying backing_domain = <w>, and computes the new domain <w^power> (note this will have size |L| / power) NOTE: This should not be mixed
src/domain.rs:41
↓ 1 callersMethodscale_with_offset
Take a domain L_0 = o * <w> and compute a new domain L_1 = w * o^power * <w^power>. Note that L_0^k \cap L_1 = \emptyset for k > power.
src/domain.rs:94
↓ 1 callersFunctiontime_ms
(x, reps=1)
graph_script.py:6
↓ 1 callersFunctiontranspose
(v: Vec<Vec<T>>)
src/utils.rs:9
Method__init__
(self, hashsize)
scripts/arg.py:5
Method__init__
(self, secparam, hashsize, pow, field_size_bits, log_degree, rho_bits, conj)
scripts/ldt_params.py:7
Method__init__
(self, params : LDTParameters, name="")
scripts/protocol.py:9
Method__init__
(self, params: LDTParameters, length, name="")
scripts/protocol.py:36
Method__init__
(self, params : LDTParameters, degree, rate_bits, stack=1, name="")
scripts/protocol.py:69
Method__init__
(self, params: LDTParameters, polys, rate_bits, name="")
scripts/protocol.py:151
next →1–100 of 213, ranked by callers