Sorry for not submitting a pull request, I'm working on a bignum library and I saw your implementation of multiplication so I just want to point out that you can simplify it by doing the multiply and the add in one loop into the result bn as follow:
typedef unsigned int u32;
typedef unsigned long long int u64;
void _bn_add_mul_u32(u32 *out, u32 *a, size_t a_len, u32 b)
{
in the Sterling approximation of factorial(n), we use an oracle based on the sw::universal::decimal type, which is an adaptive data type, to generate a reference value. However, the direct approximation of the factorial through a native floating point type yields different approximations.
factorial(40) calculated with double and decimal oracle rounded to double
815915283247897734345611269
Seen with @arnetheduck.
for uint128, stint properly generates add + adc (see status-im/nim-stint#10)
But for uint256+, the way carry is done will loop multiple time on the low half
https://github.com/status-im/nim-stint/blob/9993b9dca4a2dbf76bc432252ad4e8db944ae831/stint/private/uint_addsub.nim#L17-L29
Important for WASM codesize optimization.
Add a description, image, and links to the arbitrary-precision topic page so that developers can more easily learn about it.
To associate your repository with the arbitrary-precision topic, visit your repo's landing page and select "manage topics."
The package I want to suggest the idea to: AngouriMath.Interactive
The current logo includes Jupyter logo which is incorrect (since you can use that pkg in VSC Notebooks or in console etc.).
[Here](https://drive.google.com/file/d/1Y8TwuEjL0-YO2DCE6c_qs8TrhGJES_tL/view?usp=sharing