Semantic cache lab
Define policy keys, TTL, and similarity contracts
Page 2 advances one concrete tenant-scoped semantic answer cache: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.
Before you start
Why this matters
Predict which field in the tenant-scoped semantic answer cache contract must reject a bad value before any model or database work runs. Name one wrong output that would still look fluent to a reviewer who only reads the final answer.
1Learn the idea
Read
Build focus
Make malformed input fail before it reaches the interesting algorithm. The accepted contract is normalized question, tenant, policy key, corpus version, and embedding vector. This boundary matters because false hit that reuses the wrong policy answer often begins as a value that should never have been accepted. Keep transformation functions separate from scoring, retrieval, training, or generation so a test can identify which boundary changed the data.
Keys must include tenant, auth scope/policy key, corpus version, prompt version, and model version. TTL alone cannot fix a policy change. Validate threshold ranges and refuse to start with an absurdly low threshold in production profiles.
The artifact's user-facing goal is specific: reuse answers for paraphrases only when tenant, policy key, and similarity thresholds all match. Its accepted input is normalized question, tenant, policy key, corpus version, and embedding vector. Those statements are intentionally narrower than “build an AI system.” Narrow scope lets us inspect every input and expected result, and it prevents a toy result from being presented as a production claim. System shape for this chapter: a request normalizer derives policy fields, an embedding model maps the question to a vector, a tenant-scoped cache retrieves the nearest entry, and a threshold plus exact policy-key match decides hit or miss before the normal LLM path stores a versioned result. Keep model calls behind adapters, keep authorization and validation in deterministic code, and carry stable IDs and versions through every response. That separation lets you decide whether a bad result came from input handling, retrieval, inference, validation, or deployment. This page's job is the data contract step: make malformed input fail before it reaches the interesting algorithm. Setup baseline for the chapter (run once per machine, not secrets in git):
python -m venv .venv && source .venv/bin/activate
pip install numpy
export CACHE_THRESHOLD=0.92 CACHE_TTL_SECONDS=3600
If hardware or a hosted provider differs, preserve the interface and expected behavior. Do not present provider syntax as universal—when a vendor adapter is unavoidable, keep it behind a thin boundary and test with a fake first. The deliverable is not “it ran once”; it is a reproducible artifact another developer can inspect, including expected output and one deliberate failure related to false hit that reuses the wrong policy answer. Operationally, write down the owner of this stage, the command you ran, the observed output, and the next page's dependency on that output. If you cannot point to a file, fixture, metric, or config key, the stage is not done. Prefer small, reviewable increments: one contract, one path, one metric, one failure, one gate. When tradeoffs appear—latency versus quality, hit rate versus false hits, local privacy versus cloud quality—record both numbers instead of moving the threshold until the report looks green. The chapter ships only when evidence for false-hit rate 0 on high-risk intents in the test set, with measured hit rate and token savings and a rehearsed recovery path exist beside semantic cache with TTL, versioned keys, and SEMANTIC_CACHE_ENABLED kill switch.
Read
Run the example
Save this as lesson.py and run python3 lesson.py. Prefer the standard library or the pinned packages from the setup block so the example stays reproducible.
def cache_key(tenant, policy_key, corpus_version):
assert tenant and policy_key and corpus_version
return f"{tenant}|{policy_key}|{corpus_version}"
print(cache_key("acme","returns","faq-v3"))
Expected output: acme|returns|faq-v3 key. Exact floating-point formatting may vary slightly, but the asserted behavior must not. Read the output as evidence about this stage, not merely proof that the interpreter started.
Read
Debug the stage
Print rejected inputs with the violated field names. Silent coercion is how false hit that reuses the wrong policy answer later looks like a model problem. At the data contract stage, save the smallest failing fixture beside the expected result. Change one cause at a time and rerun the exact command printed above; that makes the repair reviewable and keeps this chapter's progressive artifact reproducible.
Read
Evaluate before continuing
Contract tests must run offline without credentials when possible. Quality claims wait for labeled sets. For this data contract page, preserve the fixture and result as evidence for the next page. Label observations separately from conclusions: a passing assertion establishes the behavior it names, while broader usefulness requires the chapter's full evaluation set and stated operating limits. Primary metrics for the chapter remain false-hit rate 0 on high-risk intents in the test set, with measured hit rate and token savings.
Continue learning · glossary & guides
- [ ] Which malformed values are rejected before the algorithm?
- [ ] Can transformation and core logic be tested separately?
- [ ] Does the error identify the violated field or shape?
- [ ] Is normalized question, tenant, policy key, corpus version, and embedding vector enforced in code?
Glossary: semantic cache · Glossary: model routing · Glossary: cosine similarity