Life & fun · free · 2026
24 free alternatives to HyperLogLog intersections
HyperMinHash: Bringing intersections to HyperLogLog
Below are 24 products that do a similar job and cost nothing to start: 22 free outright and 2 with a free plan and paid upgrades. Each price was read from the product's own site. They are ranked by how close each is in meaning, then by launch-day votes.
- 1
HyperLogLog in ZigFree▲154Zig library for HyperLogLog estimation.
2023 · github.com · price checked November 2026
- 2

Formally verified polygon intersection is a Lean implementation of a polygon intersection algorithm with mathematical proof of correctness.
Jun 2026 · github.com · price checked November 2026
- 3
HypergraphZFree▲65HypergraphZ – directed hypergraph library in Zig with Python bindings
2024 · github.com · price checked November 2026
- 4

Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · price checked November 2026
- 5
FastGraphRAGFree▲457FastGraphRAG is an open-source retrieval-augmented generation system that combines knowledge graphs with the PageRank algorithm to improve information retrieval and reasoning.
2024 · github.com · price checked November 2026
- 6
PylarFree plan, paid from $20/mo▲502Pylar is a platform that enables secure connections between AI agents and data sources.
Dec 2025 · pylar.ai · price checked November 2026
- 7
Integer Map Data StructureFree▲91This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · price checked November 2026
- 8

Xarray-SQL is an array database library that represents N-dimensional arrays as tabular data with orthogonal dimensions mapped to primary keys.
Jul 2026 · github.com · price checked November 2026
- 9

This is a free, open-source Windows desktop application for counting road traffic from video.
2024 · github.com · price checked November 2026
- 10

HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf
2024 · github.com · price checked November 2026
- 11
HelixDBFree▲237HelixDB is an open-source vector-graph database written in Rust that combines vector and graph data types natively for AI applications.
2025 · github.com · price checked November 2026
- 12
SemHashFree▲19We’ve just open-sourced SemHash, a lightweight package for semantic text deduplication. It lets you effortlessly clean up your datasets and avoid pitfalls caused by duplicate samples in semantic search, RAG, and machine learning. Main Features: - Fast and hardware friendly: Deduplicate datasets with millions of records in minutes, on a CPU. - Flexible: Works on single or multiple datasets (e.g., train/test deduplication), and multi-column data (e.g., Question-Answering datasets). - Lightweight: Minimal dependencies (largest is NumPy). - Explainable: Easily inspect duplicates and what…
2025 · github.com · price checked November 2026
- 13
NerdlogFree▲134For more background and technical details, I wrote this up as well: https://dmitryfrank.com/projects/nerdlog/article
2025 · github.com · price checked November 2026
- 14
I ported Tree-sitter to GoFree▲222A Go implementation of Tree-sitter enables semantic code analysis across multiple tools.
Feb 2026 · github.com · price checked November 2026
- 15

This proof-of-concept system stores AI conversation memory as markdown files in a Git repository instead of using traditional vector databases.
2025 · github.com · price checked November 2026
- 16
Entropy-Guided LoopFree▲33TLDR: A small, vendor-agnostic inference loop that turns token logprobs/perplexity/entropy into an extra pass and reasoning for LLMs. - Captures logprobs/top-k during generation, computes perplexity and token-level entropy. - Triggers at most one refine when simple thresholds fire; passes a compact “uncertainty report” (uncertain tokens + top-k alts + local context) back to the model. - In our tests on technical Q&A / math / code, a small model recovered much of “reasoning” quality at ~⅓ the cost while refining ~⅓ of outputs. I kept seeing “reasoning” models behave…
2025 · github.com · price checked November 2026
- 17
PythagoraFree▲141Generate automated tests for your Node.js app via LLMs without developers having to write a single line of code.
2023 · github.com · price checked November 2026
- 18
HyperZigFree▲18HypergraphZ – directed hypergraph library in Zig with Python bindings
2024 · github.com · price checked November 2026
- 19ABA benchmark platform for graph databasesFree plan▲83
This platform provides benchmarking tools for graph databases, allowing users to test and compare performance across different systems.
2022 · memgraph.com · price checked November 2026
- 20
KlarityFree▲132We've open-sourced Klarity - a tool for analyzing uncertainty and decision-making in LLM token generation. It provides structured insights into how models choose tokens and where they show uncertainty. What Klarity does: - Real-time analysis of model uncertainty during generation - Dual analysis combining log probabilities and semantic understanding - Structured JSON output with actionable insights - Fully self-hostable with customizable analysis models The tool works by analyzing each step of text generation and returns a structured JSON: - uncertainty_points: array of {step, entropy,…
2025 · github.com · price checked November 2026
- 21

Zig Topological Sort Library for Parallel Processing is a dependency graph management library for Zig that builds dependency graphs, performs topological sorting, and generates dependency-free…
2025 · github.com · price checked November 2026
- 22
Formally verified 3D CSGFree▲115To my knowledge, this is the first formally verified implementation of a 3D constructive solid geometry (CSG) operation: mesh intersection, implemented in Lean 4 and verified against a concise specification that pins down the surface of the resulting mesh exactly and guarantees practical well-formedness conditions on the triangulation. This project is also an experiment in avoiding having to trust AI-generated code. A human reviewer only needs to read 93 lines of formal specification and run the Lean checker to certify the correctness of the kernel, skipping the intricate 1000+ lines of…
Jul 2026 · github.com · price checked November 2026
- 23
GonzoFree▲74Gonzo is a terminal user interface for analyzing logs, built in Go with support for JSON, text, and OpenTelemetry (OTLP) formats.
2025 · github.com · price checked November 2026
- 24
HopperFree▲101Hopper is an agentic development environment designed for mainframe and COBOL systems.
May 2026 · hypercubic.ai · price checked November 2026
All alternatives to HyperLogLog intersections, paid too →About HyperLogLog intersections →
Free means the product’s own site says it is free or offers a free plan, as read on the date shown. Plans change; check the site before you rely on one.