ckb-sync 1.3.0

The ckb sync/relayer protocols implementation
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

use super::helper::new_index_transaction;
use crate::relayer::compact_block_verifier::{PrefilledVerifier, ShortIdsVerifier};
use crate::{Status, StatusCode};
use ckb_types::packed::{CompactBlockBuilder, ProposalShortId};
use ckb_types::prelude::*;

#[test]
fn test_unordered_prefilled() {
    let prefilled = vec![0, 1, 2, 4, 3]
        .into_iter()
        .map(new_index_transaction)
        .collect::<Vec<_>>();
    let block = CompactBlockBuilder::default()
        .prefilled_transactions(prefilled)
        .build();
    assert_eq!(
        PrefilledVerifier::verify(&block),
        StatusCode::CompactBlockHasOutOfOrderPrefilledTransactions.into(),
    );
}

#[test]
fn test_ordered_prefilled() {
    let prefilled = (0..5).map(new_index_transaction).collect::<Vec<_>>();
    let block = CompactBlockBuilder::default()
        .prefilled_transactions(prefilled)
        .build();
    assert_eq!(PrefilledVerifier::verify(&block), Status::ok());
}

#[test]
fn test_overflow_prefilled() {
    let prefilled = vec![0, 1, 2, 5]
        .into_iter()
        .map(new_index_transaction)
        .collect::<Vec<_>>();
    let block = CompactBlockBuilder::default()
        .prefilled_transactions(prefilled)
        .build();
    assert_eq!(
        PrefilledVerifier::verify(&block),
        StatusCode::CompactBlockHasOutOfIndexPrefilledTransactions.into(),
    );
}

#[test]
fn test_cellbase_not_prefilled() {
    let block = CompactBlockBuilder::default().build();
    assert_eq!(
        PrefilledVerifier::verify(&block),
        StatusCode::CompactBlockHasNotPrefilledCellbase.into(),
    );

    let prefilled = (1..5).map(new_index_transaction).collect::<Vec<_>>();
    let block = CompactBlockBuilder::default()
        .prefilled_transactions(prefilled)
        .build();
    assert_eq!(
        PrefilledVerifier::verify(&block),
        StatusCode::CompactBlockHasNotPrefilledCellbase.into(),
    );
}

#[test]
fn test_duplicated_short_ids() {
    let mut short_ids: Vec<ProposalShortId> = (1..5)
        .map(|i| new_index_transaction(i).transaction().proposal_short_id())
        .collect();
    short_ids.push(short_ids[0].clone());

    let block = CompactBlockBuilder::default().short_ids(short_ids).build();
    assert_eq!(
        ShortIdsVerifier::verify(&block),
        StatusCode::CompactBlockHasDuplicatedShortIds.into(),
    );
}

#[test]
fn test_intersected_short_ids() {
    let prefilled = (0..=5).map(new_index_transaction).collect::<Vec<_>>();
    let short_ids = (5..9)
        .map(|i| new_index_transaction(i).transaction().proposal_short_id())
        .collect::<Vec<_>>();

    let block = CompactBlockBuilder::default()
        .prefilled_transactions(prefilled)
        .short_ids(short_ids)
        .build();
    assert_eq!(
        ShortIdsVerifier::verify(&block),
        StatusCode::CompactBlockHasDuplicatedPrefilledTransactions.into(),
    );
}

#[test]
fn test_normal() {
    let prefilled = vec![1, 2, 5]
        .into_iter()
        .map(new_index_transaction)
        .collect::<Vec<_>>();
    let short_ids = vec![0, 3, 4]
        .into_iter()
        .map(|i| new_index_transaction(i).transaction().proposal_short_id())
        .collect::<Vec<_>>();
    let block = CompactBlockBuilder::default()
        .prefilled_transactions(prefilled)
        .short_ids(short_ids)
        .build();
    assert_eq!(ShortIdsVerifier::verify(&block), Status::ok());
}