anchor.diff:  handle_custom_message({get_rt_reply, RT}, State) ->
       %% merge the routing tables. Note: We don't care if this message is not from our
       %current successor. We just have to make sure that the merged entries are valid.
  -    LocalRT = rt_loop:get_rt(State),
  -    NewRT = case LocalRT =/= RT of
  +    OldRT = rt_loop:get_rt(State),
  +    NewRT = case OldRT =/= RT of
           true ->
               % - add each entry from the other RT if it doesn't already exist
               % - entries to be added have to be normal entries as RM invokes adding sticky
  
positive.code:                             false -> add_normal_entry(rt_entry_node(Entry), Acc)
                          end
                  end,
                  LocalRT, get_rt_tree(RT));
  
          false -> LocalRT
      end,
      rt_loop:set_rt(State, NewRT);
  
  % lookup a random key chosen with a pdf:
  
negative.code: rt_get_node(NodeId, RT)  -> gb_trees:get(NodeId, get_rt_tree(RT)).
  
  % @doc Similar to rt_get_node/2, but doesn't crash when the id doesn't exist
  -spec rt_lookup_node(NodeId :: key(), RT :: rt()) -> {value, rt_entry()} | none.
  rt_lookup_node(NodeId, RT) -> gb_trees:lookup(NodeId, get_rt_tree(RT)).
  
  % @doc Get the id of a given node
  