{"record":{"id":"cb218e9dea6b81dc","repo":"JuliusBrussee/caveman","slug":"where-dataset-carries-rolecounts-prior-succes","errorCode":null,"errorMessage":"${where} dataset carries ${roleCounts.prior_success} prior-success cases, want ${expectedPriors}","messagePattern":"(.+?) dataset carries (.+?) prior-success cases, want (.+?)","errorType":"exception","errorClass":"Error","httpStatus":null,"severity":"error","filePath":"packages/shared/contracts/scripts/validate-continuous-improvement.mjs","lineNumber":304,"sourceCode":"    // The boundary and stale-input generators perturb the localization evidence\n    // a confidence guard reads. A ChangeSet whose applicability never reads that\n    // evidence has no threshold to sit beside, so those two cases must NOT be\n    // generated for it — a \"boundary\" case against a guard that does not exist\n    // tests nothing while counting as adversarial coverage.\n    const confidenceGuard = item.change_set.applicability.all.some((condition) =>\n      condition === \"failure_location_confidence >= 0.90\" ||\n      condition === \"symbol_resolution == unique\" ||\n      condition === \"targeted_test_reproduces == true\");\n    const perturbations = new Set(dataset.cases.map((entry) => entry.perturbation));\n    for (const [perturbation, label] of [[\"guard_threshold_boundary\", \"boundary\"], [\"stale_input\", \"stale-input\"]]) {\n      if (perturbations.has(perturbation) !== confidenceGuard) {\n        throw new Error(`${where} ${confidenceGuard ? \"omits\" : \"generated\"} a ${label} case ${confidenceGuard ? \"for\" : \"against\"} a change set that ${confidenceGuard ? \"declares\" : \"declares no\"} confidence guard`);\n      }\n    }\n    const expectedTargets = Math.min(4, dataset.target_failure_cases.length);\n    const expectedPriors = Math.min(2, dataset.prior_success_cases.length);\n    if (roleCounts.target_failure !== expectedTargets) throw new Error(`${where} dataset carries ${roleCounts.target_failure} target-failure cases, want ${expectedTargets}`);\n    if (roleCounts.prior_success !== expectedPriors) throw new Error(`${where} dataset carries ${roleCounts.prior_success} prior-success cases, want ${expectedPriors}`);\n    if (roleCounts.boundary > 1) throw new Error(`${where} dataset carries ${roleCounts.boundary} boundary cases, want at most one`);\n    if (roleCounts.adversarial > (confidenceGuard ? 2 : 1)) throw new Error(`${where} dataset carries ${roleCounts.adversarial} adversarial cases`);\n    if (roleCounts.boundary !== dataset.boundary_cases.length) throw new Error(`${where} boundary case list disagrees with the composed dataset`);\n    if (roleCounts.adversarial !== dataset.generated_cases.length) throw new Error(`${where} generated case list disagrees with the composed dataset`);\n    const composed = roleCounts.target_failure + roleCounts.prior_success + roleCounts.boundary + roleCounts.adversarial;\n    if (composed !== dataset.cases.length) throw new Error(`${where} dataset roles (${composed}) do not account for its ${dataset.cases.length} cases`);\n    if (dataset.replay_case_ids.length !== datasetCaseIDs.size) throw new Error(`${where} replay manifest carries ${dataset.replay_case_ids.length} ids for ${datasetCaseIDs.size} dataset cases`);\n    for (const datasetCaseID of dataset.replay_case_ids) {\n      if (!datasetCaseIDs.has(datasetCaseID)) throw new Error(`${where} replay manifest case ${datasetCaseID} is not a composed dataset case`);\n    }\n\n    // The guard grader exists exactly when there is a perturbed case to catch a\n    // candidate on; a required grader with no case behind it is decoration.\n    const perturbed = dataset.cases.some((entry) => entry.perturbation !== \"none\");\n    if (perturbed !== item.eval_pack.graders.includes(\"guard_respected\")) {\n      throw new Error(`${where} guard_respected grader ${perturbed ? \"missing for\" : \"declared without\"} perturbed dataset cases`);\n    }\n    for (const proof of item.replay.trial_proofs) {","sourceCodeStart":286,"sourceCodeEnd":322,"githubUrl":"https://github.com/JuliusBrussee/caveman/blob/27d5a3981a347890211bb1bf2439e5c821a63bc9/packages/shared/contracts/scripts/validate-continuous-improvement.mjs#L286-L322","documentation":"Thrown when the number of dataset cases with role \"prior_success\" does not equal min(2, dataset.prior_success_cases.length). Spec 18.2 caps prior-success replays at two and requires the role count in the composed dataset to recompute exactly from the manifest's own list.","triggerScenarios":"One prior-success case listed but two in dataset.cases (or vice versa); three prior-success cases replayed although the cap is 2; a role string typo such as \"prior-success\".","commonSituations":"Growing the prior-success pool beyond the cap without trimming the composed cases; editing one of the two parallel structures (cases vs prior_success_cases list) in isolation.","solutions":["Synchronize: the number of dataset.cases entries with role exactly \"prior_success\" must equal min(2, dataset.prior_success_cases.length).","Trim to at most 2 prior-success replays and keep the list in sync.","Check role spellings on all entries while you are in there."],"exampleFix":"// before\nprior_success_cases: [p1, p2]        // expectedPriors = 2\ndataset.cases roles: [\"prior_success\",\"prior_success\",\"prior_success\"]\n\n// after — drop the third\ndataset.cases roles: [\"prior_success\",\"prior_success\"]","handlingStrategy":"validation","validationCode":"const priorCount = dataset.cases.filter((c) => c.role === \"prior_success\").length;\nconst ok = priorCount === Math.min(2, dataset.prior_success_cases.length);","typeGuard":null,"tryCatchPattern":null,"preventionTips":["Cap prior-success selection at 2 during composition and write the list from the selected cases.","Spell roles exactly (\"prior_success\", underscore) and validate role strings as an enum in authoring code."],"tags":["validation","dataset","composition"],"backgroundTag":null,"analyzedSha":"27d5a3981a347890211bb1bf2439e5c821a63bc9","analyzedAt":"2026-08-15T09:26:11.751Z","schemaVersion":2},"datasetVersion":"2026-08-15T22:17:37.221Z"}