# Decimal128 floating-point format

In computing, decimal128 is a decimal floating-point number format that occupies 128 bits in memory. Formally introduced in IEEE 754-2008, it is intended for applications where it is necessary to emulate decimal rounding exactly, such as financial and tax computations.

## Format

The decimal128 format supports 34 decimal digits of significand and an exponent range of −6143 to +6144, i.e. ±0.000000000000000000000000000000000×10^$^{−6143}$ to ±9.999999999999999999999999999999999×10^$^{6144}$. Because the significand is not normalized, most values with less than 34 significant digits have multiple possible representations; 1 × 10$^2$=0.1 × 10$^3$=0.01 × 10$^4$, etc. This set of representations for a same value is called a cohort. Zero has 12288 possible representations (24576 if both signed zeros are included, in two different cohorts).

## Encoding of decimal128 values

| Sign | Combination | Significand continuation |
| 1 bit | 17 bits | 110 bits |
| s | mmmmmmmmmmmmmmmmm | cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc |
The IEEE 754 standard allows two alternative encodings for decimal128 values:
* The binary encoding, based on binary integer decimal (BID): The significand is encoded as an unsigned integer written in binary.
* The decimal encoding, based on densely packed decimal (DPD): The significand is encoded as an unsigned integer written in decimal, with groups of 3 digits packed together in a declet and a special rule for the most significant digit.
This standard does not specify how to signify which encoding is used, for instance in a situation where decimal128 values are communicated between systems.
Both alternatives provide exactly the same set of representable numbers: 34 digits of significand and 3 × 2$^{12}$ = 12288 possible exponent values.
In both cases, the most significant 4 bits of the significand (which actually only have 10 possible values) are combined with the most significant 2 bits of the exponent (3 possible values) to use 30 of the 32 possible values of 5 bits in the combination field. The remaining combinations encode infinities and NaNs.
| Combination field | Exponent | Significand Msbits | Other |
| 00mmmmmmmmmmmmmmm | 00xxxxxxxxxxxx | 0ccc | — |
| 01mmmmmmmmmmmmmmm | 01xxxxxxxxxxxx | 0ccc | — |
| 10mmmmmmmmmmmmmmm | 10xxxxxxxxxxxx | 0ccc | — |
| 1100mmmmmmmmmmmmm | 00xxxxxxxxxxxx | 100c | — |
| 1101mmmmmmmmmmmmm | 01xxxxxxxxxxxx | 100c | — |
| 1110mmmmmmmmmmmmm | 10xxxxxxxxxxxx | 100c | — |
| 11110mmmmmmmmmmmm | — | — | ±Infinity |
| 11111mmmmmmmmmmmm | — | — | NaN. Sign bit ignored. Sixth bit of the combination field determines if the NaN is signaling. |
In the case of Infinity and NaN, all other bits of the encoding are ignored. Thus, it is possible to initialize an array to Infinities or NaNs by filling it with a single byte value.

### Binary integer significand field

This format uses a binary significand from 0 to 10$^{34}$ − 1 = 9999999999999999999999999999999999 = 1ED09BEAD87C0378D8E63FFFFFFFF$_{16}$ = 011110110100001001101111101010110110000111110000000011011110001101100011100110001111111111111111111111111111111111$_2$. The encoding can represent binary significands up to 10 × 2$^{110}$ − 1 = 12980742146337069071326240823050239 but values larger than 10$^{34}$ − 1 are illegal (and the standard requires implementations to treat them as 0, if encountered on input).
As described above, the encoding varies depending on whether the most significant 4 bits of the significand are in the range 0 to 7 (0000$_2$ to 0111$_2$), or higher (1000$_2$ or 1001$_2$).
If the 2 bits after the sign bit are "00", "01", or "10", then the exponent field consists of the 14 bits following the sign bit, and the significand is the remaining 113 bits, with an implicit leading 0 bit:
s 00eeeeeeeeeeee (0)ttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt s 01eeeeeeeeeeee (0)ttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt s 10eeeeeeeeeeee (0)ttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt
This includes subnormal numbers where the leading significand digit is 0.
If the 2 bits after the sign bit are "11", then the 14-bit exponent field is shifted 2 bits to the right (after both the sign bit and the "11" bits thereafter), and the represented significand is in the remaining 111 bits. In this case there is an implicit (that is, not stored) leading 3-bit sequence "100" in the true significand.
s 1100eeeeeeeeeeee (100)t tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt s 1101eeeeeeeeeeee (100)t tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt s 1110eeeeeeeeeeee (100)t tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt tttttttttt
The "11" 2-bit sequence after the sign bit indicates that there is an implicit "100" 3-bit prefix to the significand. Compare having an implicit 1 in the significand of normal values for the binary formats. The "00", "01", or "10" bits are part of the exponent field.
For the decimal128 format, all of these significands are out of the valid range (they begin with 2$^{113}$ > 1.038 × 10$^{34}$), and are thus decoded as zero, but the pattern is same as decimal32 and decimal64.
In the above cases, the value represented is
    (−1)$^{sign}$ × 10$^{exponent−6176}$ × significand
If the four bits after the sign bit are "1111" then the value is an infinity or a NaN, as described above:

### Densely packed decimal significand field

In this version, the significand is stored as a series of decimal digits. The leading digit is between 0 and 9 (3 or 4 binary bits), and the rest of the significand uses the densely packed decimal (DPD) encoding.
The leading 2 bits of the exponent and the leading digit (3 or 4 bits) of the significand are combined into the five bits that follow the sign bit.
This twelve bits after that are the exponent continuation field, providing the less-significant bits of the exponent.
The last 110 bits are the significand continuation field, consisting of eleven 10-bit declets. Each declet encodes three decimal digits using the DPD encoding.
If the first two bits after the sign bit are "00", "01", or "10", then those are the leading bits of the exponent, and the three bits after that are interpreted as the leading decimal digit (0 to 7):
s 00 TTT (00)eeeeeeeeeeee (0TTT)[tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt] s 01 TTT (01)eeeeeeeeeeee (0TTT)[tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt] s 10 TTT (10)eeeeeeeeeeee (0TTT)[tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt]
If the first two bits after the sign bit are "11", then the second two bits are the leading bits of the exponent, and the last bit is prefixed with "100" to form the leading decimal digit (8 or 9):
s 1100 T (00)eeeeeeeeeeee (100T)[tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt] s 1101 T (01)eeeeeeeeeeee (100T)[tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt] s 1110 T (10)eeeeeeeeeeee (100T)[tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt][tttttttttt]
The remaining two combinations (11110 and 11111) of the 5-bit field are used to represent ±infinity and NaNs, respectively.
The DPD/3BCD transcoding for the declets is given by the following table. b9...b0 are the bits of the DPD, and d2...d0 are the three BCD digits.
Densely packed decimal encoding rules :
| DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | DPD encoded value | Decimal digits | Decimal digits | Decimal digits | Decimal digits | Decimal digits | Decimal digits |
| Code space (1024 states) | b9 | b8 | b7 | b6 | b5 | b4 | b3 | b2 | b1 | b0 | d2 | d1 | d0 | Values encoded | Description | Occurrences (1000 states) |
| 50.0% (512 states) | a | b | c | d | e | f | 0 | g | h | i | 0abc | 0def | 0ghi | (0–7) (0–7) (0–7) | 3 small digits | 51.2% (512 states) |
| 37.5% (384 states) | a | b | c | d | e | f | 1 | 0 | 0 | i | 0abc | 0def | 100i | (0–7) (0–7) (8–9) | 2 small digits, 1 large digit | 38.4% (384 states) |
| 37.5% (384 states) | a | b | c | g | h | f | 1 | 0 | 1 | i | 0abc | 100f | 0ghi | (0–7) (8–9) (0–7) | 2 small digits, 1 large digit | 38.4% (384 states) |
| 37.5% (384 states) | g | h | c | d | e | f | 1 | 1 | 0 | i | 100c | 0def | 0ghi | (8–9) (0–7) (0–7) | 2 small digits, 1 large digit | 38.4% (384 states) |
| 9.375% (96 states) | g | h | c | 0 | 0 | f | 1 | 1 | 1 | i | 100c | 100f | 0ghi | (8–9) (8–9) (0–7) | 1 small digit, 2 large digits | 9.6% (96 states) |
| 9.375% (96 states) | d | e | c | 0 | 1 | f | 1 | 1 | 1 | i | 100c | 0def | 100i | (8–9) (0–7) (8–9) | 1 small digit, 2 large digits | 9.6% (96 states) |
| 9.375% (96 states) | a | b | c | 1 | 0 | f | 1 | 1 | 1 | i | 0abc | 100f | 100i | (0–7) (8–9) (8–9) | 1 small digit, 2 large digits | 9.6% (96 states) |
| 3.125% (32 states, 8 used) | x | x | c | 1 | 1 | f | 1 | 1 | 1 | i | 100c | 100f | 100i | (8–9) (8–9) (8–9) | 3 large digits, b9, b8: don't care | 0.8% (8 states) |
The 8 decimal values whose digits are all 8s or 9s have four codings each. The bits marked x in the table above are ignored on input, but will always be 0 in computed results. (The 8 × 3 = 24 non-standard encodings fill in the gap between 10$^3$ = 1000 and 2$^{10}$ = 1024.)
In the above cases, with the true significand as the sequence of decimal digits decoded, the value represented is
    $(-1)^{\text{signbit}}\times 10^{{\text{exponentbits}}_{2}-6176_{10}}\times {\text{truesignificand}}_{10}$