nilsimsa_lite 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c7838c1a839f2679bab3d90f107ac0226151adb1e4d000c077d9e1a99ccb84d7
+  data.tar.gz: 53ea9849b1b013a11136f9e12c35ba45072cfd69a36aedd4801450013e8b908d
+SHA512:
+  metadata.gz: 5051618cb4d5abe3cff58cdf1675394b0228aa51019ff252cd3f3c512cf492fa7020ae9a3a7f68999486513a7e57e3afa778b52ec18f0e0fee4a4f5fa47e5152
+  data.tar.gz: 71d6298a7c00b21e9357e5f3e32bd579c05fe6b0be8141764df969ecf3b1418c12fab35214d6f04e718c75417c9091c0b15ec6d46c072693d50de73ad03021f2

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2026-06-11
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,132 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, caste, color, religion, or sexual
+identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes,
+  and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall
+  community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or advances of
+  any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email address,
+  without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official email address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+[INSERT CONTACT METHOD].
+All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of
+actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or permanent
+ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the
+community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 2.1, available at
+[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].
+
+Community Impact Guidelines were inspired by
+[Mozilla's code of conduct enforcement ladder][Mozilla CoC].
+
+For answers to common questions about this code of conduct, see the FAQ at
+[https://www.contributor-covenant.org/faq][FAQ]. Translations are available at
+[https://www.contributor-covenant.org/translations][translations].
+
+[homepage]: https://www.contributor-covenant.org
+[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html
+[Mozilla CoC]: https://github.com/mozilla/diversity
+[FAQ]: https://www.contributor-covenant.org/faq
+[translations]: https://www.contributor-covenant.org/translations

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Sergio Gil
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,53 @@
+# NilsimsaLite
+
+Ruby wrapper for [nilsimsa-lite](https://github.com/3p3r/nilsimsa-lite).
+
+> In its most simplistic explanation, Nilsimsa produces the same hash if the data it represents is
+> "almost" identical. Compare this to cryptographic hash functions (such as MD5) where hashes are
+> identical if the data it represents are identical.
+
+This makes it useful for things like spam detection, etc.
+
+## Installation
+
+TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG` with your gem name right after releasing it to RubyGems.org. Please do not do it earlier due to security reasons. Alternatively, replace this section with instructions to install your gem from git if you don't plan to release to RubyGems.org.
+
+Install the gem and add to the application's Gemfile by executing:
+
+```bash
+bundle add UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```
+
+If bundler is not being used to manage dependencies, install the gem by executing:
+
+```bash
+gem install UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```
+
+## Usage
+
+```ruby
+require 'nilsimsa_lite'
+
+d1 = NilsimsaLite.digest("Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.")
+#=> "5D9E4CB0061ECD485062E26FA8273991A7A9C9C36A57E33C2E18AA13F7E4F0EE"
+
+d2 = NilsimsaLite.digest("Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.".gsub('dolor', 'delectatio'))
+#=> "55DC5CB10716C8587022E275BC203991A781C9C36A56672C2E18AA03D3F4A467"
+
+NilsimsaLite.compare(d1, d2)
+=> 92
+```
+
+According to the [original
+implementation](https://web.archive.org/web/20150308093244/http://ixazon.dynip.com/~cmeclax/nilsimsa.html),
+_"any nilsimsa over 24 (which is 3 sigma) indicates that the two messages are probably not
+independently generated."_
+
+## Contributing
+
+Bug reports and pull requests are welcome on Codeberg at https://codeberg.org/sgilperez/nilsimsa_lite. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://codeberg.org/sgilperez/nilsimsa_lite/blob/main/CODE_OF_CONDUCT.md).
+
+## Code of Conduct
+
+Everyone interacting in the NilsimsaLite project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://codeberg.org/sgilperez/nilsimsa_lite/blob/main/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+require "standard/rake"
+
+require "rake/extensiontask"
+
+task build: :compile
+
+GEMSPEC = Gem::Specification.load("nilsimsa_lite.gemspec")
+
+Rake::ExtensionTask.new("nilsimsa_lite", GEMSPEC) do |ext|
+  ext.lib_dir = "lib/nilsimsa_lite"
+end
+
+task default: %i[clobber compile spec standard]

data/ext/nilsimsa-lite/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 Sepehr Laal
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/ext/nilsimsa-lite/README.md

@@ -0,0 +1,51 @@
+# nilsimsa-lite
+A minimal C implementation of the Nilsimsa algorithm
+
+## What is Nilsimsa?
+In its most simplistic explanation, Nilsimsa produces the same hash if the data it represents is "almost" identical. Compare this to cryptographic hash functions (such as MD5) where hashes are identical iff the data it represents are identical.
+
+## Build
+There is no dependency in the source. Unit tests require `<assert.h>` and `<string.h>`. To build:
+
+ * Linux
+```Bash
+$> cd <root of the repo>
+$> mkdir build && cd build
+$> cmake ..
+$> make
+```
+
+* Windows
+```Batch
+$> cd <root of the repo>
+$> mkdir build && cd build
+$> cmake .. -G "Visual Studio 14 Win64"
+```
+Open up the solution and build.
+
+## Example Usage
+```C
+// input text to be hashed
+const char data[] = "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam cursus lacinia condimentum. Integer feugiat tortor sed massa lobortis eleifend vel eu diam. Nullam libero ligula, accumsan eu sollicitudin et, rhoncus id lorem. Etiam lacinia erat id feugiat pulvinar. Nulla scelerisque, libero vel commodo malesuada, lorem mi ultricies arcu, eget rutrum lorem velit sed ipsum. Cras ac tellus in mauris eleifend elementum. Curabitur tempor sed massa sed dignissim.";
+
+// -1 to compensate for trailing null character
+int data_size = (sizeof(data) / data(data[0])) - 1;
+
+// pre-allocate hash's string
+char hash[65] = { 0 };
+nilsimsa_compute(data, data_size, hash);
+
+// hash is now:
+5DF842A0C27C234DF170AB95440675C10E82294B181438D87D09CE4CB7C4F47E
+```
+
+## API Documentation
+ - `nilsimsa_compute`
+ > computes the Nilsimsa hash of the given data. Returns a 64 character long string representing the digest.
+
+ - `nilsimsa_compare`
+ > compares two given Nilsimsa hashes. Returns a score between -127 and 128 where -127 means completely uncorrelated data and 128 means same data.
+
+## Notes
+This is a minimal port of [rholder/nilsimsa](https://github.com/rholder/nilsimsa) to C.
+The reference C implementation can be found [here](http://ixazon.dynip.com/~cmeclax/nilsimsa.html).

data/ext/nilsimsa-lite/nilsimsa.c

@@ -0,0 +1,218 @@
+/*!
+ * The MIT License (MIT)
+ * =====================
+ *
+ * Copyright 2017 Sepehr Laal
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+*/
+
+#include "nilsimsa.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+static int __score(int num);
+static int __tran3(int a, int b, int c, int n);
+static int __hexchar_to_int(char digit);
+static const char* __int_to_hexchar(int num);
+
+#define ACCUM_LENGTH 256
+#define DIGEST_LENGTH 32
+#define WINDOW_LENGTH 4 
+
+void nilsimsa_compute(const char* data, int n, char* out)
+{
+    int accum[ACCUM_LENGTH] = { 0 };
+    int digest[DIGEST_LENGTH] = { 0 };
+    int window[WINDOW_LENGTH] = { -1, -1, -1, -1 };
+
+    for (int i = 0; i < n; ++i)
+    {
+        int ch = data[i] & 0xFF;
+
+        if (window[1] > -1)
+        {
+            accum[__tran3(ch, window[0], window[1], 0)] += 1;
+        }
+
+        if (window[2] > -1)
+        {
+            accum[__tran3(ch, window[0], window[2], 1)] += 1;
+            accum[__tran3(ch, window[1], window[2], 2)] += 1;
+        }
+
+        if (window[3] > -1)
+        {
+            accum[__tran3(ch, window[0], window[3], 3)] += 1;
+            accum[__tran3(ch, window[1], window[3], 4)] += 1;
+            accum[__tran3(ch, window[2], window[3], 5)] += 1;
+            accum[__tran3(window[3], window[0], ch, 6)] += 1;
+            accum[__tran3(window[3], window[2], ch, 7)] += 1;
+        }
+
+        window[3] = window[2];
+        window[2] = window[1];
+        window[1] = window[0];
+        window[0] = ch;
+    }
+
+    int total = 0;
+
+    if (n == 3)
+        total = 1;
+    else if (n == 4)
+        total = 4;
+    else if (n > 4)
+        total = 8 * n - 28;
+
+    int threshold = total / ACCUM_LENGTH;
+
+    for (int i = 0; i < ACCUM_LENGTH; i++)
+        if (accum[i] > threshold)
+            digest[i >> 3] += 1 << (i & 7);
+
+    int rev_index = 0;
+
+    for (int i = 0; i < DIGEST_LENGTH; ++i)
+    {
+        rev_index = DIGEST_LENGTH - i - 1;
+        out[2*i  ] = __int_to_hexchar(digest[rev_index])[0];
+        out[2*i+1] = __int_to_hexchar(digest[rev_index])[1];
+    }
+
+    out[2 * DIGEST_LENGTH] = '\0';
+}
+
+int nilsimsa_compare(const char* hash1, const char* hash2)
+{
+    int digest1[DIGEST_LENGTH] = { 0 };
+    int digest2[DIGEST_LENGTH] = { 0 };
+
+    for (int i = 0; i < DIGEST_LENGTH; ++i)
+    {
+        digest1[i] = (__hexchar_to_int(hash1[2 * i]) << 4) + __hexchar_to_int(hash1[2 * i + 1]);
+        digest2[i] = (__hexchar_to_int(hash2[2 * i]) << 4) + __hexchar_to_int(hash2[2 * i + 1]);
+    }
+
+    int bits = 0;
+    for (int i = 0; i < DIGEST_LENGTH; i++)
+        bits += __score(255 & (digest1[i] ^ digest2[i]));
+    return 128 - bits;
+}
+
+//////////////////////////////////////////////////////////////////////////
+// implementation detail
+
+// This is a precomputed constant for the standard Nilsimsa "53"-based transition table.
+static const int __TRAN53[] =
+{
+    0x02, 0xD6, 0x9E, 0x6F, 0xF9, 0x1D, 0x04, 0xAB, 0xD0, 0x22, 0x16, 0x1F, 0xD8, 0x73, 0xA1, 0xAC,
+    0x3B, 0x70, 0x62, 0x96, 0x1E, 0x6E, 0x8F, 0x39, 0x9D, 0x05, 0x14, 0x4A, 0xA6, 0xBE, 0xAE, 0x0E,
+    0xCF, 0xB9, 0x9C, 0x9A, 0xC7, 0x68, 0x13, 0xE1, 0x2D, 0xA4, 0xEB, 0x51, 0x8D, 0x64, 0x6B, 0x50,
+    0x23, 0x80, 0x03, 0x41, 0xEC, 0xBB, 0x71, 0xCC, 0x7A, 0x86, 0x7F, 0x98, 0xF2, 0x36, 0x5E, 0xEE,
+    0x8E, 0xCE, 0x4F, 0xB8, 0x32, 0xB6, 0x5F, 0x59, 0xDC, 0x1B, 0x31, 0x4C, 0x7B, 0xF0, 0x63, 0x01,
+    0x6C, 0xBA, 0x07, 0xE8, 0x12, 0x77, 0x49, 0x3C, 0xDA, 0x46, 0xFE, 0x2F, 0x79, 0x1C, 0x9B, 0x30,
+    0xE3, 0x00, 0x06, 0x7E, 0x2E, 0x0F, 0x38, 0x33, 0x21, 0xAD, 0xA5, 0x54, 0xCA, 0xA7, 0x29, 0xFC,
+    0x5A, 0x47, 0x69, 0x7D, 0xC5, 0x95, 0xB5, 0xF4, 0x0B, 0x90, 0xA3, 0x81, 0x6D, 0x25, 0x55, 0x35,
+    0xF5, 0x75, 0x74, 0x0A, 0x26, 0xBF, 0x19, 0x5C, 0x1A, 0xC6, 0xFF, 0x99, 0x5D, 0x84, 0xAA, 0x66,
+    0x3E, 0xAF, 0x78, 0xB3, 0x20, 0x43, 0xC1, 0xED, 0x24, 0xEA, 0xE6, 0x3F, 0x18, 0xF3, 0xA0, 0x42,
+    0x57, 0x08, 0x53, 0x60, 0xC3, 0xC0, 0x83, 0x40, 0x82, 0xD7, 0x09, 0xBD, 0x44, 0x2A, 0x67, 0xA8,
+    0x93, 0xE0, 0xC2, 0x56, 0x9F, 0xD9, 0xDD, 0x85, 0x15, 0xB4, 0x8A, 0x27, 0x28, 0x92, 0x76, 0xDE,
+    0xEF, 0xF8, 0xB2, 0xB7, 0xC9, 0x3D, 0x45, 0x94, 0x4B, 0x11, 0x0D, 0x65, 0xD5, 0x34, 0x8B, 0x91,
+    0x0C, 0xFA, 0x87, 0xE9, 0x7C, 0x5B, 0xB1, 0x4D, 0xE5, 0xD4, 0xCB, 0x10, 0xA2, 0x17, 0x89, 0xBC,
+    0xDB, 0xB0, 0xE2, 0x97, 0x88, 0x52, 0xF7, 0x48, 0xD3, 0x61, 0x2C, 0x3A, 0x2B, 0xD1, 0x8C, 0xFB,
+    0xF1, 0xCD, 0xE4, 0x6A, 0xE7, 0xA9, 0xFD, 0xC4, 0x37, 0xC8, 0xD2, 0xF6, 0xDF, 0x58, 0x72, 0x4E
+};
+
+/*
+* This is an optimization table for doing bitwise vector comparisons. The
+* population count of x, POPC[x], is the number of 1's in the binary
+* representation of x. The bitwise XOR(a, b) applied within this table,
+* POPC[a ^ b], is the Hamming distance between a and b. For more
+* information, see http://en.wikipedia.org/wiki/Hamming_weight.
+*/
+static const int __POPC[] =
+{
+    0x00, 0x01, 0x01, 0x02, 0x01, 0x02, 0x02, 0x03, 0x01, 0x02, 0x02, 0x03, 0x02, 0x03, 0x03, 0x04,
+    0x01, 0x02, 0x02, 0x03, 0x02, 0x03, 0x03, 0x04, 0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05,
+    0x01, 0x02, 0x02, 0x03, 0x02, 0x03, 0x03, 0x04, 0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05,
+    0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05, 0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06,
+    0x01, 0x02, 0x02, 0x03, 0x02, 0x03, 0x03, 0x04, 0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05,
+    0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05, 0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06,
+    0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05, 0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06,
+    0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06, 0x04, 0x05, 0x05, 0x06, 0x05, 0x06, 0x06, 0x07,
+    0x01, 0x02, 0x02, 0x03, 0x02, 0x03, 0x03, 0x04, 0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05,
+    0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05, 0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06,
+    0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05, 0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06,
+    0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06, 0x04, 0x05, 0x05, 0x06, 0x05, 0x06, 0x06, 0x07,
+    0x02, 0x03, 0x03, 0x04, 0x03, 0x04, 0x04, 0x05, 0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06,
+    0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06, 0x04, 0x05, 0x05, 0x06, 0x05, 0x06, 0x06, 0x07,
+    0x03, 0x04, 0x04, 0x05, 0x04, 0x05, 0x05, 0x06, 0x04, 0x05, 0x05, 0x06, 0x05, 0x06, 0x06, 0x07,
+    0x04, 0x05, 0x05, 0x06, 0x05, 0x06, 0x06, 0x07, 0x05, 0x06, 0x06, 0x07, 0x06, 0x07, 0x07, 0x08
+};
+
+/*
+* Used to convert integers to 1-byte hex strings
+* Integers in between the range of 0 and 256.
+*/
+static const char* __HEX_BYTE_DIGITS[] =
+{
+    "00", "01", "02", "03", "04", "05", "06", "07", "08", "09", "0A", "0B", "0C", "0D", "0E", "0F",
+    "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "1A", "1B", "1C", "1D", "1E", "1F",
+    "20", "21", "22", "23", "24", "25", "26", "27", "28", "29", "2A", "2B", "2C", "2D", "2E", "2F",
+    "30", "31", "32", "33", "34", "35", "36", "37", "38", "39", "3A", "3B", "3C", "3D", "3E", "3F",
+    "40", "41", "42", "43", "44", "45", "46", "47", "48", "49", "4A", "4B", "4C", "4D", "4E", "4F",
+    "50", "51", "52", "53", "54", "55", "56", "57", "58", "59", "5A", "5B", "5C", "5D", "5E", "5F",
+    "60", "61", "62", "63", "64", "65", "66", "67", "68", "69", "6A", "6B", "6C", "6D", "6E", "6F",
+    "70", "71", "72", "73", "74", "75", "76", "77", "78", "79", "7A", "7B", "7C", "7D", "7E", "7F",
+    "80", "81", "82", "83", "84", "85", "86", "87", "88", "89", "8A", "8B", "8C", "8D", "8E", "8F",
+    "90", "91", "92", "93", "94", "95", "96", "97", "98", "99", "9A", "9B", "9C", "9D", "9E", "9F",
+    "A0", "A1", "A2", "A3", "A4", "A5", "A6", "A7", "A8", "A9", "AA", "AB", "AC", "AD", "AE", "AF",
+    "B0", "B1", "B2", "B3", "B4", "B5", "B6", "B7", "B8", "B9", "BA", "BB", "BC", "BD", "BE", "BF",
+    "C0", "C1", "C2", "C3", "C4", "C5", "C6", "C7", "C8", "C9", "CA", "CB", "CC", "CD", "CE", "CF",
+    "D0", "D1", "D2", "D3", "D4", "D5", "D6", "D7", "D8", "D9", "DA", "DB", "DC", "DD", "DE", "DF",
+    "E0", "E1", "E2", "E3", "E4", "E5", "E6", "E7", "E8", "E9", "EA", "EB", "EC", "ED", "EE", "EF",
+    "F0", "F1", "F2", "F3", "F4", "F5", "F6", "F7", "F8", "F9", "FA", "FB", "FC", "FD", "FE", "FF"
+};
+
+static int __tran3(int a, int b, int c, int n)
+{
+    return (((__TRAN53[(a + n) & 255] ^ __TRAN53[b] * (n + n + 1)) + __TRAN53[c ^ __TRAN53[n]]) & 255);
+}
+
+static int __hexchar_to_int(char digit)
+{
+    return ((digit | 432) * 239217992 & 0xffffffff) >> 28;
+}
+
+static const char* __int_to_hexchar(int num)
+{
+    return __HEX_BYTE_DIGITS[num];
+}
+
+static int __score(int num)
+{
+    return __POPC[num];
+}
+
+#ifdef __cplusplus
+} //!extern "C"
+#endif

data/ext/nilsimsa-lite/nilsimsa.h

@@ -0,0 +1,58 @@
+/*!
+ * The MIT License (MIT)
+ * =====================
+ *
+ * Copyright 2017 Sepehr Laal
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+*/
+
+#ifndef _NILSIMSA_LITE_H_
+#define _NILSIMSA_LITE_H_
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*!
+ * @fn nilsimsa_compute
+ * @brief computes the Nilsimsa hash of the given data.
+ * @arg data [IN] input data byte (char) array
+ * @arg size [IN] input data size
+ * @arg out [OUT] output hash string (must be allocated 
+ * to hold exactly 64 characters + 1 null character. So
+ * total of 65 characters e.g. char hash[65])
+ */
+void nilsimsa_compute(const char* data, int size, char* out);
+
+/*!
+ * @fn nilsimsa_compare
+ * @brief compares two given Nilsimsa hashes
+ * @returns A score between -127 and 128 where -127 means
+ * completely uncorrelated data and 128 means same data.
+ * @arg lhs [IN] left hand side hash
+ * @arg rhs [IN] right hand side hash
+ */
+int nilsimsa_compare(const char* lhs, const char* rhs);
+
+#ifdef __cplusplus
+} //!extern "C"
+#endif
+
+#endif //!_NILSIMSA_LITE_H_

data/ext/nilsimsa_lite/extconf.rb

@@ -0,0 +1,10 @@
+# frozen_string_literal: true
+
+require "mkmf"
+
+# Makes all symbols private by default to avoid unintended conflict
+# with other gems. To explicitly export symbols you can use RUBY_FUNC_EXPORTED
+# selectively, or entirely remove this flag.
+append_cflags("-fvisibility=hidden")
+
+create_makefile("nilsimsa_lite/nilsimsa_lite")

data/ext/nilsimsa_lite/nilsimsa_lite.c

@@ -0,0 +1,51 @@
+#include "ruby.h"
+#include "../nilsimsa-lite/nilsimsa.c"
+
+/*
+  Computes the Nilsimsa hash of the given data. Returns a 64 character long string representing the
+  digest.
+
+  @param input [String]
+  @return [String] 64 hexadecimal characters string.
+*/
+VALUE rb_nilsimsa_digest(VALUE self, VALUE input) {
+  if (rb_type(input) != T_STRING) rb_raise(rb_eArgError, "can only digest strings");
+
+  char *string = RSTRING_PTR(input);
+  char hash[65] = { 0 };
+
+  nilsimsa_compute(string, strlen(string), hash);
+
+  VALUE ruby_str = rb_str_new2(hash);
+  return ruby_str;
+}
+
+/*
+  Compares two given Nilsimsa hashes. Returns a score between -127 and 128 where -127 means
+  completely uncorrelated data and 128 means same data.
+
+  @param a [String] Nilsimsa hash of a string
+  @param b [String] Nilsimsa hash of another string
+  @return Integer Score between -127 and 128. -127 means uncorrelated data and 128 means same data.
+
+  Note that it doesn't check whether the passed hashes are valid: if you pass shorter or longer
+  strings, or of invalid format, you will get a score between -127 and 128, but it won't mean
+  anything.
+*/
+VALUE rb_nilsimsa_compare(VALUE self, VALUE a, VALUE b) {
+  if (rb_type(a) != T_STRING || rb_type(b) != T_STRING) rb_raise(rb_eArgError, "can only compare digest strings");
+
+  char *string_a = RSTRING_PTR(a);
+  char *string_b = RSTRING_PTR(b);
+
+  VALUE ruby_int = INT2NUM(nilsimsa_compare(string_a, string_b));
+  return ruby_int;
+}
+
+RUBY_FUNC_EXPORTED void
+Init_nilsimsa_lite(void)
+{
+  VALUE rb_mNilsimsaLite = rb_define_module("NilsimsaLite");
+  rb_define_module_function(rb_mNilsimsaLite, "digest", rb_nilsimsa_digest, 1);
+  rb_define_module_function(rb_mNilsimsaLite, "compare", rb_nilsimsa_compare, 2);
+}

data/lib/nilsimsa_lite/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module NilsimsaLite
+  VERSION = "0.1.0"
+end

data/lib/nilsimsa_lite.rb

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+require_relative "nilsimsa_lite/version"
+require_relative "nilsimsa_lite/nilsimsa_lite"
+
+module NilsimsaLite
+end

data/sig/nilsimsa_lite.rbs

@@ -0,0 +1,4 @@
+module NilsimsaLite
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,59 @@
+--- !ruby/object:Gem::Specification
+name: nilsimsa_lite
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Sergio Gil
+bindir: bin
+cert_chain: []
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies: []
+description: Nilsimsa is a locality-sensitive hashing algorithm. Similar strings have
+  similar hashes. This library provides a way to generate this hashes, and compare
+  them
+email:
+- sgilperez@gmail.com
+executables: []
+extensions:
+- ext/nilsimsa_lite/extconf.rb
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- LICENSE
+- README.md
+- Rakefile
+- ext/nilsimsa-lite/LICENSE
+- ext/nilsimsa-lite/README.md
+- ext/nilsimsa-lite/nilsimsa.c
+- ext/nilsimsa-lite/nilsimsa.h
+- ext/nilsimsa_lite/extconf.rb
+- ext/nilsimsa_lite/nilsimsa_lite.c
+- lib/nilsimsa_lite.rb
+- lib/nilsimsa_lite/version.rb
+- sig/nilsimsa_lite.rbs
+homepage: https://codeberg.org/sgilperez/nilsimsa_lite
+licenses: []
+metadata:
+  homepage_uri: https://codeberg.org/sgilperez/nilsimsa_lite
+  source_code_uri: https://codeberg.org/sgilperez/nilsimsa_lite
+  changelog_uri: https://codeberg.org/sgilperez/nilsimsa_lite/CHANGELOG.md
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.1.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.6.9
+specification_version: 4
+summary: Ruby wrapper for nilsimsa-lite C library
+test_files: []