PCI DSS 4.0 audit evidence architecture for enterprise LLM deployment — 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 regulated enterprise the binding constraint is PCI DSS 4.0, and the question it actually asks is is cardholder data in scope, and can you prove it is not. The shape below holds p95 ≤ 600ms over durable queue (SQS / Kafka) with an outbox, and ships with a standard-library implementation that runs as written.
Enterprise implementation 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 | PCI DSS 4.0 |
| Applicable regimes | SOC 2 Type II, ISO/IEC 27001:2022, GDPR |
| Latency SLA | p95 ≤ 600ms — interactive surfaces need sub-second; batch jobs do not |
| Integration protocol | durable queue (SQS / Kafka) with an outbox — writes must survive a downstream outage |
| Idempotency control | the outbox row is the idempotency record |
| Throughput envelope | decoupled; the queue absorbs the burst the model tier cannot |
| Middleware requirement | policy decision point in front of the model gateway |
| Data classes in scope | PII, commercial-in-confidence data |
| Retention obligation | per the data class retention schedule, enforced automatically |
| Data residency | contracted processing region, asserted on every response |
| Contractual instrument | DPA plus a disclosed subprocessor list |
| Systems of record | SAP, Salesforce, Workday |
| Primary failure mode | a consumer crash between side effect and acknowledgement |
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 per the data class retention schedule, enforced automatically.
| Category | Risk | Control | Acceptance parameter |
|---|---|---|---|
| PCI DSS 4.0 | A PAN in a prompt pulls the inference tier into PCI scope | Tokenise before the model boundary and prove segmentation with a penetration test at least annually | Segmentation test passes; 0 PANs detected in prompt or completion stores by continuous scanning |
| 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 |
Where the rollout actually stalls
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 PCI DSS 4.0 specifically requires
PCI scope is contagious: any system that stores, processes or transmits cardholder data — or can affect the security of one that does — is in scope. The cheapest control is to keep the model tier out of scope entirely.
The artifact that satisfies it is a segmentation test proving the model tier is out of scope. The way teams most often fail it: a PAN reaching a prompt log, dragging the whole inference tier into PCI scope.
Modular implementation framework
- 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.
The request path
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]The implementation — 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 durable queue (SQS / Kafka) with an outbox; the failure mode it guards against is a consumer crash between side effect and acknowledgement. The output you hand the assessor is the segmentation test report.
"""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))
The PCI DSS 4.0 control, as code
PAN tokenisation and a scope-reduction proof. This is the artifact an assessor asks for under PCI DSS 4.0 specifically — it is not the same control as the one above, and a system that implements one does not thereby implement the other. It executes under the same publish gate.
"""PAN detection with tokenisation, and a scope-reduction proof.
PCI DSS 4.0 scope is everything that stores, processes or transmits account
data, plus anything connected to it. The cheapest compliance move is not better
controls — it is removing systems from scope. A model gateway that never sees a
PAN is out of scope; one that sees it once is in, along with everything it talks
to.
"""
import hashlib
import re
PAN_RE = re.compile(r"\b(?:\d[ -]?){12,18}\d\b")
def luhn_valid(digits: str) -> bool:
total, parity = 0, len(digits) % 2
for i, ch in enumerate(digits):
d = int(ch)
if i % 2 == parity:
d *= 2
if d > 9:
d -= 9
total += d
return total % 10 == 0
class TokenVault:
"""Format-preserving surrogate. The vault is in scope; nothing it feeds is,
provided the surrogate is not reversible outside it."""
def __init__(self, pepper: str):
self._pepper = pepper
self._map: dict[str, str] = {}
def tokenise(self, pan: str) -> str:
digest = hashlib.sha256(f"{self._pepper}:{pan}".encode()).hexdigest()
surrogate = "4" + str(int(digest[:15], 16)).zfill(15)[:15]
self._map[surrogate] = pan
return surrogate
def last_four(self, pan: str) -> str:
return pan[-4:]
class ScopeBoundary:
def __init__(self):
self.systems: dict[str, bool] = {}
self.flows: list[tuple[str, str]] = []
def add(self, system: str, sees_pan: bool) -> None:
self.systems[system] = sees_pan
def flow(self, src: str, dst: str) -> None:
self.flows.append((src, dst))
def in_scope(self) -> set[str]:
scope = {s for s, sees in self.systems.items() if sees}
changed = True
while changed: # connected-to is also in scope
changed = False
for src, dst in self.flows:
if src in scope and dst not in scope:
scope.add(dst); changed = True
elif dst in scope and src not in scope:
scope.add(src); changed = True
return scope
def redact(text: str, vault: TokenVault) -> tuple[str, int]:
found = 0
def _sub(m):
nonlocal found
raw = re.sub(r"[ -]", "", m.group(0))
if not luhn_valid(raw):
return m.group(0)
found += 1
return f"tok_{vault.tokenise(raw)}(last4={vault.last_four(raw)})"
return PAN_RE.sub(_sub, text), found
if __name__ == "__main__":
vault = TokenVault(pepper="hsm-managed")
text = "Charge card 4111 1111 1111 1111 for invoice 9912, ref 1234567890123456"
out, n = redact(text, vault)
assert n >= 1 and "4111 1111 1111 1111" not in out, out
assert "last4=1111" in out, out
# A number that fails Luhn is not a PAN and must not be mangled.
benign, n2 = redact("order 1234 5678 9012 3450 placed", vault)
assert n2 == 0 and "1234 5678 9012 3450" in benign, benign
sb = ScopeBoundary()
sb.add("checkout", True); sb.add("token_vault", True)
sb.add("llm_gateway", False); sb.add("analytics", False)
sb.flow("checkout", "token_vault"); sb.flow("token_vault", "llm_gateway")
scope = sb.in_scope()
assert "llm_gateway" in scope, "connected-to is in scope — that is the point"
clean = ScopeBoundary()
clean.add("checkout", True); clean.add("token_vault", True)
clean.add("llm_gateway", False)
clean.flow("checkout", "token_vault")
assert "llm_gateway" not in clean.in_scope(), clean.in_scope()
print("PCI DSS 4.0 tokenisation + scope reduction: OK")
print(f" PANs tokenised {n}, naive scope {len(scope)} systems, "
f"segmented scope {len(clean.in_scope())} systems")
Questions to answer before approval
- Is the inference tier in PCI scope, and what segmentation test proves it is not?
Cardholder data is tokenised before the model boundary and the segmentation is evidenced by an annual penetration test, so the tier stays out of scope by design. - 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.
See also
- Part of enterprise ai compliance architecture.
- The same control appears in PCI DSS 4.0 agent permission and delegated access architecture.
- PCI DSS 4.0 vendor evaluation criteria for enterprise AI implementation applies the same mechanism under a different obligation.
- This pattern also governs PCI DSS 4.0 retrieval architecture with citation integrity for enterprise.
- PCI DSS 4.0 prompt injection defence architecture for enterprise LLM applies the same mechanism under a different obligation.
- 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 ≤ 600ms
- Which PCI DSS 4.0 control questions you cannot yet answer, and what closes each gap