anchor.diff:              #trivial_recon_struct{interval = MySyncI, reconPid = DestReconPid,
                                     db_chunk = DBChunk,
                                     sig_size = SigSize, ver_size = VSize} = Params,
  -            Params1 = Params,
  +            Params1 = Params#trivial_recon_struct{db_chunk = <<>>},
               ?DBG_ASSERT(DestReconPid =/= undefined),
               fd:subscribe(DestRRPid),
               % convert db_chunk to a gb_tree for faster access checks
               DBChunkTree =
  -                decompress_kv_list(DBChunk, [], SigSize, VSize),
  +                decompress_kv_list(DBChunk, [], SigSize, VSize, 0),
               ?DBG_ASSERT(Misc =:= []),
  -            Misc1 = [{db_chunk, DBChunkTree}],
  +            Misc1 = [{db_chunk, {DBChunkTree, gb_trees:size(DBChunkTree)}}],
               Reconcile = resolve,
               Stage = resolve;
           shash ->
  
positive.code: %% @doc Part of the resolve_req message processing of the SHash and Bloom RC
  %%      processes in phase 2 (trivial RC).
  -spec shash_bloom_perform_resolve(
          State::state(), DBChunk::bitstring(), DBChunkTree::kv_tree(),
          SigSize::signature_size(), VSize::signature_size(),
          DestReconPid::comm:mypid(), FBItems::[?RT:key()],
          SkipResolve::boolean()) -> rr_recon_stats:stats().
  shash_bloom_perform_resolve(#rr_recon_state{stats = Stats}, _DBChunk, _DBChunkTree,
                              _SigSize, _VSize, _DestReconPid, [], true) ->
      Stats;
  shash_bloom_perform_resolve(
    #rr_recon_state{dest_rr_pid = DestRRPid,   ownerPid = OwnerL,
                    kv_list = KVList,          stats = Stats,
                    method = _RMethod},
    DBChunk, DBChunkTree, SigSize, VSize, DestReconPid, FBItems, _SkipResolve) ->
      SID = rr_recon_stats:get(session_id, Stats),
      {ToSendKeys1, ToReq1, DBChunkTree1} =
          get_part_diff(KVList, DBChunkTree, FBItems, [], SigSize, VSize),
  
      ?TRACE("Resolve ~S Session=~p ; ToSend=~p",
  
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,
  