The existence conjecture on combinatorial designs dates back to the 19th century and was recently solved by Keevash. We present a new proof based on iterative absorption. The aim of the talk is to sketch the method and to present some of the crucial steps of the proof.