From 96e03f1aa88bbd0c7a4ee4a521ff2a4a7e853b88 Mon Sep 17 00:00:00 2001
From: Tom Smeding <tom.smeding@gmail.com>
Date: Wed, 23 Sep 2020 12:59:21 +0200
Subject: Update random post

---
 random.html | 18 ++++++++++--------
 1 file changed, 10 insertions(+), 8 deletions(-)

diff --git a/random.html b/random.html
index 741f4e3..a24337d 100644
--- a/random.html
+++ b/random.html
@@ -28,16 +28,18 @@
 
 <p>
 	Nathan further recommends the following hash function, which is not a cryptographic hash function but is nothing short of magical when applied for the right purpose: the Wang hash.
+	The version on Nathan's blog is somewhat outdated; there is an improved one to be found on the (also defunct) website of Thomas Wang himself (<a href="https://web.archive.org/web/20111127152414/http://www.cris.com/~ttwang/tech/inthash.htm" target="_blank">Internet Archive copy</a>):
 </p>
 
-<pre>uint wang_hash(uint seed) {
-    // taken from Nathan Reed's blog post
-    seed = (seed ^ 61) ^ (seed &gt;&gt; 16);
-    seed *= 9;
-    seed = seed ^ (seed &gt;&gt; 4);
-    seed *= 0x27d4eb2d;
-    seed = seed ^ (seed &gt;&gt; 15);
-    return seed;
+<pre>uint wang_hash(uint key) {
+    // Taken from Thomas Wang's website
+    key = ~key + (key &lt;&lt; 15);   // key = (key &lt;&lt; 15) - key - 1;
+    key = key ^ (key &gt;&gt;&gt; 12);
+    key = key + (key &lt;&lt; 2);
+    key = key ^ (key &gt;&gt;&gt; 4);
+    key = key * 2057;   // key = key + (key &lt;&lt; 3) + (key &lt;&lt; 11);
+    key = key ^ (key &gt;&gt;&gt; 16);
+    return key;
 }</pre>
 
 <p>
-- 
cgit v1.2.3-70-g09d2