@@ -1589,16 +1589,26 @@ mod tests {
15891589 let min_level = u8:: try_from ( n. next_power_of_two ( ) . trailing_zeros ( ) ) . unwrap ( ) ;
15901590 for level in [ min_level, 10 , 30 ] {
15911591 let layer = cache_layer ( & subtree, level, & storage) . unwrap ( ) ;
1592- assert_eq ! ( layer. len( ) , 1 , "n={n} level={level}: layer not a single node" ) ;
1592+ assert_eq ! (
1593+ layer. len( ) ,
1594+ 1 ,
1595+ "n={n} level={level}: layer not a single node"
1596+ ) ;
15931597 assert_eq ! ( layer[ 0 ] , root, "n={n} level={level}: cached node != root" ) ;
15941598 for leaf in 0 ..n {
15951599 let want = subtree_inclusion_proof ( & subtree, leaf, & storage) . unwrap ( ) ;
15961600 let prefix = inclusion_proof_prefix ( & subtree, level, leaf, & storage) . unwrap ( ) ;
15971601 // The prefix is the whole proof; the cache contributes nothing.
1598- assert_eq ! ( prefix, want, "n={n} level={level} leaf={leaf}: prefix != full" ) ;
1599- let got =
1600- reconstruct_inclusion_proof ( & layer, & subtree, level, leaf, & prefix) . unwrap ( ) ;
1601- assert_eq ! ( got, prefix, "n={n} level={level} leaf={leaf}: suffix not empty" ) ;
1602+ assert_eq ! (
1603+ prefix, want,
1604+ "n={n} level={level} leaf={leaf}: prefix != full"
1605+ ) ;
1606+ let got = reconstruct_inclusion_proof ( & layer, & subtree, level, leaf, & prefix)
1607+ . unwrap ( ) ;
1608+ assert_eq ! (
1609+ got, prefix,
1610+ "n={n} level={level} leaf={leaf}: suffix not empty"
1611+ ) ;
16021612 verify_subtree_inclusion_proof ( & got, & subtree, root, leaf, leaves[ us ( leaf) ] )
16031613 . unwrap ( ) ;
16041614 }
0 commit comments