For any G(k) up arrow infinity, there exists a sequence {n(k)} of integers with 1 <= n(k+1) - n(k) <= G(k) such that the discrepancies of {n(k)x} obey the law of the iterated logarithm in the same way as uniform distributed i.i.d.