add comment about loogle

content/sundries/presenting-julids/index.md

@@ -83,7 +83,7 @@ guess a new possibly-valid ULID simply by incrementing an already-known one. And
 that sorting will need to read all the way to the end of the ULID for IDs created in the same
 millisecond.
 
-To address these shortcomings, Julids (Joe's ULIDs) have the following structure:
+To address these shortcomings, Julids (Joe's[^httm] ULIDs) have the following structure:
 
 ![Julid bit structure](./julid.svg)
 
@@ -278,6 +278,11 @@ those crates! Feel free to steal code from me any time!
     [name](https://gitlab.com/nebkor/julid/-/blob/2484d5156bde82a91dcc106410ed56ee0a5c1e07/Cargo.toml#L24)
     is just "julid"; that's how you refer to it in a `use` statement in your Rust program.
 
+[^httm]: Remember in *Hot Tub Time Machine*, where Rob Cordry's character, "Lew", decides to stay in
+    the past and use his future-knowledge to amass wealth and power, and he makes his own versions
+    of things that were done in his past, like forming a glam rock band called "Mötley Lew", and a
+    search engine called "Loogle", etc.?
+
 [^counter idea]: Putting the counter bits after the timestamp bits was stolen from
     <https://github.com/ahawker/ulid/issues/306#issuecomment-451850395>, though they use only 15 bits
     for the counter, due to each character in the string encoding representing five bits, and using