diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,3 +1,7 @@
+0.5.2 Enzo Haussecker <enzo@dfinity.org> Fri Oct 19 2018
+
+ * Fix bug related to search strategy.
+
 0.5.1 Enzo Haussecker <enzo@dfinity.org> Fri Oct 19 2018
 
  * Expose lens-based interface to radix tree data structures.
diff --git a/dfinity-radix-tree.cabal b/dfinity-radix-tree.cabal
--- a/dfinity-radix-tree.cabal
+++ b/dfinity-radix-tree.cabal
@@ -1,5 +1,5 @@
 Name:               dfinity-radix-tree
-Version:            0.5.1
+Version:            0.5.2
 Synopsis:           A generic data integrity layer.
 Description:
    This library allows you to construct a Merkle tree on top of any underlying
diff --git a/src/DFINITY/RadixTree.hs b/src/DFINITY/RadixTree.hs
--- a/src/DFINITY/RadixTree.hs
+++ b/src/DFINITY/RadixTree.hs
@@ -607,7 +607,7 @@
    -> RadixTree database -- ^ Radix tree.
    -> m (Maybe (RadixProof, RadixTree database))
 createRadixProof key tree = do
-   found <- searchNonMerkleizedRadixTree key tree
+   found <- searchMerkleizedRadixTree key tree
    case found of
       Left err -> throw err
       Right (_, path, _, prefixOverflow, keyOverflow, cache') ->