MCPcopy Create free account

hub / github.com/Lagrange-Labs/reckle-trees / functions

Functions137 in github.com/Lagrange-Labs/reckle-trees

Functionleaf_circuit_setup
()
src/digest_translation/binary_circuits.rs:24
Functionleaf_circuit_setup
( min_degree_bits: Option<&usize>, )
src/bls/binary_circuits.rs:24
Functionleaf_circuit_setup
( _min_degree_bits: Option<&usize>, )
src/reckle_bucket/binary_circuits.rs:17
Functionmt_test_base
(ell: u8, log_subset_size: u8)
src/utils/mt_binary.rs:362
Functionmt_test_default
()
src/utils/mt_binary.rs:422
Methodnew
( pp: &'a SNARK_PP<F, C, D>, mt: &'a PartialMT<F, H>, ct: &'a CanonicalTree<F, H>,
src/reckle_std/provers.rs:45
Methodnew
Synonymous with aggregation
src/reckle_std/binary_tree.rs:38
Methodnew
( left_merkle_target: HashOutTarget, left_canonical_target: HashOutTarget, right_merk
src/reckle_std/wire_information.rs:27
Methodnew
Assumes unknown sibling to be H(0)
src/utils/mt_binary.rs:59
Methodnew
(log_max_capacity: u8, subset_leaves: &HashMap<u32, Vec<F>>)
src/utils/canonical.rs:19
Methodnew
(data_target: &[HashOutTarget])
src/baseline/digest_translation/wire_information.rs:12
Methodnew
( digest_target: HashOutTarget, index_target: &Vec<Target>, pk_target: &Vec<Vec<Target
src/baseline/bls/wire_information.rs:23
Methodnew
( pp: &'a SNARK_PP<F, C, D>, mt_kh: &'a PartialMT<F, KH>, mt_ph: &'a PartialMT<F, PH>,
src/digest_translation/provers.rs:46
Methodnew
(pp: &SNARK_PP<F, C, D>, leaves: HashMap<u32, Vec<F>>)
src/digest_translation/binary_tree.rs:41
Methodnew
( left_data_target: [Target; NUM_HASH_OUT_ELTS], right_data_target: [Target; NUM_HASH_OUT_ELTS
src/digest_translation/wire_information.rs:15
Methodnew
( leaves: &'a HashMap<u32, Vec<F>>, pp: &'a SNARK_PP<Q, F, C, D>, mt: &'a PartialMT<F,
src/bls/provers.rs:46
Methodnew
(log_tree_size: u8, pp: &SNARK_PP<Q, F, C, D>, leaves: HashMap<u32, Vec<F>>)
src/bls/binary_tree.rs:38
Methodnew
( left_merkle_t: HashOutTarget, left_apk_t: &[Target], right_merkle_t: HashOutTarget,
src/bls/wire_information.rs:21
Methodnew
( pp: &'a SNARK_PP<Q, F, C, D>, mt: &'a PartialMT<F, C::Hasher>, ct: &'a CanonicalTree
src/reckle_bucket/provers.rs:44
Methodnew
(log_tree_size: u8, pp: &SNARK_PP<Q, F, C, D>, leaves: HashMap<u32, Vec<F>>)
src/reckle_bucket/binary_tree.rs:40
Methodnew
(merkle_targets_q: &[HashOutTarget], canonical_targets_q: &[HashOutTarget])
src/reckle_bucket/wire_information.rs:19
Methodnew_bucket
( log_bucket_size: usize, log_max_capacity: u8, leaves: &HashMap<u32, Vec<F>>, )
src/utils/mt_binary.rs:223
Methodprove_bucket
(&self, log_bucket_size: usize, leaf_index: u32)
src/utils/mt_binary.rs:104
Functionrec_benches
()
src/reckle_std/binary_tree.rs:420
Functionrec_test_1
()
src/reckle_std/binary_tree.rs:406
Functionrec_test_base
(log_tree_size: u8, log_subset_size: u8)
src/reckle_std/binary_tree.rs:345
Functionrec_worker
()
src/reckle_std/benches.rs:19
Methodsetup
(log_max_capacity: u8)
src/reckle_std/binary_pp.rs:50
Methodsetup
(log_max_capacity: u8)
src/digest_translation/binary_pp.rs:45
Methodsetup
(log_max_capacity: u8)
src/bls/binary_pp.rs:50
Methodsetup
(log_max_capacity: u8)
src/reckle_bucket/binary_pp.rs:52
Methodsize_by_level
(&self, pp: &SNARK_PP<F, C, D>, updated_index: u32)
src/digest_translation/binary_tree.rs:218
Methodsize_by_level
(&self, pp: &SNARK_PP<Q, F, C, D>, updated_index: u32)
src/bls/binary_tree.rs:211
Methodsize_by_level
(&self, pp: &SNARK_PP<Q, F, C, D>, updated_index: u32)
src/reckle_bucket/binary_tree.rs:223
Methodupdate_tree
(&mut self, leaf_index: u32, updated_value: Vec<F>)
src/utils/canonical.rs:67
Functionverify_child_proof
( builder: &mut CircuitBuilder<F, D>, verifier_circuit_target: &VerifierCircuitTarget, inner_cd: &
src/bls/binary_circuits.rs:275
Methodverify_child_proof
( &mut self, verifier_circuit_target: &VerifierCircuitTarget, inner_cd: &CommonCircui
src/reckle_std/binary_circuits.rs:286
← previous101–137 of 137, ranked by callers