def fresh
import stelliferous@0.0.2.0/proofs/storage_tree_model.bend as StorageTreeModelimport Base
28def fresh(-T: Data,n: Nat,+v: T) -> Tree<T>:
29 match n:
30 case 0n:
31 Leaf{v}
32 case 1n+ +rest:
33 Node{fresh(T,rest,v),fresh(T,rest,v)}