dg_xch_core 1.2.0

Core library containing type/error definitions, CLVM tools, Consensus and Pool definitions
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72

use crate::blockchain::sized_bytes::{Bytes32, SizedBytes};
use dg_xch_serialize::hash_256;
use once_cell::sync::Lazy;

pub const NULL: [u8; 0] = [];
pub const ONE: [u8; 1] = [0x01];
pub const TWO: [u8; 1] = [0x02];
pub const Q_KW: [u8; 1] = [0x01];
pub const A_KW: [u8; 1] = [0x02];
pub const C_KW: [u8; 1] = [0x04];

pub fn shatree_atom(atom: &[u8]) -> Bytes32 {
    Bytes32::new(&hash_256(
        ONE.iter()
            .copied()
            .chain(atom.iter().copied())
            .collect::<Vec<u8>>(),
    ))
}

pub fn shatree_pair(left_hash: &Bytes32, right_hash: &Bytes32) -> Bytes32 {
    Bytes32::new(&hash_256(
        TWO.iter()
            .copied()
            .chain(
                left_hash
                    .to_sized_bytes()
                    .iter()
                    .copied()
                    .chain(right_hash.to_sized_bytes().iter().copied()),
            )
            .collect::<Vec<u8>>(),
    ))
}

pub static Q_KW_TREEHASH: Lazy<Bytes32> = Lazy::new(|| shatree_atom(&Q_KW));
pub static A_KW_TREEHASH: Lazy<Bytes32> = Lazy::new(|| shatree_atom(&A_KW));
pub static C_KW_TREEHASH: Lazy<Bytes32> = Lazy::new(|| shatree_atom(&C_KW));
pub static ONE_TREEHASH: Lazy<Bytes32> = Lazy::new(|| shatree_atom(&ONE));
pub static NULL_TREEHASH: Lazy<Bytes32> = Lazy::new(|| shatree_atom(&NULL));

pub fn curried_values_tree_hash(arguments: &[Bytes32]) -> Bytes32 {
    if arguments.is_empty() {
        *ONE_TREEHASH
    } else {
        shatree_pair(
            &C_KW_TREEHASH,
            &shatree_pair(
                &shatree_pair(&Q_KW_TREEHASH, &arguments[0]),
                &shatree_pair(&curried_values_tree_hash(&arguments[1..]), &NULL_TREEHASH),
            ),
        )
    }
}

pub fn curry_and_treehash(
    hash_of_quoted_mod_hash: &Bytes32,
    hashed_arguments: &[Bytes32],
) -> Bytes32 {
    let curried_values = curried_values_tree_hash(hashed_arguments);
    shatree_pair(
        &A_KW_TREEHASH,
        &shatree_pair(
            hash_of_quoted_mod_hash,
            &shatree_pair(&curried_values, &NULL_TREEHASH),
        ),
    )
}

pub fn calculate_hash_of_quoted_mod_hash(mod_hash: &Bytes32) -> Bytes32 {
    shatree_pair(&Q_KW_TREEHASH, mod_hash)
}