Pollard's Rho Factorization with Review-Driven Refinement

Execute the delivered factorisation module on fresh primes, composites, high multiplicities and forced timeout paths.

All 12 cases preserved factor products and multiplicities, including 1,100 factors of two. Forced exhaustion raised ValueError rather than claiming a composite was prime. A fresh local benchmark compared the unchanged slow baseline with Pollard rho; the measured speedup is environment-specific. Probabilistic results above 64 bits remain probabilistic.