anchor.diff:      is_subtype(Result,      {Matched::NodeL, NotMatched::NodeL}).
   compareNodes([], [], Acc) -> Acc;
   compareNodes([N | Nodes], [H | NodeHashs], {Matched, NotMatched}) ->
  -    Hash = merkle_tree:get_hash(N),
  -    case Hash =:= H of
  +    case merkle_tree:get_hash(N) =:= H of
           true -> compareNodes(Nodes, NodeHashs, {[N|Matched], NotMatched});
           false -> compareNodes(Nodes, NodeHashs, {Matched, [N|NotMatched]})
       end.
  
positive.code:                         dhtNodePid = DhtPid,
                          struct = #bloom_recon_struct{ interval = BloomI}
                         }) ->
      %MyBloomI = mapInterval(BloomI, get_interval_quadrant(MyI)),
      MySyncI = find_intersection(MyI, BloomI),
      %?TRACE("GET STATE - MyI=~p ~n BloomI=~p ~n BloomIMapped=~p ~n SynI=~p", [MyI, BloomI, MyBloomI, MySyncI]),
      case intervals:is_empty(MySyncI) of
          true -> comm:send_local(self(), {shutdown, empty_interval});
          false -> send_chunk_req(DhtPid, self(), MySyncI, mapInterval(MySyncI, 1), get_max_items(bloom))
  
negative.code:                                 merkle_tree:get_hash(X)}) || X <- NotMatched],
                  [{tree_compareLeft, length(NotMatched)},
                   {tree_nodesCompared, length(Matched)},
                   {tree_compareSkipped, SkippedSubNodes}];
              _ -> %case fail_leaf OR fail_inner when NodeIsLeaf
                  Leafs = reconcileNode(Node, {SrcNode, Round, OwnerL, OwnerR}),
                  [{tree_leafsSynced, Leafs}]            
          end,
      FinalStats = rr_recon_stats:inc(IncOps ++ [{tree_compareLeft, -1}, 
                                                 {tree_nodesCompared, 1}], Stats),
  