Close enough is exactly right.
The Fuzzy is an approximate retrieval engine. Typos, partial hashes, noisy sensor readings, mutated DNA — it finds the neighbourhood anyway. Built on the Mirror Trie Binary, a patent-pending data structure that turns approximate search into a bounded tree traversal.
Measured, not promised.
Rust core, release build with LTO, single thread, arena allocator, 500 queries per data point. BK-Tree is the baseline.
Three passes.
Bounded by the bits.
A Mirror Trie Binary stores hashes as paths, one bit per level. Each node is a mirror — branching left and right on the same decision. Approximate search becomes a guided descent with an error budget.
-
Phase 1
Exact descent.
Walk the trie bit by bit. If the target is present, it lands in O(hash-length). If not — exploration begins from the last matching node.
-
Phase 2
Mirror exploration.
At each node along the path, allow up to d − 1 further flips. The error budget shrinks with depth; the tree prunes itself.
-
Phase 3
Multi-probe union.
Flip each high-bit independently, union the results. This is where the 99.8% recall comes from — and the cost is still sub-linear in the dataset.
Three ways to see it run.
Live Playground
Type a query, drag the distance slider, watch the trie traversal light up in real time. Real Rust-to-WASM engine, not a mock.
Open →Games
Code-break, typo-catcher, DNA mutation match. Mini-games that demonstrate Hamming distance, multi-probe, and radix-4 in the wild.
Play →API Reference
Three endpoints. /v1/index, /v1/search,
/v1/stats. Python/Rust SDKs, curl examples, rate-limit
docs, batch ingestion.
Anywhere perfect input is a lie.
Match a password against billions of breached hashes — with typo tolerance. One bit flipped ≠ secure.
Radix-4 variant. Mathematically proven 100% recall for single nucleotide polymorphism search. 82× speedup at 500K.
Users mis-type. Your search layer doesn't have to punish them. Pull candidates within edit distance 2.
Find mutated malware samples, re-compressed media, near-duplicate documents — across TrueFile / PhotoDNA / ssdeep spaces.
Free to start.
Pay when it scales.
For weekend experiments.
- 10 K queries / month
- 1 index, up to 100 K keys
- Community support
For production workloads.
- 2 M queries / month
- Unlimited indexes, 10 M keys each
- 99.8% recall guaranteed
- Email support · 24h SLA
Air-gapped, on-prem, custom.
- On-premise binaries
- Patent licensing included
- Dedicated engineering