A semantic cache that makes repeat answers free
Most requests to an assistant are near-duplicates of earlier ones. We embed each prompt locally, store the vector in Postgres with pgvector, and serve a cached completion when cosine similarity clears a per-model threshold — the upstream is never called, so the marginal cost of that answer is zero.
- Local embedding model — no per-lookup cost to a third party
- Cosine recall gated at ≥ 0.92, bucketed by billing SKU
- Cache hits save up to 90%: cached input billed at a fraction of the usual rate
- Scoped to non-streaming single-turn calls where a hit is safe