# HG changeset patch
# User Henry Precheur
# Date 1571593645 25200
# Sun Oct 20 10:47:25 2019 -0700
# Node ID 99e5107a10eafef2d2f1528d78225fdb30741ce0
# Parent 3aba14aac9bf905e1944b7c390f27c505401ae2a
wip
diff --git a/episode10/README.md b/episode10/README.md
--- a/episode10/README.md
+++ b/episode10/README.md
@@ -31,7 +31,7 @@
[ep8]: http://henry.precheur.org/scratchpad/20180604_083306
[ep9]: http://henry.precheur.org/scratchpad/20190419_114828
[rfc7049]: https://tools.ietf.org/html/rfc7049
-[repo]: https://bitbucket.org/henry/cbor/src/default/episode9/
+[repo]: https://bitbucket.org/henry/cbor/src/default/episode10/
----
@@ -134,20 +134,22 @@
Note that we don’t check if the input equals -0.0 because -0.0 == 0.0.
-!!WIP!!
+We’re done with zero, what about the other subnormal numbers? How we can
+represent them and use them to encode other numbers tigthly? The difference
+between subnormal numbers and regular floating point numbers is the fractional’s
+prefix. The regular ones are prefixed with a 1, while the subnormal ones have a
+0 as prefix.
-We’ve done zero and what about the other subnormal numbers? How we can represent
-them and use them to encode other numbers tigthly? Let’s learn more about
-subnormal numbers. The main difference is with the formual where the fractional
-prefix is a 0 instead of a 1. Here’s the formula for regular floating point
-numbers:
+Here’s the formula for regular floating point numbers:
> (−1)^{signbit} × 2^{exponent−15} × 1.significantbits_{2}
-When we have subnormal numbers the formula turns into:
+With subnormal numbers the formula turns into:
> (−1)^{signbit} × 2^{−14} × 0.significantbits_{2}
+!!WIP!!
+
Subnormal numbers don’t start with a 1, but with a 0. This means we can
represent number with exponents lower that -14 with subnormal numbers by
shifting the bits to the left. We’ll use the smallest 16 bits subnormal number:
@@ -242,6 +244,10 @@
Check out the [repository][repo] with the full code for this episode.
+
+
+
+
==== END WIP
XXX the following may be deletable.