Here's a quantitative example of its power. According to the ghci, run times for a simple prime factorization algorithm using a 6n + 1 seive to generate primes running in something like O(d^2) where d is the prime density:
239393226413 > 0.03 seconds
2393932264130 > 0.03 seconds
23939322641300 > 0.04 seconds
23939322641303 > 0.12 seconds
239393226413033 > 0.38 seconds
(written in haskell98)
