This is a novelty mathematics crate that computes large factorials, k-factorials and (sequential) interval residue products up to (2^64-1)!. As well as faster-than-naive evaluation of there factorization and logarithms.
Note that fast_log and fast_factor have no guarantee of accuracy and are only useful for estimating near-incomputably large values.
The crate also permits simple conversion to num-bigint types by using the to_u32 conversion.
See Factorials and SIRPs for a further discussion of this crate and some of the algorithms used.