Struct CaseKey 

pub struct CaseKey<'a> {
    pub case_id: &'a str,
    pub question: &'a str,
    pub agent_sha: &'a str,
    pub model: &'a str,
    pub context_sha: &'a str,
    pub sample: u32,
    pub backend: Backend,
}

The inputs that determine a case’s result. Everything here is in the cache key; the golden’s expectation (expected/tolerance/match) deliberately is not, which is what makes re-scoring a changed expectation a cache hit.

Fields

case_id: &'a str

question: &'a str

agent_sha: &'a str

model: &'a str

The whole-run --model binding, or FRONTMATTER_MODEL on the ablation path.

context_sha: &'a str

sample: u32

Which repeated-sample run this is (0-indexed). Distinct samples of the same case are distinct cache entries — the pass-rate methodology depends on each sample actually invoking the agent (or replaying its OWN prior trace), not silently collapsing onto sample 0.

backend: Backend

Which back-end/runtime this run is measuring. Part of the key so runs on different back-ends can never hit each other’s cache.

Implementations

impl CaseKey<'_>

pub fn hash(&self) -> Result<String, String>

Content-addressed hash of the key → the cache entry’s filename stem.