diff --git a/bytestring-tree-builder.cabal b/bytestring-tree-builder.cabal
--- a/bytestring-tree-builder.cabal
+++ b/bytestring-tree-builder.cabal
@@ -1,5 +1,5 @@
 name: bytestring-tree-builder
-version: 0.2.7.5
+version: 0.2.7.6
 category: ByteString
 synopsis: A very efficient ByteString builder implementation based on the binary tree
 description:
@@ -69,8 +69,8 @@
     base-prelude,
     bytestring,
     bytestring-tree-builder,
-    QuickCheck >=2.8.1 && <3,
-    quickcheck-instances >=0.3.11 && <0.4,
-    tasty >=0.12 && <2,
-    tasty-hunit >=0.9 && <0.11,
-    tasty-quickcheck >=0.9 && <0.11
+    QuickCheck >=2.14 && <3,
+    quickcheck-instances >=0.3.25 && <0.4,
+    tasty >=1.4 && <2,
+    tasty-hunit >=0.10 && <0.11,
+    tasty-quickcheck >=0.10 && <0.11
diff --git a/library/ByteString/TreeBuilder/Poker.hs b/library/ByteString/TreeBuilder/Poker.hs
--- a/library/ByteString/TreeBuilder/Poker.hs
+++ b/library/ByteString/TreeBuilder/Poker.hs
@@ -43,4 +43,4 @@
   case a of
     E.Branch c d -> pokeTreeOnBranch c (E.Branch d b) ptr
     E.Leaf bytes -> pokeBytes bytes ptr >>= pokeTree b
-    E.Empty -> pure ptr
+    E.Empty -> pokeTree b ptr
diff --git a/tasty/Main.hs b/tasty/Main.hs
--- a/tasty/Main.hs
+++ b/tasty/Main.hs
@@ -24,4 +24,16 @@
     \bytestrings ->
       mconcat bytestrings ===
       Data.ByteString.Lazy.toStrict (toLazyByteString (foldMap byteString bytestrings))
+    ,
+    testCase "Regression (Issue #5)" $
+    let
+      fn name =
+        toByteString $
+          "FETCH FORWARD "
+            <> asciiIntegral 10
+            <> " FROM "
+            <> byteString name
+      in assertEqual ""
+        "FETCH FORWARD 10 FROM abc"
+        (fn "abc")
   ]