THE GARDEN
Updated 15 Sep 2026
the standard binary representation for real numbers in computers: x=(−1)s×(1+m)×2e−biasx = (-1)^s \times (1+m) \times 2^{e-\text{bias}}
single precision (float32) — 1 sign bit, 8 exponent bits (bias = 127), 23 mantissa bits
double precision (float64) — 1 sign bit, 11 exponent bits (bias = 1023), 52 mantissa bits
sign: negative -> s=1s=1
integer part 2610=11010226_{10} = 11010_2; fractional part 0.62510=0.10120.625_{10} = 0.101_2
normalize: 11010.1012=1.10101012×2411010.101_2 = 1.1010101_2 \times 2^4
biased exponent: 4+127=13110=1000001124 + 127 = 131_{10} = 10000011_2
mantissa (23 bits, padded): 1010101000000000000000010101010000000000000000
result: 1 10000011 101010100000000000000002=0xC1D540001\ 10000011\ 10101010000000000000000_2 = \texttt{0xC1D54000}
0x41440000
binary: 0100 0001 0100 0100 0000 0000 0000 00000100\ 0001\ 0100\ 0100\ 0000\ 0000\ 0000\ 0000
s=0s=0; exponent bits =100000102=13010= 10000010_2 = 130_{10}, true exponent =130−127=3= 130-127=3
mantissa =1+2−2+2−6=1.265625= 1 + 2^{-2} + 2^{-6} = 1.265625
result: (+1)×1.265625×23=10.12510(+1) \times 1.265625 \times 2^3 = 10.125_{10}
Machine Epsilon
Subnormal Numbers and Underflow
◌ Explore connections in Graph view
Paths through the garden