This paper studies uniformly distributed size n circuits (labelled acyclic graphs) consisting of binary gates and a constant number of inpurts. We show that their depth is asymptotically 2e ln n in probability. To this end, we use coupling to bound circuit depth from above and below by those of two alternative processes, and then establishing the result by embedding them in suitable continuous time branching processes.