{"component":{"type":17,"accent_color":7315445,"components":[{"type":10,"content":"-# WikiRNG · Roll of 11/2/2026 · by [famous\\_erik](https://wikirng.com/u/famous_erik)"},{"type":10,"content":"## [Nilsimsa](https://wikirng.com/roll/9ZYEXG)\n*Anti-spam hashing algorithm*"},{"type":10,"content":">>> Nilsimsa is an anti-spam focused locality-sensitive hashing algorithm originally proposed by the cmeclax remailer operator in 2001 and then reviewed by Ernesto Damiani et al. in their 2004 paper titled, \"An Open Digest-based Technique for Spam Detection\"."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟦 Obscure · 92,379 SP\n-# Top 22%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🐙 **GitHub** · Obscure · +63,354 SP\n-# Links to GitHub.\n🟦 🤷 **Notability?** · Obscure · +12,994 SP\n-# Tagged as maybe not notable.\n🟦 👻 **Ghostarchive** · Obscure · +10,563 SP\n-# Links to Ghostarchive.\n🟩 🕊️ **Pigeonholed** · Notable · +1,112 SP\n-# In exactly one category.\n⬜ 🏃 **Short Path** · Basic · +817 SP\n-# Reaches Philosophy in 10 or fewer first-link clicks.\n⬜ 1️⃣ **One Word** · Basic · +813 SP\n-# Title is one word.\n-# +6 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/9ZYEXG"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Nilsimsa"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}