anchor.diff:      end, open(data_file(), 256), lists:seq(1,500)),
     TreeB = lists:foldl(fun(N, Tree) ->
         update(lists:concat(["key", N]), lists:concat(["value", N]), Tree)
  -    end, open("/Users/cliff/data/dmerkle1", 256), lists:reverse(lists:seq(1,500))),
  +    end, open(data_file(1), 256), lists:reverse(lists:seq(1,500))),
     % error_logger:info_msg("rootA ~p~nrootB ~p~n", [TreeA#dmerkle.root, TreeB#dmerkle.root]),
     true = equals(TreeA, TreeB).
     
  
positive.code:     end, open(data_file(), 256), lists:seq(1,500)),
    TreeB = lists:foldl(fun(N, Tree) ->
        update(lists:concat(["key", N]), lists:concat(["value", N]), Tree)
      end, open("/Users/cliff/data/dmerkle1", 256), lists:seq(1,505)),
    error_logger:info_msg("rootA ~p~nrootB ~p~n", [TreeA#dmerkle.root, TreeB#dmerkle.root]),
    false = equals(TreeA, TreeB).
  
  
negative.code:     end, open(data_file(), 256), lists:seq(1,500)),
    TreeB = lists:foldl(fun(N, Tree) ->
        update(lists:concat(["key", N]), lists:concat(["value", N]), Tree)
      end, open(data_file(1), 256), lists:reverse(lists:seq(1,500))),
    Diff = key_diff(TreeA, TreeB),
    error_logger:info_msg("both ways diff: ~p~n", [Diff]),
    [] = Diff.
  