anchor.diff:                  R0 = riak_core_ring:fresh(Partitions, Node0),
                   Rfinal = lists:foldl(fun(Node, Racc) ->
                                                Racc0 = riak_core_ring:add_member(Node0, Racc, Node),
  -                                             default_choose_claim(Racc0, Node)
  +                                             choose_claim_v1(Racc0, Node)
                                        end, R0, RestNodes),
   
                   Preflists = riak_core_ring:all_preflists(Rfinal, Nval),
  
positive.code: %% @spec default_choose_claim(riak_core_ring()) -> riak_core_ring()
  %% @doc Choose a partition at random.
  default_choose_claim(Ring) ->
      default_choose_claim(Ring, node()).
  
  default_choose_claim(Ring0, Node) ->
      Ring = riak_core_ring:upgrade(Ring0),
      TargetN = app_helper:get_env(riak_core, target_n_val),
      case meets_target_n(Ring, TargetN) of
  
negative.code: get_expected_partitions(Ring, Node) ->
      riak_core_ring:num_partitions(Ring) div get_member_count(Ring, Node).
  
  wants_claim_v1(Ring0, Node) ->
      Ring = riak_core_ring:upgrade(Ring0),
      %% Calculate the expected # of partitions for a perfectly balanced ring. Use
      %% this expectation to determine the relative balance of the ring. If the
  