chia-sdk-test 0.36.0

A wallet simulator and related tooling for testing Chia wallet code.
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

use bip39::Mnemonic;
use chia_bls::{PublicKey, SecretKey};
use chia_protocol::{Bytes32, Coin};
use chia_puzzle_types::standard::StandardArgs;
use chia_secp::{K1PublicKey, K1SecretKey, R1PublicKey, R1SecretKey};
use rand::{Rng, SeedableRng};
use rand_chacha::ChaCha8Rng;

#[derive(Debug, Clone)]
pub struct BlsPair {
    pub sk: SecretKey,
    pub pk: PublicKey,
    pub puzzle_hash: Bytes32,
}

impl Default for BlsPair {
    fn default() -> Self {
        Self::new(0)
    }
}

impl BlsPair {
    pub fn new(seed: u64) -> Self {
        let mut rng = ChaCha8Rng::seed_from_u64(seed);
        let entropy: [u8; 32] = rng.random();
        let mnemonic = Mnemonic::from_entropy(&entropy).unwrap();
        let seed = mnemonic.to_seed("");
        let sk = SecretKey::from_seed(&seed);
        let pk = sk.public_key();
        Self {
            sk,
            pk,
            puzzle_hash: StandardArgs::curry_tree_hash(pk).into(),
        }
    }

    pub fn range<const N: usize>() -> [Self; N] {
        Self::range_with_seed(0)
    }

    pub fn range_with_seed<const N: usize>(seed: u64) -> [Self; N] {
        Self::range_vec_with_seed(seed, N).try_into().unwrap()
    }

    pub fn range_vec(length: usize) -> Vec<Self> {
        Self::range_vec_with_seed(0, length)
    }

    pub fn range_vec_with_seed(seed: u64, length: usize) -> Vec<Self> {
        let mut results = Vec::new();

        for i in 0..length {
            results.push(Self::new(seed + i as u64));
        }

        results
    }
}

#[derive(Debug, Clone)]
pub struct BlsPairWithCoin {
    pub sk: SecretKey,
    pub pk: PublicKey,
    pub puzzle_hash: Bytes32,
    pub coin: Coin,
}

impl BlsPairWithCoin {
    pub fn new(pair: BlsPair, coin: Coin) -> Self {
        Self {
            sk: pair.sk,
            pk: pair.pk,
            puzzle_hash: pair.puzzle_hash,
            coin,
        }
    }
}

#[derive(Debug, Clone)]
pub struct K1Pair {
    pub sk: K1SecretKey,
    pub pk: K1PublicKey,
}

impl Default for K1Pair {
    fn default() -> Self {
        Self::new(0)
    }
}

impl K1Pair {
    pub fn new(seed: u64) -> Self {
        let mut rng = ChaCha8Rng::seed_from_u64(seed);
        let sk = K1SecretKey::from_bytes(&rng.random()).unwrap();
        let pk = sk.public_key();
        Self { sk, pk }
    }

    pub fn range<const N: usize>() -> [Self; N] {
        Self::range_with_seed(0)
    }

    pub fn range_with_seed<const N: usize>(seed: u64) -> [Self; N] {
        Self::range_vec_with_seed(seed, N).try_into().unwrap()
    }

    pub fn range_vec(length: usize) -> Vec<Self> {
        Self::range_vec_with_seed(0, length)
    }

    pub fn range_vec_with_seed(seed: u64, length: usize) -> Vec<Self> {
        let mut results = Vec::new();

        for i in 0..length {
            results.push(Self::new(seed + i as u64));
        }

        results
    }
}

#[derive(Debug, Clone)]
pub struct R1Pair {
    pub sk: R1SecretKey,
    pub pk: R1PublicKey,
}

impl Default for R1Pair {
    fn default() -> Self {
        Self::new(0)
    }
}

impl R1Pair {
    pub fn new(seed: u64) -> Self {
        let mut rng = ChaCha8Rng::seed_from_u64(seed);
        let sk = R1SecretKey::from_bytes(&rng.random()).unwrap();
        let pk = sk.public_key();
        Self { sk, pk }
    }

    pub fn range<const N: usize>() -> [Self; N] {
        Self::range_with_seed(0)
    }

    pub fn range_with_seed<const N: usize>(seed: u64) -> [Self; N] {
        Self::range_vec_with_seed(seed, N).try_into().unwrap()
    }

    pub fn range_vec(length: usize) -> Vec<Self> {
        Self::range_vec_with_seed(0, length)
    }

    pub fn range_vec_with_seed(seed: u64, length: usize) -> Vec<Self> {
        let mut results = Vec::new();

        for i in 0..length {
            results.push(Self::new(seed + i as u64));
        }

        results
    }
}