We show that there is a generalized high degree which is a minimal cover of a minimal degree. This is the highest jump class one can reach by finite iterations of minimality. This result also answers an old question by Lerman.