anchor.diff:                             method = bloom}) ->
       ?TRACE1(_Msg, State),
       
  -    DBChunkTree = decompress_kv_list(DBChunk, [], SigSize, VSize),
  +    DBChunkTree = decompress_kv_list(DBChunk, [], SigSize, VSize, 0),
   
       NewStats2 = shash_bloom_perform_resolve(
  -                  State, DBChunk, DBChunkTree, SigSize, VSize, DestReconPid, [],
  +                  State, DBChunkTree, SigSize, VSize, DestReconPid, [],
                     % nothing to do if the chunk is empty
                     gb_trees:is_empty(DBChunkTree)),
       shutdown(sync_finished, State#rr_recon_state{stats = NewStats2});
  
positive.code: -spec merkle_resolve_retrieve_leaf_hashes(
          Hashes::bitstring(), P1E::float(), MyMaxItemsCount::non_neg_integer(),
          BucketSizeBits::pos_integer())
          -> {NHashes::bitstring(), OtherBucketBin::bitstring(), OtherBucketTree::kv_tree(),
              SigSize::signature_size(), VSize::signature_size()}.
  merkle_resolve_retrieve_leaf_hashes(Hashes, P1E, MyMaxItemsCount, BucketSizeBits) ->
      <<BSize:BucketSizeBits/integer-unit:1, HashesT/bitstring>> = Hashes,
      {SigSize, VSize} = trivial_signature_sizes(BSize, MyMaxItemsCount, P1E),
      OBucketBinSize = BSize * (SigSize + VSize),
      <<OBucketBin:OBucketBinSize/bitstring, NHashes/bitstring>> = HashesT,
      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
  %%      comparisons so that the other node can filter its leaf nodes and
  
negative.code:            <<0:FillSize, KBin/binary>>
      end.
  
  %% @doc Creates a compressed version of a (key-)position list.
  %% @see shash_compress_k_list/7
  -spec compress_idx_list(SortedIdxList::[non_neg_integer()],
                          DBChunkLen::non_neg_integer(), ResultIdx::[?RT:key()],
                          LastPos::non_neg_integer(), Max::non_neg_integer())
          -> CompressedIndices::bitstring().
  compress_idx_list([], DBChunkLen, AccResult, _LastPos, Max) ->
      IdxSize = if Max =:= 0 -> 1;
                   true      -> bits_for_number(Max)
                end,
  