anchor.diff:                      end, {[], 0}, LeafNodes),
       {ToSend1, ToReq1, OBucketTree1} =
           get_full_diff(MyBuckets, OBucketTree, ToSend, ToReq, SigSize, VSize),
  -    ToResolve1 = [gb_trees:keys(OBucketTree1) | ToResolve],
  +    ToResolve1 = [compress_k_list(OBucketTree1, OBucketHashes, SigSize, VSize,
  +                                  0, []) | ToResolve],
       ResolveNonEmptyAcc1 =
           ?IIF(gb_trees:size(OBucketTree1) =/= 0, true, ResolveNonEmptyAcc),
       {NHashes, ToSend1, ToReq1, ToResolve1, ResolveNonEmptyAcc1, NLeafNAcc}.
  
positive.code: %%      Inner(NI)-leaf(I) mismatches will work with the compressed KV-List from
  %%      the initiator.
  -spec merkle_resolve_req_keys_noninit(
          Sync::[merkle_sync()], Hashes::bitstring(), BinKeyList::[[bitstring()]],
          DestRRPid::comm:mypid(), Stats, OwnerL::comm:erl_local_pid(),
          BucketSizeBits::pos_integer(), MaxBucketSize::pos_integer(), P1EOneLeaf::float(),
          ToSend::[?RT:key()], ToReq::[?RT:key()], ToResolve::[[bitstring()]],
          ResolveNonEmpty::boolean(), BinKeyListNonEmpty::boolean())
          -> {HashesReq::[[bitstring()]], NewStats::Stats}
      when is_subtype(Stats, rr_recon_stats:stats()).
  merkle_resolve_req_keys_noninit([{leaf, leaf, LeafNode} | TL], Hashes,
                                  [_ReqKeys | _] = BinKeyList, DestRRPid,
  
negative.code:     OBucketBinSize = BSize * (SigSize + VSize),
      <<OBucketBin:OBucketBinSize/bitstring, NHashes/bitstring>> = HashesT,
      OBucketTree = decompress_kv_list(OBucketBin, gb_trees:empty(), 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
  