anchor.diff:                          DestRRPid, Stats, OwnerL, SendKeys) ->
       merkle_resolve_req_keys_noninit(TL, BinKeyList, DestRRPid, Stats, OwnerL,
                                       SendKeys);
  -merkle_resolve_req_keys_noninit([{leaf, leaf, SigSize, LeafNode} | TL],
  +merkle_resolve_req_keys_noninit([{leaf, leaf, SigSize0, LeafNode} | TL],
                           [[_|_] = ReqKeys | BinKeyList],
                           DestRRPid, Stats, OwnerL, SendKeys) ->
       ReqSet = gb_sets:from_list(ReqKeys),
  +    {SigSize, _VSize} = align_bitsize(SigSize0, get_min_version_bits()),
       SendKeys1 = [Key || {Key, _Version} <- merkle_tree:get_bucket(LeafNode),
                           gb_sets:is_member(compress_key(Key, SigSize),
                                             ReqSet)] ++ SendKeys,
  
positive.code:                     end, {Interval, Items, LeafNAcc}, LeafNodes),
      merkle_resolve_leaves_noninit(TL, Bin, Dest, SID, OwnerL, NInterval, NItems,
                                    NLeafNAcc);
  merkle_resolve_leaves_noninit([{leaf, leaf, SigSize, LeafNode} | TL], Bin,
                                Dest, SID, OwnerL, Interval, Items, LeafNAcc) ->
      ?ASSERT(merkle_tree:is_leaf(LeafNode)),
      % TODO: make extra version binary for better compression (?)
  
negative.code:                         calc_signature_size_1_to_n(1, VP, 128)),
      % note: we can reach the best compression if values and versions align to
      %       byte-boundaries
      {SigSize, VSize} = align_bitsize(SigSize0, VSize0),
      DBChunkBin = compress_kv_list(DBItems, <<>>, SigSize, VSize),
      % debug compressed and uncompressed sizes:
      ?TRACE("SigSize: ~p, VSize: ~p, ChunkSize: ~p / ~p bits",
  