anchor.diff:             ResultCode = if not IsLeafNode -> ?recon_fail_stop_inner; % stop_empty_leaf1
                              NonEmptyLeafNode -> ?recon_fail_stop_leaf % stop_empty_leaf2
                           end,
  -           {MyKVItems, LeafCount} = merkle_tree:get_items([Node]),
  +           {MyKVItems, LeafCount} = merkle_tree:get_items(Node),
              MySyncAccDRK1 = [element(1, X) || X <- MyKVItems] ++ MySyncAccDRK,
              merkle_check_node(TK, TN, SigSizeI, SigSizeL,
                                MyMaxItemsCount, OtherMaxItemsCount, Params, Stats,
  
positive.code:        (not IsLeafNode) andalso NonEmptyLeafHash ->
             % inner node here, non-empty leaf there
             % no need to compare hashes - this is an exact process based on the tags
             {MyKVItems, LeafCount} = merkle_tree:get_items([Node]),
             Sync = {MyMaxItemsCount, MyKVItems},
             merkle_check_node(TK, TN, SigSizeI, SigSizeL,
                               MyMaxItemsCount, OtherMaxItemsCount, Params, Stats,
  
negative.code:                     OtherSyncAccDRLCount1 = OtherSyncAccDRLCount + 1
              end;
          false -> % stop_leaf
              {MyKVItems, LeafCount} = merkle_tree:get_items(Node),
              SyncAccRcv1 =
                  [{MyMaxItemsCount, MyKVItems} | SyncAccRcv],
              SyncAccRcvLeafCount1 = SyncAccRcvLeafCount + LeafCount,
  