MCPcopy Create free account

hub / github.com/andrewmilson/sandstorm / functions

Functions239 in github.com/andrewmilson/sandstorm

⨍ Functions 239◇ Types & classes 118
↓ 153 callersMethodoffset
(&self, cycle_offset: isize)
layouts/src/starknet/air.rs:2544
↓ 56 callersMethodpush
Pushes a memory access to the pool
layouts/src/utils.rs:164
↓ 48 callersMethodoffset
(&self, cycle_offset: isize)
layouts/src/recursive/air.rs:1329
↓ 18 callersMethodget_flag
(&self, flag: Flag)
binary/src/lib.rs:591
↓ 14 callersFunctionverify
( required_security_bits: u8, proof_path: &PathBuf, claim: Claim, )
cli/src/main.rs:168
↓ 12 callersMethodcol_and_shift
Output is of the form (col_idx, row_shift)
layouts/src/starknet/air.rs:2591
↓ 12 callersMethodindex
(&self)
layouts/src/starknet/air.rs:2540
↓ 11 callersMethodclone
(&self)
crypto/src/merkle/mod.rs:56
↓ 11 callersMethodinverse
(self)
builtins/src/utils.rs:67
↓ 11 callersFunctionmap_into_fp_array
Maps array items into `FieldVariant::Fp` TODO: remove. need for const fn.
layouts/src/utils.rs:397
↓ 10 callersMethodpush_diluted
Pushes a binary value with dilution to the pool
layouts/src/utils.rs:256
↓ 9 callersMethodmem_addr
Get the memory address for this instance Output is of the form (pubkey_addr, msg_addr)
binary/src/lib.rs:364
↓ 9 callersFunctionpedersen_hash
Computes the Pedersen hash of a and b using StarkWare's parameters. The hash is defined by: shift_point + x_low * P_0 + x_high * P1 + y_low * P2 + y_
builtins/src/pedersen/mod.rs:31
↓ 8 callersMethodindex
(&self)
layouts/src/recursive/air.rs:1325
↓ 8 callersMethodinto_felt
(self)
binary/src/lib.rs:718
↓ 7 callersMethodget_off_dst
(&self)
binary/src/lib.rs:595
↓ 7 callersMethodget_off_op0
(&self)
binary/src/lib.rs:601
↓ 7 callersMethodget_off_op1
(&self)
binary/src/lib.rs:607
↓ 7 callersMethodpublic_memory_padding
(&self)
binary/src/lib.rs:337
↓ 7 callersMethodroot
(&self)
crypto/src/merkle/mod.rs:72
↓ 6 callersFunctioncalculate_slope
calculates the slope between points `p1` and `p2` Returns None if one of the points is the point at infinity
builtins/src/utils.rs:163
↓ 6 callersMethodcol_and_shift
Output is of the form (col_idx, row_shift)
layouts/src/recursive/air.rs:1615
↓ 6 callersMethodget_op0_addr
(&self, ap: usize, fp: usize)
binary/src/lib.rs:580
↓ 6 callersMethodindex
(&self)
layouts/src/plain/air.rs:632
↓ 6 callersFunctionmimic_ec_mad_air
Computes `m * point + shift_point` using the same steps like the AIR and Returns None if and only if the AIR errors.
builtins/src/ecdsa/mod.rs:308
↓ 5 callersMethodget_dst
(&self, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:653
↓ 5 callersMethodget_flag_group
(&self, flag_group: FlagGroup)
binary/src/lib.rs:613
↓ 5 callersMethodget_op1_addr
(&self, pc: usize, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:657
↓ 5 callersMethodget_ordered_values_with_padding
Returns an ordered list of diluted check values with padding. Diluted check values, in their regular form, need to be continuos. For example with SPAC
layouts/src/utils.rs:295
↓ 5 callersMethodreseed_with_bytes
(&mut self, bytes: impl AsRef<[u8]>)
crypto/src/public_coin/cairo.rs:42
↓ 5 callersFunctionto_montgomery
(v: Fp)
crypto/src/utils.rs:15
↓ 4 callersMethodget_dst_addr
(&self, ap: usize, fp: usize)
binary/src/lib.rs:586
↓ 4 callersMethodget_res
(&self, pc: usize, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:673
↓ 4 callersMethodget_tmp0
(&self, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:705
↓ 4 callersMethodmin
(&self)
layouts/src/utils.rs:336
↓ 4 callersMethodreseed_with_bytes
(&mut self, bytes: impl AsRef<[u8]>)
crypto/src/public_coin/solidity.rs:36
↓ 3 callersFunctiondoubling_steps
(num_steps: usize, mut p: Projective<StarkwareCurve>)
builtins/src/ecdsa/mod.rs:207
↓ 3 callersFunctionexecute_command
( command: Command, claim: Claim, )
cli/src/main.rs:138
↓ 3 callersMethodfinal_ap
(&self)
binary/src/lib.rs:333
↓ 3 callersMethodfinal_pc
(&self)
binary/src/lib.rs:325
↓ 3 callersMethodget_flag_prefix
Calculates $\tilde{f_i}$ - https://eprint.iacr.org/2021/1063.pdf
binary/src/lib.rs:569
↓ 3 callersMethodget_op0
(&self, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:649
↓ 3 callersMethodget_op1
(&self, pc: usize, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:669
↓ 3 callersMethodget_tmp1
(&self, pc: usize, ap: usize, fp: usize, mem: &Memory<F>)
binary/src/lib.rs:714
↓ 3 callersMethodinitial_ap
(&self)
binary/src/lib.rs:329
↓ 3 callersMethodinitial_pc
(&self)
binary/src/lib.rs:321
↓ 3 callersMethodmax
(&self)
layouts/src/utils.rs:340
↓ 3 callersMethodtranspose
(self)
builtins/src/utils.rs:52
↓ 2 callersMethodas_bytes
(&self)
crypto/src/merkle/mixed.rs:80
↓ 2 callersFunctionbench_proof_of_work
(c: &mut Criterion, p: P, id: &str)
crypto/benches/public_coin.rs:14
↓ 2 callersFunctionconstant_points_evals
Ouptut is of the form (x_points_evals, y_points_evals)
builtins/src/pedersen/periodic.rs:1212
↓ 2 callersMethoddraw_bytes
(&mut self)
crypto/src/public_coin/cairo.rs:51
↓ 2 callersMethoddraw_bytes
(&mut self)
crypto/src/public_coin/solidity.rs:45
↓ 2 callersFunctionfrom_montgomery
(v: U256)
crypto/src/utils.rs:9
↓ 2 callersFunctiongen_element_steps
( x: Fp, p0: Affine<StarkwareCurve>, p1: Affine<StarkwareCurve>, p2: Affine<StarkwareCurve>, )
builtins/src/pedersen/mod.rs:129
↓ 2 callersFunctiongen_half_full_round_states
( mut state: [Fp; 3], round_keys: [[Fp; 3]; NUM_FULL_ROUNDS / 2], )
builtins/src/poseidon/mod.rs:118
↓ 2 callersFunctiongenerator_points_evals
Ouptut is of the form (x_points_coeffs, y_points_coeffs)
builtins/src/ecdsa/periodic.rs:628
↓ 2 callersMethodsharp_code
Returns the unique code used by SHARP associated to this layout
binary/src/lib.rs:96
↓ 1 callersMethodbase_columns
(&self)
layouts/src/starknet/trace.rs:993
↓ 1 callersMethodbase_columns
(&self)
layouts/src/recursive/trace.rs:695
↓ 1 callersMethodbase_columns
(&self)
layouts/src/plain/trace.rs:273
↓ 1 callersMethodbase_values
(&self)
src/input.rs:10
↓ 1 callersFunctiondeserialize_hex_str
Deserializes a hex string into a big integer
binary/src/utils.rs:30
↓ 1 callersMethoddraw
(&mut self)
crypto/src/public_coin/cairo.rs:97
↓ 1 callersFunctionflatten
(l)
example/gen_poly.py:341
↓ 1 callersFunctiongen_dummy_instance
Generates a dummy EC op instance using `private_key = 1`
builtins/src/ec_op/mod.rs:89
↓ 1 callersFunctiongen_dummy_instance
Generates a dummy signature using `private_key = 1`
builtins/src/ecdsa/mod.rs:223
↓ 1 callersFunctiongen_ec_mad_steps
Generates a list of the steps involved with `p + m * q` Different failure cases to [crate::ecdsa::gen_ec_mad_steps]
builtins/src/ec_op/mod.rs:104
↓ 1 callersMethodget_public_inputs
(&self)
src/lib.rs:122
↓ 1 callersMethodgrind_proof_of_work
(&self, proof_of_work_bits: u8)
crypto/src/public_coin/cairo.rs:133
↓ 1 callersMethodlayout_specific_values
(&self)
src/input.rs:48
↓ 1 callersFunctionmimic_ec_mad_air
Computes `p + m * q` using the same steps as the AIR Returns None if and only if the AIR errors.
builtins/src/ec_op/mod.rs:141
↓ 1 callersFunctionprocess_element
( x: Fp, p1: Projective<StarkwareCurve>, p2: Projective<StarkwareCurve>, )
builtins/src/pedersen/mod.rs:48
↓ 1 callersFunctionprove
( options: ProofOptions, private_input_path: &PathBuf, output_path: &PathBuf, claim: Claim, )
cli/src/main.rs:180
↓ 1 callersMethodprove
(&self, indices: &[usize])
crypto/src/merkle/mod.rs:79
↓ 1 callersMethodsecurity_level_bits
()
crypto/src/merkle/mod.rs:100
↓ 1 callersFunctiontry_felt_from_u256
(value: U256)
binary/src/utils.rs:12
↓ 1 callersFunctionverify
Verifies a signature Returns the associated public key if the signature is valid Returns None if the signature is invalid based on: https://github.com
builtins/src/ecdsa/mod.rs:275
↓ 1 callersMethodverify
(root: &Self::Root, proof: Self::Proof, indices: &[usize])
crypto/src/merkle/mod.rs:86
Function_calc_optimized_partial_round_keys
This is mentioned in section B of the Poseidon paper. Sources: <https://eprint.iacr.org/2019/458.pdf> <https://extgit.iaik.tugraz.at/krypto/hadeshash/
builtins/src/poseidon/mod.rs:225
Function_deserialize_vec_big_uint
Deserializes a JSON list of big integers See docs for [deserialize_big_uint] to understand why this is needed. TODO: consider removing
binary/src/utils.rs:77
Function_permute_optimized
Computes the Poseidon hash using StarkWare's parameters. Source: <https://extgit.iaik.tugraz.at/krypto/hadeshash/-/blob/master/code/starkadperm_x5_256
builtins/src/poseidon/mod.rs:189
Methodas_bytes
(&self)
crypto/src/hash/pedersen.rs:24
Methodbuild_extension_columns
(&self, challenges: &Challenges<Fp>)
layouts/src/starknet/trace.rs:997
Methodbuild_extension_columns
(&self, challenges: &Challenges<Fp>)
layouts/src/recursive/trace.rs:699
Methodbuild_extension_columns
(&self, challenges: &Challenges<Fq>)
layouts/src/plain/trace.rs:277
Methodcheck
(&self)
crypto/src/merkle/mod.rs:216
Methodcheck
(&self)
crypto/src/merkle/mixed.rs:74
Methodcheck
(&self)
binary/src/lib.rs:130
Methodcomposition_constraint
( _trace_len: usize, constraints: &[Constraint<FieldVariant<Self::Fp, Self::Fq>>], )
layouts/src/starknet/air.rs:2390
Methodcomposition_constraint
( _trace_len: usize, constraints: &[Constraint<FieldVariant<Self::Fp, Self::Fq>>], )
layouts/src/recursive/air.rs:1184
Functioncompute_diluted_cumulative_value
Source: https://github.com/starkware-libs/starkex-contracts # Context The cumulative value is defined using the following recursive formula: $$r_1 =
layouts/src/utils.rs:83
Functioncompute_public_memory_quotient
Computes the value of the public memory quotient: Adapted from https://github.com/starkware-libs/starkex-contracts
layouts/src/utils.rs:14
Functionconstant_points
()
builtins/src/pedersen/constants.rs:2065
Methodconstraints
(trace_len: usize)
layouts/src/starknet/air.rs:115
Methodconstraints
(trace_len: usize)
layouts/src/recursive/air.rs:61
Methodconstraints
(trace_len: usize)
layouts/src/plain/air.rs:36
Methoddefault
()
crypto/src/merkle/mixed.rs:41
Methoddefault
()
layouts/src/utils.rs:233
Methodderef
(&self)
crypto/src/hash/pedersen.rs:33
next →1–100 of 239, ranked by callers