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:     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
          true -> compareNodes(Nodes, NodeHashs, {[N|Matched], NotMatched});
          false -> compareNodes(Nodes, NodeHashs, {Matched, [N|NotMatched]})
      end.
  
negative.code: %% merkle tree sync messages
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  
  on({check_node, SenderPid, Interval, Hash}, State = #rr_recon_state{ struct = Tree }) ->
      Node = merkle_tree:lookup(Interval, Tree),
      {Result, ChildHashs} = 
          case Node of
  