fold use SubtreeConsistency for Consistency

Author: phbnf

proof/proof.go

@@ -84,27 +84,7 @@ func SubtreeInclusion(index, start, end uint64) (Nodes, error) {
 // consistency proof between the two given tree sizes of a log Merkle tree. It
 // requires 0 <= size1 <= size2.
 func Consistency(size1, size2 uint64) (Nodes, error) {
-	if size1 > size2 {
-		return Nodes{}, fmt.Errorf("tree size %d > %d", size1, size2)
-	}
-	if size1 == size2 || size1 == 0 {
-		return Nodes{IDs: []compact.NodeID{}}, nil
-	}
-
-	// Find the root of the biggest perfect subtree that ends at size1.
-	level := uint(bits.TrailingZeros64(size1))
-	index := (size1 - 1) >> level
-	// The consistency proof consists of this node (except if size1 is a power of
-	// two, in which case adding this node would be redundant because the client
-	// is assumed to know it from a checkpoint), and nodes of the inclusion proof
-	// into this node in the tree of size2.
-	p := nodes(index, level, size2)
-
-	// Handle the case when size1 is a power of 2.
-	if index == 0 {
-		return p.skipFirst(), nil
-	}
-	return p, nil
+	return SubtreeConsistency(0, size1, size2)
 }
 
 // SubtreeConsistency returns the information on how to fetch and construct a