The Erdős–Herzog–Piranian (EHP) conjecture asserts that among all monic polynomials of degree n, the polynomial z^n – 1 uniquely maximizes the lemniscate length. Tao (2025) proved this for all sufficiently large n with a tower-exponential threshold. We computationally verify the conjecture for all n in {3,4,5,6,7,8,9,10,11,12} using dual independent implementations (Python/mpmath and Rust/inari) with IEEE 1788 interval arithmetic and certified branch-and-bound optimization. Both produce identica