anchor.diff:                        util:tc(fun() ->
                                         compress_kv_list_p1e(
                                           NewKVList, FullDiffSize,
  -                                        bloom:item_count(BF), ?BLOOM_B * get_p1e())
  +                                        BFCount, ?BLOOM_B * get_p1e())
                                 end),
                     ?DBG_ASSERT(DBChunk =/= <<>>),
                     
  
positive.code: 
  %% @doc Calculates the minimum number of bits needed to have a hash collision
  %%      probability of P1E, given we compare N hashes with M other hashes
  %%      pairwise with each other (assuming the worst case, i.e. we have M+N
  %%      hashes).
  -spec calc_signature_size_nm_pair(N::non_neg_integer(), M::non_neg_integer(),
                                    P1E::float(), MaxSize::signature_size())
  
negative.code: 
  %% @doc De-compresses the binary from compress_kv_list/4 into a gb_tree with a
  %%      binary key representation and the integer of the (shortened) version.
  -spec decompress_kv_list(CompressedBin::bitstring(), AccList::[{KeyBin::bitstring(), VersionShort::non_neg_integer()}],
                           SigSize::signature_size(), VSize::signature_size())
          -> ResTree::kv_tree().
  decompress_kv_list(<<>>, AccList, _SigSize, _VSize) ->
      gb_trees:from_orddict(orddict:from_list(AccList));
  decompress_kv_list(Bin, AccList, SigSize, VSize) ->
      <<KeyBin:SigSize/bitstring, Version:VSize, T/bitstring>> = Bin,
      decompress_kv_list(T, [{KeyBin, Version} | AccList], SigSize, VSize).
  
  %% @doc Gets all entries from MyEntries which are not encoded in MyIOtherKvTree
  %%      or the entry in MyEntries has a newer version than the one in the tree
  