MCPcopy Create free account

hub / github.com/BitVM/BitVM / functions

Functions2,120 in github.com/BitVM/BitVM

⨍ Functions 2,120◇ Types & classes 197
↓ 1 callersFunctionu4_2_nib_shift_stack
Assuming the u4 numbers X and Y are on top of the stack, calculates (16 * Y + X) >> n modulo 16
bitvm/src/u4/u4_shift_stack.rs:83
↓ 1 callersFunctionu4_add_carry_nested
Calculates the modulo 16 of the u4 at the top of the stack also with the quotient, parameters being internal values
bitvm/src/u4/u4_add.rs:101
↓ 1 callersFunctionu4_add_nested
Calculates the modulo 16 of the u4 at the top of the stack, parameters being internal values
bitvm/src/u4/u4_add.rs:121
↓ 1 callersFunctionu4_arrange_nibbles
Arranges (zips) the given numbers (locations given by the parameters bases) each consisting of nibble_count u4's so each group of nibbles can be procc
bitvm/src/u4/u4_add.rs:84
↓ 1 callersFunctionu4_hex_to_nibbles
(hex_str: &str)
bitvm/src/hash/sha256_u4_stack.rs:767
↓ 1 callersFunctionu4_push_from_depth_full_lookup
Pushes table for the value x * 16
bitvm/src/u4/u4_logic_stack.rs:51
↓ 1 callersFunctionu4_push_from_depth_half_lookup
Pushes the table to calculate the order of ordered pairs (a, b) satisfying the conditions a <= b and 0 <= a, b < 16
bitvm/src/u4/u4_logic_stack.rs:61
↓ 1 callersFunctionu4_push_full_lookup
Pushes table for the value x * 16
bitvm/src/u4/u4_logic.rs:27
↓ 1 callersFunctionu4_push_full_xor_table
Pushes the bitwise XOR table
bitvm/src/u4/u4_logic.rs:11
↓ 1 callersFunctionu4_push_half_and_table
Pushes the half bitwise AND table
bitvm/src/u4/u4_logic.rs:52
↓ 1 callersFunctionu4_push_half_and_table_stack
Push half AND table
bitvm/src/u4/u4_logic_stack.rs:14
↓ 1 callersFunctionu4_push_half_lookup_0_based
Pushes the table to calculate the order of ordered pairs (a, b) satisfying the conditions a <= b and 0 <= a, b < 15
bitvm/src/u4/u4_logic_stack.rs:29
↓ 1 callersFunctionu4_push_half_xor_table
Pushes the half bitwise XOR table
bitvm/src/u4/u4_logic.rs:41
↓ 1 callersFunctionu4_push_modulo_table_5
Pushes the table for calculating the modulo, i.e. x % 16 for x < 80. i.e. 15 (max u4) * 5 (max # numbers to sum) + 4 (max carry)
bitvm/src/u4/u4_add.rs:50
↓ 1 callersFunctionu4_push_quotient_table_5
Pushes the table for calculating the quotient, i.e. floor(x / 16) for x < 80. i.e. 15 (max u4) * 5 (max # numbers to sum) + 4 (max carry)
bitvm/src/u4/u4_add.rs:21
↓ 1 callersFunctionu4_sort
Sorts the top 2 stack values
bitvm/src/u4/u4_logic.rs:192
↓ 1 callersFunctionu8_extract_1bit
Extracts (puts it at the top of the stack) the most significant bit of the u8 number and multiplies it by 2 modulo 256
bitvm/src/u32/u32_rrot.rs:87
↓ 1 callersMethodupload_compressed_object
( &self, file_name: &str, contents: &Vec<u8>, file_path: Option<&str>, )
bridge/src/client/data_store/sftp.rs:247
↓ 1 callersMethodupload_object
( &self, key: &str, data: ByteStream, file_path: Option<&str>, )
bridge/src/client/data_store/aws_s3.rs:80
↓ 1 callersMethodupload_object
( &self, file_name: &str, data: Vec<u8>, file_path: Option<&str>, )
bridge/src/client/data_store/local_file.rs:61
↓ 1 callersFunctionutils_analyze_largest_segments
This is a duplicate of [`utils_execute_chunked_g16`], just to analyze worst case scenarios
bitvm/src/chunk/api_runtime_utils.rs:443
↓ 1 callersFunctionutils_multiply_by_line_eval
Given line evaluation f, line coeff (alpha_t3, neg_bias_t3) and point P3, Compute line evaluation 'g' at P3 and multiply it with f. Return Script and
bitvm/src/chunk/taps_mul.rs:151
↓ 1 callersFunctionutils_raw_witnesses_from_signatures
(signatures: &Signatures)
bitvm/src/chunk/api.rs:115
↓ 1 callersFunctionutils_signatures_from_raw_witnesses
(raw_wits: &[RawWitness])
bitvm/src/chunk/api.rs:90
↓ 1 callersFunctionvalidate_timestamp
(block_time: u32, prev_11_timestamps: [u32; 11])
header-chain/src/header_chain.rs:292
↓ 1 callersMethodvalidate_verifying_key
TODO: This is TBD. Verifying key validation is unclear at the moment. We'll add it once circuit design is finalized and we can run a Groth16 setup.
bridge/src/client/cli/key_command.rs:196
↓ 1 callersMethodverifier_sign
( &mut self, verifier_context: &VerifierContext, secret_nonces: &HashMap<Txid, HashMap
bridge/src/graphs/peg_in.rs:122
↓ 1 callersMethodverifier_status
( &self, client: &AsyncClient, verifier_context: &VerifierContext, peg_outs: &
bridge/src/graphs/peg_in.rs:300
↓ 1 callersMethodverify
(&self, method_id: [u32; 8], output: &T)
header-chain/src/zkvm.rs:51
↓ 1 callersFunctionverify_pairing
rust version of pairing verification check with normalized (1 + a. J) representation
bitvm/src/chunk/g16_runner_core.rs:582
↓ 1 callersFunctionverify_pairing_scripted
Pairing verification check with normalized (1 + a. J) representation Includes equivalent bitcoin script in for each functions
bitvm/src/chunk/g16_runner_core.rs:732
↓ 1 callersMethodverify_proof
Verifies an inclusion proof against the current MMR root
header-chain/src/mmr_guest.rs:36
↓ 1 callersFunctionverify_public_nonce
(sig: &Signature, nonce: &PubNonce, pubkey: &XOnlyPublicKey)
bridge/src/transactions/pre_signed_musig2.rs:110
↓ 1 callersFunctionverify_schnorr_signature
(sig: &Signature, msg: &Message, pubkey: &XOnlyPublicKey)
bridge/src/transactions/pre_signed_musig2.rs:100
↓ 1 callersFunctionwrap_chunk_final_verify
( skip: bool, segment_id: usize, in_a: &Segment, in_t4: &Segment, in_q4: Vec<Segment>,
bitvm/src/chunk/g16_runner_utils.rs:492
↓ 1 callersFunctionwrap_hint_hash_c
(skip: bool, segment_id: usize, in_c: Vec<Segment>)
bitvm/src/chunk/g16_runner_utils.rs:436
↓ 1 callersFunctionwrap_hint_hash_c_inv
(skip: bool, segment_id: usize, in_c: Vec<Segment>)
bitvm/src/chunk/g16_runner_utils.rs:464
↓ 1 callersFunctionwrap_hint_hash_p
( skip: bool, segment_id: usize, in_t: &Segment, pub_vky0: ark_bn254::G1Affine, )
bitvm/src/chunk/g16_runner_utils.rs:354
↓ 1 callersFunctionwrap_hint_init_t4
init_t4
bitvm/src/chunk/g16_runner_utils.rs:100
↓ 1 callersFunctionwrap_hint_msm
( skip: bool, segment_id: usize, scalars: Vec<Segment>, pub_vky: Vec<ark_bn254::G1Affine>, )
bitvm/src/chunk/g16_runner_utils.rs:289
↓ 1 callersFunctionwrap_hint_squaring
final verify sq
bitvm/src/chunk/g16_runner_utils.rs:77
↓ 1 callersFunctionwrap_hints_precompute_p_from_hash
( skip: bool, segment_id: usize, in_p: &Segment, )
bitvm/src/chunk/g16_runner_utils.rs:411
↓ 1 callersFunctionwrap_scr
truncate 32 byte output hash to {BLAKE3_HASH_LENGTH} hash output and pad with zeros
bitvm/src/chunk/wrap_hasher.rs:21
↓ 1 callersMethodwrite_compressed_data
( &self, contents: &Vec<u8>, file_path: Option<&str>, )
bridge/src/client/data_store/data_store.rs:152
↓ 1 callersMethodwrite_config
(&self, config: &Config)
bridge/src/client/cli/key_command.rs:180
↓ 1 callersFunctionwrite_scripts_to_file
(sig_cache: HashMap<u32, Vec<ScriptBuf>>, file: &str)
bitvm/src/chunk/api.rs:422
↓ 1 callersFunctionwrite_scripts_to_separate_files
( sig_cache: HashMap<u32, Vec<ScriptBuf>>, file: &str, )
bitvm/src/chunk/api.rs:431
FunctionNMUL
(n: u32)
bitvm/src/pseudo.rs:156
FunctionOP_16MUL
The top stack item is multiplied by 16
bitvm/src/pseudo.rs:98
FunctionOP_256MUL
The top stack item is multiplied by 256
bitvm/src/pseudo.rs:106
FunctionOP_2MUL
The top stack item is multiplied by 2
bitvm/src/pseudo.rs:75
FunctionOP_4DROP
Drops the top 4 items
bitvm/src/pseudo.rs:42
FunctionOP_4DUP
Duplicates the top 4 items
bitvm/src/pseudo.rs:35
FunctionOP_4FROMALTSTACK
Puts the top 4 items from the altstack onto the top of the main stack. Removes them from the alt stack.
bitvm/src/pseudo.rs:64
FunctionOP_4MUL
The top stack item is multiplied by 4
bitvm/src/pseudo.rs:82
FunctionOP_4PICK
OP_4PICK The 4 items n back in the stack are copied to the top.
bitvm/src/pseudo.rs:12
FunctionOP_4ROLL
OP_4ROLL The 4 items n back in the stack are moved to the top.
bitvm/src/pseudo.rs:24
FunctionOP_4SWAP
Swaps the top two groups of 4 items
bitvm/src/pseudo.rs:49
FunctionOP_4TOALTSTACK
Puts the top 4 items onto the top of the alt stack. Removes them from the main stack.
bitvm/src/pseudo.rs:57
FunctionOP_CHECKSEQUENCEVERIFY
()
bitvm/src/pseudo.rs:6
FunctionOP_NDUP
(n: usize)
bitvm/src/pseudo.rs:115
Method_add_ref_inner
Underlying add_ref implementation used by both `add_ref` and `add_ref_stack` functions. The commented section is supposed to handle depth=0, which fai
bitvm/src/bigint/add.rs:312
Methodadd
Compute the sum of two BigInts
bitvm/src/bigint/add.rs:37
Methodadd
A + B mod M Ci⁺ overflow carry bit (A+B) Ci⁻ overflow carry bit (A-B)
bitvm/src/bn254/fp254impl.rs:160
Methodadd
(mut a: u32, mut b: u32)
bitvm/src/bn254/fq12.rs:71
Methodadd
(mut a: u32, mut b: u32)
bitvm/src/bn254/fq6.rs:92
Methodadd1
add one
bitvm/src/bigint/add.rs:67
Methodadd_output
(&mut self, output_script_pubkey: ScriptBuf)
bridge/src/transactions/start_time_timeout.rs:224
Methodadd_output
(&mut self, output_script_pubkey: ScriptBuf)
bridge/src/transactions/kick_off_timeout.rs:162
Methodadd_ref
Add BigInt on top of the stack to a BigInt at `b` depth in the stack # Note This function consumes the BigInt on top of the stack while not consumin
bitvm/src/bigint/add.rs:261
Methodadd_ref_stack
Add BigInt referenced by the integer (depth) on top of the stack to the BigInt at the top the stack below the depth # Note This function consumes th
bitvm/src/bigint/add.rs:301
Methodadd_ref_with_top
(b: u32)
bitvm/src/bigint/add.rs:221
Methodaffine_add_in_place
(t: &mut ark_bn254::G2Affine, q: &ark_bn254::G2Affine)
bitvm/src/bn254/ell_coeffs.rs:57
Methodaffine_double_in_place
( t: &mut ark_bn254::G2Affine, three_div_two: &ark_bn254::Fq, )
bitvm/src/bn254/ell_coeffs.rs:35
Functionapi_get_assertions_from_signature
(signed_asserts: Signatures)
bitvm/src/chunk/api.rs:52
Functionapi_get_signature_from_assertion
(assn: Assertions, secrets: Vec<String>)
bitvm/src/chunk/api.rs:48
Methodarbitrary
(u: &mut Unstructured<'a>)
fuzz/fuzz_targets/bigint/bigint_transform.rs:100
Methodbigint_tmul_lc_1
()
bitvm/src/bn254/fq.rs:65
Methodbigint_tmul_lc_2
()
bitvm/src/bn254/fq.rs:72
Methodbigint_tmul_lc_2_w4
()
bitvm/src/bn254/fq.rs:79
Methodbigint_tmul_lc_4
()
bitvm/src/bn254/fq.rs:86
Functionbigint_to_u32_limbs
(n: BigInt, n_bits: u32)
bitvm/src/bn254/fq.rs:470
Functionbigint_verify_output_script
Verifies two bigints of n_element size on the stack
fuzz/fuzz_targets/bigint/utils.rs:4
Methodbiguint_to_limbs
(x: BigUint)
bitvm/src/bigint/std.rs:26
Methodblake3_compute_script
(&self)
fuzz/fuzz_targets/blake3.rs:55
Methodbroadcast_command
()
bridge/src/client/cli/query_command.rs:498
Methodbyte_array_to_nib
(bytes: &[u8])
bitvm/src/chunk/elements.rs:163
Functionbyte_reorder
Reorders (reverse and rotate) the bytes of an u32 number, assuming the starting order is 1 2 3 4 (4 being at the top): if offset is 0, then reorder is
bitvm/src/u32/u32_rrot.rs:141
Functioncalculate_double_sha256
(input: &[u8])
header-chain/src/utils.rs:3
Methodcalculate_root_with_merkle_proof
Calculates the Bitcoin Merkle root from a leaf's transaction ID (mid_state_txid) and its inclusion proof derived from a "mid-state" Merkle tree. This
final-spv/src/merkle_tree.rs:206
Functioncalculate_s_part_1
( offset_number: u32, offset_rrot: u32, shift_value: Vec<u32>, last_is_shift: bool, )
bitvm/src/hash/sha256_u4.rs:106
Functioncalculate_s_part_2
(offset_and: u32, do_xor_with_and: bool)
bitvm/src/hash/sha256_u4.rs:119
Functioncalculate_sha256
(input: &[u8])
header-chain/src/utils.rs:11
Functionch
Push (((x) & (y)) ^ (~(x) & (z))) into stack
bitvm/src/hash/sha256.rs:854
Methodcheck_validity
()
bitvm/src/bigint/std.rs:346
Methodcheck_validity
verifies that the element at the top of the stack is less than the modulo and valid (limbs are in range) doesn't consume the element, instead sends it
bitvm/src/bn254/fp254impl.rs:532
Methodcheck_validity
()
bitvm/src/bn254/fq12.rs:286
Methodcheck_validity
()
bitvm/src/bn254/fq2.rs:364
Methodcheck_validity
()
bitvm/src/bn254/fq6.rs:729
Methodcheck_validity_and_keep_element
()
bitvm/src/bn254/fp254impl.rs:560
← previousnext →801–900 of 2,120, ranked by callers