Merlin
the memoryalone: 15% of the reference rate
Hashes every incoming prompt and asks one question: have we done this before? A live in-VRAM registry answers in microseconds; a durable on-disk ledger survives restarts and moves byte-identical between machines. A lookup is only a hit when two independent hashes agree, so it never returns the wrong memory. Merlin also runs standalone as deduplication, against any provider including pure API setups.
1.4 µs to select · exact addressing makes zero errors where approximate retrieval picks wrong 94.3% of the time