Compliance audit evidence architecture for enterprise LLM deployment in financial services — Reference Architecture
The control that resolves this is an Attestable Inference Plane, evaluated before the request reaches a model provider rather than audited afterwards. In financial services the binding constraint is SOC 2 Type II, and the question it actually asks is did this control operate effectively for the whole observation window. The shape below holds p95 ≤ 400ms over REST over HTTPS, and ships with a standard-library implementation that runs as written.
Technical parameters
Every value below is a parameter you can hold a vendor or an internal team to. Adjectives are not acceptance criteria.
| Deployment vector | Customer-managed VPC, provider model endpoint pinned to region |
|---|---|
| Security standard | SOC 2 Type II |
| Applicable regimes | SOC 2 Type II, PCI DSS 4.0, SOX, DORA, GLBA |
| Latency SLA | p95 ≤ 400ms — front-office surfaces break above 400ms; batch reconciliation does not |
| Integration protocol | REST over HTTPS — the widest compatibility and the easiest audit story |
| Idempotency control | an Idempotency-Key header, honoured for 24h |
| Throughput envelope | ~2k rps per gateway node before connection churn dominates |
| Middleware requirement | tokenisation vault + deterministic redaction gateway |
| Data classes in scope | PAN, account numbers, MNPI, KYC documents |
| Retention obligation | 7 years for books and records (SEC 17a-4), WORM storage |
| Data residency | EU workloads must stay in-region under DORA Article 29 |
| Contractual instrument | DPA plus a signed subprocessor schedule |
| Systems of record | Temenos, Finastra, Murex, SAP FI |
| Primary failure mode | a retried POST creating a duplicate record |
Risk register with acceptance criteria
Each row carries an acceptance parameter rather than an adjective, because "low latency" cannot be signed off. Retention here is bound by 7 years for books and records (SEC 17a-4), WORM storage.
| Category | Risk | Control | Acceptance parameter |
|---|---|---|---|
| SOC 2 Type II | Evidence population has gaps across the observation window | Emit a control-execution record on every request, not on exceptions; alert when daily volume drops below the expected floor | 0 days with no control records across the window |
| Data privacy | Prompt and completion bodies persisted in the audit store | Redact before sealing; store sha256 digests of sensitive fields, never values | 0 raw PII fields in the audit store; digest-only verified by schema test in CI |
| Data privacy | Subprocessor exposure not disclosable to the customer | Pin provider + region per tenant; publish the subprocessor list as a versioned artifact | Subprocessor list version referenced in every DPA; drift alert on change |
| Latency SLA | Sealing and redaction added to the synchronous request path | Redact inline (cheap, deterministic); seal and persist asynchronously via an outbox | Added p95 under 12ms; outbox lag alert over 30s |
| Latency SLA | Verifier scan over a long chain blocks the audit window | Checkpoint every 10k records; verify the delta against the last signed checkpoint | Full-chain verify under 60s per tenant per million records |
| Cost control | Audit volume grows faster than inference spend | Tier the store: hot 30 days, cold object storage to the retention horizon | Audit storage held under 4% of inference spend |
| Cost control | Retention over-collection creates both cost and liability | Per-class retention clock with documented, automated deletion | 0 records past their class retention horizon; deletion log reconciles monthly |
| Operational | Key rotation breaks historical seal verification | Record key id per record; verifier resolves the key id against the KMS key history | Rotation rehearsed quarterly; historical verification passes post-rotation |
The control gap
The model works and the pilot passed. The rollout is stopped by a control gap: the team can show that inference happened, but cannot produce per-tenant, tamper-evident evidence of WHAT was processed, by WHOM, under WHICH retention rule — which is the evidence an auditor asks for and a shared application log cannot give.
What SOC 2 Type II specifically requires
SOC 2 Type II is not a point-in-time assertion. The auditor samples evidence across a 3-12 month observation window and asks whether the control operated on every day of it, not whether it exists today.
The artifact that satisfies it is a sampled, time-ordered population the auditor can draw from. The way teams most often fail it: the control was added mid-window, so the population has a hole and the observation period restarts.
Implementation components
- Policy decision point — Evaluates tenant, data class and purpose before the call. Fails closed.
- Redaction stage — Strips sensitive values and substitutes digests, BEFORE anything is sealed.
- Per-tenant hash chain — Each record commits to the previous digest, keyed per tenant.
- HMAC seal — A KMS-held key makes records unforgeable by anyone with store write access.
- Retention scheduler — Enforces the per-class retention clock and records the deletion.
- Verifier endpoint — The function you run in front of the auditor to prove the chain is intact.
Reference architecture
Attestable Inference Plane — the request path, with the decision points that must exist before the first model call:
flowchart LR
C[Client / Agent] --> G[Gateway]
G --> PDP{Policy Decision Point<br/>tenant - class - purpose}
PDP -->|deny| D[403 + denial record]
PDP -->|allow| R[Redaction stage<br/>values to digests]
R --> M[Model provider]
M --> S[Seal: sha256 chain + HMAC]
S --> L[(Per-tenant audit store)]
L --> V[Verifier endpoint]
V --> A[Auditor evidence pack]
L --> RT[Retention scheduler]
RT -->|expiry| X[Documented deletion]Implementation artifact — Per-tenant tamper-evident audit chain
Standard-library Python, no external dependencies, runs as written. Executed by the publish gate: if it raises, this page does not ship. Wire it behind REST over HTTPS; the failure mode it guards against is a retried POST creating a duplicate record. The output you hand the assessor is the observation-window evidence export.
"""Per-tenant, tamper-evident audit log for an LLM gateway.
Why this shape: a SOC 2 auditor does not ask "do you log?" — they ask whether a
log entry can be altered after the fact without detection, and whether tenant A
can ever read tenant B's entries. A plain append-only table answers neither.
This answers both with a per-tenant hash chain: each record commits to the
previous record's digest, so any edit or deletion breaks the chain at a
detectable point, and the chain is keyed per tenant so isolation is structural
rather than a WHERE clause someone can forget.
"""
import hashlib
import hmac
import json
import os
import time
from dataclasses import dataclass, field
GENESIS = "0" * 64
def _canonical(obj) -> bytes:
# Digests must be stable across processes and Python versions, so the JSON
# has to be canonical: sorted keys, no insignificant whitespace.
return json.dumps(obj, sort_keys=True, separators=(",", ":")).encode()
@dataclass
class AuditChain:
"""Append-only, per-tenant hash chain with an HMAC seal.
secret: a per-deployment key from your KMS. It makes the seal
unforgeable by anyone who only has write access to the store.
"""
secret: bytes
heads: dict = field(default_factory=dict) # tenant_id -> last digest
def append(self, tenant_id: str, event: dict) -> dict:
if not tenant_id:
raise ValueError("tenant_id is required: an unattributed audit "
"record cannot satisfy per-tenant evidence")
prev = self.heads.get(tenant_id, GENESIS)
record = {
"tenant_id": tenant_id,
"ts": event.get("ts") or time.time(),
"actor": event.get("actor"),
"action": event["action"],
"resource": event.get("resource"),
"prev": prev,
# Redaction happens BEFORE sealing. Sealing a payload you later
# need to redact forces you to break your own chain.
"payload": redact(event.get("payload") or {}),
}
digest = hashlib.sha256(_canonical(record)).hexdigest()
seal = hmac.new(self.secret, digest.encode(), hashlib.sha256).hexdigest()
record["digest"] = digest
record["seal"] = seal
self.heads[tenant_id] = digest
return record
def verify(self, tenant_id: str, records: list) -> tuple:
"""-> (ok, first_broken_index). This is the function you demo to the
auditor; without it the chain is a claim rather than evidence."""
prev = GENESIS
for i, r in enumerate(records):
if r.get("tenant_id") != tenant_id:
return False, i # cross-tenant record in the stream
body = {k: r[k] for k in
("tenant_id", "ts", "actor", "action", "resource",
"prev", "payload")}
if r.get("prev") != prev:
return False, i
if hashlib.sha256(_canonical(body)).hexdigest() != r.get("digest"):
return False, i
expect = hmac.new(self.secret, r["digest"].encode(),
hashlib.sha256).hexdigest()
if not hmac.compare_digest(expect, r.get("seal", "")):
return False, i
prev = r["digest"]
return True, -1
SENSITIVE_KEYS = {"prompt", "completion", "email", "ssn", "dob", "mrn",
"card", "iban", "phone", "address", "name"}
def redact(payload: dict, keep_hash: bool = True) -> dict:
"""Drop sensitive values, keep a digest so you can still prove WHICH
payload was processed without storing the payload itself.
This is the control that lets you keep audit evidence under GDPR data
minimisation and an HIPAA BAA at the same time."""
out = {}
for k, v in payload.items():
if k.lower() in SENSITIVE_KEYS:
out[k] = ("sha256:" + hashlib.sha256(
_canonical(v)).hexdigest()[:16]) if keep_hash else "[redacted]"
elif isinstance(v, dict):
out[k] = redact(v, keep_hash)
else:
out[k] = v
return out
if __name__ == "__main__":
chain = AuditChain(secret=os.environb.get(b"AUDIT_HMAC_KEY", b"dev-only-key"))
stream = [
chain.append("tenant-a", {"actor": "svc:rag", "action": "inference",
"resource": "gpt-4o",
"payload": {"prompt": "patient MRN 9912",
"tokens": 318}}),
chain.append("tenant-a", {"actor": "u:42", "action": "export",
"resource": "conversation/77"}),
]
print("redacted payload:", stream[0]["payload"])
print("chain verifies:", chain.verify("tenant-a", stream))
stream[0]["payload"]["tokens"] = 1 # tamper
print("after tamper: ", chain.verify("tenant-a", stream))
Questions to answer before approval
- Show me the control-execution population for the full window, and the days where it is empty.
Every request emits an execution record, so the population is continuous by construction. A gap is an alertable incident, not something discovered during the audit. - Can you produce, for one named tenant, every inference record in a date range with proof none was altered?
Yes — the verifier endpoint replays that tenant's hash chain for the date range and reports the first index at which the chain breaks. Each record commits to the previous record's digest, so an edit or deletion is detectable rather than merely unlikely. - Where exactly in the request path are sensitive values removed, and what is stored in their place?
In the redaction stage, before the record is sealed. Sensitive values are replaced with a sha256 digest of the value, so you can still prove which payload was processed without retaining the payload. - Which key seals the records, who can use it, and what happens to verification after rotation?
An HMAC key held in your KMS, usable only by the sealing service. Each record stores the key id it was sealed with, so the verifier resolves historical records against the KMS key history and rotation does not invalidate past evidence. - What is the retention clock per data class, and what evidence proves deletion occurred?
A retention clock per data class, enforced by the retention scheduler, which writes a deletion record when a record passes its horizon. The deletion log is what you show the auditor; reconcile it monthly against records in the store. - Can tenant A's records ever appear in tenant B's evidence pack, and what makes that structurally impossible?
No. The chain is keyed per tenant and the verifier rejects any record whose tenant_id does not match the stream being verified, so isolation is structural rather than a WHERE clause that can be forgotten.
Source discussions
This page exists because the problem is reported publicly. The threads below are the primary sources, linked unmodified and not affiliated with this site.
- Show HN: PEC – A proposal for compliance metadata in the Model Context Protocol hackernews · hn/story · 2026-01-12
- Technical scanner that drafts legal documents (Privacy policy etc.) for your MVP hackernews · hn/comment · 2026-02-04
- Show HN (YC S25): Well – MCP AI-Based Collection of Invoices hackernews · hn/story · 2025-05-02
- BasaltCRM – The Open Source AI-Native CRM Built on Next.js 16 hackernews · hn/comment · 2026-02-23
Adjacent problems
- Part of enterprise ai compliance architecture.
- on-premises compliance audit evidence architecture for enterprise LLM applies the same mechanism under a different obligation.
- Where this interacts with another regime, see audit trail compliance architecture for enterprise AI.
- latency compliance data governance framework for enterprise LLM deployment covers the adjacent case.
- A different failure mode of the same component: EU AI Act audit evidence architecture for enterprise LLM deployment.
- If this is the blocker in front of you: enterprise AI infrastructure review.
Enterprise infrastructure review
If you are carrying this blocker, the useful next step is not a demo. It is a review of your actual request path against the control points above:
- Which of the 6 components exist in your estate today, and which are assumed
- Your current numbers against the 7 acceptance parameters, starting with p95 ≤ 400ms
- Which SOC 2 Type II control questions you cannot yet answer, and what closes each gap