anchor.diff:      NewStats1 = rr_recon_stats:inc([{resolve_started, 1}], Stats),
   
       % let the initiator's rr_recon process identify the remaining keys
  -    ReqTree = lists:foldl(fun(KeyBin, Acc) ->
  -                                  gb_trees:enter(KeyBin, 0, Acc)
  -                          end, DBChunkTree1, ToReq1),
  -    Req2Count = gb_trees:size(ReqTree),
  -    ToReq2 = compress_k_list(ReqTree, DBChunk, SigSize, VSize, 0, [], 0, 0),
  +    ReqIdx = lists:usort([Idx || {_Version, Idx} <- gb_trees:values(DBChunkTree1)] ++ ToReqIdx1),
  +    ToReq2 = compress_idx_list(ReqIdx, OrigDBChunkLen, [], 0, 0),
       ?TRACE("resolve_req ~s Session=~p ; ToReq=~p (~p bits)",
  -           [_RMethod, SID, Req2Count, erlang:bit_size(ToReq2)]),
  +           [_RMethod, SID, length(ToReq2), erlang:bit_size(ToReq2)]),
       comm:send(DestReconPid, {resolve_req, ToReq2}),
  -    if Req2Count > 0 ->
  +    if ReqIdx =/= [] ->
              rr_recon_stats:inc([{resolve_started, 1}], NewStats1);
          true -> NewStats1
       end.
  
positive.code:          kv_list            = []                                     :: db_chunk_kv(),
           k_list             = []                                     :: [?RT:key()],
           stats              = rr_recon_stats:new()                   :: rr_recon_stats:stats(),
           to_resolve         = {[], []}                               :: {ToSend::rr_resolve:kvv_list(), ToReq::[bitstring()]}
           }).
  -type state() :: #rr_recon_state{}.
  
  
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,
  