anchor.diff:  
   start() ->
       meck:new(peer),
  -    meck:expect(peer, start, fun(Id, Kbucket, Alpha) -> {self(), Id} end),
  -    K = 3,
  -    KbucketPid = kbucket:start(K, ?ID_LENGTH),
  +    meck:expect(peer, start, fun(Id, _, _) -> ?FAKE_PEER(Id) end),
  +    KbucketPid = kbucket:start(?K, ?ID_BIT_LENGTH),
       Peer = peer:start(?PEER_ID, KbucketPid, ?ALPHA),
       kbucket:set_peer(KbucketPid, Peer),
       {KbucketPid, Peer}.
  
positive.code: 
      [?_assertEqual([?TWO_PEER_2, ?TWO_PEER_1, ?ONE_PEER_1], ClosestContacts)].
  
  should_search_a_key_within_each_bucket_and_refresh_its_content({KbucketPid, Peer}) ->
      meck:expect(peer, iterative_find_peers, fun always_successful_iterative_find_peers/2),
  
      kbucket:refresh(KbucketPid),
  
negative.code: -include_lib("eunit/include/eunit.hrl").
  -include_lib("test_macro.hrl").
  
  -define(PEER_ID, 2#1101).
  -define(ALPHA, 3).
  
  -define(ID_BIT_LENGTH, 4).
  -define(K, 3).
  
  % build a fake peer with the specified ID and fixed (dummy) PID
  -define(FAKE_PEER(ID), {list_to_pid("<0.255.255>"), ID}).
  