From 1f47a3b2c00a253800d33699f4691ea10c7fafb4 Mon Sep 17 00:00:00 2001
From: Marvin <33938500+marvin-j97@users.noreply.github.com>
Date: Fri, 19 Jan 2024 12:41:28 +0100
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index b8b8965..1beafa9 100644
--- a/README.md
+++ b/README.md
@@ -29,7 +29,7 @@ This is the most feature-rich LSM-tree implementation in Rust! It features:
 - Multi-threaded flushing (immutable/sealed memtables)
 - Partitioned block index to reduce memory footprint and keep startup time tiny [1]
 - Block caching to keep hot data in memory
-- Bloom filters to increase point lookup performance (`bloom` feature, enabled by default)
+- Bloom filters to increase point lookup performance (`bloom` feature, disabled by default)
 - Snapshots (MVCC)
 
 Keys are limited to 65536 bytes, values are limited to 2^32 bytes. As is normal with any kind of storage