Findafactor

This is an attempt to "nitpick" small edge cases that might be responsible for occasionally returning `1` as a factor when the number to factor is _not_ prime. It might increase reliability, somewhat. (At least from this point, it's not clear if there even _is_ an edge case bug in this library, insofar as I can't identify one in something like only 800 lines of code in total besides wheel arrays. We can't blame the ABI without due diligence, but the ABI is not infallible. Another possibility is edge cases in the Boost `cpp_int` type.)

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.8.0...v1.8.1

sha1sum results:
fa367f1f353704e1b20834b378f48355e74ab54a FindAFactor-1.8.1-cp310-cp310-manylinux_2_35_x86_64.whl
7f44fd608c9a92a75277ef55d17b5ded422b00c0 FindAFactor-1.8.1-cp312-cp312-manylinux_2_39_x86_64.whl
dfc185ac97a9f771a470fd4aa22452543865a8a4 FindAFactor-1.8.1-cp38-cp38-manylinux_2_31_x86_64.whl
1bf178f37994329625fdb97629865206ea7713e4 findafactor-1.8.1.tar.gz

Gaussian elimination was previously not working at all. (This was discovered when eliminating use of `gcd()` in favor of a one-step modulo.) Note that the default settings now _disable_ `use_congruence_of_squares` by default. (The theory is still that `use_congruence_of_squares` has better asymptotic scaling, but only at cryptographically-relevant scales.)

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.7.2...v.1.8.0

sha1sum results:
0358e74a940684cd016bad371f9f99d461921b88 FindAFactor-1.8.0-cp310-cp310-manylinux_2_35_x86_64.whl
0fb8ecde627645d51d61596e5514a91f34f6702e FindAFactor-1.8.0-cp312-cp312-manylinux_2_39_x86_64.whl
a9934e0cb87b372526570f8e8eb7addc8cd563a2 FindAFactor-1.8.0-cp38-cp38-manylinux_2_31_x86_64.whl
58d83836a3d9c3550bf4cdf0f88636ae368eec1f findafactor-1.8.0.tar.gz

On the topic of Newton's GCD algorithm, we use the recursive form of the algorithm. This form of the function can have constant reference arguments, and it seems to be faster. Hence, it is highly motivated to use the recursive form of the function.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.7.1...v1.7.2

sha1sum results:
921e33a70cc86c8658e72c612bb96a81610b8fbd FindAFactor-1.7.2-cp310-cp310-manylinux_2_35_x86_64.whl
11b1d64bb870fb35d8ac5331d72ae05fe6e65f89 FindAFactor-1.7.2-cp312-cp312-manylinux_2_39_x86_64.whl
8446a986f7f0ab862179ab18e4a95856aace2d77 FindAFactor-1.7.2-cp38-cp38-manylinux_2_31_x86_64.whl
c071e4377f1f47635f04b4787a0eed9d73319cda findafactor-1.7.2.tar.gz

This release (only) makes a micro-optimization on use and implementation of Newtown's "greatest common divisor" ("GCD") method. Execution time benefits significantly in general, as a result.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.7.0...v1.7.1

sha1sum results:
94973046fb7b5acbd4c974a9b1f8e5ce28912306 FindAFactor-1.7.1-cp310-cp310-manylinux_2_35_x86_64.whl
15d97fc00cc8c629ecb7b98357bc1f67226a2917 FindAFactor-1.7.1-cp312-cp312-manylinux_2_39_x86_64.whl
ac19948af956282010a141e501bfed702594b539 FindAFactor-1.7.1-cp38-cp38-manylinux_2_31_x86_64.whl
5d8a6e44c7cc4f49976fae34f29b61c5dba68a6f findafactor-1.7.1.tar.gz

Default wheel factorization level (besides "gear" factorization) has been found to work better set to `7` for semiprimes of about 64 bits. Level `11` was already available, and this release also adds an optimized implementation for `13`. With two additional levels for optimized wheel factorization (besides "gear" factorization) beyond default, it is unlikely that HPC-scale factoring will ever benefit from higher than `13` at scale. (This is "future-proofing.")

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.6.6...v1.7.0

sha1sum results:
340523a7e332063f6405032a595d822ea36c70c3 FindAFactor-1.7.0-cp310-cp310-manylinux_2_35_x86_64.whl
89e085866d8d89d78026bb901df5741b5739861c FindAFactor-1.7.0-cp312-cp312-manylinux_2_39_x86_64.whl
251636037625460bde9e0ce8e72e6f45d29f72b0 FindAFactor-1.7.0-cp38-cp38-manylinux_2_31_x86_64.whl
0b745f282c52318995dcd89d90d28958f9f800fa findafactor-1.7.0.tar.gz

This release updates documentation. It also removes all usage of `uint64_t` in favor of `size_t`. (`size_t` should always be preferred unless there is specific need for 64 bits.)

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.6.4...v1.6.6

sha1sum results:
37cbe24445230d847930018bd31586c8254f4d64 FindAFactor-1.6.6-cp310-cp310-manylinux_2_35_x86_64.whl
6feedb865a2f8ce8e7b3c2146258d7795ebb467a FindAFactor-1.6.6-cp312-cp312-manylinux_2_39_x86_64.whl
6d49a21bdc24a1230279708c5eee9b2a7e75ce37 FindAFactor-1.6.6-cp38-cp38-manylinux_2_31_x86_64.whl
0da656ffc6ef9b478ca995e7642508a0f7c6b67d findafactor-1.6.6.tar.gz