694 lines
23 KiB
Rust
694 lines
23 KiB
Rust
use std::convert::TryFrom;
|
|
use std::mem::size_of;
|
|
|
|
use crate::{Address, Hashable, Level, Position, Source};
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
use {std::collections::VecDeque, std::iter::repeat};
|
|
|
|
/// Validation errors that can occur during reconstruction of a Merkle frontier from
|
|
/// its constituent parts.
|
|
#[derive(Clone, Debug, PartialEq, Eq)]
|
|
pub enum FrontierError {
|
|
/// An error representing that the number of ommers provided in frontier construction does not
|
|
/// the expected length of the ommers list given the position.
|
|
PositionMismatch { expected_ommers: usize },
|
|
/// An error representing that the position and/or list of ommers provided to frontier
|
|
/// construction would result in a frontier that exceeds the maximum statically allowed depth
|
|
/// of the tree. `depth` is the minimum tree depth that would be required in order for that
|
|
/// tree to contain the position in question.
|
|
MaxDepthExceeded { depth: u8 },
|
|
}
|
|
|
|
/// A [`NonEmptyFrontier`] is a reduced representation of a Merkle tree, containing a single leaf
|
|
/// value, along with the vector of hashes produced by the reduction of previously appended leaf
|
|
/// values that will be required when producing a witness for the current leaf.
|
|
#[derive(Clone, Debug, PartialEq, Eq)]
|
|
pub struct NonEmptyFrontier<H> {
|
|
position: Position,
|
|
leaf: H,
|
|
ommers: Vec<H>,
|
|
}
|
|
|
|
impl<H> NonEmptyFrontier<H> {
|
|
/// Constructs a new frontier with the specified value at position 0.
|
|
pub fn new(leaf: H) -> Self {
|
|
Self {
|
|
position: 0.into(),
|
|
leaf,
|
|
ommers: vec![],
|
|
}
|
|
}
|
|
|
|
/// Constructs a new frontier from its constituent parts.
|
|
pub fn from_parts(position: Position, leaf: H, ommers: Vec<H>) -> Result<Self, FrontierError> {
|
|
let expected_ommers = position.past_ommer_count();
|
|
if ommers.len() == expected_ommers {
|
|
Ok(Self {
|
|
position,
|
|
leaf,
|
|
ommers,
|
|
})
|
|
} else {
|
|
Err(FrontierError::PositionMismatch { expected_ommers })
|
|
}
|
|
}
|
|
|
|
/// Returns the position of the most recently appended leaf.
|
|
pub fn position(&self) -> Position {
|
|
self.position
|
|
}
|
|
|
|
/// Returns the leaf most recently appended to the frontier.
|
|
pub fn leaf(&self) -> &H {
|
|
&self.leaf
|
|
}
|
|
|
|
/// Returns the list of past hashes required to construct a witness for the
|
|
/// leaf most recently appended to the frontier.
|
|
pub fn ommers(&self) -> &[H] {
|
|
&self.ommers
|
|
}
|
|
}
|
|
|
|
impl<H: Hashable + Clone> NonEmptyFrontier<H> {
|
|
/// Append a new leaf to the frontier, and recompute ommers by hashing together full subtrees
|
|
/// until an empty ommer slot is found.
|
|
pub fn append(&mut self, leaf: H) {
|
|
let prior_position = self.position;
|
|
let prior_leaf = self.leaf.clone();
|
|
self.position += 1;
|
|
self.leaf = leaf;
|
|
if self.position.is_odd() {
|
|
// if the new position is odd, the current leaf will directly become
|
|
// an ommer at level 0, and there is no other mutation made to the tree.
|
|
self.ommers.insert(0, prior_leaf);
|
|
} else {
|
|
// if the new position is even, then the current leaf will be hashed
|
|
// with the first ommer, and so forth up the tree.
|
|
let new_root_level = self.position.root_level();
|
|
|
|
let mut carry = Some((prior_leaf, 0.into()));
|
|
let mut new_ommers = Vec::with_capacity(self.position.past_ommer_count());
|
|
for (addr, source) in prior_position.witness_addrs(new_root_level) {
|
|
if let Source::Past(i) = source {
|
|
if let Some((carry_ommer, carry_lvl)) = carry.as_ref() {
|
|
if *carry_lvl == addr.level() {
|
|
carry = Some((
|
|
H::combine(addr.level(), &self.ommers[i], carry_ommer),
|
|
addr.level() + 1,
|
|
))
|
|
} else {
|
|
// insert the carry at the first empty slot; then the rest of the
|
|
// ommers will remain unchanged
|
|
new_ommers.push(carry_ommer.clone());
|
|
new_ommers.push(self.ommers[i].clone());
|
|
carry = None;
|
|
}
|
|
} else {
|
|
// when there's no carry, just push on the ommer value
|
|
new_ommers.push(self.ommers[i].clone());
|
|
}
|
|
}
|
|
}
|
|
|
|
// we carried value out, so we need to push on one more ommer.
|
|
if let Some((carry_ommer, _)) = carry {
|
|
new_ommers.push(carry_ommer);
|
|
}
|
|
|
|
self.ommers = new_ommers;
|
|
}
|
|
}
|
|
|
|
/// Generate the root of the Merkle tree by hashing against empty subtree roots.
|
|
pub fn root(&self, root_level: Option<Level>) -> H {
|
|
let max_level = root_level.unwrap_or_else(|| self.position.root_level());
|
|
self.position
|
|
.witness_addrs(max_level)
|
|
.fold(
|
|
(self.leaf.clone(), Level::from(0)),
|
|
|(digest, complete_lvl), (addr, source)| {
|
|
// fold up from complete_lvl to addr.level() pairing with empty roots; if
|
|
// complete_lvl == addr.level() this is just the complete digest to this point
|
|
let digest = complete_lvl
|
|
.iter_to(addr.level())
|
|
.fold(digest, |d, l| H::combine(l, &d, &H::empty_root(l)));
|
|
|
|
let res_digest = match source {
|
|
Source::Past(i) => H::combine(addr.level(), &self.ommers[i], &digest),
|
|
Source::Future => {
|
|
H::combine(addr.level(), &digest, &H::empty_root(addr.level()))
|
|
}
|
|
};
|
|
|
|
(res_digest, addr.level() + 1)
|
|
},
|
|
)
|
|
.0
|
|
}
|
|
|
|
/// Constructs a witness for the leaf at the tip of this frontier, given a source of node
|
|
/// values that complement this frontier.
|
|
///
|
|
/// If the `complement_nodes` function returns `None` when the value is requested at a given
|
|
/// tree address, the address at which the failure occurs will be returned as an error.
|
|
pub fn witness<F>(&self, depth: u8, complement_nodes: F) -> Result<Vec<H>, Address>
|
|
where
|
|
F: Fn(Address) -> Option<H>,
|
|
{
|
|
// construct a complete trailing edge that includes the data from
|
|
// the following frontier not yet included in the trailing edge.
|
|
self.position()
|
|
.witness_addrs(depth.into())
|
|
.map(|(addr, source)| match source {
|
|
Source::Past(i) => Ok(self.ommers[i].clone()),
|
|
Source::Future => complement_nodes(addr).ok_or(addr),
|
|
})
|
|
.collect::<Result<Vec<_>, _>>()
|
|
}
|
|
}
|
|
|
|
/// A possibly-empty Merkle frontier.
|
|
#[derive(Debug, Clone, PartialEq, Eq)]
|
|
pub struct Frontier<H, const DEPTH: u8> {
|
|
frontier: Option<NonEmptyFrontier<H>>,
|
|
}
|
|
|
|
impl<H, const DEPTH: u8> TryFrom<NonEmptyFrontier<H>> for Frontier<H, DEPTH> {
|
|
type Error = FrontierError;
|
|
fn try_from(f: NonEmptyFrontier<H>) -> Result<Self, FrontierError> {
|
|
if f.position.root_level() <= Level::from(DEPTH) {
|
|
Ok(Frontier { frontier: Some(f) })
|
|
} else {
|
|
Err(FrontierError::MaxDepthExceeded {
|
|
depth: f.position.root_level().into(),
|
|
})
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<H, const DEPTH: u8> Frontier<H, DEPTH> {
|
|
/// Constructs a new empty frontier.
|
|
pub fn empty() -> Self {
|
|
Self { frontier: None }
|
|
}
|
|
|
|
/// Constructs a new frontier from its constituent parts.
|
|
///
|
|
/// Returns `None` if the new frontier would exceed the maximum
|
|
/// allowed depth or if the list of ommers provided is not consistent
|
|
/// with the position of the leaf.
|
|
pub fn from_parts(position: Position, leaf: H, ommers: Vec<H>) -> Result<Self, FrontierError> {
|
|
NonEmptyFrontier::from_parts(position, leaf, ommers).and_then(Self::try_from)
|
|
}
|
|
|
|
/// Return the wrapped NonEmptyFrontier reference, or None if
|
|
/// the frontier is empty.
|
|
pub fn value(&self) -> Option<&NonEmptyFrontier<H>> {
|
|
self.frontier.as_ref()
|
|
}
|
|
|
|
/// Returns the amount of memory dynamically allocated for ommer
|
|
/// values within the frontier.
|
|
pub fn dynamic_memory_usage(&self) -> usize {
|
|
self.frontier.as_ref().map_or(0, |f| {
|
|
size_of::<usize>() + (f.ommers.capacity() + 1) * size_of::<H>()
|
|
})
|
|
}
|
|
}
|
|
|
|
impl<H: Hashable + Clone, const DEPTH: u8> Frontier<H, DEPTH> {
|
|
/// Appends a new value to the frontier at the next available slot.
|
|
/// Returns true if successful and false if the frontier would exceed
|
|
/// the maximum allowed depth.
|
|
pub fn append(&mut self, value: H) -> bool {
|
|
if let Some(frontier) = self.frontier.as_mut() {
|
|
if frontier.position().is_complete_subtree(DEPTH.into()) {
|
|
false
|
|
} else {
|
|
frontier.append(value);
|
|
true
|
|
}
|
|
} else {
|
|
self.frontier = Some(NonEmptyFrontier::new(value));
|
|
true
|
|
}
|
|
}
|
|
|
|
/// Obtains the current root of this Merkle frontier by hashing
|
|
/// against empty nodes up to the maximum height of the pruned
|
|
/// tree that the frontier represents.
|
|
pub fn root(&self) -> H {
|
|
self.frontier
|
|
.as_ref()
|
|
.map_or(H::empty_root(DEPTH.into()), |frontier| {
|
|
frontier.root(Some(DEPTH.into()))
|
|
})
|
|
}
|
|
}
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
pub struct PathFiller<H> {
|
|
queue: VecDeque<H>,
|
|
}
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
impl<H: Hashable> PathFiller<H> {
|
|
pub fn empty() -> Self {
|
|
PathFiller {
|
|
queue: VecDeque::new(),
|
|
}
|
|
}
|
|
|
|
pub fn new(queue: VecDeque<H>) -> Self {
|
|
Self { queue }
|
|
}
|
|
|
|
pub fn next(&mut self, level: Level) -> H {
|
|
self.queue
|
|
.pop_front()
|
|
.unwrap_or_else(|| H::empty_root(level))
|
|
}
|
|
}
|
|
|
|
/// A Merkle tree of note commitments.
|
|
#[derive(Clone, Debug, PartialEq, Eq)]
|
|
#[cfg(feature = "legacy-api")]
|
|
pub struct CommitmentTree<H, const DEPTH: u8> {
|
|
pub(crate) left: Option<H>,
|
|
pub(crate) right: Option<H>,
|
|
pub(crate) parents: Vec<Option<H>>,
|
|
}
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
impl<H, const DEPTH: u8> CommitmentTree<H, DEPTH> {
|
|
/// Creates an empty tree.
|
|
pub fn empty() -> Self {
|
|
CommitmentTree {
|
|
left: None,
|
|
right: None,
|
|
parents: vec![],
|
|
}
|
|
}
|
|
|
|
#[allow(clippy::result_unit_err)]
|
|
pub fn from_parts(
|
|
left: Option<H>,
|
|
right: Option<H>,
|
|
parents: Vec<Option<H>>,
|
|
) -> Result<Self, ()> {
|
|
if parents.len() < usize::from(DEPTH) {
|
|
Ok(CommitmentTree {
|
|
left,
|
|
right,
|
|
parents,
|
|
})
|
|
} else {
|
|
Err(())
|
|
}
|
|
}
|
|
|
|
pub fn left(&self) -> &Option<H> {
|
|
&self.left
|
|
}
|
|
|
|
pub fn right(&self) -> &Option<H> {
|
|
&self.right
|
|
}
|
|
|
|
pub fn parents(&self) -> &Vec<Option<H>> {
|
|
&self.parents
|
|
}
|
|
|
|
/// Returns the number of leaf nodes in the tree.
|
|
pub fn size(&self) -> usize {
|
|
self.parents.iter().enumerate().fold(
|
|
match (self.left.as_ref(), self.right.as_ref()) {
|
|
(None, None) => 0,
|
|
(Some(_), None) => 1,
|
|
(Some(_), Some(_)) => 2,
|
|
(None, Some(_)) => unreachable!(),
|
|
},
|
|
|acc, (i, p)| {
|
|
// Treat occupation of parents array as a binary number
|
|
// (right-shifted by 1)
|
|
acc + if p.is_some() { 1 << (i + 1) } else { 0 }
|
|
},
|
|
)
|
|
}
|
|
|
|
pub(crate) fn is_complete(&self, depth: u8) -> bool {
|
|
if depth == 0 {
|
|
self.left.is_some() && self.right.is_none() && self.parents.is_empty()
|
|
} else {
|
|
self.left.is_some()
|
|
&& self.right.is_some()
|
|
&& self
|
|
.parents
|
|
.iter()
|
|
.chain(repeat(&None))
|
|
.take((depth - 1).into())
|
|
.all(|p| p.is_some())
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
impl<H: Hashable + Clone, const DEPTH: u8> CommitmentTree<H, DEPTH> {
|
|
pub fn from_frontier(frontier: &Frontier<H, DEPTH>) -> Self {
|
|
frontier.value().map_or_else(Self::empty, |f| {
|
|
let mut ommers_iter = f.ommers().iter().cloned();
|
|
let (left, right) = if f.position().is_odd() {
|
|
(
|
|
ommers_iter
|
|
.next()
|
|
.expect("An ommer must exist if the frontier position is odd"),
|
|
Some(f.leaf().clone()),
|
|
)
|
|
} else {
|
|
(f.leaf().clone(), None)
|
|
};
|
|
|
|
let upos: usize = f.position().into();
|
|
Self {
|
|
left: Some(left),
|
|
right,
|
|
parents: (1u8..DEPTH)
|
|
.into_iter()
|
|
.map(|i| {
|
|
if upos & (1 << i) == 0 {
|
|
None
|
|
} else {
|
|
ommers_iter.next()
|
|
}
|
|
})
|
|
.collect(),
|
|
}
|
|
})
|
|
}
|
|
|
|
pub fn to_frontier(&self) -> Frontier<H, DEPTH> {
|
|
if self.size() == 0 {
|
|
Frontier::empty()
|
|
} else {
|
|
let ommers_iter = self.parents.iter().filter_map(|v| v.as_ref()).cloned();
|
|
let (leaf, ommers) = match (self.left.as_ref(), self.right.as_ref()) {
|
|
(Some(a), None) => (a.clone(), ommers_iter.collect()),
|
|
(Some(a), Some(b)) => (
|
|
b.clone(),
|
|
Some(a.clone()).into_iter().chain(ommers_iter).collect(),
|
|
),
|
|
_ => unreachable!(),
|
|
};
|
|
|
|
// If a frontier cannot be successfully constructed from the
|
|
// parts of a commitment tree, it is a programming error.
|
|
Frontier::from_parts((self.size() - 1).into(), leaf, ommers)
|
|
.expect("Frontier should be constructable from CommitmentTree.")
|
|
}
|
|
}
|
|
|
|
/// Adds a leaf node to the tree.
|
|
///
|
|
/// Returns an error if the tree is full.
|
|
#[allow(clippy::result_unit_err)]
|
|
pub fn append(&mut self, node: H) -> Result<(), ()> {
|
|
if self.is_complete(DEPTH) {
|
|
// Tree is full
|
|
return Err(());
|
|
}
|
|
|
|
match (&self.left, &self.right) {
|
|
(None, _) => self.left = Some(node),
|
|
(_, None) => self.right = Some(node),
|
|
(Some(l), Some(r)) => {
|
|
let mut combined = H::combine(0.into(), l, r);
|
|
self.left = Some(node);
|
|
self.right = None;
|
|
|
|
for i in 0..DEPTH {
|
|
let i_usize = usize::from(i);
|
|
if i_usize < self.parents.len() {
|
|
if let Some(p) = &self.parents[i_usize] {
|
|
combined = H::combine((i + 1).into(), p, &combined);
|
|
self.parents[i_usize] = None;
|
|
} else {
|
|
self.parents[i_usize] = Some(combined);
|
|
break;
|
|
}
|
|
} else {
|
|
self.parents.push(Some(combined));
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
Ok(())
|
|
}
|
|
|
|
/// Returns the current root of the tree.
|
|
pub fn root(&self) -> H {
|
|
self.root_at_depth(DEPTH, PathFiller::empty())
|
|
}
|
|
|
|
pub fn root_at_depth(&self, depth: u8, mut filler: PathFiller<H>) -> H {
|
|
assert!(depth > 0);
|
|
|
|
// 1) Hash left and right leaves together.
|
|
// - Empty leaves are used as needed.
|
|
// - Note that `filler.next` is side-effecting and so cannot be factored out.
|
|
let leaf_root = H::combine(
|
|
0.into(),
|
|
&self
|
|
.left
|
|
.as_ref()
|
|
.map_or_else(|| filler.next(0.into()), |n| n.clone()),
|
|
&self
|
|
.right
|
|
.as_ref()
|
|
.map_or_else(|| filler.next(0.into()), |n| n.clone()),
|
|
);
|
|
|
|
// 2) Extend the parents to the desired depth with None values, then hash from leaf to
|
|
// root. Roots of the empty subtrees are used as needed.
|
|
self.parents
|
|
.iter()
|
|
.chain(repeat(&None))
|
|
.take((depth - 1).into())
|
|
.zip(0u8..)
|
|
.fold(leaf_root, |root, (p, i)| {
|
|
let level = Level::from(i + 1);
|
|
match p {
|
|
Some(node) => H::combine(level, node, &root),
|
|
None => H::combine(level, &root, &filler.next(level)),
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
#[cfg(feature = "test-dependencies")]
|
|
pub mod testing {
|
|
use core::fmt::Debug;
|
|
use proptest::prelude::*;
|
|
use std::collections::hash_map::DefaultHasher;
|
|
use std::hash::Hasher;
|
|
|
|
use crate::{Hashable, Level};
|
|
|
|
impl<H: Hashable + Clone, const DEPTH: u8> crate::testing::Frontier<H>
|
|
for super::Frontier<H, DEPTH>
|
|
{
|
|
fn append(&mut self, value: H) -> bool {
|
|
super::Frontier::append(self, value)
|
|
}
|
|
|
|
fn root(&self) -> H {
|
|
super::Frontier::root(self)
|
|
}
|
|
}
|
|
|
|
#[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord)]
|
|
pub struct TestNode(pub u64);
|
|
|
|
impl Hashable for TestNode {
|
|
fn empty_leaf() -> Self {
|
|
Self(0)
|
|
}
|
|
|
|
fn combine(level: Level, a: &Self, b: &Self) -> Self {
|
|
let mut hasher = DefaultHasher::new();
|
|
hasher.write_u8(level.into());
|
|
hasher.write_u64(a.0);
|
|
hasher.write_u64(b.0);
|
|
Self(hasher.finish())
|
|
}
|
|
}
|
|
|
|
prop_compose! {
|
|
pub fn arb_test_node()(i in any::<u64>()) -> TestNode {
|
|
TestNode(i)
|
|
}
|
|
}
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
use {crate::frontier::CommitmentTree, proptest::collection::vec};
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
pub fn arb_commitment_tree<
|
|
H: Hashable + Clone + Debug,
|
|
T: Strategy<Value = H>,
|
|
const DEPTH: u8,
|
|
>(
|
|
min_size: usize,
|
|
arb_node: T,
|
|
) -> impl Strategy<Value = CommitmentTree<H, DEPTH>> {
|
|
assert!((1 << DEPTH) >= min_size + 100);
|
|
vec(arb_node, min_size..(min_size + 100)).prop_map(move |v| {
|
|
let mut tree = CommitmentTree::empty();
|
|
for node in v.into_iter() {
|
|
tree.append(node).unwrap();
|
|
}
|
|
tree.parents.resize_with((DEPTH - 1).into(), || None);
|
|
tree
|
|
})
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
|
|
use super::*;
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
use {
|
|
super::testing::{arb_commitment_tree, arb_test_node, TestNode},
|
|
proptest::prelude::*,
|
|
};
|
|
|
|
#[test]
|
|
fn nonempty_frontier_root() {
|
|
let mut frontier = NonEmptyFrontier::new("a".to_string());
|
|
assert_eq!(frontier.root(None), "a");
|
|
|
|
frontier.append("b".to_string());
|
|
assert_eq!(frontier.root(None), "ab");
|
|
|
|
frontier.append("c".to_string());
|
|
assert_eq!(frontier.root(None), "abc_");
|
|
}
|
|
|
|
#[test]
|
|
fn frontier_from_parts() {
|
|
assert!(super::Frontier::<(), 1>::from_parts(0.into(), (), vec![]).is_ok());
|
|
assert!(super::Frontier::<(), 1>::from_parts(1.into(), (), vec![()]).is_ok());
|
|
assert!(super::Frontier::<(), 1>::from_parts(0.into(), (), vec![()]).is_err());
|
|
}
|
|
|
|
#[test]
|
|
fn frontier_root() {
|
|
let mut frontier: super::Frontier<String, 4> = super::Frontier::empty();
|
|
assert_eq!(frontier.root().len(), 16);
|
|
assert_eq!(frontier.root(), "________________");
|
|
|
|
frontier.append("a".to_string());
|
|
assert_eq!(frontier.root(), "a_______________");
|
|
|
|
frontier.append("b".to_string());
|
|
assert_eq!(frontier.root(), "ab______________");
|
|
|
|
frontier.append("c".to_string());
|
|
assert_eq!(frontier.root(), "abc_____________");
|
|
}
|
|
|
|
#[test]
|
|
fn frontier_witness() {
|
|
let mut frontier = NonEmptyFrontier::<String>::new("a".to_string());
|
|
for c in 'b'..'h' {
|
|
frontier.append(c.to_string());
|
|
}
|
|
let bridge_value_at = |addr: Address| match <u8>::from(addr.level()) {
|
|
0 => Some("h".to_string()),
|
|
3 => Some("xxxxxxxx".to_string()),
|
|
_ => None,
|
|
};
|
|
|
|
assert_eq!(
|
|
Ok(["h", "ef", "abcd", "xxxxxxxx"]
|
|
.map(|v| v.to_string())
|
|
.to_vec()),
|
|
frontier.witness(4, bridge_value_at)
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
#[cfg(feature = "legacy-api")]
|
|
fn test_commitment_tree_complete() {
|
|
let mut t: CommitmentTree<TestNode, 6> = CommitmentTree::empty();
|
|
for n in 1u64..=32 {
|
|
t.append(TestNode(n)).unwrap();
|
|
// every tree of a power-of-two height is complete
|
|
let is_complete = n.count_ones() == 1;
|
|
let level = usize::BITS - 1 - n.leading_zeros(); //log2
|
|
assert_eq!(
|
|
is_complete,
|
|
t.is_complete(level.try_into().unwrap()),
|
|
"Tree {:?} {} complete at height {}",
|
|
t,
|
|
if is_complete {
|
|
"should be"
|
|
} else {
|
|
"should not be"
|
|
},
|
|
n
|
|
);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
#[cfg(feature = "legacy-api")]
|
|
fn test_commitment_tree_roundtrip() {
|
|
let ct = CommitmentTree {
|
|
left: Some("a".to_string()),
|
|
right: Some("b".to_string()),
|
|
parents: vec![
|
|
Some("c".to_string()),
|
|
Some("d".to_string()),
|
|
Some("e".to_string()),
|
|
Some("f".to_string()),
|
|
None,
|
|
None,
|
|
None,
|
|
],
|
|
};
|
|
|
|
let frontier: Frontier<String, 8> = ct.to_frontier();
|
|
let ct0 = CommitmentTree::from_frontier(&frontier);
|
|
assert_eq!(ct, ct0);
|
|
let frontier0: Frontier<String, 8> = ct0.to_frontier();
|
|
assert_eq!(frontier, frontier0);
|
|
}
|
|
|
|
#[cfg(feature = "legacy-api")]
|
|
proptest! {
|
|
#[test]
|
|
fn prop_commitment_tree_roundtrip(ct in arb_commitment_tree(32, arb_test_node())) {
|
|
let frontier: Frontier<TestNode, 8> = ct.to_frontier();
|
|
let ct0 = CommitmentTree::from_frontier(&frontier);
|
|
assert_eq!(ct, ct0);
|
|
let frontier0: Frontier<TestNode, 8> = ct0.to_frontier();
|
|
assert_eq!(frontier, frontier0);
|
|
}
|
|
|
|
#[test]
|
|
fn prop_commitment_tree_roundtrip_str(ct in arb_commitment_tree::<_, _, 8>(32, any::<char>().prop_map(|c| c.to_string()))) {
|
|
let frontier: Frontier<String, 8> = ct.to_frontier();
|
|
let ct0 = CommitmentTree::from_frontier(&frontier);
|
|
assert_eq!(ct, ct0);
|
|
let frontier0: Frontier<String, 8> = ct0.to_frontier();
|
|
assert_eq!(frontier, frontier0);
|
|
}
|
|
}
|
|
}
|