Type. Tune.
Watch it land.
A real Mirror Trie Binary runs in your browser below. Data: 500 common English words, hashed to 16-bit signatures. Change the query, change the distance, watch the traversal path and the recall climb.
Every word in the dataset is hashed to 16 bits and inserted as a path through a binary trie. Your query gets the same treatment. The engine descends bit-by-bit. When it can't match, it mirrors. When the error budget runs out, it returns.
Mirror-only exploration has blind spots at high distance. Multi-probe re-runs the search with each of the top bits flipped independently and unions the results. Recall jumps from ~48% to 99.8%.
The real engine uses 64-bit hashes, arena allocation, SIMD batch probes, and a Rust core compiled with LTO. Client-side demo here uses 16-bit for clarity and is single-pass.