diff --git a/CHANGELOG.markdown b/CHANGELOG.markdown
new file mode 100644
--- /dev/null
+++ b/CHANGELOG.markdown
@@ -0,0 +1,9 @@
+q4c12-twofinger 0.0.0.1 (2017-12-08)
+====================================
+
+* Packaging fix-ups only.
+
+q4c12-twofinger 0 (2017-12-08)
+==============================
+
+* Initial release.
diff --git a/README.markdown b/README.markdown
--- a/README.markdown
+++ b/README.markdown
@@ -1,13 +1,7 @@
-This package provides efficient alternating sequences based on
-finger trees. These can represent sequences made up of two types of
-element, `e` and `a`  where two of the same type of element cannot
-follow each other directly.
+This package provides efficient alternating sequences based on finger trees. These can represent sequences made up of two types of element, `e` and `a`  where two of the same type of element cannot follow each other directly.
 
-Four different flavours are provided, isomorphic to `([(a, e)], a)`,
-`([(e, a)], e)`, `[(a, e)]`, and `[(e, a)]`.
+Four different flavours are provided, isomorphic to `([(a, e)], a)`, `([(e, a)], e)`, `[(a, e)]`, and `[(e, a)]`.
 
-Cons-like operations are *O(1)* amortised, and append operations are
-*O(log(min(n, m)))* amortised.
+Cons-like operations are *O(1)* amortised, and append operations are *O(log(min(n, m)))* amortised.
 
-For more details, please see the Haddock documentation of
-Q4C12.TwoFinger.
+For more details, please see the Haddock documentation of Q4C12.TwoFinger.
diff --git a/q4c12-twofinger.cabal b/q4c12-twofinger.cabal
--- a/q4c12-twofinger.cabal
+++ b/q4c12-twofinger.cabal
@@ -2,11 +2,18 @@
 --
 -- see: https://github.com/sol/hpack
 --
--- hash: e8e00b005348ee2c4b2972e8d65d24abad0d2b84cf43a569ed207ceb78f026e4
+-- hash: 170352bc018b512f91fd2fd5b865796d5ba48ca28bccf4ef9d162864f7ffa13d
 
 name:           q4c12-twofinger
-version:        0
+version:        0.0.0.1
 synopsis:       Efficient alternating finger trees
+description:    This package provides efficient alternating sequences based on finger trees. These can represent sequences made up of two types of element, @e@ and @a@  where two of the same type of element cannot follow each other directly.
+                .
+                Four different flavours are provided, isomorphic to @([(a, e)], a)@, @([(e, a)], e)@, @[(a, e)]@, and @[(e, a)]@.
+                .
+                Cons-like operations are /O(1)/ amortised, and append operations are /O(log(min(n, m)))/ amortised.
+                .
+                For more details, please see the Haddock documentation of 'Q4C12.TwoFinger'.
 category:       Data Structures
 homepage:       https://github.com/quasicomputational/mega/tree/master/packages/twofinger
 bug-reports:    https://github.com/quasicomputational/mega/issues
@@ -18,6 +25,7 @@
 cabal-version:  >= 1.10
 
 extra-source-files:
+    CHANGELOG.markdown
     README.markdown
 
 source-repository head