anchor.diff:             end,
       p_process_tree_cmp_result(TR, TN, SigSize, MerkleSyncIn, Stats, RestTreeAcc,
                                 [Sync | MerkleSyncAcc], AccMLC, AccCmp + 1);
  -p_process_tree_cmp_result(<<?recon_fail_stop_inner:2, TR/bitstring>>, [Node | TN], SigSize,
  +p_process_tree_cmp_result(<<?recon_fail_stop_inner_found:3, TR/bitstring>>, [Node | TN], SigSize,
                             MerkleSyncIn, Stats, RestTreeAcc,
                             MerkleSyncAcc, AccMLC, AccCmp) ->
       ?ASSERT(merkle_tree:is_leaf(Node)),
       p_process_tree_cmp_result(TR, TN, SigSize, MerkleSyncIn, Stats, RestTreeAcc,
  -                              [{leaf, inner, SigSize, Node} | MerkleSyncAcc],
  +                              [{leaf, inner, SigSize, Node, _FoundSkipHash = true} | MerkleSyncAcc],
                                 AccMLC, AccCmp + 1);
  -p_process_tree_cmp_result(<<?recon_fail_cont_inner:2, TR/bitstring>>, [Node | TN], SigSize,
  +p_process_tree_cmp_result(<<?recon_fail_stop_inner_notfound:3, TR/bitstring>>, [Node | TN], SigSize,
  +                          MerkleSyncIn, Stats, RestTreeAcc,
  +                          MerkleSyncAcc, AccMLC, AccCmp) ->
  +    ?ASSERT(merkle_tree:is_leaf(Node)),
  +    p_process_tree_cmp_result(TR, TN, SigSize, MerkleSyncIn, Stats, RestTreeAcc,
  +                              [{leaf, inner, SigSize, Node, _FoundSkipHash = false} | MerkleSyncAcc],
  +                              AccMLC, AccCmp + 1);
  +p_process_tree_cmp_result(<<?recon_fail_cont_inner:3, TR/bitstring>>, [Node | TN], SigSize,
                             MerkleSyncIn, Stats, RestTreeAcc,
                             MerkleSyncAcc, AccMLC, AccCmp) ->
       ?ASSERT(not merkle_tree:is_leaf(Node)),
  
positive.code: merkle_resolve_leaves_init([{leaf, leaf, SigSize, LeafNode} | TL], Hashes,
                             DestRRPid, Stats, OwnerL, ToSend, ToReq, ToResolve,
                             ResolveNonEmpty, LeafNAcc, HashesReply) ->
      % same handling as below -> simply convert:
      merkle_resolve_leaves_init(
        [{inner, leaf, SigSize, [LeafNode], false} | TL], Hashes,
        DestRRPid, Stats, OwnerL,
  
negative.code:     merkle_resolve_req_keys_noninit(TL, NHashes, BinKeyList, DestRRPid, NStats,
                                      OwnerL, ToSend1, ToReq1, ToResolve1,
                                      ResolveNonEmpty1, BKLNonEmpty);
  merkle_resolve_req_keys_noninit([_ | TL], Hashes, BinKeyList, DestRRPid,
                                  Stats, OwnerL, ToSend, ToReq, ToResolve,
                                  ResolveNonEmpty, BKLNonEmpty) ->
      % already resolved by initiator / in first step or optimised empty BinKeyList
      merkle_resolve_req_keys_noninit(TL, Hashes, BinKeyList, DestRRPid, Stats,
                                      OwnerL, ToSend, ToReq, ToResolve,
                                      ResolveNonEmpty, BKLNonEmpty);
  merkle_resolve_req_keys_noninit([], <<>>, [], DestRRPid, Stats, OwnerL,
                                  ToSend, ToReq, ToResolve, ResolveNonEmpty,
                                  _BKLNonEmpty) ->
  