PCI DSS 4.0 model release gate and golden set evaluation for enterprise AI — Reference Architecture

Reference architecture · published 2026-10-16 · regulated enterprise · PCI DSS 4.0 · layout diagram_first · implementation executed in CI before publish

The control that resolves this is a Frozen Golden Set Release Gate, 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 REST over HTTPS, and ships with a standard-library implementation that runs as written.

Reference architecture

Frozen Golden Set Release Gate — the request path, with the decision points that must exist before the first model call:

flowchart LR
    CAND[Candidate model] --> SC[Score per slice]
    BASE[Baseline scores] --> CMP{Compare per slice}
    SC --> CMP
    CMP -->|slice regressed| BLOCK[Refuse release]
    CMP -->|below floor| BLOCK
    CMP -->|all slices hold| REL[Release + decision record]
    BLOCK --> REC[Record which slice and by how much]

Component breakdown

1. Frozen golden set — Versioned and immutable; editing it after freeze raises.
2. Slice taxonomy — Rare-but-critical cases are their own slice, not noise in the mean.
3. Per-slice thresholds — Tolerance for regression plus an absolute floor per slice.
4. Deterministic scorer — Same inputs, same score — a flaky scorer makes the gate decorative.
5. Release gate — Refuses on any slice regression even when the aggregate improves.
6. Decision record — What was compared, which slices moved, who accepted the risk.

Implementation parameter matrix

Every value below is a parameter you can hold a vendor or an internal team to. Adjectives are not acceptance criteria.

The control gap

A model upgrade is approved on a demo and an aggregate score. Nobody can say which cases got worse, because the comparison is a single number against a test set that changes whenever it is inconvenient.

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.

Working implementation — Per-slice release gate over a frozen golden set

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 segmentation test report.

"""Release gate on a frozen golden set, with per-slice thresholds.

The failure this prevents: a candidate model improves the aggregate score and
regresses badly on one slice that happens to matter. Aggregates hide that
(Simpson's paradox is not a curiosity here, it is the default outcome), so the
gate evaluates per slice and refuses on any slice regression beyond tolerance
even when the headline number improves.
"""
from dataclasses import dataclass, field


@dataclass(frozen=True)
class Case:
    case_id: str
    slice_name: str
    prompt: str
    expected: str


@dataclass
class GoldenSet:
    """Frozen on purpose. A golden set edited to make a release pass is not a
    golden set, so mutation after freeze raises rather than warns."""
    name: str
    cases: list = field(default_factory=list)
    _frozen: bool = False

    def add(self, case: Case) -> None:
        if self._frozen:
            raise RuntimeError(f"{self.name} is frozen; create a new version")
        self.cases.append(case)

    def freeze(self) -> "GoldenSet":
        self._frozen = True
        return self

    def slices(self) -> set:
        return {c.slice_name for c in self.cases}


def score(model, golden: GoldenSet) -> dict:
    per_slice: dict[str, list] = {}
    for case in golden.cases:
        ok = model(case.prompt) == case.expected
        per_slice.setdefault(case.slice_name, []).append(ok)
    return {s: sum(v) / len(v) for s, v in per_slice.items()}


def aggregate(scores: dict, golden: GoldenSet) -> float:
    weights = {s: sum(1 for c in golden.cases if c.slice_name == s)
               for s in scores}
    total = sum(weights.values())
    return sum(scores[s] * weights[s] for s in scores) / total


class ReleaseGate:
    def __init__(self, tolerance: float = 0.02, floors: dict | None = None):
        self.tolerance = tolerance
        self.floors = floors or {}

    def decide(self, baseline: dict, candidate: dict, golden: GoldenSet) -> dict:
        regressions, floor_breaks = [], []
        for s in sorted(set(baseline) | set(candidate)):
            b, c = baseline.get(s, 0.0), candidate.get(s, 0.0)
            if b - c > self.tolerance:
                regressions.append({"slice": s, "baseline": round(b, 3),
                                    "candidate": round(c, 3),
                                    "delta": round(c - b, 3)})
            floor = self.floors.get(s)
            if floor is not None and c < floor:
                floor_breaks.append({"slice": s, "candidate": round(c, 3),
                                     "floor": floor})
        agg_b, agg_c = aggregate(baseline, golden), aggregate(candidate, golden)
        return {
            "aggregate_baseline": round(agg_b, 3),
            "aggregate_candidate": round(agg_c, 3),
            "aggregate_improved": agg_c > agg_b,
            "slice_regressions": regressions,
            "floor_breaches": floor_breaks,
            "release": not regressions and not floor_breaks,
        }


if __name__ == "__main__":
    g = GoldenSet("claims-triage-v1")
    for i in range(40):
        g.add(Case(f"c{i}", "common", f"p{i}", f"a{i}"))
    for i in range(10):
        g.add(Case(f"r{i}", "rare_high_value", f"rp{i}", f"ra{i}"))
    g.freeze()

    baseline_answers = {c.prompt: c.expected for c in g.cases}
    def baseline_model(p): return baseline_answers[p]

    # Candidate: better on the big slice, broken on the small critical one.
    def candidate_model(p):
        if p.startswith("rp"):
            return "wrong"
        return baseline_answers[p]

    base = score(baseline_model, g)
    cand = score(candidate_model, g)
    gate = ReleaseGate(tolerance=0.02, floors={"rare_high_value": 0.90})
    decision = gate.decide(base, cand, g)

    assert decision["aggregate_candidate"] >= 0.79, decision
    assert not decision["release"], "a slice regression must block the release"
    assert decision["slice_regressions"][0]["slice"] == "rare_high_value"
    assert decision["floor_breaches"], decision

    clean = gate.decide(base, base, g)
    assert clean["release"], clean

    try:
        g.add(Case("x", "common", "p", "a"))
        raise AssertionError("edited a frozen golden set")
    except RuntimeError:
        pass

    print("Evaluation release gate: OK")
    print(f"  aggregate {decision['aggregate_baseline']} -> "
          f"{decision['aggregate_candidate']}, release={decision['release']}, "
          f"slice regressions {len(decision['slice_regressions'])}")

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")

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.

Control questions before sign-off

• 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.
• Which slices did the candidate model get worse on, and by how much?
  The gate reports a per-slice delta for every slice, and the decision record keeps it. An aggregate alone cannot answer this, which is why it is not the gate.
• What stops someone editing the evaluation set until the release passes?
  The set is frozen on publish — mutation raises rather than warns, and a change requires a new version with its own identifier recorded on every subsequent decision.
• If the aggregate score improves by two points, can the release still be refused?
  Yes, and it must be. A slice regression beyond tolerance, or any breach of a named slice's floor, refuses the release regardless of the aggregate.
• Where is the record of who accepted a known regression, and on what basis?
  In the decision record attached to the release: the slices that moved, the magnitude, and the named person who accepted it. An unaccepted regression cannot ship.
• How do you know the scorer gives the same answer twice?
  The scorer is deterministic and any sampling is seeded, with the seed recorded. The same candidate against the same frozen set produces the same report.

Adjacent problems

• Part of enterprise ai compliance architecture.
• The same control appears in PCI DSS 4.0 legacy integration patterns for enterprise AI agents.
• The same control appears in PCI DSS 4.0 prompt injection defence architecture for enterprise LLM.
• PCI DSS 4.0 cost control architecture for enterprise LLM deployment covers the adjacent case.
• For the related constraint, see PCI DSS 4.0 tracing and token accounting architecture for enterprise LLM.
• If this is the blocker in front of you: enterprise AI infrastructure review.