We present a new design and prototype implementation of refinement types for Scala, enabling types to be refined with logical predicates and statically checked by the compiler. Unlike previous work, our system integrates qualified types directly into the Scala type checker and performs subtyping via a lightweight, compiler-internal solver based on E-Graphs and expression normalization. The implementation builds on earlier student work, which explored syntax design and runtime checking mechanisms.