Abstract: Boolean functions occupy a central role in discrete mathematics and theoretical computer science. For understanding their complexity, researchers developed various measures such as the degree, the sensitivity, and the block sensitivity. While nearly all these measures fit into a unified framework, sensitivity remained unfit for almost 30 years, producing the famous sensitivity conjecture. In this talk I will give an overview of the problem and I will present the recent resolution with a proof from the Book given by Dr. Hao Huang.