In computing, NaN (//), standing for Not a Number, is a member of a numeric data type that can be interpreted as a value that is undefined or unrepresentable, especially in floating-point arithmetic. Systematic use of NaNs was introduced by the IEEE 754 floating-point standard in 1985, along with the representation of other non-finite quantities such as infinities.
In mathematics, zero divided by zero is undefined[a] and is therefore represented by NaN in computing systems. The square root of a negative number is not a real number, and is therefore also represented by NaN in compliant computing systems. NaNs may also be used to represent missing values in computations.
Two separate kinds of NaNs are provided, termed quiet NaNs and signaling NaNs. Quiet NaNs are used to propagate errors resulting from invalid operations or values. Signaling NaNs can support advanced features such as mixing numerical and symbolic computation or other extensions to basic floating-point arithmetic.
In floating-point calculations, NaN is not the same as infinity, although both are typically handled as special cases in floating-point representations of real numbers as well as in floating-point operations. An invalid operation is also not the same as an arithmetic overflow (which might return an infinity) or an arithmetic underflow (which would return the smallest normal number, a subnormal number, or zero).
IEEE 754 NaNs are encoded with the exponent field filled with ones (like infinity values), and some non-zero number in the significand field (to make them distinct from infinity values); this allows the definition of multiple distinct NaN values, depending on which bits are set in the significand field, but also on the value of the leading sign bit (but applications are not required to provide distinct semantics for those distinct NaN values).
For example, a bit-wise IEEE 754 single precision (32-bit) NaN would be
s111 1111 1xxx xxxx xxxx xxxx xxxx xxxx
where s is the sign (most often ignored in applications) and the x sequence represents a non-zero number (the value zero encodes infinities). The most significant bit from x is used to determine the type of NaN: "quiet NaN" or "signaling NaN". The remaining bits encode a payload (most often ignored in applications).
Floating-point operations other than ordered comparisons normally propagate a quiet NaN (qNaN). Most floating-point operations on a signaling NaN (sNaN) signal the invalid operation exception; the default exception action is then the same as for qNaN operands and they produce a qNaN if producing a floating-point result.
The propagation of quiet NaNs through arithmetic operations allows errors to be detected at the end of a sequence of operations without extensive testing during intermediate stages. For example, if one starts with a NaN and adds 1 five times in a row, each addition results in a NaN, but there is no need to check each calculation because one can just note that the final result is NaN. However, depending on the language and the function, NaNs can silently be removed from a chain of calculations where one calculation in the chain would give a constant result for all other floating-point values. For example, the calculation x0 may produce the result 1, even where x is NaN, so checking only the final result would obscure the fact that a calculation before the x0 resulted in a NaN. In general, then, a later test for a set invalid flag is needed to detect all cases where NaNs are introduced (see Function definition below for further details).
In section 6.2 of the old IEEE 754-2008 standard, there are two anomalous functions (the
minNum functions, which return the maximum and the minimum, respectively, of two operands that are expected to be numbers) that favor numbers — if just one of the operands is a NaN then the value of the other operand is returned. The IEEE 754-2019 revision has replaced these functions as they are not associative (when a signaling NaN appears in an operand).
Comparison with NaN
Comparisons are specified by the IEEE 754 standard to take into account possible NaN operands. When comparing two real numbers, or extended real numbers (as in the IEEE 754 floating-point formats), the first number may be either less than, equal to, or greater than the second number. This gives three possible relations. But when at least one operand of a comparison is NaN, this trichotomy does not apply, and a fourth relation is needed: unordered. In particular, two NaN values compare as unordered, not as equal.
As specified, the predicates associated with the <, ≤, =, ≥, > mathematical symbols (or equivalent notation in programming languages) return false on an unordered relation. So, for instance, NOT(x < y) is not logically equivalent to x ≥ y: on unordered, i.e. when x or y is NaN, the former returns true while the latter returns false. However, ≠ is defined as the negation of =, thus it returns true on unordered.
|Comparison||NaN ≥ x||NaN ≤ x||NaN > x||NaN < x||NaN = x||NaN ≠ x|
From these rules, x ≠ x or x = x can be used to test whether x is NaN or non-NaN.
The comparison predicates are either signaling or non-signaling on quiet NaN operands; the signaling versions signal the invalid-operation exception for such comparisons (i.e., by default, this just sets the corresponding status flag in addition to the behavior of the non-signaling versions). The equality and inequality predicates are non-signaling. The other standard comparison predicates associated with the above mathematical symbols are all signaling if they receive a NaN operand. The standard also provides non-signaling versions of these other predicates. The predicate
isNaN(x) determines whether a value is a NaN and never signals an exception, even if x is a signaling NaN.
Operations generating NaN
There are three kinds of operations that can return NaN:
- Most operations with at least one NaN operand.
- Indeterminate forms:
- The divisions (±0) / (±0) and (±∞) / (±∞).
- The multiplications (±0) × (±∞) and (±∞) × (±0).
- Remainder x % y when x is an infinity or y is zero.
- The additions (+∞) + (−∞), (−∞) + (+∞) and equivalent subtractions (+∞) − (+∞) and (−∞) − (−∞).
- The standard has alternative functions for powers:
- The standard
powfunction and the integer exponent
pownfunction define 00, 1∞, and ∞0 as 1.
powrfunction defines all three indeterminate forms as invalid operations and so returns NaN.
- The standard
- Real operations with complex results, for example:
NaNs may also be explicitly assigned to variables, typically as a representation for missing values. Prior to the IEEE standard, programmers often used a special value (such as −99999999) to represent undefined or missing values, but there was no guarantee that they would be handled consistently or correctly.
NaNs are not necessarily generated in all the above cases. If an operation can produce an exception condition and traps are not masked then the operation will cause a trap instead. If an operand is a quiet NaN, and there is also no signaling NaN operand, then there is no exception condition and the result is a quiet NaN. Explicit assignments will not cause an exception even for signaling NaNs.
Quiet NaNs, or qNaNs, do not raise any additional exceptions as they propagate through most operations. The exceptions are where the NaN cannot simply be passed through unchanged to the output, such as in format conversions or certain comparison operations.
Signaling NaNs, or sNaNs, are special forms of a NaN that, when consumed by most operations, should raise the invalid operation exception and then, if appropriate, be "quieted" into a qNaN that may then propagate. They were introduced in IEEE 754. There have been several ideas for how these might be used:
- Filling uninitialized memory with signaling NaNs would produce the invalid operation exception if the data is used before it is initialized
- Using an sNaN as a placeholder for a more complicated object, such as:
When encountered, a trap handler could decode the sNaN and return an index to the computed result. In practice, this approach is faced with many complications. The treatment of the sign bit of NaNs for some simple operations (such as absolute value) is different from that for arithmetic operations. Traps are not required by the standard. There are other approaches to this sort of problem that would be more portable.
IEEE 754-2019 recommends the operations getPayload, setPayload, and setPayloadSignaling be implemented, standardizing the access to payloads to streamline application use. According to the IEEE 754-2019 background document, this recommendation should be interpreted as "required for new implementations, with reservation for backward compatibility".
There are differences of opinion about the proper definition for the result of a numeric function that receives a quiet NaN as input. One view is that the NaN should propagate to the output of the function in all cases to propagate the indication of an error. Another view, and the one taken by the ISO C99 and IEEE 754-2008 standards in general, is that if the function has multiple arguments and the output is uniquely determined by all the non-NaN inputs (including infinity), then that value should be the result. Thus for example the value returned by
hypot(±∞, qNaN) and
hypot(qNaN, ±∞) is +∞.
The problem is particularly acute for the exponentiation function
pow(x, y) = xy. The expressions 00, ∞0 and 1∞ are considered indeterminate forms when they occur as limits (just like ∞ × 0), and the question of whether zero to the zero power should be defined as 1 has divided opinion.
If the output is considered as undefined when a parameter is undefined, then
pow(1, qNaN) should produce a qNaN. However, math libraries have typically returned 1 for
pow(1, y) for any real number y, and even when y is an infinity. Similarly, they produce 1 for
pow(x, 0) even when x is 0 or an infinity.  The 2008 version of the IEEE 754 standard says that
pow(1, qNaN) and
pow(qNaN, 0) should both return 1 since they return 1 whatever else is used instead of quiet NaN. Moreover, ISO C99, and later IEEE 754-2008, chose to specify
pow(−1, ±∞) = 1 instead of qNaN; the reason of this choice is given in the C rationale: "Generally, C99 eschews a NaN result where a numerical value is useful. ... The result of
pow(−2, ∞) is +∞, because all large positive floating-point values are even integers."
To satisfy those wishing a more strict interpretation of how the power function should act, the 2008 standard defines two additional power functions:
pown(x, n), where the exponent must be an integer, and
powr(x, y), which returns a NaN whenever a parameter is a NaN or the exponentiation would give an indeterminate form.
Most fixed-size integer formats cannot explicitly indicate invalid data. In such a case, when converting NaN to an integer type, the IEEE 754 standard requires that an invalid operation exception be signaled. For example in Java, such operations throw instances of
java.lang.ArithmeticException. In C, they lead to undefined behavior, but if annex F is supported, the operation yields an "invalid" floating-point exception (as required by the IEEE standard) and an unspecified value.
> perl -mMath::BigInt -e "print Math::BigInt->new('foo')" NaN
Different operating systems and programming languages may have different string representations of NaN.
nan (C, C++ output) NaN (ECMAScript, Rust, C#) NaN% NAN (Rust, C, C++ source code) NaNQ (IBM XL and AIX: Fortran, C++ proposal n2290) NaNS (ditto) qNaN sNaN 1.#SNAN (Excel) 1.#QNAN (Excel) -1.#IND (Excel) +nan.0 (Scheme)
Since, in practice, encoded NaNs have a sign, a quiet/signaling bit and optional 'diagnostic information' (sometimes called a payload), these will occasionally be found in string representations of NaNs, too. Some examples are:
- For the C and C++ languages, the sign bit is always shown by the standard-library functions (e.g.
-nan) when present. There is no standard display of the payload nor of the signaling status, but a quiet NaN value of a specific payload may either be constructed by providing the string
nan(char-sequence)to a number-parsing function (e.g.
strtod) or by providing the char-sequence string to
nans()for sNaN), both interpreted in an implementation-defined manner.
- GCC and LLVM provides built-in implementations of
nans(). They parse the char-sequence as an integer for
strtoull(or a differently-sized equivalent) with its detection of integer bases.
- The GNU C Library's float-parser uses the char-sequence string in "some unspecified fashion". In practice, this parsing has been equivalent to GCC/LLVM's for up to 64 bits of payload.
- Newlib does not implement
strtod()accepts a hexadecimal format without prefix.
- musl does not implement any payload parsing.
- GCC and LLVM provides built-in implementations of
Not all languages admit the existence of multiple NaNs. For example, ECMAScript only uses one NaN value throughout.
In IEEE 754 standard-conforming floating-point storage formats, NaNs are identified by specific, pre-defined bit patterns unique to NaNs. The sign bit does not matter. Binary format NaNs are represented with the exponential field filled with ones (like infinity values), and some non-zero number in the significand field (to make them distinct from infinity values). The original IEEE 754 standard from 1985 (IEEE 754-1985) only described binary floating-point formats, and did not specify how the signaling/quiet state was to be tagged. In practice, the most significant bit of the significand field determined whether a NaN is signaling or quiet. Two different implementations, with reversed meanings, resulted:
- most processors (including those of the Intel and AMD's x86 family, the Motorola 68000 family, the AIM PowerPC family, the ARM family, the Sun SPARC family, and optionally new MIPS processors) set the signaling/quiet bit to non-zero if the NaN is quiet, and to zero if the NaN is signaling. Thus, on these processors, the bit represents an
- in NaNs generated by the PA-RISC and old MIPS processors, the signaling/quiet bit is zero if the NaN is quiet, and non-zero if the NaN is signaling. Thus, on these processors, the bit represents an
The former choice has been preferred as it allows the implementation to quiet a signaling NaN by just setting the signaling/quiet bit to 1. The reverse is not possible with the latter choice because setting the signaling/quiet bit to 0 could yield an infinity.
The 2008 and 2019 revisions of the IEEE 754 standard make formal requirements and recommendations for the encoding of the signaling/quiet state.
- For binary interchange formats, the most significant bit of the significand field is exclusively used to distinguish between quiet and signaling NaNs. Moreover, it should be an
is_quietflag. That is, this bit is non-zero if the NaN is quiet, and zero if the NaN is signaling.
- For decimal interchange formats, whether binary or decimal encoded, a NaN is identified by having the top five bits of the combination field after the sign bit set to ones. The sixth bit of the field is the
is_signalingflag. That is, this bit is zero if the NaN is quiet, and non-zero if the NaN is signaling.
For IEEE 754-2008 conformance, the meaning of the signaling/quiet bit in recent MIPS processors is now configurable via the NAN2008 field of the FCSR register. This support is optional in MIPS Release 3 and required in Release 5.
The state/value of the remaining bits of the significand field are not defined by the standard. This value is called the 'payload' of the NaN. If an operation has a single NaN input and propagates it to the output, the result NaN's payload should be that of the input NaN (this is not always possible for binary formats when the signaling/quiet state is encoded by an
is_signaling flag, as explained above). If there are multiple NaN inputs, the result NaN's payload should be from one of the input NaNs; the standard does not specify which.
- Bowman, Kenneth (2006). An Introduction to Programming with IDL: Interactive Data Language. Academic Press. p. 26. ISBN 978-0-12-088559-6.
- Press, William H.; Teukolsky, Saul A.; Vetterling, William T.; Flannery, Brian P. (2007). Numerical Recipes: The Art of Scientific Computing. Cambridge University Press. p. 34. ISBN 978-0-521-88068-8.
- William Kahan (1 October 1997). "Lecture Notes on the Status of IEEE Standard 754 for Binary Floating-Point Arithmetic" (PDF).
- David H.C. Chen (21 February 2017). "The Removal/Demotion of
MaxNumOperations from IEEE 754™-2018" (PDF). Retrieved 6 May 2019.
- "754R Minutes". 19 May 2017. Retrieved 25 June 2017.
- IEEE 754 2019, §5.11
- David Goldberg (1991). "What Every Computer Scientist Should Know About Floating-Point".
- "Intel 64 and IA-32 Architectures Software Developer's Manual Volume 1: Basic Architecture". April 2008. pp. 118–125, 266–267, 334–335.
- IEEE 754 2019, §9.7
- "Background discussion for the new Payload functions".
- "IEEE Standard for Floating-Point Arithmetic revision due in 2019" (PDF).
- "Rationale for International Standard—Programming Languages—C, Revision 5.10" (PDF). April 2003. p. 180.
- "ArithmeticException (Java Platform SE 8)". docs.oracle.com.
Math::BigInt". perldoc.perl.org. Retrieved 12 June 2015.
- "Parsing of Floats (The GNU C Library)". www.gnu.org. Retrieved 9 September 2021.
If chars… are provided, they are used in some unspecified fashion to select a particular representation of NaN (there can be several).
- "Re: (long) sNaNs not what they could be..." grouper.ieee.org. 15 October 2010. Retrieved 5 November 2020.
- IEEE 754 2019, §3.4
- IEEE 754 2019, §6.2.1
- IEEE 754 2019, §3.5.2
- "MIPS® Architecture For Programmers – Volume I-A: Introduction to the MIPS64® Architecture" (PDF). MIPS Technologies, Inc. 20 November 2013. p. 79. Retrieved 27 September 2017.
- IEEE Computer Society (29 August 2008). IEEE Standard for Floating-Point Arithmetic. IEEE STD 754-2008. IEEE. pp. 1–70. doi:10.1109/IEEESTD.2008.4610935. ISBN 978-0-7381-5753-5. IEEE Std 754-2008.
- IEEE Computer Society (22 July 2019). IEEE Standard for Floating-Point Arithmetic. IEEE STD 754-2019. IEEE. pp. 1–84. doi:10.1109/IEEESTD.2019.8766229. ISBN 978-1-5044-5924-2. IEEE Std 754-2019.
- Not a Number, foldoc.org
- IEEE 754-2008 Standard for Floating-Point Arithmetic (subscription required)
- IEEE 754-2019 Standard for Floating-Point Arithmetic (subscription required)