The MinRank Problem is the computational problem of finding a low rank linear combination of a set of matrices. There are several cryptographic attacks that can be reduced to MinRank. During this talk I will introduce a recent approach to the problem: the Support Minors Modeling. We will discuss the modeling itself and the heuristics that the authors made in order to estimate the complexity.