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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
// Copyright 2021 Parity Technologies (UK) Ltd.
// This file is part of Parity Bridges Common.

// Parity Bridges Common is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// Parity Bridges Common is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with Parity Bridges Common.  If not, see <http://www.gnu.org/licenses/>.

//! Utilities for testing runtime code.

use crate::bridges::header_chain as bp_header_chain;

use bp_header_chain::justification::GrandpaJustification;
use sp_consensus_grandpa::{AuthorityId, AuthoritySignature, AuthorityWeight, SetId};
use sp_runtime::traits::{Header as HeaderT, One, Zero};
use sp_std::{convert::TryFrom, prelude::*, vec};
// Re-export all our test account utilities

pub use keyring::*;

mod keyring;

pub const TEST_GRANDPA_ROUND: u64 = 1;
pub const TEST_GRANDPA_SET_ID: SetId = 1;

/// Configuration parameters when generating test GRANDPA justifications.
#[derive(Clone)]
pub struct JustificationGeneratorParams<H> {
    /// The header which we want to finalize.
    pub header: H,
    /// The GRANDPA round number for the current authority set.
    pub round: u64,
    /// The current authority set ID.
    pub set_id: SetId,
    /// The current GRANDPA authority set.
    ///
    /// The size of the set will determine the number of pre-commits in our justification.
    pub authorities: Vec<(Account, AuthorityWeight)>,
    /// The total number of vote ancestries in our justification.
    ///
    /// These may be distributed among many different forks.
    pub votes: u32,
    /// The number of forks.
    ///
    /// Useful for creating a "worst-case" scenario in which each authority is on its own fork.
    pub forks: u32,
}

impl<H: HeaderT> Default for JustificationGeneratorParams<H> {
    fn default() -> Self {
        Self {
            header: test_header(One::one()),
            round: TEST_GRANDPA_ROUND,
            set_id: TEST_GRANDPA_SET_ID,
            authorities: test_keyring(),
            votes: 2,
            forks: 1,
        }
    }
}

/// Make a valid GRANDPA justification with sensible defaults
pub fn make_default_justification<H: HeaderT>(header: &H) -> GrandpaJustification<H> {
    let params = JustificationGeneratorParams::<H> {
        header: header.clone(),
        ..Default::default()
    };

    make_justification_for_header(params)
}

/// Generate justifications in a way where we are able to tune the number of pre-commits
/// and vote ancestries which are included in the justification.
///
/// This is useful for benchmarkings where we want to generate valid justifications with
/// a specific number of pre-commits (tuned with the number of "authorities") and/or a specific
/// number of vote ancestries (tuned with the "votes" parameter).
///
/// Note: This needs at least three authorities or else the verifier will complain about
/// being given an invalid commit.
pub fn make_justification_for_header<H: HeaderT>(
    params: JustificationGeneratorParams<H>,
) -> GrandpaJustification<H> {
    let JustificationGeneratorParams {
        header,
        round,
        set_id,
        authorities,
        mut votes,
        forks,
    } = params;

    let (target_hash, target_number) = (header.hash(), *header.number());
    let mut precommits = vec![];
    let mut votes_ancestries = vec![];

    assert!(forks != 0, "Need at least one fork to have a chain..");
    assert!(votes >= forks, "Need at least one header per fork.");
    assert!(
		forks as usize <= authorities.len(),
		"If we have more forks than authorities we can't create valid pre-commits for all the forks."
	);

    // Roughly, how many vote ancestries do we want per fork
    let target_depth = (votes + forks - 1) / forks;

    let mut unsigned_precommits = vec![];
    for i in 0..forks {
        let depth = if votes >= target_depth {
            votes -= target_depth;
            target_depth
        } else {
            votes
        };

        // Note: Adding 1 to account for the target header
        let chain = generate_chain(i as u8, depth + 1, &header);

        // We don't include our finality target header in the vote ancestries
        for child in &chain[1..] {
            votes_ancestries.push(child.clone());
        }

        // The header we need to use when pre-commiting is the one at the highest height
        // on our chain.
        let precommit_candidate = chain.last().map(|h| (h.hash(), *h.number())).unwrap();
        unsigned_precommits.push(precommit_candidate);
    }

    for (i, (id, _weight)) in authorities.iter().enumerate() {
        // Assign authorities to sign pre-commits in a round-robin fashion
        let target = unsigned_precommits[i % forks as usize];
        let precommit = signed_precommit::<H>(id, target, round, set_id);

        precommits.push(precommit);
    }

    GrandpaJustification {
        round,
        commit: finality_grandpa::Commit {
            target_hash,
            target_number,
            precommits,
        },
        votes_ancestries,
    }
}

fn generate_chain<H: HeaderT>(fork_id: u8, depth: u32, ancestor: &H) -> Vec<H> {
    let mut headers = vec![ancestor.clone()];

    for i in 1..depth {
        let parent = &headers[(i - 1) as usize];
        let (hash, num) = (parent.hash(), *parent.number());

        let mut header = test_header::<H>(num + One::one());
        header.set_parent_hash(hash);

        // Modifying the digest so headers at the same height but in different forks have different
        // hashes
        header
            .digest_mut()
            .logs
            .push(sp_runtime::DigestItem::Other(vec![fork_id]));

        headers.push(header);
    }

    headers
}

/// Create signed precommit with given target.
pub fn signed_precommit<H: HeaderT>(
    signer: &Account,
    target: (H::Hash, H::Number),
    round: u64,
    set_id: SetId,
) -> finality_grandpa::SignedPrecommit<H::Hash, H::Number, AuthoritySignature, AuthorityId> {
    let precommit = finality_grandpa::Precommit {
        target_hash: target.0,
        target_number: target.1,
    };

    let encoded = sp_consensus_grandpa::localized_payload(
        round,
        set_id,
        &finality_grandpa::Message::Precommit(precommit.clone()),
    );

    let signature = signer.sign(&encoded);
    let raw_signature: Vec<u8> = signature.to_bytes().into();

    // Need to wrap our signature and id types that they match what our `SignedPrecommit` is expecting
    let signature = AuthoritySignature::try_from(raw_signature).expect(
        "We know our Keypair is good,
		so our signature must also be good.",
    );
    let id = (*signer).into();

    finality_grandpa::SignedPrecommit {
        precommit,
        signature,
        id,
    }
}

/// Get a header for testing.
///
/// The parent will only be correct for the first block, as the genesis block has no parent -> default is correct
pub fn test_header<H: HeaderT>(number: H::Number) -> H {
    let default = |num| {
        H::new(
            num,
            Default::default(),
            Default::default(),
            Default::default(),
            Default::default(),
        )
    };

    let mut header = default(number);
    if number != Zero::zero() {
        let parent_hash = default(number - One::one()).hash();
        header.set_parent_hash(parent_hash);
    }

    header
}

/// Get a header for testing, with correct parent_hash
pub fn test_header_with_correct_parent<H: HeaderT>(
    number: H::Number,
    parent_hash: Option<H::Hash>,
) -> H {
    let default = |num| {
        H::new(
            num,
            Default::default(),
            Default::default(),
            Default::default(),
            Default::default(),
        )
    };

    let mut header = default(number);

    if let Some(hash) = parent_hash {
        header.set_parent_hash(hash);
    }

    header
}

/// Convenience function for generating a Header ID at a given block number.
pub fn header_id<H: HeaderT>(index: u8) -> (H::Hash, H::Number) {
    (test_header::<H>(index.into()).hash(), index.into())
}