proof 0.0.0

Library for interacting with SSZ merkle tree proofs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

use crate::tree_arithmetic;

pub const fn subtree_index_to_general(root: u64, index: u64) -> u64 {
    tree_arithmetic::subtree_index_to_general(root + 1, index + 1) - 1
}

pub const fn general_index_to_subtree(root: u64, index: u64) -> u64 {
    tree_arithmetic::general_index_to_subtree(root + 1, index + 1) - 1
}

pub fn expand_tree_index(index: u64) -> (u64, u64, u64) {
    let (left, right, parent) = tree_arithmetic::expand_tree_index(index + 1);
    (left - 1, right - 1, parent - 1)
}

pub const fn sibling_index(index: u64) -> u64 {
    tree_arithmetic::sibling_index(index + 1) - 1
}

pub const fn left_most_leaf(root: u64, depth: u64) -> u64 {
    tree_arithmetic::left_most_leaf(root + 1, depth) - 1
}

pub const fn right_most_leaf(root: u64, depth: u64) -> u64 {
    tree_arithmetic::right_most_leaf(root + 1, depth) - 1
}

pub const fn is_in_subtree(root: u64, index: u64) -> bool {
    tree_arithmetic::is_in_subtree(root + 1, index + 1)
}

pub const fn root_from_depth(index: u64, depth: u64) -> u64 {
    tree_arithmetic::root_from_depth(index + 1, depth) - 1
}

pub const fn relative_depth(a: u64, b: u64) -> u64 {
    tree_arithmetic::relative_depth(a + 1, b + 1)
}