anchor.diff:             if FullDiffSize > 0 ->
                     % start resolve similar to a trivial recon but using the full diff!
                     % (as if non-initiator in trivial recon)
  +                  % NOTE: reduce P1E for the two parts here (bloom and trivial RC)
                     {BuildTime, {DBChunk, SigSize, VSize}} =
                         util:tc(fun() ->
                                         compress_kv_list_p1e(
                                           NewKVList, FullDiffSize,
  -                                        bloom:item_count(BF), 0.5 * get_p1e())
  +                                        bloom:item_count(BF), ?BLOOM_B * get_p1e())
                                 end),
                     
                     send(DestReconPid,
  
positive.code:          to_resolve         = {[], []}                               :: {ToSend::rr_resolve:kvv_list(), ToReq::[?RT:key()]}
           }).
  -type state() :: #rr_recon_state{}.
  
  % keep in sync with check_node/2
  -define(recon_ok,                       1). % match
  
negative.code: compress_kv_list_p1e(DBItems, ItemCount, OtherItemCount, P1E) ->
      VCompareCount = erlang:min(ItemCount, OtherItemCount),
      % reduce P1E for the two parts here (key and version comparison)
      B = ?TRIVIAL_B, A = 1 - ?TRIVIAL_B,
      % cut off at 128 bit (rt_chord uses md5 - must be enough for all other RT implementations, too)
      SigSize0 = calc_signature_size_nm_pair(ItemCount, OtherItemCount, A * P1E, 128),
      % note: we have n one-to-one comparisons, assuming the probability of a
  