We consider the Constrained-degree percolation model with random constraints on the square lattice and prove a non-trivial phase transition. In this model, each vertex has an independently distributed random constraint j ∈ {0, 1, 2, 3} with probability ρ j . Each edge e tries to open at a random uniform time U e , independently of all other edges. It succeeds if at time U e both its end-vertices have degrees strictly smaller than their respectively attached constraints. We show that this model undergoes a non-trivial phase transition when ρ 3 is sufficiently large. The proof consists of a decoupling inequality, the continuity of the probability for local events, together with a coarse-graining argument.