Semantic cache lab
Debug cancel-trial versus cancel-plan false hits
Page 5 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 the exact failure class you will see when you inject false hit that reuses the wrong policy answer into the smallest fixture. What incorrect fix would hide the bug without restoring the invariant?
1Learn the idea
Read
Build focus
Break the artifact on purpose. The most important failure family is false hit that reuses the wrong policy answer. Reproduce one failure with the smallest possible input, inspect the intermediate values, and fix the boundary or algorithm rather than catching every exception. Retrying deterministic bad input only repeats the same mistake; a retry is justified only for a transient dependency.
Classic failure: “cancel my trial” vs “cancel my paid plan.” Reproduce it, require policy-key match, raise threshold, and bypass high-risk intents. On cache outage, fail open to a fresh model call.
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 debugging step: break the artifact on purpose. 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 lookup(score, threshold, policy_ok, high_risk):
if high_risk: return "bypass"
if not policy_ok: return "miss"
return "hit" if score>=threshold else "miss"
print(lookup(0.96, 0.92, True, True))
Expected output: bypass for high-risk intent. 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
Reproduce false hit that reuses the wrong policy answer as a fixture. Fix one cause at a time. Do not catch broad exceptions and return an apparently successful answer. At the debugging 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
Record latency and failure class for each injected fault. Clear degradation beats a wrong success. For this debugging 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
- [ ] Can I reproduce the failure with one minimal input?
- [ ] Did I fix the first broken invariant instead of masking the exception?
- [ ] Does a neighboring valid case still pass?
- [ ] Do I recognize false hit that reuses the wrong policy answer in logs?
Glossary: semantic cache · Glossary: model routing · Glossary: cosine similarity