MCPcopy Create free account

hub / github.com/Sin7Y/olavm / functions

Functions2,921 in github.com/Sin7Y/olavm

⨍ Functions 2,921◇ Types & classes 499
↓ 3 callersMethodmul_sub
Computes `x * y - z`.
plonky2/plonky2/src/gadgets/arithmetic.rs:181
↓ 3 callersMethodnum_base_arithmetic_ops_per_gate
The number of (base field) `arithmetic` operations that can be performed in a single gate.
plonky2/plonky2/src/plonk/circuit_builder.rs:650
↓ 3 callersFunctionnum_partial_products
Returns the length of the output of `partial_products()` on a vector of length `n`.
plonky2/plonky2/src/util/partial_products.rs:41
↓ 3 callersMethodnum_quotient_polys
(&self)
plonky2/plonky2/src/plonk/circuit_data.rs:532
↓ 3 callersFunctionnumber_from_token
(token: &Token, len: usize)
interpreter/src/utils/number.rs:231
↓ 3 callersMethodnums_permutation_zs
(&self, config: &StarkConfig)
circuits/src/stark/ola_stark.rs:336
↓ 3 callersMethodobserve_hash
(&mut self, hash: OH::Hash)
plonky2/plonky2/src/iop/challenger.rs:79
↓ 3 callersMethodon_tx_success
(&mut self)
executor/src/ola_storage.rs:392
↓ 3 callersFunctionoperand_asm_to_binary
( option_asm_op: Option<OlaAsmOperand>, mapper_label_call: &HashMap<String, usize>, mapper_label_j
assembler/src/encoder.rs:220
↓ 3 callersMethodpar_chunks
(&self, chunk_size: usize)
plonky2/maybe_rayon/src/lib.rs:176
↓ 3 callersMethodpar_iter_mut
(&'data mut self)
plonky2/maybe_rayon/src/lib.rs:95
↓ 3 callersFunctionpartial_products_and_z_gx
Compute partial products of the original vector `v` such that all products consist of `max_degree` or less elements. This is done until we've computed
plonky2/plonky2/src/util/partial_products.rs:28
↓ 3 callersMethodput
(&self, key: K, value: V)
core/src/storage/db.rs:206
↓ 3 callersFunctionquotient_chunk_products
( quotient_values: &[F], max_degree: usize, )
plonky2/plonky2/src/util/partial_products.rs:12
↓ 3 callersMethodrange_check
Checks that `x < 2^n_log` using a `BaseSumGate`.
plonky2/plonky2/src/gadgets/range_check.rs:11
↓ 3 callersMethodread_field
(&mut self)
circuits/src/stark/serialization.rs:53
↓ 3 callersMethodread_field_vec
(&mut self)
circuits/src/stark/serialization.rs:89
↓ 3 callersMethodread_merkle_cap
(&mut self)
circuits/src/stark/serialization.rs:135
↓ 3 callersFunctionreduce128
(x: u128)
plonky2/field/src/goldilocks_field.rs:342
↓ 3 callersMethodreduce_base
Reduces a vector of `Target`s using `ReducingGate`s.
plonky2/plonky2/src/util/reducing.rs:125
↓ 3 callersMethodrepeated_frobenius
Repeated Frobenius automorphisms: x -> x^(p^count). Follows precomputation suggestion in Section 11.3.3 of the Handbook of Elliptic and Hyperelliptic
plonky2/field/src/extension/mod.rs:40
↓ 3 callersFunctionreverse_index_bits
Permutes `arr` such that each index is mapped to its reverse in binary.
plonky2/util/src/lib.rs:59
↓ 3 callersMethodrun
(self)
mini-ola/src/subcommands/call.rs:45
↓ 3 callersMethodselect
See `select_ext`.
plonky2/plonky2/src/gadgets/select.rs:36
↓ 3 callersMethodselect_ext
Selects `x` or `y` based on `b`, i.e., this returns `if b { x } else { y }`.
plonky2/plonky2/src/gadgets/select.rs:11
↓ 3 callersMethodselect_ext_generalized
Like `select_ext`, but accepts a condition input which does not necessarily have to be binary. In this case, it computes the arithmetic generalization
plonky2/plonky2/src/gadgets/select.rs:25
↓ 3 callersMethodselect_hash
( &mut self, b: BoolTarget, h0: HashOutTarget, h1: HashOutTarget, )
plonky2/plonky2/src/plonk/conditional_recursive_verifier.rs:187
↓ 3 callersFunctionserialize_tree_leaf
(leaf: [GoldilocksField; TREE_VALUE_LEN])
core/src/utils.rs:39
↓ 3 callersMethodsigmas_range
Range of the sigma polynomials in the `constants_sigmas_commitment`.
plonky2/plonky2/src/plonk/circuit_data.rs:381
↓ 3 callersFunctionsplit_limbs_from_field
(value: &GoldilocksField)
core/src/utils.rs:9
↓ 3 callersMethodsub_one
TODO: Move to `Field`.
plonky2/field/src/types.rs:532
↓ 3 callersFunctiontest_low_degree
Tests that the constraints imposed by the given gate are low-degree by applying them to random low-degree witness polynomials.
plonky2/plonky2/src/gates/gate_testing.rs:23
↓ 3 callersFunctiontest_reduce_gadget
(n: usize)
plonky2/plonky2/src/util/reducing.rs:317
↓ 3 callersFunctionu256_to_tree_key
(value: &TreeKeyU256)
core/src/types/merkle_tree/mod.rs:115
↓ 3 callersFunctionu32_to_rc_no_filter
(n: u32)
circuits/src/generation/pre_process.rs:433
↓ 3 callersMethodwrite
( &mut self, contract_addr: ContractAddress, storage_key: OlaStorageKey, value
executor/src/ola_storage.rs:299
↓ 3 callersMethodwrite_field
(&mut self, x: F)
circuits/src/stark/serialization.rs:50
↓ 2 callersMethodabsorb_buffered_inputs
Absorb any buffered inputs. After calling this, the input buffer will be empty, and the output buffer will be full.
plonky2/plonky2/src/iop/challenger.rs:275
↓ 2 callersMethodadd_assign_scaled
Adds `rhs * rhs_weight` to `self`. Assumes `self.len() == rhs.len()`.
plonky2/field/src/polynomial/mod.rs:112
↓ 2 callersMethodadd_const
Computes `x + C`.
plonky2/plonky2/src/gadgets/arithmetic.rs:163
↓ 2 callersMethodadd_lookup_from_index
Adds a lookup (input, output) pair to the stored lookups. Takes a `Target` input and returns a `Target` output.
plonky2/plonky2/src/gadgets/lookup.rs:69
↓ 2 callersMethodadd_lookup_table_from_pairs
Adds a lookup table to the list of stored lookup tables `self.luts` based on a table of (input, output) pairs. It returns the index of the LUT within
plonky2/plonky2/src/gadgets/lookup.rs:50
↓ 2 callersFunctionadd_no_canonicalize_trashing_input
(x: u64, y: u64)
plonky2/field/src/goldilocks_field.rs:304
↓ 2 callersFunctionadd_no_double_overflow_64_64
(x: __m512i, y: __m512i)
plonky2/field/src/arch/x86_64/avx512_goldilocks_field.rs:260
↓ 2 callersFunctionadd_u160_u128
((x_lo, x_hi): (u128, u32), y: u128)
plonky2/plonky2/src/hash/poseidon.rs:31
↓ 2 callersMethodadd_virtual_merkle_proof
(&mut self, len: usize)
plonky2/plonky2/src/plonk/circuit_builder.rs:228
↓ 2 callersMethodand_expr
(&mut self)
interpreter/src/parser/mod.rs:609
↓ 2 callersFunctionappend_caller_callee_addr
( process: &mut Process, caller_exe_addr: Address, callee_code_addr: Address, callee_exe_addr:
executor/src/load_tx.rs:138
↓ 2 callersMethodapply_state_diff
( &mut self, tape: &mut OlaTape, storage: &mut OlaCachedStorage, state_diff: V
executor/src/contract_executor.rs:249
↓ 2 callersMethodassert_leading_zeros
Asserts that `x`'s big-endian bit representation has at least `leading_zeros` leading zeros.
plonky2/plonky2/src/gadgets/split_base.rs:29
↓ 2 callersMethodassert_zero
(&mut self, x: Target)
plonky2/plonky2/src/plonk/circuit_builder.rs:355
↓ 2 callersMethodbatch_write
(&mut self, from: u64, values: Vec<u64>)
core/src/vm/hardware.rs:274
↓ 2 callersMethodbinary_bit_shift
(&self)
core/src/vm/opcodes.rs:78
↓ 2 callersFunctionbits_u64
(n: u64)
plonky2/util/src/lib.rs:17
↓ 2 callersFunctionbytes_to_u64s
(bytes: &[u8])
plonky2/plonky2/src/hash/utils.rs:65
↓ 2 callersMethodcall_statement
(&mut self, id: Option<Token>)
interpreter/src/parser/mod.rs:381
↓ 2 callersFunctioncapacity_up_to_mut
(v: &mut Vec<T>, len: usize)
plonky2/plonky2/src/hash/merkle_tree/mod.rs:60
↓ 2 callersMethodcast_expr
(&mut self)
interpreter/src/parser/mod.rs:499
↓ 2 callersFunctioncheck_locations
( looking_locations: &[(Table, usize)], looked_locations: &[(Table, usize)], ctl_index
circuits/src/stark/cross_table_lookup.rs:1025
↓ 2 callersFunctioncheck_partial_products
Checks the relationship between each pair of partial product accumulators. In particular, this sequence of accumulators starts with `Z(x)`, then conta
plonky2/plonky2/src/util/partial_products.rs:54
↓ 2 callersMethodclear_tx_cache
(&mut self)
executor/src/ola_storage.rs:397
↓ 2 callersMethodcombine
( &self, terms: T, )
circuits/src/stark/permutation.rs:60
↓ 2 callersMethodcombine_circuit
( &self, builder: &mut CircuitBuilder<F, D>, terms: &[ExtensionTarget<D>], )
circuits/src/stark/permutation.rs:74
↓ 2 callersMethodcompound_statement
(&mut self)
interpreter/src/parser/mod.rs:227
↓ 2 callersMethodcompress
Compress all the Merkle paths in the FRI proof and remove duplicate indices.
plonky2/plonky2/src/fri/proof.rs:140
↓ 2 callersMethodcompress
Compress the proof.
plonky2/plonky2/src/plonk/proof.rs:49
↓ 2 callersMethodcompress
( &self, lhs: &TreeKey, rhs: &TreeKey, node_type: PoseidonType, )
core/src/crypto/poseidon.rs:37
↓ 2 callersFunctioncompute_evaluation
Computes P'(x^arity) from {P(x*g^i)}_(i=0..arity), where g is a `arity`-th root of unity and P' is the FRI reduced polynomial.
plonky2/plonky2/src/fri/verifier.rs:20
↓ 2 callersFunctioncompute_filter
A gate's filter designed so that it is non-zero if `s = row`.
plonky2/plonky2/src/gates/gate.rs:255
↓ 2 callersMethodconditionally_verify_proof
Verify `proof0` if `condition` else verify `proof1`. `proof0` and `proof1` are assumed to use the same `CommonCircuitData`.
plonky2/plonky2/src/plonk/conditional_recursive_verifier.rs:77
↓ 2 callersFunctionconst_layer
( state: (__m256i, __m256i, __m256i), round_const_arr: &[u64; 12], )
plonky2/plonky2/src/hash/arch/x86_64/poseidon_goldilocks_avx2_bmi2.rs:164
↓ 2 callersMethodconstant
(constant: F)
circuits/src/stark/cross_table_lookup.rs:151
↓ 2 callersMethodconstant_bool
(&mut self, b: bool)
plonky2/plonky2/src/plonk/circuit_builder.rs:419
↓ 2 callersMethodconstants_range
Range of the constants polynomials in the `constants_sigmas_commitment`.
plonky2/plonky2/src/plonk/circuit_data.rs:376
↓ 2 callersMethodconstraint_last_row
Add one constraint, but first multiply it by a filter such that it will only apply to the last row of the trace.
circuits/src/stark/constraint_consumer.rs:75
↓ 2 callersMethodcoset
The domain of the points we're interpolating.
plonky2/plonky2/src/gates/low_degree_interpolation.rs:75
↓ 2 callersFunctionctl_data_memory
()
circuits/src/builtins/rangecheck/rangecheck_stark.rs:111
↓ 2 callersFunctionctl_data_with_poseidon_chunk
()
circuits/src/cpu/cpu_stark.rs:139
↓ 2 callersFunctionctl_filter_cpu_mem_call_ret
()
circuits/src/cpu/cpu_stark.rs:62
↓ 2 callersFunctionctl_filter_cpu_storage_access
()
circuits/src/cpu/cpu_stark.rs:200
↓ 2 callersFunctionctl_filter_with_poseidon_bit0
()
circuits/src/builtins/storage/storage_access_stark.rs:74
↓ 2 callersFunctionctl_filter_with_poseidon_bit1
()
circuits/src/builtins/storage/storage_access_stark.rs:103
↓ 2 callersFunctionctl_filter_with_poseidon_chunk
()
circuits/src/cpu/cpu_stark.rs:152
↓ 2 callersMethoddeclarations
(&mut self)
interpreter/src/parser/mod.rs:372
↓ 2 callersFunctiondecode_raw_instruction
( raw_inst_str: &str, imm_str: &str, )
executor/src/decode.rs:29
↓ 2 callersMethoddecompress
Decompress all the Merkle paths in the FRI proof and reinsert duplicate indices.
plonky2/plonky2/src/fri/proof.rs:248
↓ 2 callersMethoddependencies
(&self)
plonky2/plonky2/src/iop/generator.rs:268
↓ 2 callersMethoddiv_add_extension
Computes ` x / y + z`.
plonky2/plonky2/src/gadgets/arithmetic_extension.rs:472
↓ 2 callersMethoddiv_rem_long_division
Polynomial long division. Returns `(q, r)`, the quotient and remainder of the polynomial division of `a` by `b`. Generally slower that the equivalent
plonky2/field/src/polynomial/division.rs:42
↓ 2 callersMethoddivide_by_linear
Let `self=p(X)`, this returns `(p(X)-p(z))/(X-z)`. See https://en.wikipedia.org/wiki/Horner%27s_method
plonky2/field/src/polynomial/division.rs:74
↓ 2 callersMethoddump
(&self)
core/src/vm/hardware.rs:386
↓ 2 callersMethodempty_tree
Returns reference to precalculated empty Merkle Tree hashes starting from leaf.
core/src/merkle_tree/tree_config.rs:66
↓ 2 callersMethodend_coeffs
(&self)
plonky2/plonky2/src/gates/interpolation.rs:76
↓ 2 callersMethodeval_inverse
Returns `1 / Z_H(g * w^i)`.
plonky2/field/src/zero_poly_coset.rs:40
↓ 2 callersFunctioneval_l_0_and_l_last
Evaluate the Lagrange polynomials `L_0` and `L_(n-1)` at a point `x`. `L_0(x) = (x^n - 1)/(n * (x - 1))` `L_(n-1)(x) = (x^n - 1)/(n * (g * x - 1))`, w
circuits/src/stark/verifier.rs:381
↓ 2 callersMethodeval_scalar
( &self, builder: &mut CircuitBuilder<F, D>, point: Target, )
plonky2/plonky2/src/gadgets/polynomial.rs:17
↓ 2 callersMethodeval_unfiltered_base_packed
( &self, _vars: EvaluationVarsBasePacked<P>, mut _yield_constr: StridedConstraintConsu
plonky2/plonky2/src/gates/lookup.rs:257
↓ 2 callersFunctionevaluate_poly_with_offset
( p: &[F], twiddles: &[F], domain_offset: F, blowup_factor: usize, )
plonky2/field/src/cfft/mod.rs:63
↓ 2 callersFunctionfe_option_opcode
(op: Option<OlaOpcode>)
circuits/src/generation/pre_process.rs:449
↓ 2 callersFunctionfft_dispatch
( input: &mut [F], zero_factor: Option<usize>, root_table: Option<&FftRootTable<F>>, )
plonky2/field/src/fft.rs:36
← previousnext →501–600 of 2,921, ranked by callers