There are other usecases than making a constant

src/generate.rs

@@ -237,7 +237,7 @@ pub const fn primes_lt<const N: usize, const MEM: usize>(
 }
 
 /// Generate arrays of large prime numbers without having to store all primes
-/// from 2 and up in the constant, and thus the binary.
+/// from 2 and up in the result, and thus potentially the binary.
 /// 
 /// Calls [`primes_geq`] or [`primes_lt`], and automatically computes the memory requirement of the sieve.
 ///

src/sieve.rs

@@ -392,7 +392,7 @@ pub const fn sieve_geq<const N: usize, const MEM: usize>(
 }
 
 /// Generate arrays of the prime status of large numbers without having to store the prime status
-/// of every single integer smaller than the target in the resulting constant, and thus the binary.
+/// of every single integer smaller than the target in the result, and thus potentially the binary.
 /// 
 /// Calls [`sieve_geq`] or [`sieve_lt`], and automatically computes the memory requirement of the sieve.
 ///