A vulnerability exists in the QuickJS engine's BigInt string parsing logic (jsbigintfromstring) when attempting to create a BigInt from a string with an excessively large number of digits. The function calculates the necessary number of bits (nbits) 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 nbits value becomes unexpectedly small or even negative due to this wrap-around. * This flawed nbits is then used to compute nlimbs, the number of memory "limbs" needed for the BigInt object. Since nbits is too small, the calculated nlimbs is also significantly underestimated. * The function proceeds to allocate a JSBigInt object using this underestimated nlimbs. * 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.