Review the compute assurance packet

Objectives

Review six independent statements in the clinic's compute assurance packet. Accept only statements that are technically sound and provide the claimed evidence. The packet owner insists that managed execution removes all customer controls and that containers are miniature VMs.

For rejections, choose the single root defect: kernel-boundary means a false isolation claim; mutable-reference means approval is tied only to a movable tag; responsibility-gap means customer duties are incorrectly discarded; evidence-loss means records cannot outlive the workload. Accepted statements need no reason code.

Verdicts are accept or reject. Every rejection needs one reason code from: kernel-boundary | mutable-reference | responsibility-gap | evidence-loss.

CC-1 | Each ordinary container has a separate guest kernel, so the shared host kernel needs no assessment.
CC-2 | An approval records only tag release; the tag was reassigned after scanning, but the packet claims the original scan proves the deployed bytes were scanned.
CC-3 | A serverless function means the customer no longer needs to review its code dependencies or runtime identity permissions.
CC-4 | Workers keep their only lifecycle logs on disposable local disk; tomorrow's inventory will prove all terminated launches.
CC-5 | Launch records link unique instance IDs to approved machine-image IDs; guest scan results are retained separately to detect drift.
CC-6 | A deployment pins an approved image digest, and orchestrator events record replacement replicas and their workload IDs.

Step-by-step hints

The guided walkthrough, in full. It is free: no XP cost, and it does not touch the paid hint ladder or the reveal gate.

1. Step 1

   Read the request before the artefact

   Read the claim and its supporting mechanism together. Do not accept a broad assurance claim merely because its first phrase sounds familiar.

2. Step 2

   Judge every line, including the boring ones

   Give each packet ID exactly one verdict, even if the statement already looks well supported.

   Every line in the fixture carries a verdict

3. Step 3

   Separate what is wrong from what is merely ugly

   Trace the kernel boundary, artifact identity, responsibility division and record lifetime. Distinguish a bounded evidence claim from a promise of complete safety.

   Accept and reject land on the right lines

4. Step 4

   Say why, in the vocabulary the programme uses

   Match each rejected statement to its root defect using the four definitions in the brief. Leave accepted rows without a reason.

   Each rejection cites a valid reason code

Rules summary

• XP on pass

  40 bonus XP the first time every check goes green.

• Paid hints

  2 available. Each costs 25% of the lab XP (about 10 XP).

• Reveal solution

  Scores 0 XP and unlocks only after 3 check runs.

• Attempt cap

  60 check runs per learner. The runner warns you in the last 10.

• Drafts

  Your editor content is saved in this browser, so a reload will not lose work.

• Walkthrough

  Always free and never penalised: use it before spending a hint.