How large can the multiplier step be in the classical two-block alternating direction method of multipliers (ADMM)? We keep the penalty fixed and use the usual primal updates. We consider finite-dimensional problems with closed proper convex objectives. We assume that a Karush-Kuhn-Tucker point exists and that each block subproblem attains its minimum at every step. Under these assumptions, the constraint images and the multiplier converge for a range of factors that extends beyond the golden ratio. The constraint matrices may be rank deficient. For larger steps, we construct two fixed compact polytopes and give an explicit threshold below two. The polytopes admit an infeasible periodic orbit for every factor at or above this threshold. At that threshold, ADMM can cycle even for smooth strongly convex objectives. This gives a negative answer to Glowinski's question about the full interval from zero to two. A different pair of piecewise-quadratic objectives gives geometrically growing residuals. For the general convex class, we locate the endpoint of the uniform convergence interval near 1.88688256. A convergence certificate on the unit circle gives the lower bound, while a separate periodic orbit gives the upper bound. Exact arithmetic verifies that the two bounds differ by less than 0.000000174.