Nisan–Szegedy's sensitivity conjecture for Boolean functions

Let $f$ be a Boolean function. Write $s(f)$ for its sensitivity and $bs(f)$ for its block sensitivity, the maximum number of pairwise disjoint blocks of input variables whose simultaneous flips change the value of $f$.

Nisan–Szegedy's sensitivity conjecture. There exists an absolute constant $C>0$ such that, for every Boolean function $f$,

$$bs(f)\leq s(f)^C.$$

The conjecture asks whether sensitivity is polynomially related to the other standard complexity measures of Boolean functions. The supplied context says that Hao's result directly resolves it, so the conjecture is solved.