It means hash collisions occur much sooner than brute-force estimates suggest
A hash with n-bit output seems to need 2^n tries to find a collision. The birthday paradox cuts that to about 2^(n/2). For a 128-bit hash, the search drops from 10^38 to 10^19 — suddenly within reach of modern hardware.
