The two-step secant method is an efficient algorithm for solving nonlinear equations with n variables. We prove in this paper that the rootconvergence order of this method is not less than the unique positive root of equation t~(n+1)-t~n-2=0.