chore: regenerate umbrella crate, fix feature propagation
This commit is contained in:
@@ -40,8 +40,8 @@
|
||||
//!
|
||||
//! ## What for?
|
||||
//!
|
||||
//! Primary use case for this pezpallet is to generate MMR root hashes, that can latter on be used by
|
||||
//! BEEFY protocol (see <https://github.com/paritytech/grandpa-bridge-gadget>).
|
||||
//! Primary use case for this pezpallet is to generate MMR root hashes, that can latter on be used
|
||||
//! by BEEFY protocol (see <https://github.com/paritytech/grandpa-bridge-gadget>).
|
||||
//! MMR root hashes along with BEEFY will make it possible to build Super Light Clients (SLC) of
|
||||
//! Bizinikiwi-based chains. The SLC will be able to follow finality and can be shown proofs of more
|
||||
//! details that happened on the source chain.
|
||||
@@ -378,8 +378,8 @@ impl<T: Config<I>, I: 'static> Pezpallet<T, I> {
|
||||
best_known_block_number: Option<BlockNumberFor<T>>,
|
||||
) -> Result<(Vec<LeafOf<T, I>>, LeafProof<HashOf<T, I>>), Error> {
|
||||
// check whether best_known_block_number provided, else use current best block
|
||||
let best_known_block_number =
|
||||
best_known_block_number.unwrap_or_else(|| <pezframe_system::Pezpallet<T>>::block_number());
|
||||
let best_known_block_number = best_known_block_number
|
||||
.unwrap_or_else(|| <pezframe_system::Pezpallet<T>>::block_number());
|
||||
|
||||
let leaf_count = Self::block_num_to_leaf_count(best_known_block_number)?;
|
||||
|
||||
@@ -428,8 +428,8 @@ impl<T: Config<I>, I: 'static> Pezpallet<T, I> {
|
||||
best_known_block_number: Option<BlockNumberFor<T>>,
|
||||
) -> Result<AncestryProof<HashOf<T, I>>, Error> {
|
||||
// check whether best_known_block_number provided, else use current best block
|
||||
let best_known_block_number =
|
||||
best_known_block_number.unwrap_or_else(|| <pezframe_system::Pezpallet<T>>::block_number());
|
||||
let best_known_block_number = best_known_block_number
|
||||
.unwrap_or_else(|| <pezframe_system::Pezpallet<T>>::block_number());
|
||||
|
||||
let leaf_count = Self::block_num_to_leaf_count(best_known_block_number)?;
|
||||
let prev_leaf_count = Self::block_num_to_leaf_count(prev_block_number)?;
|
||||
@@ -440,7 +440,8 @@ impl<T: Config<I>, I: 'static> Pezpallet<T, I> {
|
||||
|
||||
#[cfg(feature = "runtime-benchmarks")]
|
||||
pub fn generate_mock_ancestry_proof() -> Result<AncestryProof<HashOf<T, I>>, Error> {
|
||||
let leaf_count = Self::block_num_to_leaf_count(<pezframe_system::Pezpallet<T>>::block_number())?;
|
||||
let leaf_count =
|
||||
Self::block_num_to_leaf_count(<pezframe_system::Pezpallet<T>>::block_number())?;
|
||||
let mmr: ModuleMmr<mmr::storage::OffchainStorage, T, I> = mmr::Mmr::new(leaf_count);
|
||||
mmr.generate_mock_ancestry_proof()
|
||||
}
|
||||
|
||||
@@ -28,7 +28,10 @@ use frame::{
|
||||
};
|
||||
|
||||
pub(crate) fn new_test_ext() -> TestState {
|
||||
pezframe_system::GenesisConfig::<Test>::default().build_storage().unwrap().into()
|
||||
pezframe_system::GenesisConfig::<Test>::default()
|
||||
.build_storage()
|
||||
.unwrap()
|
||||
.into()
|
||||
}
|
||||
|
||||
fn register_offchain_ext(ext: &mut TestState) {
|
||||
@@ -260,7 +263,9 @@ fn should_generate_proofs_correctly() {
|
||||
// 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())
|
||||
.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)
|
||||
@@ -545,7 +550,10 @@ fn generate_and_verify_batch_proof(
|
||||
// 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(()));
|
||||
assert_eq!(
|
||||
crate::Pezpallet::<Test>::verify_leaves(leaves.clone(), proof.clone()),
|
||||
Ok(())
|
||||
);
|
||||
});
|
||||
})
|
||||
}
|
||||
@@ -741,8 +749,8 @@ fn should_verify_canonicalized() {
|
||||
}
|
||||
|
||||
// Generate proofs for some blocks.
|
||||
let (leaves, proofs) =
|
||||
ext.execute_with(|| crate::Pezpallet::<Test>::generate_proof(vec![1, 4, 5, 7], None).unwrap());
|
||||
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(()));
|
||||
@@ -773,7 +781,10 @@ fn does_not_panic_when_generating_historical_proofs() {
|
||||
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),);
|
||||
assert_eq!(
|
||||
crate::Pezpallet::<Test>::generate_proof(vec![10], None),
|
||||
Err(Error::LeafNotFound),
|
||||
);
|
||||
|
||||
// when leaves count is invalid
|
||||
assert_eq!(
|
||||
@@ -819,6 +830,9 @@ fn generating_and_verifying_ancestry_proofs_works_correctly() {
|
||||
}
|
||||
|
||||
// Check that we can't generate ancestry proofs for a future block.
|
||||
assert_eq!(Pezpallet::<Test>::generate_ancestry_proof(501, None), Err(Error::GenerateProof));
|
||||
assert_eq!(
|
||||
Pezpallet::<Test>::generate_ancestry_proof(501, None),
|
||||
Err(Error::GenerateProof)
|
||||
);
|
||||
});
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user