From 3c858461ff3ef718521a5f008163d162890d7cc1 Mon Sep 17 00:00:00 2001
From: tomtomwombat <45644087+tomtomwombat@users.noreply.github.com>
Date: Thu, 7 Mar 2024 21:07:43 -0800
Subject: [PATCH] Update README.md

---
 README.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/README.md b/README.md
index c59df12..9c9628d 100644
--- a/README.md
+++ b/README.md
@@ -96,6 +96,16 @@ The fastbloom-rs crate (similarily named) uses xxhash, which is faster than SipH
 ![bloom-fp](https://github.com/tomtomwombat/fastbloom/assets/45644087/07e22ab3-f777-4e4e-8910-4f1c764e4134)
 > The bloom filters and a control hash set were populated with a varying number of random 64 bit integers ("Number of Items"). Then 100,000 random 64 bit integers were checked: false positives are numbers that do NOT exist in the control hash set but do report as existing in the bloom filter.
 
+### Comparing Block Sizes: 64, 128, 256, and 512 Bits
+
+`fastbloom` offers 4 different block sizes. 512 bits is the default. Larger block sizes have slower performance but are more accurate.
+
+#### Runtime Performance
+
+
+#### Accuracy
+![fastbloom-block-fp](https://github.com/tomtomwombat/fastbloom/assets/45644087/c8e88ddb-3617-4d85-8f76-b606b4e98e13)
+
 ### How it Works
 
 `fastbloom` attributes its performance to two insights: