anchor.diff:      {reply, ok, State2};
   handle_call({insert_object, BKey, RObj}, _From, State) ->
       VNode = State#state.vnode,
  -    IndexN = riak_core_util:get_index_n(BKey),
  +    IndexN = get_index_n(VNode, BKey),
       State2 = do_insert(IndexN, term_to_binary(BKey), VNode:hash_object(BKey, RObj), [], State),
       {reply, ok, State2};
   handle_call({delete, BKey}, _From, State) ->
  -    IndexN = riak_core_util:get_index_n(BKey),
  +    IndexN = get_index_n(State#state.vnode, BKey),
       State2 = do_delete(IndexN, term_to_binary(BKey), State),
       {reply, ok, State2};
   
  
positive.code: close_trees(State=#state{trees=Trees}) ->
      Trees2 = [{IdxN, hashtree:close(Tree)} || {IdxN, Tree} <- Trees],
      State#state{trees=Trees2}.
  
negative.code: fold_keys(Partition, Tree, VNode) ->
      Req = riak_core_util:make_fold_req(
              fun(BKey={Bucket,Key}, RObj, _) ->
                      IndexN = get_index_n(VNode, {Bucket, Key}),
                      insert(IndexN, term_to_binary(BKey), VNode:hash_object(BKey, RObj),
                             Tree, [if_missing]),
                      ok
  