{"categories":[{"label":"Information Analysis","url":"https://skillfed.io/packages/category/scientific-engineering-information-analysis/3"}],"enrichment":{"capability":"Rensa computes MinHash signatures for fast similarity estimation and deduplication of large datasets using Rust-backed algorithms with Python bindings.","skillfed_tags":["deduplication","similarity-search","rust-bindings"],"use_cases":["Find and remove near-duplicate documents or SQL queries in large datasets using LSH indexing and batch deduplication.","Estimate Jaccard similarity between tokenized text sets without computing exact set intersection.","Build a searchable index of document signatures to quickly retrieve candidates above a similarity threshold.","Deduplicate synthetic or generated datasets where exact matching is too strict but similarity thresholds are appropriate.","Batch-process thousands of token sets into MinHash signatures with minimal Python call overhead."],"what_it_does":"Rensa is a Rust-based MinHash library that estimates Jaccard similarity between sets and identifies near-duplicates in large datasets. It implements two variants: R-MinHash (Rensa's own, optimized for speed) and C-MinHash (based on published research with formal variance bounds). The core algorithm applies k random hash functions to a set and keeps the minimum value from each; sets sharing many elements produce similar minimums, and the fraction of matching slots estimates the Jaccard index.\n\nRensa replaces the traditional modular reduction step with multiply-shift hashing, which is faster on modern CPUs and naturally produces 32-bit signatures (half the memory of standard implementations). It includes batch APIs for bulk operations, LSH (Locality Sensitive Hashing) indexing for efficient candidate retrieval, and a deduplicator for end-to-end workflows. The library has no runtime dependencies and supports Python 3.8 and later on CPython and PyPy.","worth_installing":"Yes. Rensa is actively maintained, has no known vulnerabilities, carries a permissive MIT license, and offers substantial speed gains over comparable Python libraries (datasketch, FastSketch) with near-identical results. Install friction is moderate due to compiled bindings, but prebuilt wheels cover common platforms. Use it if you need to deduplicate or find similar items in large datasets and speed matters."},"id":"rensa","links":{"html":"https://skillfed.io/packages/rensa","md":"https://skillfed.io/packages/rensa.md","pypi":"https://pypi.org/project/rensa/"},"maintenance":{"status":"active"},"meta":{"latest_release":"2026-07-23","license_spdx":null,"license_treatment":"permissive","name":"rensa","python_support":"supports_current","summary":"High-performance MinHash implementation in Rust with Python bindings - 40x faster than datasketch"},"popularity":{"monthly_downloads":96884,"position":13188,"tier":"top_15000"},"security":{"n_vulnerabilities":0},"version":"0.4.1"}