SOC 2 Type II model release gate and golden set evaluation for enterprise AI — Reference Architecture

Reference architecture · published 2026-10-16 · regulated enterprise · SOC 2 Type II · 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 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 ≤ 600ms over REST over HTTPS, and ships with a standard-library implementation that runs as written.

The request path

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]

Modular implementation framework

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.

Technical parameters

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 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.

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 observation-window evidence export.

"""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 SOC 2 Type II control, as code

Type II evidence sampling over the observation window. This is the artifact an assessor asks for under SOC 2 Type II 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.

"""SOC 2 Type II evidence sampling over an observation window.

Type II is not "the control exists" — it is "the control operated throughout
the period". An auditor samples days from the window and asks for proof the
control ran on each sampled day. A gap of one day with no evidence is an
exception, so the population must be built from operational records rather
than asserted.
"""
import hashlib
from datetime import date, timedelta


class ObservationWindow:
    """The population an auditor samples from, plus deterministic selection."""

    def __init__(self, start: date, end: date, control_id: str):
        if end < start:
            raise ValueError("window end precedes start")
        self.start, self.end, self.control_id = start, end, control_id
        self._evidence: dict[date, list[str]] = {}

    def record(self, day: date, artifact_ref: str) -> None:
        if not (self.start <= day <= self.end):
            raise ValueError(f"{day} outside observation window")
        self._evidence.setdefault(day, []).append(artifact_ref)

    def population(self) -> list[date]:
        n = (self.end - self.start).days + 1
        return [self.start + timedelta(days=i) for i in range(n)]

    def gaps(self) -> list[date]:
        """Days with no evidence. Each one is a Type II exception."""
        return [d for d in self.population() if not self._evidence.get(d)]

    def sample(self, size: int) -> list[date]:
        """Deterministic, reproducible selection — an auditor must be able to
        re-derive the same sample from the same seed rather than trust ours."""
        pop = self.population()
        size = min(size, len(pop))
        seed = f"{self.control_id}:{self.start}:{self.end}"
        scored = sorted(
            pop, key=lambda d: hashlib.sha256(f"{seed}:{d}".encode()).hexdigest())
        return sorted(scored[:size])

    def evidence_for(self, day: date) -> list[str]:
        return list(self._evidence.get(day, []))

    def attestation(self, size: int = 25) -> dict:
        sampled = self.sample(size)
        missing = [d for d in sampled if not self._evidence.get(d)]
        return {
            "control_id": self.control_id,
            "window": f"{self.start}..{self.end}",
            "population_days": len(self.population()),
            "sampled_days": len(sampled),
            "exceptions": [str(d) for d in missing],
            "opinion": "unqualified" if not missing else "qualified",
        }


if __name__ == "__main__":
    start, end = date(2026, 1, 1), date(2026, 3, 31)
    w = ObservationWindow(start, end, "CC6.1-tenant-isolation")
    for d in w.population():
        w.record(d, f"s3://evidence/{d}/isolation-check.json")
    clean = w.attestation()
    assert clean["opinion"] == "unqualified", clean
    assert clean["population_days"] == 90, clean

    # One missing day is one exception — and it must survive sampling to matter.
    w2 = ObservationWindow(start, end, "CC6.1-tenant-isolation")
    sampled = set(w2.sample(25))
    for d in w2.population():
        if d != sorted(sampled)[0]:
            w2.record(d, "ok")
    assert w2.attestation()["opinion"] == "qualified", w2.attestation()
    assert len(w2.gaps()) == 1, w2.gaps()

    # The sample must be reproducible from the same seed.
    assert w.sample(25) == ObservationWindow(start, end,
                                             "CC6.1-tenant-isolation").sample(25)
    print("SOC 2 Type II evidence sampling: OK")
    print(f"  population {clean['population_days']} days, "
          f"sample {clean['sampled_days']}, opinion {clean['opinion']}")

Risk and control matrix

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.

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.
• 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.

Related architectures

• Part of enterprise ai compliance architecture.
• For the related constraint, see SOC 2 Type II tracing and token accounting architecture for enterprise.
• SOC 2 Type II legacy integration patterns for enterprise AI agents covers the adjacent case.
• SOC 2 Type II audit evidence architecture for enterprise LLM deployment covers the adjacent case.
• A different failure mode of the same component: SOC 2 Type II vendor evaluation criteria for enterprise AI implementation.
• If this is the blocker in front of you: enterprise AI infrastructure review.