  We present a short and self-contained proof of a classical result due to
Bollob\'as (1990): in the random hypercube process, with high probability the
hitting time of connectedness equals the hitting time of having minimum degree
at least one.
