Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact, at most n) steps, while the Hilbert Basis Theorem shows that the process of finding generators for an ideal also terminates in finitely many steps. These results laid the foundations for the modern algebraic study of polynomials.Hilbert's results are not uniform in n: unsurprisingly, polynomials in n variables will exhibit greater complexity as n increases. However, an array of recent work has shown that in a certain regime-namely, that where the number of polynomials and their degrees are fixed-the complexity of polynomials (in various senses) remains bounded even as the number of variables goes to infinity. We refer to this as Stillman uniformity, since Stillman's conjecture provided the motivating example. The purpose of this paper is to give an exposition of Stillman uniformity, including the circle of ideas initiated by Ananyan and Hochster in their proof of Stillman's conjecture, the followup results that clarified and expanded on those ideas, and the implications for understanding polynomials in many variables. remains bounded, at least according to a wide variety of measures. We refer to this phenomenon as Stillman uniformity, as Stillman's conjecture is the model case. The purpose of this paper is to give an exposition of Stillman uniformity and some of the work around it.Our account is focused on four closely related threads of work, which we now introduce and briefly summarize.I. Stillman's conjecture. The first indication, as far as we are aware, of the general phenomenon of Stillman uniformity can be found in a conjecture posed by Michael Stillman around the year 2000. 1 Recall that the projective dimension of a module is the minimal length of a projective resolution (see §7 for a review). This is a fundamental, albeit rather technical, invariant. The Hilbert Syzygy Theorem is exactly the statement that every module over an n-variable polynomial ring has projective dimension at most n. Stillman's conjecture refines this theorem: it asserts that the projective dimension of an ideal in an n-variable polynomial ring generated by r homogeneous polynomials 2 of degrees ≤ d can be bounded in terms of r and d, but is independent of the number n of variables. In other words, in this particular regime, the Hilbert Syzygy Theorem holds uniformly in n. Stillman's conjecture was proved by Ananyan and Hochster [2] in 2016, and has subsequently been reproven by us [26] and Draisma, Lasoń, and Leykin [20].