pezkuwichain/pezkuwi-sdk
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Files
556d40bca94dbdebaccee7ccb233f587775be1af
pezkuwi-sdk/bizinikiwi/pezframe/merkle-mountain-range/src/tests.rs
T
pezkuwichain cf463fe8ee FAZ 1 Complete: Workspace compile fixes, warning cleanup, version bumps 
- Fixed is_using_frame_crate() macro to check for pezframe/pezkuwi_sdk
- Removed disable_pezframe_system_supertrait_check temporary bypasses
- Feature-gated storage-benchmark and teyrchain-benchmarks code
- Fixed dead_code warnings with underscore prefix (_Header)
- Removed unused imports and shadowing use statements
- Version bumps: procedural-tools 10.0.1, benchmarking-cli 32.0.1,
  docs 0.0.2, minimal-runtime 0.0.1, yet-another-teyrchain 0.6.1, umbrella 0.1.2
- Updated MAINNET_ROADMAP.md with FAZ 1 completion status
2026-01-02 11:41:09 +03:00

839 lines
24 KiB
Rust
Raw Blame History

// This file is part of Bizinikiwi.
// Copyright (C) Parity Technologies (UK) Ltd. and Dijital Kurdistan Tech Institute
// SPDX-License-Identifier: Apache-2.0
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use crate::{mock::*, *};
use crate::primitives::{mmr_lib::helper, utils, Compact, LeafProof};
use pezframe::{
deps::pezsp_core::{
offchain::{testing::TestOffchainExt, OffchainDbExt, OffchainWorkerExt},
H256,
},
testing_prelude::*,
};
pub(crate) fn new_test_ext() -> TestState {
pezframe_system::GenesisConfig::<Test>::default()
.build_storage()
.unwrap()
.into()
}
fn register_offchain_ext(ext: &mut TestState) {
let (offchain, _offchain_state) = TestOffchainExt::with_offchain_db(ext.offchain_db());
ext.register_extension(OffchainDbExt::new(offchain.clone()));
ext.register_extension(OffchainWorkerExt::new(offchain));
}
fn new_block() -> Weight {
let number = pezframe_system::Pezpallet::<Test>::block_number() + 1;
let hash = H256::repeat_byte(number as u8);
LeafDataTestValue::mutate(|r| r.a = number);
pezframe_system::Pezpallet::<Test>::reset_events();
pezframe_system::Pezpallet::<Test>::initialize(&number, &hash, &Default::default());
MMR::on_initialize(number)
}
fn peaks_from_leaves_count(leaves_count: NodeIndex) -> Vec<NodeIndex> {
let size = utils::NodesUtils::new(leaves_count).size();
helper::get_peaks(size)
}
pub(crate) fn hex(s: &str) -> H256 {
s.parse().unwrap()
}
type BlockNumber = BlockNumberFor<Test>;
fn decode_node(
v: Vec<u8>,
) -> mmr::Node<<Test as Config>::Hashing, ((BlockNumber, H256), LeafData)> {
use crate::primitives::DataOrHash;
type A = DataOrHash<<Test as Config>::Hashing, (BlockNumber, H256)>;
type B = DataOrHash<<Test as Config>::Hashing, LeafData>;
type Node = mmr::Node<<Test as Config>::Hashing, (A, B)>;
let tuple: Node = codec::Decode::decode(&mut &v[..]).unwrap();
match tuple {
mmr::Node::Data((DataOrHash::Data(a), DataOrHash::Data(b))) => mmr::Node::Data((a, b)),
mmr::Node::Hash(hash) => mmr::Node::Hash(hash),
_ => unreachable!(),
}
}
fn add_blocks(blocks: usize) {
// given
for _ in 0..blocks {
new_block();
}
}
#[test]
fn should_start_empty() {
pezsp_tracing::init_for_tests();
new_test_ext().execute_with(|| {
// given
assert_eq!(
crate::RootHash::<Test>::get(),
"0000000000000000000000000000000000000000000000000000000000000000"
.parse()
.unwrap()
);
assert_eq!(crate::NumberOfLeaves::<Test>::get(), 0);
assert_eq!(crate::Nodes::<Test>::get(0), None);
// when
let weight = new_block();
// then
assert_eq!(crate::NumberOfLeaves::<Test>::get(), 1);
assert_eq!(
crate::Nodes::<Test>::get(0),
Some(hex("4320435e8c3318562dba60116bdbcc0b82ffcecb9bb39aae3300cfda3ad0b8b0"))
);
assert_eq!(
crate::RootHash::<Test>::get(),
hex("4320435e8c3318562dba60116bdbcc0b82ffcecb9bb39aae3300cfda3ad0b8b0")
);
assert!(weight != Weight::zero());
});
}
#[test]
fn should_append_to_mmr_when_on_initialize_is_called() {
pezsp_tracing::init_for_tests();
let mut ext = new_test_ext();
let (parent_b1, parent_b2) = ext.execute_with(|| {
// when
new_block();
let parent_b1 = <pezframe_system::Pezpallet<Test>>::parent_hash();
// then
assert_eq!(crate::NumberOfLeaves::<Test>::get(), 1);
assert_eq!(
(
crate::Nodes::<Test>::get(0),
crate::Nodes::<Test>::get(1),
crate::RootHash::<Test>::get(),
),
(
Some(hex("4320435e8c3318562dba60116bdbcc0b82ffcecb9bb39aae3300cfda3ad0b8b0")),
None,
hex("0x4320435e8c3318562dba60116bdbcc0b82ffcecb9bb39aae3300cfda3ad0b8b0"),
)
);
// when
new_block();
let parent_b2 = <pezframe_system::Pezpallet<Test>>::parent_hash();
// then
assert_eq!(crate::NumberOfLeaves::<Test>::get(), 2);
let peaks = peaks_from_leaves_count(2);
assert_eq!(peaks, vec![2]);
assert_eq!(
(
crate::Nodes::<Test>::get(0),
crate::Nodes::<Test>::get(1),
crate::Nodes::<Test>::get(2),
crate::Nodes::<Test>::get(3),
crate::RootHash::<Test>::get(),
),
(
None,
None,
Some(hex("672c04a9cd05a644789d769daa552d35d8de7c33129f8a7cbf49e595234c4854")),
None,
hex("672c04a9cd05a644789d769daa552d35d8de7c33129f8a7cbf49e595234c4854"),
)
);
(parent_b1, parent_b2)
});
// make sure the leaves end up in the offchain DB
ext.persist_offchain_overlay();
let offchain_db = ext.offchain_db();
let expected = Some(mmr::Node::Data(((0, H256::repeat_byte(1)), LeafData::new(1))));
assert_eq!(
offchain_db.get(&MMR::node_temp_offchain_key(0, parent_b1)).map(decode_node),
expected
);
let expected = Some(mmr::Node::Data(((1, H256::repeat_byte(2)), LeafData::new(2))));
assert_eq!(
offchain_db.get(&MMR::node_temp_offchain_key(1, parent_b2)).map(decode_node),
expected
);
let expected = Some(mmr::Node::Hash(hex(
"672c04a9cd05a644789d769daa552d35d8de7c33129f8a7cbf49e595234c4854",
)));
assert_eq!(
offchain_db.get(&MMR::node_temp_offchain_key(2, parent_b2)).map(decode_node),
expected
);
assert_eq!(offchain_db.get(&MMR::node_temp_offchain_key(3, parent_b2)), None);
}
#[test]
fn should_construct_larger_mmr_correctly() {
pezsp_tracing::init_for_tests();
new_test_ext().execute_with(|| {
// when
add_blocks(7);
// then
assert_eq!(crate::NumberOfLeaves::<Test>::get(), 7);
let peaks = peaks_from_leaves_count(7);
assert_eq!(peaks, vec![6, 9, 10]);
for i in (0..=10).filter(|p| !peaks.contains(p)) {
assert!(crate::Nodes::<Test>::get(i).is_none());
}
assert_eq!(
(
crate::Nodes::<Test>::get(6),
crate::Nodes::<Test>::get(9),
crate::Nodes::<Test>::get(10),
crate::RootHash::<Test>::get(),
),
(
Some(hex("ae88a0825da50e953e7a359c55fe13c8015e48d03d301b8bdfc9193874da9252")),
Some(hex("7e4316ae2ebf7c3b6821cb3a46ca8b7a4f9351a9b40fcf014bb0a4fd8e8f29da")),
Some(hex("611c2174c6164952a66d985cfe1ec1a623794393e3acff96b136d198f37a648c")),
hex("e45e25259f7930626431347fa4dd9aae7ac83b4966126d425ca70ab343709d2c"),
)
);
});
}
#[test]
fn should_calculate_the_size_correctly() {
pezsp_tracing::init_for_tests();
let leaves = vec![0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 21];
let sizes = vec![0, 1, 3, 4, 7, 8, 10, 11, 15, 16, 18, 19, 22, 23, 25, 26, 39];
// size cross-check
let mut actual_sizes = vec![];
for s in &leaves[1..] {
new_test_ext().execute_with(|| {
let mut mmr = mmr::Mmr::<mmr::storage::RuntimeStorage, crate::mock::Test, _, _>::new(0);
for i in 0..*s {
mmr.push(i);
}
actual_sizes.push(mmr.size());
})
}
assert_eq!(sizes[1..], actual_sizes[..]);
}
#[test]
fn should_generate_proofs_correctly() {
pezsp_tracing::init_for_tests();
let mut ext = new_test_ext();
// given
let num_blocks: u64 = 7;
ext.execute_with(|| add_blocks(num_blocks as usize));
ext.persist_offchain_overlay();
// Try to generate proofs now. This requires the offchain extensions to be present
// to retrieve full leaf data.
register_offchain_ext(&mut ext);
ext.execute_with(|| {
let best_block_number = pezframe_system::Pezpallet::<Test>::block_number();
// when generate proofs for all leaves.
let proofs = (1_u64..=best_block_number)
.into_iter()
.map(|block_num| {
crate::Pezpallet::<Test>::generate_proof(vec![block_num], None).unwrap()
})
.collect::<Vec<_>>();
// when generate historical proofs for all leaves
let historical_proofs = (1_u64..best_block_number)
.into_iter()
.map(|block_num| {
let mut proofs = vec![];
for historical_best_block in block_num..=num_blocks {
proofs.push(
crate::Pezpallet::<Test>::generate_proof(
vec![block_num],
Some(historical_best_block),
)
.unwrap(),
)
}
proofs
})
.collect::<Vec<_>>();
// then
assert_eq!(
proofs[0],
(
vec![Compact::new(((0, H256::repeat_byte(1)).into(), LeafData::new(1).into(),))],
LeafProof {
leaf_indices: vec![0],
leaf_count: 7,
items: vec![
hex("ad4cbc033833612ccd4626d5f023b9dfc50a35e838514dd1f3c86f8506728705"),
hex("cb24f4614ad5b2a5430344c99545b421d9af83c46fd632d70a332200884b4d46"),
hex("dca421199bdcc55bb773c6b6967e8d16675de69062b52285ca63685241fdf626"),
],
}
)
);
assert_eq!(
historical_proofs[0][0],
(
vec![Compact::new(((0, H256::repeat_byte(1)).into(), LeafData::new(1).into(),))],
LeafProof { leaf_indices: vec![0], leaf_count: 1, items: vec![] }
)
);
// D
// / \
// / \
// A B C
// / \ / \ / \
// 1 2 3 4 5 6 7
//
// we're proving 3 => we need { 4, A, C++7 }
assert_eq!(
proofs[2],
(
vec![Compact::new(((2, H256::repeat_byte(3)).into(), LeafData::new(3).into(),))],
LeafProof {
leaf_indices: vec![2],
leaf_count: 7,
items: vec![
hex("1b14c1dc7d3e4def11acdf31be0584f4b85c3673f1ff72a3af467b69a3b0d9d0"),
hex("672c04a9cd05a644789d769daa552d35d8de7c33129f8a7cbf49e595234c4854"),
hex("dca421199bdcc55bb773c6b6967e8d16675de69062b52285ca63685241fdf626"),
],
}
)
);
// A
// / \
// 1 2 3
//
// we're proving 3 => we need { A }
assert_eq!(
historical_proofs[2][0],
(
vec![Compact::new(((2, H256::repeat_byte(3)).into(), LeafData::new(3).into(),))],
LeafProof {
leaf_indices: vec![2],
leaf_count: 3,
items: vec![hex(
"672c04a9cd05a644789d769daa552d35d8de7c33129f8a7cbf49e595234c4854"
)],
}
)
);
// D
// / \
// / \
// A B
// / \ / \
// 1 2 3 4 5
// we're proving 3 => we need { 4, A, 5 }
assert_eq!(
historical_proofs[2][2],
(
vec![Compact::new(((2, H256::repeat_byte(3)).into(), LeafData::new(3).into(),))],
LeafProof {
leaf_indices: vec![2],
leaf_count: 5,
items: vec![
hex("1b14c1dc7d3e4def11acdf31be0584f4b85c3673f1ff72a3af467b69a3b0d9d0"),
hex("672c04a9cd05a644789d769daa552d35d8de7c33129f8a7cbf49e595234c4854"),
hex("3b031d22e24f1126c8f7d2f394b663f9b960ed7abbedb7152e17ce16112656d0")
],
}
)
);
assert_eq!(historical_proofs[2][4], proofs[2]);
assert_eq!(
proofs[4],
(
// NOTE: the leaf index is equivalent to the block number(in this case 5) - 1
vec![Compact::new(((4, H256::repeat_byte(5)).into(), LeafData::new(5).into(),))],
LeafProof {
leaf_indices: vec![4],
leaf_count: 7,
items: vec![
hex("ae88a0825da50e953e7a359c55fe13c8015e48d03d301b8bdfc9193874da9252"),
hex("8ed25570209d8f753d02df07c1884ddb36a3d9d4770e4608b188322151c657fe"),
hex("611c2174c6164952a66d985cfe1ec1a623794393e3acff96b136d198f37a648c"),
],
}
)
);
assert_eq!(
historical_proofs[4][0],
(
vec![Compact::new(((4, H256::repeat_byte(5)).into(), LeafData::new(5).into(),))],
LeafProof {
leaf_indices: vec![4],
leaf_count: 5,
items: vec![hex(
"ae88a0825da50e953e7a359c55fe13c8015e48d03d301b8bdfc9193874da9252"
),],
}
)
);
assert_eq!(historical_proofs[4][2], proofs[4]);
assert_eq!(
proofs[6],
(
vec![Compact::new(((6, H256::repeat_byte(7)).into(), LeafData::new(7).into(),))],
LeafProof {
leaf_indices: vec![6],
leaf_count: 7,
items: vec![
hex("ae88a0825da50e953e7a359c55fe13c8015e48d03d301b8bdfc9193874da9252"),
hex("7e4316ae2ebf7c3b6821cb3a46ca8b7a4f9351a9b40fcf014bb0a4fd8e8f29da"),
],
}
)
);
assert_eq!(historical_proofs[5][1], proofs[5]);
});
}
#[test]
fn should_generate_batch_proof_correctly() {
pezsp_tracing::init_for_tests();
let mut ext = new_test_ext();
// given
ext.execute_with(|| add_blocks(7));
ext.persist_offchain_overlay();
// Try to generate proofs now. This requires the offchain extensions to be present
// to retrieve full leaf data.
register_offchain_ext(&mut ext);
ext.execute_with(|| {
// when generate proofs for a batch of leaves
let (.., proof) = crate::Pezpallet::<Test>::generate_proof(vec![1, 5, 6], None).unwrap();
// then
assert_eq!(
proof,
LeafProof {
// the leaf indices are equivalent to the above specified block numbers - 1.
leaf_indices: vec![0, 4, 5],
leaf_count: 7,
items: vec![
hex("ad4cbc033833612ccd4626d5f023b9dfc50a35e838514dd1f3c86f8506728705"),
hex("cb24f4614ad5b2a5430344c99545b421d9af83c46fd632d70a332200884b4d46"),
hex("611c2174c6164952a66d985cfe1ec1a623794393e3acff96b136d198f37a648c"),
],
}
);
// when generate historical proofs for a batch of leaves
let (.., historical_proof) =
crate::Pezpallet::<Test>::generate_proof(vec![1, 5, 6], Some(6)).unwrap();
// then
assert_eq!(
historical_proof,
LeafProof {
leaf_indices: vec![0, 4, 5],
leaf_count: 6,
items: vec![
hex("ad4cbc033833612ccd4626d5f023b9dfc50a35e838514dd1f3c86f8506728705"),
hex("cb24f4614ad5b2a5430344c99545b421d9af83c46fd632d70a332200884b4d46"),
],
}
);
// when generate historical proofs for a batch of leaves
let (.., historical_proof) =
crate::Pezpallet::<Test>::generate_proof(vec![1, 5, 6], None).unwrap();
// then
assert_eq!(historical_proof, proof);
});
}
#[test]
fn should_verify() {
pezsp_tracing::init_for_tests();
// Start off with chain initialisation and storing indexing data off-chain
// (MMR Leafs)
let mut ext = new_test_ext();
ext.execute_with(|| add_blocks(7));
ext.persist_offchain_overlay();
// Try to generate proof now. This requires the offchain extensions to be present
// to retrieve full leaf data.
register_offchain_ext(&mut ext);
let (leaves, proof5) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![5], None).unwrap()
});
let (simple_historical_leaves, simple_historical_proof5) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![5], Some(6)).unwrap()
});
let (advanced_historical_leaves, advanced_historical_proof5) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![5], Some(7)).unwrap()
});
ext.execute_with(|| {
add_blocks(7);
// then
assert_eq!(crate::Pezpallet::<Test>::verify_leaves(leaves, proof5), Ok(()));
assert_eq!(
crate::Pezpallet::<Test>::verify_leaves(
simple_historical_leaves,
simple_historical_proof5
),
Ok(())
);
assert_eq!(
crate::Pezpallet::<Test>::verify_leaves(
advanced_historical_leaves,
advanced_historical_proof5
),
Ok(())
);
});
}
fn generate_and_verify_batch_proof(
ext: &mut TestExternalities,
block_numbers: &Vec<u64>,
blocks_to_add: usize,
) {
let (leaves, proof) = ext.execute_with(|| {
crate::Pezpallet::<Test>::generate_proof(block_numbers.to_vec(), None).unwrap()
});
let max_block_number = ext.execute_with(|| pezframe_system::Pezpallet::<Test>::block_number());
let min_block_number = block_numbers.iter().max().unwrap();
// generate all possible historical proofs for the given blocks
let historical_proofs = (*min_block_number..=max_block_number)
.map(|best_block| {
ext.execute_with(|| {
crate::Pezpallet::<Test>::generate_proof(block_numbers.to_vec(), Some(best_block))
.unwrap()
})
})
.collect::<Vec<_>>();
ext.execute_with(|| {
add_blocks(blocks_to_add);
// then
assert_eq!(crate::Pezpallet::<Test>::verify_leaves(leaves, proof), Ok(()));
historical_proofs.iter().for_each(|(leaves, proof)| {
assert_eq!(
crate::Pezpallet::<Test>::verify_leaves(leaves.clone(), proof.clone()),
Ok(())
);
});
})
}
#[test]
fn should_verify_batch_proofs() {
pezsp_tracing::init_for_tests();
use itertools::Itertools;
let mut ext = new_test_ext();
// require the offchain extensions to be present
// to retrieve full leaf data when generating proofs
register_offchain_ext(&mut ext);
// verify that up to n=10, valid proofs are generated for all possible block number
// combinations.
for n in 1..=10 {
ext.execute_with(|| new_block());
ext.persist_offchain_overlay();
// generate powerset (skipping empty set) of all possible block number combinations for mmr
// size n.
let blocks_set: Vec<Vec<u64>> = (1..=n).into_iter().powerset().skip(1).collect();
blocks_set.iter().for_each(|blocks_subset| {
generate_and_verify_batch_proof(&mut ext, &blocks_subset, 0);
ext.persist_offchain_overlay();
});
}
// verify that up to n=15, valid proofs are generated for all possible 2-block number
// combinations.
for n in 11..=15 {
ext.execute_with(|| new_block());
ext.persist_offchain_overlay();
// generate all possible 2-block number combinations for mmr size n.
let blocks_set: Vec<Vec<u64>> = (1..=n).into_iter().combinations(2).collect();
blocks_set.iter().for_each(|blocks_subset| {
generate_and_verify_batch_proof(&mut ext, &blocks_subset, 0);
ext.persist_offchain_overlay();
});
}
generate_and_verify_batch_proof(&mut ext, &vec![8, 12], 20);
ext.execute_with(|| add_blocks(1000));
ext.persist_offchain_overlay();
generate_and_verify_batch_proof(&mut ext, &vec![8, 12, 100, 800], 100);
}
#[test]
fn verification_should_be_stateless() {
pezsp_tracing::init_for_tests();
// Start off with chain initialisation and storing indexing data off-chain
// (MMR Leafs)
let mut ext = new_test_ext();
let (root_6, root_7) = ext.execute_with(|| {
add_blocks(6);
let root_6 = crate::Pezpallet::<Test>::mmr_root();
add_blocks(1);
let root_7 = crate::Pezpallet::<Test>::mmr_root();
(root_6, root_7)
});
ext.persist_offchain_overlay();
// Try to generate proof now. This requires the offchain extensions to be present
// to retrieve full leaf data.
register_offchain_ext(&mut ext);
let (leaves, proof5) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![5], None).unwrap()
});
let (_, historical_proof5) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![5], Some(6)).unwrap()
});
// Verify proof without relying on any on-chain data.
let leaf = crate::primitives::DataOrHash::Data(leaves[0].clone());
assert_eq!(
crate::verify_leaves_proof::<<Test as Config>::Hashing, _>(
root_7,
vec![leaf.clone()],
proof5
),
Ok(())
);
assert_eq!(
crate::verify_leaves_proof::<<Test as Config>::Hashing, _>(
root_6,
vec![leaf],
historical_proof5
),
Ok(())
);
}
#[test]
fn should_verify_batch_proof_statelessly() {
pezsp_tracing::init_for_tests();
// Start off with chain initialisation and storing indexing data off-chain
// (MMR Leafs)
let mut ext = new_test_ext();
let (root_6, root_7) = ext.execute_with(|| {
add_blocks(6);
let root_6 = crate::Pezpallet::<Test>::mmr_root();
add_blocks(1);
let root_7 = crate::Pezpallet::<Test>::mmr_root();
(root_6, root_7)
});
ext.persist_offchain_overlay();
// Try to generate proof now. This requires the offchain extensions to be present
// to retrieve full leaf data.
register_offchain_ext(&mut ext);
let (leaves, proof) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![1, 4, 5], None).unwrap()
});
let (historical_leaves, historical_proof) = ext.execute_with(|| {
// when
crate::Pezpallet::<Test>::generate_proof(vec![1, 4, 5], Some(6)).unwrap()
});
// Verify proof without relying on any on-chain data.
assert_eq!(
crate::verify_leaves_proof::<<Test as Config>::Hashing, _>(
root_7,
leaves
.into_iter()
.map(|leaf| crate::primitives::DataOrHash::Data(leaf))
.collect(),
proof
),
Ok(())
);
assert_eq!(
crate::verify_leaves_proof::<<Test as Config>::Hashing, _>(
root_6,
historical_leaves
.into_iter()
.map(|leaf| crate::primitives::DataOrHash::Data(leaf))
.collect(),
historical_proof
),
Ok(())
);
}
#[test]
fn should_verify_on_the_next_block_since_there_is_no_pruning_yet() {
pezsp_tracing::init_for_tests();
let mut ext = new_test_ext();
// given
ext.execute_with(|| add_blocks(7));
ext.persist_offchain_overlay();
register_offchain_ext(&mut ext);
ext.execute_with(|| {
// when
let (leaves, proof5) = crate::Pezpallet::<Test>::generate_proof(vec![5], None).unwrap();
new_block();
// then
assert_eq!(crate::Pezpallet::<Test>::verify_leaves(leaves, proof5), Ok(()));
});
}
#[test]
fn should_verify_canonicalized() {
pezsp_tracing::init_for_tests();
// How deep is our fork-aware storage (in terms of blocks/leaves, nodes will be more).
let block_hash_size: u64 = <Test as pezframe_system::Config>::BlockHashCount::get();
// Start off with chain initialisation and storing indexing data off-chain.
// Create twice as many leaf entries than our fork-aware capacity,
// resulting in ~half of MMR storage to use canonical keys and the other half fork-aware keys.
// Verify that proofs can be generated (using leaves and nodes from full set) and verified.
let mut ext = new_test_ext();
register_offchain_ext(&mut ext);
for blocknum in 0u32..(2 * block_hash_size).try_into().unwrap() {
ext.execute_with(|| {
new_block();
<Pezpallet<Test> as Hooks<BlockNumber>>::offchain_worker(blocknum.into());
});
ext.persist_offchain_overlay();
}
// Generate proofs for some blocks.
let (leaves, proofs) = ext
.execute_with(|| crate::Pezpallet::<Test>::generate_proof(vec![1, 4, 5, 7], None).unwrap());
// Verify all previously generated proofs.
ext.execute_with(|| {
assert_eq!(crate::Pezpallet::<Test>::verify_leaves(leaves, proofs), Ok(()));
});
// Generate proofs for some new blocks.
let (leaves, proofs) = ext.execute_with(|| {
crate::Pezpallet::<Test>::generate_proof(vec![block_hash_size + 7], None).unwrap()
});
// Add some more blocks then verify all previously generated proofs.
ext.execute_with(|| {
add_blocks(7);
assert_eq!(crate::Pezpallet::<Test>::verify_leaves(leaves, proofs), Ok(()));
});
}
#[test]
fn does_not_panic_when_generating_historical_proofs() {
pezsp_tracing::init_for_tests();
let mut ext = new_test_ext();
// given 7 blocks (7 MMR leaves)
ext.execute_with(|| add_blocks(7));
ext.persist_offchain_overlay();
// Try to generate historical proof with invalid arguments. This requires the offchain
// extensions to be present to retrieve full leaf data.
register_offchain_ext(&mut ext);
ext.execute_with(|| {
// when leaf index is invalid
assert_eq!(
crate::Pezpallet::<Test>::generate_proof(vec![10], None),
Err(Error::LeafNotFound),
);
// when leaves count is invalid
assert_eq!(
crate::Pezpallet::<Test>::generate_proof(vec![3], Some(100)),
Err(Error::GenerateProof),
);
// when both leaf index and leaves count are invalid
assert_eq!(
crate::Pezpallet::<Test>::generate_proof(vec![10], Some(100)),
Err(Error::LeafNotFound),
);
});
}
#[test]
fn generating_and_verifying_ancestry_proofs_works_correctly() {
pezsp_tracing::init_for_tests();
let mut ext = new_test_ext();
let mut prev_roots = vec![];
ext.execute_with(|| {
for _ in 1..=500 {
add_blocks(1);
prev_roots.push(Pezpallet::<Test>::mmr_root())
}
});
ext.persist_offchain_overlay();
register_offchain_ext(&mut ext);
ext.execute_with(|| {
let root = Pezpallet::<Test>::mmr_root();
// Check that generating and verifying ancestry proofs works correctly
// for each previous block
for prev_block_number in 1usize..=500 {
let proof =
Pezpallet::<Test>::generate_ancestry_proof(prev_block_number as u64, None).unwrap();
assert!(Pezpallet::<Test>::is_ancestry_proof_optimal(&proof));
assert_eq!(
Pezpallet::<Test>::verify_ancestry_proof(root, proof),
Ok(prev_roots[prev_block_number - 1])
);
}
// Check that we can't generate ancestry proofs for a future block.
assert_eq!(
Pezpallet::<Test>::generate_ancestry_proof(501, None),
Err(Error::GenerateProof)
);
});
}
Reference in New Issue View Git Blame Copy Permalink