anchor.diff:  merkle_resolve_retrieve_leaf_hashes(
     HashesK, HashesV, P1EAllLeaves, NumRestLeaves, PrevP0E, MyMaxItemsCount,
     BucketSizeBits) ->
  -    <<BucketSize:BucketSizeBits/integer-unit:1, HashesKT/bitstring>> = HashesK,
  +    <<BucketSize0:BucketSizeBits/integer-unit:1, HashesKT/bitstring>> = HashesK,
  +    BucketSize = BucketSize0 + 1,
       P1E_next = calc_n_subparts_p1e(NumRestLeaves, P1EAllLeaves, PrevP0E),
   %%     log:pal("merkle_receive [ ~p ]:~n   ~p~n   ~p",
   %%             [self(), {NumRestLeaves, P1EAllLeaves, PrevP0E},
  
positive.code:                     State#rr_recon_state{stats = NStats2,
                                           merkle_sync = SyncNew1, misc = []});
         SyncSend =/= [] ->
             BucketSizeBits = bits_for_number(Params#merkle_params.bucket_size),
             % note: 1 trivial proc contains 1 leaf
             {HashesK, HashesV, NewSyncSend_rev, ThisP0E, LeafCount} =
                 lists:foldl(
  
negative.code:          is_subtype(Bin, bitstring()).
  merkle_resolve_leaves_receive(Sync, {HashesK, HashesV}, DestRRPid, Stats, OwnerL, Params,
                                P1EAllLeaves, TrivialProcs, IsInitiator) ->
      % note: we do not have empty buckets here and thus always store (BucketSize - 1)
      BucketSizeBits = bits_for_number(Params#merkle_params.bucket_size - 1),
      % mismatches to resolve:
      % * at initiator    : inner(I)-leaf(NI) or leaf(NI)-non-empty-leaf(I)
      % * at non-initiator: inner(NI)-leaf(I)
  