Life & fun · alternatives · 2026
24 alternatives to HyperLogLog intersections
HyperMinHash: Bringing intersections to HyperLogLog - axiomhq/hyperminhash
HyperLogLog intersections is a GitHub-hosted project that implements intersection operations using the HyperLogLog probabilistic data structure. Designed for developers working with large datasets, it provides an… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. HyperLogLog intersections launched in 2018; newer entries below may have overtaken it.
- 1
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom - axiomhq/hyperloglog
2017 · github.com · its alternatives →
- 2
Zig library for HyperLogLog estimation. Contribute to axiomhq/zig-hyperloglog development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 3IM
This is the first iteration of a short game I’m making that tries to interactively explain some of my favorite math questions / ideas. My goal is mostly to get the player curious and not necessarily to explain absolutely everything. There were a lot of fun technical parts to building this: - For implementation reasons, it’s much easier if the lines all have integer intersection points with each other. To do this, when a new line is added I “cheat” by rounding intersections to integers and then splitting the old lines at the intersection into new linds (with potentially different slopes)…
2024 · rahulilango.com · its alternatives →
- 4
To my knowledge, this is the first formally verified implementation of an intersection algorithm for polygons. The experience of working with AI agents on this project changed a lot with recent model releases, as I describe in the readme. Opus 4.8 is able to provide algorithm implementation with formal proof in one shot, whereas previous models required me to provide proof strategies in multiple steps. Trust in the correctness comes entirely from the Lean checker and human review of a small specification, not from the LLM. Also check out the web demo built around the verified core linked in…
Jun 2026 · github.com · its alternatives →
- 55N
2021 · thishashcollisionisnotporn.com · its alternatives →
- 6
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 7
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 · its alternatives →
- 8
a minimal versioned log structured relational DB in Common Lisp - GitHub - codr7/whirlog: a minimal versioned log structured relational DB in Common Lisp
2021 · github.com · its alternatives →
- 9CH
Hi HN! We're thrilled to share CozoDB v0.6, a monumental update to our FOSS database, which already unifies relational and graph features. With the addition of vector search, CozoDB becomes an even better companion for LLMs like ChatGPT. This release introduces vector search using HNSW indices within Datalog, enabling seamless integration with powerful features such as ad-hoc joins, recursive Datalog, and classical whole-graph algorithms. This update significantly broadens CozoDB's capabilities. Check out the linked release note for an in-depth look at the new features, comparisons to other…
2023 · docs.cozodb.org · its alternatives →
- 10
Contribute to seiflotfy/pcsa development by creating an account on GitHub.
2018 · github.com · its alternatives →
- 11
This 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 · its alternatives →
- 12
Hypergraph is a data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices. - yamafaktory/hypergraph
2021 · github.com · its alternatives →
- 13
Everything that would be here is in the README. I hope this gets big, it has tons of potential.
2013 · github.com · its alternatives →
- 14
A simple re-implementation of Google's sparsehash as a learning excercise. - qpfiffer/Simple-Sparsehash
2015 · github.com · its alternatives →
- 15
Proof of Concept : generating collisions on a neural perceptual hash - collisionLSH.py
2021 · gist.github.com · its alternatives →
- 16
Geohashes in proximity. Contribute to ashwin711/proximityhash development by creating an account on GitHub.
2017 · github.com · its alternatives →
- 17
We’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 · its alternatives →
- 18
TLDR: 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 · its alternatives →
- 19
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 20
Hey HN! We're excited to introduce Logwise, our new AI-powered log analysis tool. (built by two devs who hate logs) Product page: https://logwise.framer.website/ Logwise makes debugging and incident response faster for developers. It uses natural language processing to automatically parse log data, surface insights, and detect anomalies. We built Logwise to eliminate the manual sifting of log analysis. Key features: - Search logs in plain English - no complex queries needed - Auto-generated alerts highlight potential issues - Contextual debugging advice speeds incident…
2023 · logwise.framer.website · its alternatives →
- 21
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings - dnbaker/sketch
2017 · github.com · its alternatives →
- 22
Token-efficiency linter for LLM prompts and payloads - ritenv/tokensift
Aug 2026 · github.com · its alternatives →
- 23GA
Just a quick little feature I implemented over the weekend. TODO: Assure that polygons can be palindromic as well
2024 · altayakkus.dev · its alternatives →
- 24TY
2021 · phoe.github.io · its alternatives →
Also compare
- An improved version of HyperLogLog alternatives
- HyperLogLog in Zig alternatives
- I made a puzzle game that gently introduces my favorite math mysteries alternatives
- Formally verified polygon intersection – Opus 4.8 oneshots, prev failed alternatives
- 59a34eabe31910abfb06f308 – NeuralHash Collision Demo alternatives
- HypergraphZ – A Hypergraph Implementation in Zig alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →