CVE-2025-62495
HighCVSS 8.8Exploitation Probability (EPSS)
Low risk38th percentile - higher than 38% of all known CVEs
Summary
An integer overflow vulnerability in the QuickJS regular expression engine (libregexp) due to inconsistent representation of the bytecode buffer size. A large or complex regular expression can cause the size to wrap around and lead to an out-of-bounds write.
Risk Assessment
It can lead to memory corruption, crash, or potential code execution in applications using QuickJS to process untrusted regular expressions.
Recommendation
Update QuickJS to a patched version. Restrict the ability for untrusted users to supply complex regular expressions.
Other vulnerabilities in QuickJS
See all- CVE-2026-88378Critical
QuickJS commit 04be24600 contains a heap out-of-bounds write condition in JS_ReadFunctionTag().
- CVE-2025-12745Medium
In QuickJS up to commit eb2c89087def1829ed99630cb14b549d7a98408c, the function js_array_buffer_slice in quickjs.c causes a buffer over-read. The attack requires local execution, and the exploit is publicly available.
- CVE-2025-62496High
A vulnerability in the QuickJS engine when creating a BigInt from a string with an excessively large number of digits. The bit count calculation causes an integer overflow, leading to an underestimated buffer size and a heap out-of-bounds write.
- CVE-2025-62494High
A type confusion vulnerability exists in the QuickJS engine's handling of the string addition (+) operation. During conversion of the right-hand operand, a callback can change the type of the left-hand operand, leading to a type mismatch and potential out-of-bounds memory access.
- CVE-2025-62493Medium
A vulnerability in the QuickJS engine's BigInt string conversion logic (js_bigint_to_string1) stems from an incorrect calculation of the required number of digits, leading to reading memory past the allocated BigInt structure. In certain edge cases, the conversion loop reads data spanning two limbs, causing an out-of-bounds read.
- CVE-2025-62492Medium
A floating-point arithmetic precision error exists in QuickJS's implementation of TypedArray.prototype.indexOf() when a negative fromIndex argument is supplied. When the value is extremely small (e.g., -1e-20), adding the array length can lose precision and yield an index equal to the length, causing an out-of-bounds read of one element. This may lead to information disclosure of adjacent memory.
- CVE-2025-62491High
A use-after-free exists in the QuickJS engine's standard library when iterating over the global list of unhandled rejected promises (rejected_promise_list). A malicious property getter on an Error object can call catch() on the same rejected promise, which removes and frees the current list entry while the loop continues using the freed pointer.
- CVE-2025-62490High
In QuickJS's js_print_object, printing an array fetches the length and then loops over it, but printing a value is not side-effect free. An attacker-defined callback can run during js_print_value and resize the array, causing a use-after-free; a second instance occurs when printing Map or Set objects whose records list can be modified during js_print_value.
Original NVD description (English source)
An integer overflow vulnerability exists in the QuickJS regular expression engine (libregexp) due to an inconsistent representation of the bytecode buffer size. * The regular expression bytecode is stored in a DynBuf structure, which correctly uses a $\text{size}\_\text{t}$ (an unsigned type, typically 64-bit) for its size member. * However, several functions, such as re_emit_op_u32 and other internal parsing routines, incorrectly cast or store this DynBuf $\text{size}\_\text{t}$ value into a signed int (typically 32-bit). * When a large or complex regular expression (such as those generated by a recursive pattern in a Proof-of-Concept) causes the bytecode size to exceed $2^{31}$ bytes (the maximum positive value for a signed 32-bit integer), the size value wraps around, resulting in a negative integer when stored in the int variable (Integer Overflow). * This negative value is subsequently used in offset calculations. For example, within functions like re_parse_disjunction, the negative size is used to compute an offset (pos) for patching a jump instruction. * This negative offset is then incorrectly added to the buffer pointer (s->byte\_code.buf + pos), leading to an out-of-bounds write on the first line of the snippet below: put_u32(s->byte_code.buf + pos, len);
Vulnerability data from NVD (NIST) · CISA KEV · EPSS