A vulnerability exists in the QuickJS engines BigInt string parsing logic (js_bigint_from_string) when attempting to create a BigInt from a string with an excessively large number of digits.
The function calculates the necessary number of bits (n_bits) required to store the BigInt using the formula:
$$text{n_bits} = (text{n_digits} times 27 + 7) / 8 quad (text{for radix 10})$$
For large input strings (e.g., $79,536,432$ digits or more for base 10), the intermediate calculation $(text{n_digits} times 27 + 7)$ exceeds the maximum value of a standard signed 32-bit integer, resulting in an Integer Overflow.
The resulting n_bits value becomes unexpectedly small or even negative due to this wrap-around.
This flawed n_bits is then used to compute n_limbs, the number of memory limbs needed for the BigInt object. Since n_bits is too small, the calculated n_limbs is also significantly underestimated.
The function proceeds to allocate a JSBigInt object using this underestimated n_limbs.
When the function later attempts to write the actual BigInt data into the allocated object, the small buffer size is quickly exceeded, leading to a Heap Out-of-Bounds Write as data is written past the end of the allocated r->tab array.
The product performs a calculation that can produce an integer overflow or wraparound when the logic assumes that the resulting value will always be larger than the original value. This occurs when an integer value is incremented to a value that is too large to store in the associated representation. When this occurs, the value may become a very small or negative number.