diff --git a/implementations/onblocks/BlobOnBlocks.cpp b/implementations/onblocks/BlobOnBlocks.cpp
index 737fa45a..429e933b 100644
--- a/implementations/onblocks/BlobOnBlocks.cpp
+++ b/implementations/onblocks/BlobOnBlocks.cpp
@@ -76,13 +76,6 @@ void BlobOnBlocks::flush() {
   _datatree->flush();
 }
 
-void BlobOnBlocks::resizeIfSmallerThan(uint64_t neededSize) {
-  //TODO This is inefficient, because size() and resizeNumBytes() both traverse the tree. Better: _datatree->ensureMinSize(x)
-  if (neededSize > size()) {
-    _datatree->resizeNumBytes(neededSize);
-  }
-}
-
 Key BlobOnBlocks::key() const {
   return _datatree->key();
 }
diff --git a/implementations/onblocks/BlobOnBlocks.h b/implementations/onblocks/BlobOnBlocks.h
index 5377061c..91f3d836 100644
--- a/implementations/onblocks/BlobOnBlocks.h
+++ b/implementations/onblocks/BlobOnBlocks.h
@@ -36,7 +36,6 @@ public:
 private:
 
   void traverseLeaves(uint64_t offsetBytes, uint64_t sizeBytes, std::function<void (uint64_t, datanodestore::DataLeafNode *, uint32_t, uint32_t)>) const;
-  void resizeIfSmallerThan(uint64_t neededSize);
 
   cpputils::unique_ref<parallelaccessdatatreestore::DataTreeRef> _datatree;
 };