From ff2944c2439fafddcc97ba74a68148c3f7920a45 Mon Sep 17 00:00:00 2001
From: Jason Davies <jason@jasondavies.com>
Date: Sun, 4 Sep 2011 10:37:42 +0100
Subject: [PATCH] Add README.

---
 README.md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 README.md

diff --git a/README.md b/README.md
new file mode 100644
index 0000000..a32d75c
--- /dev/null
+++ b/README.md
@@ -0,0 +1,11 @@
+Bloom Filter
+============
+
+This JavaScript bloom filter implementation uses the non-cryptographic
+[Fowler–Noll–Vo hash function][1] for speed.  In fact, the hash function only
+needs to be called once per operation, as *n* hash functions can be simulated
+using only two hash functions.  And two 32-bit hash functions can be simulated
+[using a single 64-bit hash function][2]!
+
+[1]: http://isthe.com/chongo/tech/comp/fnv/
+[2]: http://willwhim.wordpress.com/2011/09/03/producing-n-hash-functions-by-hashing-only-once/