Abstract. Let X1, X2, . . . denote i.i.d. random bits, each taking the values 1 and 0 with respective probabilities p and 1 − p. A well-known theorem of Erdős and Rényi (1970) describes the length of the longest contiguous stretch, or “run,” of ones in X1, . . . , Xn for large values of n. Benjamini, Häggström, Peres, and Steif (2003, Theorem 1.4) demonstrated the existence of unusual times, pr...