Factoring integers much faster than the number field sieve
Factor large semiprimes about 160,000 times faster than the elliptic curve method or the number field sieve would on the same machine.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.