John Tromp
53414ae105
* use 0-based positions in methods pmmr_leaf_to_insertion_index and bintree_postorder_height; add round_up_to_leaf_pos method
* use 0-based positions in method insertion_to_pmmr_index
* use 0-based positions in method is_leaf
* use 0-based positions in method family()
* use 0-based positions in method is_left_sibling
* use 0-based positions in method family_branch
* use 0-based positions in methods bintree_{left,right}most
* use 0-based positions in method bintree_pos_iter
* use 0-based positions in method bintree_range
* use 0-based positions in method bintree_leaf_pos_iter
* rename last_pos in MMR related structs to size
* use 0-based positions in method prune
* use 0-based positions in method push and apply_output return value
* use 0-based position argument of method merkle_proof
* use 0-based outputs in method pmmr::peaks
* fix peaks() code comments
* refix peaks() code comments
* use 0-based positions in method get_peak_from_file
* use 0-based positions in methods get_data_from_file
* use 0-based positions in methods get_from_file
* use 0-based positions in methods get_data
* use 0-based positions in methods get_hash
* use 0-based positions in method peak_path
* use 0-based positions in method bag_the_rhs
* use 0-based positions in method Backend::remove
* use 0-based positions in method leaf_pos_iter
* use 0-based positions in method self.LeafSet::includes
* use 0-based positions in methods self.LeafSet::{add,remove}
* use 0-based positions in methods is_pruned,is_pruned_root,is_compacted
* use 0-based positions in methods PruneList::append
* use 0-based positions in methods append_pruned_subtree
* use 0-based positions in method calculate_next_leaf_shift
* use 0-based positions in method append_single
* use 0-based positions in method calculate_next_shift
* use 0-based positions in method segment_pos_range
* use 0-based positions in method reconstruct_root
* use 0-based positions in method validate_with
* use 0-based positions in method validate
* rename size (formerly last_pos) to mmr_size
* use 0-based positions in Segment's hash_pos and leaf_pos
* minimize use of saturating_sub(1) and rename some pos/idx to size
* use 0-based positions in methods get_output_pos
* use 0-based positions in method get_unspent_output_at
* use 0-based positions in method get_header_hash
* use 0-based positions in methods MerkleProof::verify{,_consume}
* use 0-based positions in method cleanup_subtree
* don't allow 0 in prunelist bitmap
* use 0-based positions in methods get_{,leaf_}shift
* rename some 1-based pos to pos1; identify TODO
* Address yeastplume's PR review comments
62 lines
2.0 KiB
Rust
62 lines
2.0 KiB
Rust
// Copyright 2021 The Grin Developers
|
|
//
|
|
// 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.
|
|
|
|
mod common;
|
|
|
|
use self::core::core::pmmr;
|
|
use self::core::core::{Segment, SegmentIdentifier};
|
|
use common::TestElem;
|
|
use grin_core as core;
|
|
use grin_core::core::pmmr::ReadablePMMR;
|
|
|
|
fn test_unprunable_size(height: u8, n_leaves: u32) {
|
|
let size = 1u64 << height;
|
|
let n_segments = (n_leaves as u64 + size - 1) / size;
|
|
|
|
// Build an MMR with n_leaves leaves
|
|
let mut ba = pmmr::VecBackend::new();
|
|
let mut mmr = pmmr::PMMR::new(&mut ba);
|
|
for i in 0..n_leaves {
|
|
mmr.push(&TestElem([i / 7, i / 5, i / 3, i])).unwrap();
|
|
}
|
|
let mmr = mmr.readonly_pmmr();
|
|
let last_pos = mmr.unpruned_size();
|
|
let root = mmr.root().unwrap();
|
|
|
|
for idx in 0..n_segments {
|
|
let id = SegmentIdentifier { height, idx };
|
|
let segment = Segment::from_pmmr(id, &mmr, false).unwrap();
|
|
println!(
|
|
"\n\n>>>>>>> N_LEAVES = {}, LAST_POS = {}, SEGMENT = {}:\n{:#?}",
|
|
n_leaves, last_pos, idx, segment
|
|
);
|
|
if idx < n_segments - 1 || (n_leaves as u64) % size == 0 {
|
|
// Check if the reconstructed subtree root matches with the hash stored in the mmr
|
|
let subtree_root = segment.root(last_pos, None).unwrap().unwrap();
|
|
let last = pmmr::insertion_to_pmmr_index((idx + 1) * size - 1) + (height as u64);
|
|
assert_eq!(subtree_root, mmr.get_hash(last).unwrap());
|
|
println!(" ROOT OK");
|
|
}
|
|
segment.validate(last_pos, None, root).unwrap();
|
|
println!(" PROOF OK");
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn unprunable_mmr() {
|
|
for i in 1..=64 {
|
|
test_unprunable_size(3, i);
|
|
}
|
|
}
|