anchor.diff:  -spec init(nodelist:neighborhood()) -> rt().
   init(Neighbors) -> 
       % ask the successor node for its routing table
  -    % XXX i have to wrap the message as the Pid given as the succ is actually the dht
  -    % node, but the message should be send to the routing table
       Msg = {send_to_group_member, routing_table, {get_rt, comm:this()}},
       comm:send(node:pidX(nodelist:succ(Neighbors)), Msg),
  +    comm:send_local(self(), {trigger_random_lookup}),
       empty(Neighbors).
   
   %% @doc Hashes the key to the identifier space.
  
positive.code:                 source -> set_source_node(entry_nodeid(NewNode), RT);
                  _else  -> RT
              end,
              %% XXX DELETE
              %% assert that the ids of the adjacent nodes are still in the new table
              %% So: check that no ID exists which is not contained in the RT
              Adjs = [tuple_to_list(adjacent_fingers(N)) || N <- [NewPred, NewNode,
                      NewSucc]],
              Ids = lists:flatten(Adjs),
              false = lists:any(fun (none) -> true; (_) -> false end, [gb_trees:lookup(N,
                          Nodes) || N <- Ids]),
              rt_set_nodes(NewRT, Nodes);
          _else -> RT
      end
  
negative.code: -spec entry_learning_and_filtering(node:node_type(), entry_type(), rt()) -> rt().
  entry_learning_and_filtering(Entry, Type, RT) ->
      IntermediateRT = entry_learning(Entry, Type, RT),
  
      SizeOfRT = get_size(IntermediateRT),
      MaxEntries = maximum_entries(),
  