anchor.diff:      {SigSize, VSize} = trivial_signature_sizes(BSize, MyMaxItemsCount, P1E),
       OBucketBinSize = BSize * (SigSize + VSize),
       <<OBucketBin:OBucketBinSize/bitstring, NHashes/bitstring>> = HashesT,
  -    OBucketTree = decompress_kv_list(OBucketBin, gb_trees:empty(), SigSize, VSize),
  +    OBucketTree = decompress_kv_list(OBucketBin, [], SigSize, VSize),
       {NHashes, OBucketBin, OBucketTree, SigSize, VSize}.
   
   %% @doc Gets a compact binary merkle hash list from all leaf-inner node
  
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:                VersionShort =:= OtherVersionShort ->
                     get_full_diff_(Rest, MyIOtKvTree2, FBItems,
                                    ReqItems, SigSize, VMod);
                 true -> % VersionShort < OtherVersionShort
                     get_full_diff_(Rest, MyIOtKvTree2, FBItems,
                                    [Key | ReqItems], SigSize, VMod)
              end
  