Is there any compile-time library (template metaprogramming) for arbitrary-precision arithmetic in C++? I need this to help with fixed-point arithmetic and binary scaling in my program for A...

I'm still learning typescript/javascript and now I'm trying to replace existing code where BigNumber is used with bigint/BigInt. Originally I thought these types are the same (because typeof(...

I'm aware of https://floating-point-gui.de/ and the fact that there are many libraries available to help with big numbers, but I've surprisingly been unable to find anything that handles more than ...

I am trying to call a custom function of a contract that expects a parameter of unit256. I'm calling this function from web3 with this value as parameter: 10000000000000000000 (10 with 18 zeros) As...

I need to deal with bignum calculation (addition and subtraction, but I treat subtraction as equivalent to signed addition) on RISC-V and the situation is a bit complicated. What I gather from half...

While I was working on smart contract using truffle, whenever request some number like account balance or address from the truffle console; I receive a BN object which looks like this: BN { negati...

I'd like to implement a big int class in C++ as a programming exercise—a class that can handle numbers bigger than a long int. I know that there are several open source implementations out th...

Does emacs have support for big numbers that don't fit in integers? If it does, how do I use them?

I'm working with large numbers that I can't have rounded off. Using Lua's standard math library, there seem to be no convenient way to preserve precision past some internal limit. I also see there ...

On a Windows 32-bit platform I have to read some numbers that, this was unexpected, can have values as big as 99,999,999,999, but no more. Trying to sprintf("%011d", $myNum) them outputs an overflo...

To use modular exponentiation as you would require when using the Fermat Primality Test with large numbers (100,000+), it calls for some very large calculations. When I multiply two large numbers ...

perl -Mbigrat -E'for (1..100) { $i += 1/3; say int($i), "\t", sprintf "%.55f", $i }' spams a lot of warnings: Argument "100/3" isn't numeric in addition (+) at …/site_perl/5.24.1/Math/BigRat.pm ...

I would like to loop through a range of values that have a BigUint type (from the num crate). How can I do this? I tried for i in 0..a {...} where a is a (borrowed) BigUint type. I got a error...

What are the meanings of the c, e, and s fields in the object produced by bignumber.js? For example: > new BigNumber('1234') { c: [1234], e: 3, s: 1 } > new BigNumber('12345678901234567890'...

I have a large and "unique" integer (actually a SHA1 hash). Note: While I'm talking here about SHA1 hashes, this is not a cryptography / security question! I'm not trying to break SHA1. Imagine a ...

I would like to add 2 arbitrarily sized integers in C++. How can I go about doing this?

I have a big integer below, as 'max'. How come the value dividing max by '27' is not equivalent to just completely omiting the first number '27'. Technically they should be equal, but in python the...

I have a 100 digit number stored as string. I want to divide this number with an integer less than 10. How do I efficiently divide a big integer stored as a string with an integer?

I tried a recursive factorial algorithm in Rust. I use this version of the compiler: rustc 1.12.0 (3191fbae9 2016-09-23) cargo 0.13.0-nightly (109cb7c 2016-08-19) Code: extern crate num_bigint;...

I'm trying to Hash a BigInteger/BigNum and I'm getting different results in Android/iOS. I need to get the same Hash result so that both the apps work as per the SRP protocol. On closer inspection ...

My understanding is that many public key cryptographic algorithms these days depend on large prime numbers to make up the keys, and it is the difficulty in factoring the product of two primes that ...

In Haskell, what is the difference between an Int and an Integer? Where is the answer documented?

I need to calculate result = (dividend * factor) / divisor where dividend: full range of int64_t values factor: either a full range of uint32_t values or as a special case 2^32 divisor: positiv...

I'm trying to use the Num module in OCaml (bignums and big fractions). Some things seem to be working, while others seem not to, and I'm not able to generate a single, complete example. For instanc...

I am trying to convert a string p_str representing a big integer to a BIGNUM p using the OpenSSL library. #include <stdio.h> #include <openssl/bn.h> int main () { /* I shortened the...