anchor.diff:          case merkle_tree:get_interval(Tree) =:= art:get_interval(Art) of
               true ->
                   {ASyncLeafs, NComp, NSkip, NLSync} =
  -                    art_get_sync_leaves([merkle_tree:get_root(Tree)], Art,
  +                    art_get_sync_leafs([merkle_tree:get_root(Tree)], Art,
                                           [], 0, 0, 0),
  -                ResolveCalled = resolve_leaves(ASyncLeafs, DestPid, SID, OwnerL),
  +                ResolveCalled = resolve_leafs(ASyncLeafs, DestPid, SID, OwnerL),
                   rr_recon_stats:inc([{tree_nodesCompared, NComp},
                                       {tree_compareSkipped, NSkip},
                                       {tree_leafsSynced, NLSync},
  
positive.code:                                   Stats),
      Req =/= [] andalso
          send(DestReconPid, {check_nodes, Req}),
      {LeafNodes, Leafs} = merkle_get_sync_leaves(Res, [], 0),
      Resolves = resolve_leaves(LeafNodes, SrcNode, SID, OwnerL),
      FStats = rr_recon_stats:inc([{tree_leafsSynced, Leafs},
                                   {resolve_started, Resolves}], NStats),
      CompLeft = rr_recon_stats:get(tree_compareLeft, FStats),
      NewState = State#rr_recon_state{stats = FStats, struct = RTree},
  
negative.code: p_process_tree_cmp_result([?ok_leaf | TR], [_Node | TN], BS, Stats, Req, Res, RTree) ->
      NStats = rr_recon_stats:inc([{tree_compareSkipped, 1}], Stats),
      p_process_tree_cmp_result(TR, TN, BS, NStats, Req, Res, RTree);
  p_process_tree_cmp_result([{?fail_leaf, Hash} | TR], [Node | TN], BS, Stats, Req, Res, RTree) ->
      NewRes = lists:append(merkle_get_sync_leafs([Node], Hash, []), Res),
      p_process_tree_cmp_result(TR, TN, BS, Stats, Req, NewRes, RTree);
  p_process_tree_cmp_result([?fail_inner | TR], [Node | TN], BS, Stats, Req, Res, RTree) ->
      case merkle_tree:is_leaf(Node) of
          false -> 
  