RTS questionnaire · Q15 · GenAI proof

Have you worked with Generative AI, Agentic AI, or MCP (Model Context Protocol)?

A runnable review of how these systems are built to be trustworthy: retrieval before generation, typed tools for agents, guardrails around the model and evaluation before every release.

Status: reviewed Live GenAI workflow RAG · Agents · MCP Jump to live proof ↓

15. Generative AI, agentic AI and MCP

Answer as submitted

“Yes — RAG, embeddings, Llama-3 QLoRA fine-tuning, agentic workflows and MCP servers.”
Technical decision: expand. The submitted line lists techniques but not the engineering that makes them dependable. This page is the separate, detailed version: it shows retrieval-grounded answering, the honest choice between fine-tuning and prompting, typed tool-calling for agents, and the guardrails and evals that keep a probabilistic system inside its bounds.

Expanded answer

Yes — this is active practice, not theory. I build RAG pipelines (chunking strategy, embeddings, vector search over pgvector/FAISS-style stores, citation-forced prompting, context-window and cost control), run fine-tuning only where it earns its keep (QLoRA adapters on Llama-3-class models for style and format, never to patch missing knowledge), wire agentic workflows through MCP with schema-typed tools and confirmation on anything that writes, and put guardrails around the model: PII redaction before the prompt, prompt-injection checks on retrieved text, tool allow-lists and strict output schemas. Every prompt or model change is measured against a golden set with regression checks, and cost and latency are tracked per request.

DecisionTypical implementationWhy it is done this way
Groundingretrieve → prompt with context → cite the sourceAn answer the business can verify, instead of text from memory.
Retrievalchunking with overlap, hybrid vector + keyword searchPuts the right passage in context and nothing else.
Fine-tuningQLoRA adapter for style and formatShapes output without pretending to add knowledge.
AgentsMCP tools with typed schemasThe model's reach is exactly the tool contract — no more.
Write actionsconfirmation step + optimistic concurrencyAutonomy stays bounded where state actually changes.
Privacy & safetyPII redaction, injection checks, output schemaGuardrails around the model, not promises inside the prompt.
Quality gategolden set + LLM-as-judge + regressionA prompt change is released with evidence, like any other change.

Live GenAI delivery workflow proof

The running component below changes its decision/result view through real event binding. Select a step to see the technique, the reasoning behind it, and the measurement that keeps it honest.

LIVE PREVIEW
RUNNING
GENAI WORKFLOWRUNNING

Choose a GenAI step

Select a step to inspect the decision, the reasoning and the measured result.

$ embed(query) → vector search (top-k) → prompt with context → answer with citations

The model answers from retrieved context and cites it, instead of answering from memory. That is what makes an answer verifiable and auditable by the business.

top-8 of 12,400 chunks  ·  recall@8 0.94
6 of 6 claims resolve to a source

Why the system is built this way

Rules I apply. Retrieve before generating and force a citation; keep knowledge in the index rather than in the weights; expose capability to an agent only as schema-typed tools, with confirmation on write actions; minimise data before the prompt and validate whatever comes back; measure every change against a golden set; and track cost and latency per request. The model is a component with a probabilistic boundary — the surrounding engineering is what makes it usable in a business process.
Boundary for Q15: this page covers applied GenAI delivery — retrieval, adaptation, agents and evaluation. Model pre-training, GPU infrastructure sizing and provider-specific commercial terms are separate topics.

Source files

Select a file to inspect the proof with syntax highlighting and line numbers. The first file is the code running the component above; the other two are the production shapes of the same decisions.

Acceptance criteria