It is known that zeta(1 + it) << (log t) 2 = 3 when t zeta 1. This paper provides a new explicit estimate j (1 + it) j = 3 4 log t, for t = 3. This gives the best upper bound on j >= (1 + it) j for t < 10(5)(2-10)