Thinking of a domain name specifically. I pictured an n-ary tree and you search the tree until you don't get a match. Each level of the tree requires more recursions of a hash function....
-
-
-
Reverse the url and chunk it. Calculate the hash of the first chunk if it isn't in the tree then not blacklisted. This would let you skip over entire TLDs quickly. You would only have to make the tree as deep as needed to identify all unique entries in the blacklist.
- 1 more reply
New conversation -
-
-
Not a progressive hash but a lookup tree where each level takes more work to find the correct hash. https://github.com/averagesecurityguy/blacklist … Need to benchmark it with a larger blacklist.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.