anchor.diff:                                  merkle_tree:get_hash(X)}) || X <- NotMatched],
                   [{tree_compareLeft, length(NotMatched)},
                    {tree_nodesCompared, length(Matched)},
  -                 {tree_compareSkipped, SkippedSubNodes}]    
  +                 {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),
  
positive.code:             not_found -> [{error_count, 1}]; 
              ok_leaf -> [{tree_compareSkipped, 1}];
              ok_inner -> [{tree_compareSkipped, merkle_tree:size(Node)}];
              fail_leaf ->
                  Leafs = reconcileNode(Node, {SrcNode, Round, OwnerL, OwnerR}),
                  [{tree_leafsSynced, Leafs}];
              fail_inner when NodeIsLeaf ->
                  Leafs = reconcileNode(Node, {SrcNode, Round, OwnerL, OwnerR}),
                  [{tree_leafsSynced, Leafs}];
              fail_inner when not NodeIsLeaf ->
                  MyChilds = merkle_tree:get_childs(Node),
                  {Matched, NotMatched} = compareNodes(MyChilds, ChildHashs, {[], []}),
  
negative.code:                random -> select_sync_node(MyI);        
                 _ -> DestKey
             end,
      ?TRACE("START_TO_DEST ~p", [DKey]),
      comm:send_local(DhtPid, {?lookup_aux, DKey, 0, Msg}),    
      comm:send_local(self(), {shutdown, negotiate_interval_initiator}),
      State;
  