TL;DR: We simplify and unify various constructions of the Johnson-Lindenstrauss (JL) lemma, including spherical and sub-Gaussian models, and provide the first rigorous proof for spherical construction’s effectiveness. Our work extends the Hanson-Wright inequality and solidifies the JL lemma’s theoretical foundation, enhancing its practical applications in computational algorithms.