anchor.diff:                          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]),
  +    ?TRACE("GET STATE - MyI=~p ~n BloomI=~p ~n SynI=~p", [MyI, BloomI, 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))
  
positive.code: build_recon_struct(merkle_tree, {I, DBItems}) ->
      merkle_tree:new(I, DBItems, []);
  build_recon_struct(art, Chunk) ->
      Tree = build_recon_struct(merkle_tree, Chunk),
      art:new(Tree).
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  % HELPER
  
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),
  