http://benji3up2kxewkqfcq7buxk2xd6zwy3zggnurkrm3l4cvwy2iipvyyad.onion/mirrors/gmpdoc/Factorial-Algorithm.html
At first as many products as possible are accumulated in a
single register, generating a list of factors that fit in a machine word. This
list is then split into halves, and the product is computed recursively. Such splitting is more efficient than repeated Nx1 multiplies since it
forms big multiplies, allowing Karatsuba and higher algorithms to be used.