From c5442802ffab4abe9a4912e29cc122dfa36c478e Mon Sep 17 00:00:00 2001
From: Tyler Perkins <tperki17@kent.edu>
Date: Wed, 2 Feb 2022 16:30:01 -0500
Subject: [PATCH] Update for 02-02-22 16:30

---
 tech/Bloom_filter.wiki | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/tech/Bloom_filter.wiki b/tech/Bloom_filter.wiki
index c181c58..cb21353 100644
--- a/tech/Bloom_filter.wiki
+++ b/tech/Bloom_filter.wiki
@@ -10,4 +10,8 @@ not. Meaning it can return,
 == Implementation ==
 
 * Simple [[hash_table]] set
-* 
+  * but for some set of hash functions, ALL values of those hash functions are
+    selected in the table (table of bits?)
+* When entry is given, if ALL values that the set of hash functions give are
+  filled, then value may exist
+* If not, it defintily does not exist