doc: mention 2025 speedup on large composites

diff --git a/NEWS b/NEWS
index 17a43b064967cf0f7d4905c6baf0ef52fe929fef..0b2be7116f700bb9b0393924cfcc9c08ec56913a 100644 (file)
--- a/NEWS
+++ b/NEWS
@@ -4,7 +4,8 @@ GNU coreutils NEWS                                    -*- outline -*-
 
 ** Changes in behavior
 
-  'factor' is now much faster at identifying large prime numbers.
+  'factor' is now much faster at identifying large prime numbers,
+  and significantly faster on composite numbers greater than 2^128.
 
 ** Bug fixes
 

diff --git a/src/factor.c b/src/factor.c
index 44c0deb6a50181f2a549a4c66576c488220600d8..b3af25b5f16f913afd4f5271ad639b545df8a7f3 100644 (file)
--- a/src/factor.c
+++ b/src/factor.c
@@ -19,7 +19,8 @@
    Arbitrary-precision code adapted by James Youngman from Torbjörn
    Granlund's factorize.c, from GNU MP version 4.2.2.
    In 2012, the core was rewritten by Torbjörn Granlund and Niels Möller.
-   In 2025, Torbjörn Granlund and Paul Eggert sped up primality checking.
+   In 2025, Torbjörn Granlund and Paul Eggert sped up primality checking,
+   and improved performance on composite numbers greater than 2^128.
    Contains code from GNU MP.  */
 
 /* Efficiently factor numbers that fit in one or two words (word = mp_limb_t),