A competitive test for uniformity of monotone distributions

We propose a test that takes random samples drawn from a monotone distribution and de-cides whether or not the distribution is uni-form. The test is nearly optimal in that it uses at most O(n√log n) samples, where n is the number of samples that a genie who knew all but one bit about the underlying distribution would need for the same task. Conversely, we show that any such test would require Ω(n log n) samples for some distri-butions.