memstead_base/ingest/

findings.rs

//! The engine-owned durable **findings store** and the thin `projection verify`
//! write path that populates it (bundle plan `05-verify-sync-engine`, group A).
//!
//! Verify **measures** fidelity and records durable findings; it mutates no
//! entity in the destination mem (though a completed run does write this
//! store, backfill observed anchor hashes, and record a `#verified`
//! baseline). The store is the real home behind plan 03's findings
//! schema stub ([`crate::binding`]'s removed `FindingKey` / `FindingRecord`).
//!
//! ## Keying: `hash(D)` alone — findings survive head movement
//!
//! The store keys on the binding's **`hash(D)` alone**: a binding-declaration
//! edit still mechanically partitions findings into a fresh keyspace (prior
//! findings are never presented as current, only segregated as superseded —
//! A3), but a **source-head move does not**. Each finding records the
//! `source_head` it was observed at as metadata (its [`Finding::key`]), and
//! sync briefs present **all** open findings under the current `hash(D)`
//! regardless of recorded head — an open finding survives source movement and
//! keeps appearing until an agent's repair lets a verify observe it clean, or
//! a verify supersedes it. (Originally the key was `(hash(D), source_head)`,
//! which leaked exactly the findings sync exists to consume: once the source
//! advanced, open findings recorded at the previous head went invisible to
//! every subsequent brief.) The store does not grow unboundedly: verify
//! re-observes every anchor each pass and closes what resolves clean, and a
//! carried coverage finding whose artifact left `S(D)` or gained an anchor is
//! closed, not carried (see [`merge_with_prior`]). On-disk format is unchanged
//! — pre-re-key stores (batches keyed `(hash(D), source_head)`) load as-is;
//! same-hash batches from different heads collapse under the hash-alone view
//! (the latest-recorded batch is current, the rest superseded until the next
//! verify rewrites the hash's batch).
//!
//! ## Durability & location (A1, engine-state convention)
//!
//! The store is engine-owned state, **not a mem**. It lives at
//! `<workspace>/.memstead/state/findings/<mem>/<name>.json` — a sibling of the
//! durable advance store (`state/advance/`) and `state/mounts.json`, under the
//! `.memstead/state/` tier every engine-state consumer shares. It is read fresh
//! from disk per call, so findings survive a process restart and a later
//! sync-brief render (a fresh process) reads them back. This is deliberately the
//! `state/` tier, **not** the ephemeral `.memstead.cache/` tier the mtime memo,
//! backoff, and the `next_batch` rotation use — those are recomputable; findings
//! are not.
//!
//! ## One writer (A4/A5)
//!
//! Only the engine verify/sync/advance code paths write this store. There is no
//! CLI/skill/temp-file side channel: the refinement scout/writer temp-findings
//! handover (a `.md` file under `.memstead.cache/ingest/refinement/` with a
//! 10-minute-staleness contract) is gone — [`super::refinement`] retains only
//! the `next_batch` rotation machinery, consumed here solely to **schedule**
//! verify samples. [`verify_binding`] takes `&Engine` (shared, not mutable): it
//! is structurally incapable of a destination-mem mutation. Any repair routes
//! through the sync brief (group C), never through findings recording/reading.
//! Two sanctioned post-run writes exist, both explicit separate steps the
//! caller performs only after a pass returns `Ok` (so an aborted or failed
//! run never records either), and both measurement bookkeeping — never entity
//! content: the **verified baseline** ([`record_verified_baseline`] records
//! `<binding>/<facet>#verified` per observed facet head through the lifecycle
//! sync-state writer) and the **prepared-hash backfill**
//! ([`record_anchor_hash_backfill`] records this pass's observed
//! prepared-content hashes onto hash-less hash-bearing anchors in the
//! engine-owned anchors sidecar).

use std::collections::{BTreeMap, BTreeSet};
use std::path::{Path, PathBuf};
use std::time::{SystemTime, UNIX_EPOCH};

use serde::{Deserialize, Serialize};

use crate::Engine;
use crate::anchor::{Anchor, AnchorState, ObservedArtifactHash};
use crate::binding::{
    Binding, DEFAULT_ADJUDICATION_CAP, DEFAULT_FULL_RESYNC_EVERY, hash_binding, medium_capabilities,
};
use crate::workspace_store::{StoreError, WORKSPACE_STORE_DIR};

use super::advance::is_single_component;
use super::cursor::{compute_source_cursor, enumerate_source_artifacts};
use super::refinement::{
    ROTATION_ANCHOR_ADJUDICATION, bump_verify_runs, next_batch, next_rotation_batch,
};
use super::resolve::{ResolvedIngest, ResolvedSource};

/// The engine-owned state directory root, under the workspace store:
/// `<root>/.memstead/state/`. Mirrors [`super::advance`]'s `STATE_DIR`.
const STATE_DIR: &str = "state";
/// The findings store's subtree: `<root>/.memstead/state/findings/`.
const FINDINGS_DIR: &str = "findings";

// ---------------------------------------------------------------------------
// Key
// ---------------------------------------------------------------------------

/// A binding's `hash(D)` plus the `source_head` a finding was observed at.
///
/// Only the **`binding_hash` half keys the store**: a changed `hash(D)` (a
/// binding-declaration edit) invalidates prior findings by construction —
/// segregated as superseded, never silently mixed into the current view (A3).
/// The `source_head` half is **observation metadata**, carried on every
/// finding so it stays self-describing about when it was observed — a moved
/// head does NOT invalidate a finding (findings survive head movement; see
/// the module docs).
///
/// The real key behind plan 03's schema stub (which lived, IO-less, in
/// [`crate::binding`]).
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Serialize, Deserialize)]
pub struct FindingKey {
    /// The binding's `hash(D)` (lowercase hex SHA-256; see
    /// [`crate::binding::hash_binding`]) — the store key.
    pub binding_hash: String,
    /// The composite source-head token the finding was observed at — the
    /// per-facet baseline tokens current at observation time. Metadata, not
    /// part of the store key.
    pub source_head: String,
}

// ---------------------------------------------------------------------------
// Finding
// ---------------------------------------------------------------------------

/// The class of a verify finding (A2). A closed vocabulary: `drifted` and
/// `queued-for-adjudication` come only from **hash-drift adjudication** (over
/// hash-bearing anchors — never `authored` / `informed-by`, see
/// [`adjudicate_anchor`]); `unresolvable-anchor` is an existence failure;
/// `uncovered` marks a source artifact with no anchor; `wrong` is reserved for
/// an adjudicated content mismatch the group-B report renders.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Serialize, Deserialize)]
#[serde(rename_all = "kebab-case")]
pub enum FindingClass {
    /// A hash-bearing anchor's prepared-content hash drifted from the recorded
    /// one on a `stable` medium.
    Drifted,
    /// An adjudicated content mismatch (reserved for the group-B report path).
    Wrong,
    /// A source artifact in scope carries no anchor in the destination mem.
    Uncovered,
    /// An anchor's referenced artifact is no longer present in the medium.
    UnresolvableAnchor,
    /// Hash adjudication is deferred (capped, or `recheck`) and queued in the
    /// store; the remainder is the tier-3 backlog.
    QueuedForAdjudication,
}

impl FindingClass {
    /// Every wire string, in declaration order.
    pub const WIRE_VALUES: &'static [&'static str] = &[
        "drifted",
        "wrong",
        "uncovered",
        "unresolvable-anchor",
        "queued-for-adjudication",
    ];

    /// Stable wire form.
    pub fn as_wire(&self) -> &'static str {
        match self {
            FindingClass::Drifted => "drifted",
            FindingClass::Wrong => "wrong",
            FindingClass::Uncovered => "uncovered",
            FindingClass::UnresolvableAnchor => "unresolvable-anchor",
            FindingClass::QueuedForAdjudication => "queued-for-adjudication",
        }
    }

    /// Inverse of [`Self::as_wire`]; `None` for an unknown string.
    pub fn from_wire(s: &str) -> Option<Self> {
        match s {
            "drifted" => Some(FindingClass::Drifted),
            "wrong" => Some(FindingClass::Wrong),
            "uncovered" => Some(FindingClass::Uncovered),
            "unresolvable-anchor" => Some(FindingClass::UnresolvableAnchor),
            "queued-for-adjudication" => Some(FindingClass::QueuedForAdjudication),
            _ => None,
        }
    }
}

/// What a finding is about (A2): an anchor reference, or — for an uncovered
/// artifact that has no anchor — the source artifact id itself.
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
#[serde(tag = "kind", rename_all = "kebab-case")]
pub enum FindingTarget {
    /// An anchor reference: the entity id carrying the anchor and the artifact
    /// the anchor points at.
    Anchor {
        /// The entity id (`mem--slug`) the anchor belongs to.
        entity: String,
        /// The anchor's artifact reference (path / `path@commit` / url / entity id).
        artifact: String,
    },
    /// An uncovered source artifact — no anchor references it, so there is no
    /// anchor to name (A2's "artifact ID for uncovered artifacts").
    Artifact {
        /// The source-side artifact id.
        artifact: String,
    },
}

/// A single durable verify finding (A2). Carries its target, its class, and —
/// self-describingly — the [`FindingKey`] it was recorded under, so a finding
/// pulled out of the store always states which `(hash(D), source_head)` it
/// belongs to.
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct Finding {
    /// The key this finding was recorded under (A2). Redundant with its
    /// enclosing [`FindingsBatch::key`], carried on the finding so it stays
    /// self-describing when detached.
    pub key: FindingKey,
    /// The source facet the finding concerns (best-effort label in the thin
    /// verify — the group-B report refines per-facet attribution).
    pub facet: String,
    /// What the finding is about.
    pub target: FindingTarget,
    /// The finding class.
    pub class: FindingClass,
    /// Human/agent-readable detail.
    pub detail: String,
    /// When the finding was recorded (opaque timestamp string — unix seconds).
    pub created_at: String,
}

// ---------------------------------------------------------------------------
// Store
// ---------------------------------------------------------------------------

/// One batch of findings recorded for a single `hash(D)` in one verify pass.
/// A new pass under the same `hash(D)` replaces the batch (after
/// [`verify_binding`]'s merge carried forward what stays open); a pass under a
/// different `hash(D)` lands as a separate batch — the prior one is retained,
/// segregated, never overwritten (A3). The batch's `key.source_head` is the
/// head the batch was last **recorded** at; each finding's own key records the
/// head *it* was observed at (a carried finding keeps its original).
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct FindingsBatch {
    /// The key this batch was recorded under (`binding_hash` is the store
    /// key; `source_head` is the recording head, metadata).
    pub key: FindingKey,
    /// When the batch was last recorded (opaque timestamp string).
    pub recorded_at: String,
    /// The findings in this batch.
    pub findings: Vec<Finding>,
}

/// One binding's durable findings store (A1). Persisted at
/// `.memstead/state/findings/<mem>/<name>.json`, read fresh per call. Holds
/// findings grouped by the `hash(D)` they were recorded under so declaration
/// invalidation is mechanical: [`Self::current`] presents the current hash's
/// batch — regardless of source head; [`Self::superseded`] surfaces everything
/// else, segregated (A3).
///
/// The on-disk shape predates the hash-alone re-key and is unchanged: a store
/// written when batches were keyed `(hash(D), source_head)` loads without loss.
/// Such a legacy store may hold several batches sharing one `binding_hash`
/// (recorded at different heads); the hash-alone view treats the
/// latest-recorded of them as current and the next [`Self::record`] collapses
/// them into one.
#[derive(Debug, Clone, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct FindingsStore {
    /// The canonical binding id `<mem>/<stem>` this store belongs to.
    pub binding: String,
    /// Findings grouped by recording key, most-recent recording order not
    /// guaranteed — look up by key.
    #[serde(default)]
    pub batches: Vec<FindingsBatch>,
}

impl FindingsStore {
    /// Index of the store's current batch for `binding_hash`: the
    /// latest-recorded batch carrying that hash (ties break toward the later
    /// entry — [`Self::record`] appends). Usually unique; a legacy per-head
    /// store may hold several.
    fn current_batch_index(&self, binding_hash: &str) -> Option<usize> {
        self.batches
            .iter()
            .enumerate()
            .filter(|(_, b)| b.key.binding_hash == binding_hash)
            .max_by_key(|(i, b)| (b.recorded_at.parse::<u64>().unwrap_or(0), *i))
            .map(|(i, _)| i)
    }

    /// Record `findings` under `key.binding_hash`, replacing **every** prior
    /// batch recorded under that hash (including legacy per-head siblings) and
    /// leaving every other hash's batch untouched (A3 segregation — a changed
    /// `hash(D)` never overwrites the old batch).
    pub fn record(&mut self, key: FindingKey, recorded_at: String, findings: Vec<Finding>) {
        self.batches
            .retain(|b| b.key.binding_hash != key.binding_hash);
        self.batches.push(FindingsBatch {
            key,
            recorded_at,
            findings,
        });
    }

    /// The findings recorded under `key.binding_hash` — the **only** findings
    /// ever presented as current (A3), **regardless of `key.source_head`**: an
    /// open finding recorded at a previous head stays presented after the
    /// source advances. Empty when nothing was recorded under this hash.
    pub fn current(&self, key: &FindingKey) -> &[Finding] {
        self.current_batch_index(&key.binding_hash)
            .map(|i| self.batches[i].findings.as_slice())
            .unwrap_or(&[])
    }

    /// Every finding **outside** the current view of `key.binding_hash` —
    /// superseded by a `hash(D)` change (or stranded in an older legacy
    /// per-head batch of the same hash), segregated so a consumer can show
    /// them as stale without mixing them into the current view (A3).
    pub fn superseded(&self, key: &FindingKey) -> Vec<&Finding> {
        let current = self.current_batch_index(&key.binding_hash);
        self.batches
            .iter()
            .enumerate()
            .filter(|(i, _)| Some(*i) != current)
            .flat_map(|(_, b)| b.findings.iter())
            .collect()
    }
}

// ---------------------------------------------------------------------------
// Store IO — mirrors `super::advance`'s durable-store shape
// ---------------------------------------------------------------------------

/// The durable store path for a binding:
/// `.memstead/state/findings/<mem>/<name>.json`.
pub fn findings_store_path(workspace_root: &Path, mem: &str, name: &str) -> PathBuf {
    workspace_root
        .join(WORKSPACE_STORE_DIR)
        .join(STATE_DIR)
        .join(FINDINGS_DIR)
        .join(mem)
        .join(format!("{name}.json"))
}

/// The mem-scoped findings key for binding-less (standalone) anchor
/// verification (agent-trust plan 14). A distinguished constant that
/// can never collide with a real `hash(D)` (which is always 64 hex
/// chars): a hand-authored mem with no binding persists its verify
/// findings under this key, in its own store file
/// (`state/findings/<mem>/standalone.json`), closing the
/// observe-and-forget gap. Binding-backed stores keep their `hash(D)`
/// key and semantics untouched — the two keyspaces coexist and never
/// share a file.
pub const STANDALONE_KEY: &str = "standalone";

/// One standalone finding with its already-seen annotation: `true`
/// when the previous standalone pass recorded the same target and
/// class — the re-serving that makes a second pass say "known" rather
/// than rediscovering.
#[derive(Debug, Clone, Serialize)]
pub struct AnnotatedStandaloneFinding {
    #[serde(flatten)]
    pub finding: Finding,
    pub already_seen: bool,
}

/// Persist a standalone (binding-less) anchor-verification pass's
/// flagged findings under the mem-scoped [`STANDALONE_KEY`], and
/// annotate each against the previous pass. `drifted` and
/// `unresolvable` anchors become durable findings (`recheck` is
/// transient by definition and `resolved` is not a finding); a pass
/// whose flagged set is empty still records — the empty batch IS the
/// "everything resolved clean" statement that closes prior findings.
pub fn record_standalone_findings(
    workspace_root: &Path,
    report: &crate::engine::query::MemAnchorVerification,
) -> Result<Vec<AnnotatedStandaloneFinding>, StoreError> {
    let mem = &report.mem;
    let key = FindingKey {
        binding_hash: STANDALONE_KEY.to_string(),
        source_head: String::new(),
    };
    let now = SystemTime::now()
        .duration_since(UNIX_EPOCH)
        .map(|d| d.as_secs())
        .unwrap_or(0)
        .to_string();

    let findings: Vec<Finding> = report
        .anchors
        .iter()
        .filter_map(|a| {
            // `unobserved` is deliberately absent (consistency-sweep 03/05).
            // A finding asserts a MEASURED condition, and an unobserved row is
            // the absence of a measurement: recording it as
            // `UnresolvableAnchor` claimed the artifact was gone when nobody
            // had looked, which is the collapse criterion 2 removes. It is not
            // dropped silently either — the population statement and
            // `fully_adjudicated` on this same surface report it, and the
            // binding report raises it as a blind spot that blocks a clean
            // verdict.
            let class = match a.state.as_str() {
                "drifted" => FindingClass::Drifted,
                "unresolvable" => FindingClass::UnresolvableAnchor,
                _ => return None,
            };
            Some(Finding {
                key: key.clone(),
                facet: STANDALONE_KEY.to_string(),
                target: FindingTarget::Anchor {
                    entity: a.entity_id.clone(),
                    artifact: a.artifact.clone(),
                },
                class,
                detail: format!("{} ({} {})", a.state, a.class, a.grain),
                created_at: now.clone(),
            })
        })
        .collect();

    let mut store =
        read_findings_store(workspace_root, mem, STANDALONE_KEY)?.unwrap_or_else(|| {
            FindingsStore {
                binding: format!("{mem}/{STANDALONE_KEY}"),
                ..Default::default()
            }
        });
    let prior: BTreeSet<(String, String)> = store
        .current(&key)
        .iter()
        .map(|f| {
            (
                serde_json::to_string(&f.target).unwrap_or_default(),
                f.class.as_wire().to_string(),
            )
        })
        .collect();
    let annotated: Vec<AnnotatedStandaloneFinding> = findings
        .iter()
        .map(|f| AnnotatedStandaloneFinding {
            finding: f.clone(),
            already_seen: prior.contains(&(
                serde_json::to_string(&f.target).unwrap_or_default(),
                f.class.as_wire().to_string(),
            )),
        })
        .collect();
    store.record(key, now, findings);
    write_findings_store(workspace_root, mem, STANDALONE_KEY, &store)?;
    Ok(annotated)
}

/// Read the durable findings store for a binding, or `None` when none exists.
/// A malformed file surfaces a typed [`StoreError::Parse`] naming the path.
pub fn read_findings_store(
    workspace_root: &Path,
    mem: &str,
    name: &str,
) -> Result<Option<FindingsStore>, StoreError> {
    let path = findings_store_path(workspace_root, mem, name);
    match std::fs::read(&path) {
        Ok(bytes) => serde_json::from_slice(&bytes)
            .map(Some)
            .map_err(|e| StoreError::Parse {
                path,
                message: e.to_string(),
            }),
        Err(e) if e.kind() == std::io::ErrorKind::NotFound => Ok(None),
        Err(e) => Err(StoreError::Io { path, source: e }),
    }
}

/// Create an engine-owned store subtree and drop a self-ignoring
/// `.gitignore` (`*`) at its root if none exists. The `state/findings/`
/// and `state/advance/` stores are per-checkout ephemeral engine state
/// living inside a possibly-tracked workspace (where `state/mounts.json`
/// IS tracked) — without the ignore they surface as untracked noise and
/// would churn if committed. Best-effort: an ignore-write failure never
/// fails the store write itself.
pub(crate) fn ensure_selfignoring_store_dir(subtree_root: &Path) -> Result<(), StoreError> {
    std::fs::create_dir_all(subtree_root).map_err(|e| StoreError::Io {
        path: subtree_root.to_path_buf(),
        source: e,
    })?;
    let gitignore = subtree_root.join(".gitignore");
    if !gitignore.exists() {
        let _ = std::fs::write(&gitignore, "*\n");
    }
    Ok(())
}

/// Persist the durable findings store for a binding (pretty JSON), creating
/// parent directories.
pub fn write_findings_store(
    workspace_root: &Path,
    mem: &str,
    name: &str,
    store: &FindingsStore,
) -> Result<(), StoreError> {
    ensure_selfignoring_store_dir(
        &workspace_root
            .join(WORKSPACE_STORE_DIR)
            .join(STATE_DIR)
            .join(FINDINGS_DIR),
    )?;
    let path = findings_store_path(workspace_root, mem, name);
    if let Some(parent) = path.parent() {
        std::fs::create_dir_all(parent).map_err(|e| StoreError::Io {
            path: parent.to_path_buf(),
            source: e,
        })?;
    }
    let bytes = serde_json::to_vec_pretty(store).map_err(|e| StoreError::Parse {
        path: path.clone(),
        message: e.to_string(),
    })?;
    std::fs::write(&path, bytes).map_err(|e| StoreError::Io { path, source: e })
}

/// Drop the durable findings store for a binding. A missing file is a
/// successful no-op.
pub fn delete_findings_store(
    workspace_root: &Path,
    mem: &str,
    name: &str,
) -> Result<(), StoreError> {
    let path = findings_store_path(workspace_root, mem, name);
    match std::fs::remove_file(&path) {
        Ok(()) => Ok(()),
        Err(e) if e.kind() == std::io::ErrorKind::NotFound => Ok(()),
        Err(e) => Err(StoreError::Io { path, source: e }),
    }
}

// ---------------------------------------------------------------------------
// Verify write path
// ---------------------------------------------------------------------------

/// Why [`verify_binding`] could not complete.
#[derive(Debug, thiserror::Error)]
pub enum FindingsError {
    /// The binding id is not the canonical `<mem>/<stem>` shape.
    #[error("malformed binding id '{0}': expected `<mem>/<stem>`")]
    MalformedId(String),
    /// Reading or writing the durable findings store failed.
    #[error("findings store error: {0}")]
    Store(#[source] StoreError),
    /// A path-based primary source's base directory does not exist — a
    /// vanished or unmounted source. Verify refuses rather than measures:
    /// enumerating a missing tree yields an empty stat map whose aggregate
    /// (the hash of nothing) is indistinguishable from a genuinely empty
    /// source and would overwrite a real `#verified` baseline with fake
    /// state. Typed and visible, mirroring the D3 non-enumerable refusal.
    #[error("source '{source_name}' unreachable: `{path}` does not exist")]
    SourceUnreachable {
        /// The source whose pointer resolved to the missing path.
        source_name: String,
        /// The resolved base path that does not exist.
        path: String,
    },
    /// A full measurement ([`verify_binding_full`]) was requested over a
    /// facet whose medium the capability matrix marks **non-enumerable**: the
    /// full `S(D)` walk cannot cover it, so the whole run refuses — typed,
    /// carrying the same [`FullResyncRefusal`] shape the scheduled walk emits
    /// — rather than render a report with fabricated completeness. (The
    /// *scheduled* walk refuses per facet and walks the rest; an explicit
    /// full measurement promises complete figures, so a partial walk is not
    /// an answer.)
    #[error(
        "full verify refused: facet '{}' over medium type '{}' cannot be fully walked — {}",
        .0.facet, .0.medium_type, .0.reason
    )]
    FullWalkNonEnumerable(FullResyncRefusal),
}

/// The outcome of a [`verify_binding`] pass.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct VerifyOutcome {
    /// The binding id verified.
    pub binding: String,
    /// The key the findings were recorded under this pass.
    pub key: FindingKey,
    /// How many findings were recorded under the current key.
    pub recorded: usize,
    /// How many findings remain under prior (superseded) keys (A3).
    pub superseded: usize,
    /// The tier-3 backlog depth — findings queued for adjudication.
    pub backlog: usize,
    /// The full-enumeration scheduling decision for this run (D3) — whether a
    /// scheduled full walk fired, is not yet due, is disabled, and any typed
    /// non-enumerable refusals. Surfaced (never a silent skip) to the caller.
    pub full_resync: FullResyncDecision,
    /// Each source facet's current head token as observed by this run — the
    /// per-facet decomposition of `key.source_head`. The completed-run
    /// baseline [`record_verified_baseline`] writes as `#verified`.
    pub facet_heads: BTreeMap<String, String>,
    /// Prepared-content hashes this pass observed for **hash-less**
    /// hash-bearing (`anchored` / `derived`) anchors whose artifact resolved —
    /// the backfill worklist. The caller records them onto the anchors via
    /// [`record_anchor_hash_backfill`] after the pass returns `Ok` (the same
    /// sanctioned post-run-write pattern as [`record_verified_baseline`]);
    /// once recorded, subsequent verifies adjudicate those anchors
    /// deterministically and this list comes back empty. `authored` /
    /// `informed-by` anchors never appear here — the observation computes no
    /// hash for them.
    pub hash_backfill: Vec<ObservedArtifactHash>,
}

/// Record a **completed** verify run's baseline: for each facet head the run
/// observed, `<binding>/<facet>#verified = <token>` on the destination mem,
/// through the engine's lifecycle sync-state writer (the backlog-prescribed
/// `#verified` writer — the counterpart of the advance path's `#synced`).
///
/// Deliberately a separate step from [`verify_binding`], which keeps its
/// shared `&Engine` borrow (A5 — measurement is structurally incapable of a
/// mem mutation): the caller invokes this **only after** a verify pass
/// returned `Ok`, so an aborted or failed run never advances the token. The
/// selection loop reads the token to decide when a verify is due again; the
/// CLI `status`/report paths render it.
///
/// Returns the written sync-state keys. A binding whose run observed no facet
/// head (nothing recorded, nothing moved) writes nothing.
pub fn record_verified_baseline(
    engine: &mut Engine,
    destination_mem: &str,
    outcome: &VerifyOutcome,
    note: Option<&str>,
) -> Result<Vec<String>, crate::engine::EngineError> {
    let mut written = Vec::with_capacity(outcome.facet_heads.len());
    for (facet, token) in &outcome.facet_heads {
        let key = format!("{}/{facet}#verified", outcome.binding);
        engine.set_mem_sync_state(destination_mem, &key, token, note)?;
        written.push(key);
    }
    Ok(written)
}

/// Record a **completed** verify run's prepared-hash backfill: every hash the
/// pass observed for a hash-less hash-bearing anchor
/// ([`VerifyOutcome::hash_backfill`]) is written onto that anchor in the
/// destination mem's engine-owned anchors sidecar, through
/// [`Engine::record_anchor_observed_hashes`].
///
/// Measurement bookkeeping only: the write touches the sidecar and nothing
/// else — no entity content, no section, no `_hash`. Deliberately a separate
/// step from [`verify_binding`] (which keeps its shared `&Engine` borrow —
/// A5), mirroring [`record_verified_baseline`]: the caller invokes this only
/// after a verify pass returned `Ok`, so an aborted or failed run never
/// records a hash. Idempotent — the engine writer skips anchors that already
/// carry a hash, and a pass over fully-backfilled anchors observes an empty
/// worklist, so re-verifying stages nothing and produces no commit.
///
/// Returns how many anchors gained a recorded hash.
pub fn record_anchor_hash_backfill(
    engine: &mut Engine,
    destination_mem: &str,
    outcome: &VerifyOutcome,
    note: Option<&str>,
) -> Result<usize, crate::engine::EngineError> {
    engine.record_anchor_observed_hashes(destination_mem, &outcome.hash_backfill, note)
}

/// Split a canonical binding id `<mem>/<stem>` into its two path-safe halves,
/// or refuse. Uses the same guard as the advance store so a caller-supplied id
/// can never escape the `.memstead/state/findings/` tier.
fn split_binding_id(binding_id: &str) -> Result<(String, String), FindingsError> {
    binding_id
        .split_once('/')
        .filter(|(m, n)| is_single_component(m) && is_single_component(n))
        .map(|(m, n)| (m.to_string(), n.to_string()))
        .ok_or_else(|| FindingsError::MalformedId(binding_id.to_string()))
}

/// A single facet label for the thin verify: the lone primary facet when there
/// is exactly one, else a comma-join. Per-anchor facet attribution is a
/// group-B refinement.
fn source_facet_label(resolved: &ResolvedIngest) -> String {
    let facets: Vec<&str> = resolved
        .sources
        .iter()
        .filter_map(|s| match s {
            ResolvedSource::Primary(p) => Some(p.name.as_str()),
            ResolvedSource::Reference { .. } => None,
        })
        .collect();
    facets.join(",")
}

/// Opaque recording timestamp — unix seconds as a decimal string.
fn now_seconds() -> String {
    let secs = SystemTime::now()
        .duration_since(UNIX_EPOCH)
        .map(|d| d.as_secs())
        .unwrap_or(0);
    secs.to_string()
}

/// Each source facet's **current head token**, keyed by facet. Starts from the
/// destination mem's recorded `#synced` tokens for the binding, then overlays
/// the cursor's current-head tokens for any facet that has moved or is newly
/// seen — so the map reflects the source's current state. These are the tokens
/// [`current_source_head`] joins into the composite key, and the per-facet
/// values [`record_verified_baseline`] writes as `#verified` after a completed
/// verify run.
fn current_facet_heads(
    engine: &Engine,
    workspace_root: &Path,
    resolved: &ResolvedIngest,
) -> BTreeMap<String, String> {
    let binding_id = &resolved.name;
    let prefix = format!("{binding_id}/");
    let mut tokens: BTreeMap<String, String> = BTreeMap::new();

    // Recorded baselines for facets that have not moved since the last sync.
    if let Some(cfg) = engine.mem_config_for(&resolved.destination_mem) {
        for (k, v) in &cfg.sync_state {
            if let Some(rest) = k.strip_prefix(&prefix)
                && let Some(facet) = rest.strip_suffix("#synced")
            {
                tokens.insert(facet.to_string(), v.clone());
            }
        }
    }

    // Current-head tokens for facets that moved / reseeded this pass win.
    let cursor = compute_source_cursor(engine, resolved, workspace_root);
    for c in cursor.write_commands.iter().chain(cursor.reseed.iter()) {
        if let Some(rest) = c.key.strip_prefix(&prefix)
            && let Some(facet) = rest.strip_suffix("#synced")
        {
            tokens.insert(facet.to_string(), c.token.clone());
        }
    }

    tokens
}

/// Join a facet-head map into the composite source-head token,
/// deterministically (`facet=token;facet=token`).
fn join_facet_heads(tokens: &BTreeMap<String, String>) -> String {
    tokens
        .iter()
        .map(|(facet, token)| format!("{facet}={token}"))
        .collect::<Vec<_>>()
        .join(";")
}

/// The composite current source-head token: each source facet's current
/// baseline token, joined deterministically — the value changes iff any
/// facet's head changes (the A3 "source head moved" trigger).
fn current_source_head(
    engine: &Engine,
    workspace_root: &Path,
    resolved: &ResolvedIngest,
) -> String {
    join_facet_heads(&current_facet_heads(engine, workspace_root, resolved))
}

/// `hash(D)` for a v2 binding — the record alone carries every content
/// input, so the resolved shape is not needed.
fn binding_hash_of(binding: &Binding, _resolved: &ResolvedIngest) -> String {
    hash_binding(binding)
}

/// The current [`FindingKey`] for a binding — `hash(D)` (the half that
/// keys the store) plus the current `source_head` (observation
/// metadata carried on each finding, not part of the store key).
fn current_key(
    engine: &Engine,
    workspace_root: &Path,
    binding: &Binding,
    resolved: &ResolvedIngest,
) -> FindingKey {
    FindingKey {
        binding_hash: binding_hash_of(binding, resolved),
        source_head: current_source_head(engine, workspace_root, resolved),
    }
}

/// The current `(hash(D), source_head)` key plus the open findings under the
/// key's `hash(D)` for a binding — the read the **sync brief** (group C)
/// consumes. It resolves the current key exactly as [`verify_binding`] does,
/// reads the durable store, and returns the `current(key)` slice cloned —
/// which presents **all open findings regardless of the head they were
/// recorded at** (findings survive source movement; each carries its observed
/// head on its own key). **Read-only** on the destination mem (shared
/// `&Engine`): no findings recording, no mutation. A binding whose store does
/// not exist yet yields the key and an empty vec.
///
/// The durable authored-exclusion ledger is consulted HERE, not only at
/// recording time: an `uncovered` finding whose artifact the ledger names is
/// dropped from the slice, so an exclusion `projection advance` /
/// `projection exclude` just accepted stops presenting on the very next
/// brief — without waiting for a verify pass to rewrite the stored batch.
/// (Recording has consulted the ledger since 2026-08-28; a batch recorded
/// before an exclusion landed still carried the finding, and three
/// independent runs read that as a repair that did not take.)
pub fn current_findings(
    engine: &Engine,
    workspace_root: &Path,
    binding: &Binding,
    resolved: &ResolvedIngest,
) -> Result<(FindingKey, Vec<Finding>), FindingsError> {
    let (mem, name) = split_binding_id(&resolved.name)?;
    let key = current_key(engine, workspace_root, binding, resolved);
    let mut findings = read_findings_store(workspace_root, &mem, &name)
        .map_err(FindingsError::Store)?
        .map(|s| s.current(&key).to_vec())
        .unwrap_or_default();
    let excluded: BTreeSet<String> =
        crate::ingest::advance::read_advance_store(workspace_root, &mem, &name)
            .ok()
            .flatten()
            .map(|state| state.exclusions.keys().cloned().collect())
            .unwrap_or_default();
    if !excluded.is_empty() {
        findings.retain(|f| {
            !(f.class == FindingClass::Uncovered
                && matches!(&f.target, FindingTarget::Artifact { artifact } if excluded.contains(artifact)))
        });
    }
    Ok((key, findings))
}

/// Adjudicate one resolved anchor into a finding, or `None` when it resolves
/// clean.
///
/// **A2 enforcement — hash-drift exclusion.** A `drifted` / `recheck` state is
/// turned into a finding **only** for a hash-bearing class (`anchored` /
/// `derived`). An `authored` or `informed-by` anchor is excluded from hash-drift
/// adjudication by design: it never yields a `drifted` / `queued-for-adjudication`
/// finding here, whatever its content did. (Existence failures — `orphaned` —
/// are class-independent and reported for any class: a vanished artifact is not
/// a hash-drift claim.)
pub fn adjudicate_anchor(
    key: &FindingKey,
    facet: &str,
    entity: &str,
    anchor: &Anchor,
    state: AnchorState,
    created_at: &str,
) -> Option<Finding> {
    let (class, detail) = match state {
        AnchorState::Resolves => return None,
        AnchorState::Orphaned => (
            FindingClass::UnresolvableAnchor,
            format!(
                "artifact '{}' the anchor references is no longer present in the medium",
                anchor.artifact
            ),
        ),
        AnchorState::Drifted | AnchorState::Recheck => {
            // Hash-drift adjudication — excluded for non-hash-bearing classes (A2).
            if !anchor.class.is_hash_bearing() {
                return None;
            }
            match state {
                AnchorState::Drifted => (
                    FindingClass::Drifted,
                    format!(
                        "prepared-content hash of '{}' drifted from the anchored hash",
                        anchor.artifact
                    ),
                ),
                _ => (
                    FindingClass::QueuedForAdjudication,
                    format!(
                        "hash adjudication of '{}' deferred (recheck); queued",
                        anchor.artifact
                    ),
                ),
            }
        }
    };
    Some(Finding {
        key: key.clone(),
        facet: facet.to_string(),
        target: FindingTarget::Anchor {
            entity: entity.to_string(),
            artifact: anchor.artifact.clone(),
        },
        class,
        detail,
        created_at: created_at.to_string(),
    })
}

// ---------------------------------------------------------------------------
// Tier-3 caps + scheduling (group D)
// ---------------------------------------------------------------------------

/// One source facet's enumerability — the input the full-resync scheduler
/// reasons over (D3). Built from the capability matrix per primary facet.
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct FacetEnumerability {
    /// The source facet.
    pub facet: String,
    /// The medium type wire string.
    pub medium_type: String,
    /// Whether the medium's scope is enumerable (`S(D)` computable).
    pub enumerable: bool,
}

/// A typed refusal from the scheduled full-enumeration walk (D3): a source facet
/// whose medium the capability matrix marks **non-enumerable**, which the walk
/// cannot cover. Emitted instead of a silent skip or a fabricated full-coverage
/// claim.
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct FullResyncRefusal {
    /// The refused facet.
    pub facet: String,
    /// The non-enumerable medium type.
    pub medium_type: String,
    /// Why the scheduled walk refuses this facet.
    pub reason: String,
}

/// The full-enumeration scheduling decision for a verify run (D3). A closed,
/// serialized vocabulary so the caller (and the fidelity report) can render the
/// outcome without inferring it.
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
#[serde(tag = "state", rename_all = "kebab-case")]
pub enum FullResyncDecision {
    /// `full_resync_every == 0` — scheduled full walks are disabled; the run
    /// uses the rotating sample only.
    Disabled,
    /// Scheduled but not due this run — the rotating sample runs; the counter
    /// advances toward the next full walk.
    NotDue {
        /// This run's 1-based verify-run count.
        run_count: u64,
        /// The configured cadence.
        every: u32,
        /// How many further runs until the next scheduled full walk.
        runs_until_due: u32,
    },
    /// Due this run: a full-enumeration walk fires for the **enumerable** facets
    /// (guaranteeing a complete coverage picture), and every **non-enumerable**
    /// facet is refused with a typed signal — never a silent skip, never a
    /// fabricated full-coverage claim.
    Due {
        /// This run's 1-based verify-run count.
        run_count: u64,
        /// The configured cadence.
        every: u32,
        /// The facets a full enumeration walk covers this run.
        walked_facets: Vec<String>,
        /// The non-enumerable facets the walk refuses (typed).
        refused: Vec<FullResyncRefusal>,
    },
    /// A full walk was **explicitly requested** ([`verify_binding_full`] —
    /// the CLI's `--full`), not schedule-triggered: the whole enumerable
    /// `S(D)` is walked, the sampling scheduler is bypassed, and the
    /// adjudication cap is treated as unlimited. Only ever constructed after
    /// the every-facet-enumerable gate, so it carries no per-facet refusal
    /// list — a non-enumerable facet refuses the entire run instead
    /// ([`FindingsError::FullWalkNonEnumerable`]).
    Forced {
        /// The facets the full enumeration walk covers.
        walked_facets: Vec<String>,
    },
}

impl FullResyncDecision {
    /// Whether this run performs a full-enumeration walk (a scheduled sweep
    /// is due, or an explicit full measurement was requested). `false` for
    /// `Disabled` / `NotDue`.
    pub fn is_full_walk(&self) -> bool {
        matches!(
            self,
            FullResyncDecision::Due { .. } | FullResyncDecision::Forced { .. }
        )
    }
}

/// Decide the `full_resync_every` scheduling outcome for a verify run (D3) —
/// pure and level-triggered on the persisted run counter. `every == 0` disables
/// scheduled walks; otherwise the walk is **due** when `run_count` is a multiple
/// of `every`. When due, enumerable facets are walked and non-enumerable facets
/// are refused with a typed [`FullResyncRefusal`] (never silently skipped).
pub fn schedule_full_resync(
    every: u32,
    run_count: u64,
    facets: &[FacetEnumerability],
) -> FullResyncDecision {
    if every == 0 {
        return FullResyncDecision::Disabled;
    }
    let modulo = run_count % u64::from(every);
    if modulo != 0 {
        return FullResyncDecision::NotDue {
            run_count,
            every,
            runs_until_due: (u64::from(every) - modulo) as u32,
        };
    }
    let mut walked_facets = Vec::new();
    let mut refused = Vec::new();
    for f in facets {
        if f.enumerable {
            walked_facets.push(f.facet.clone());
        } else {
            refused.push(FullResyncRefusal {
                facet: f.facet.clone(),
                medium_type: f.medium_type.clone(),
                reason: format!(
                    "medium type '{}' is non-enumerable — a full-enumeration walk cannot cover \
                     it; the scheduled full resync refuses rather than claim full coverage",
                    f.medium_type
                ),
            });
        }
    }
    FullResyncDecision::Due {
        run_count,
        every,
        walked_facets,
        refused,
    }
}

/// The rotation item key a drift-adjudication candidate is selected under (D2) —
/// stable across runs for a given `(entity, artifact)` so the rotating window
/// covers a reproducible sequence.
fn candidate_key(entity: &str, anchor: &Anchor) -> String {
    format!("{entity}\u{1f}{}", anchor.artifact)
}

/// Adjudicate the hash-drift **candidates** under the per-run cap (D1). Each
/// candidate is an anchor observation that hash-drift adjudication applies to
/// (a hash-bearing anchor in a `drifted` / `recheck` state). `window` is the
/// rotation-selected key set this run adjudicates (D2); a candidate whose
/// [`candidate_key`] is **not** in the window is **queued** as
/// `queued-for-adjudication` (the tier-3 backlog remainder) rather than
/// adjudicated. `window = None` means uncapped — every candidate is adjudicated.
///
/// Existence failures (`orphaned`) are **not** candidates: they are cheap
/// existence checks, always reported by [`verify_binding`] regardless of the
/// cap. Non-hash-bearing classes never reach here (they produce no adjudication).
fn adjudicate_candidates(
    key: &FindingKey,
    facet: &str,
    candidates: &[(String, Anchor, AnchorState)],
    window: Option<&BTreeSet<String>>,
    created_at: &str,
) -> Vec<Finding> {
    let mut out = Vec::new();
    for (entity, anchor, state) in candidates {
        let ck = candidate_key(entity, anchor);
        let adjudicate_now = window.is_none_or(|w| w.contains(&ck));
        if adjudicate_now {
            if let Some(f) = adjudicate_anchor(key, facet, entity, anchor, *state, created_at) {
                out.push(f);
            }
        } else {
            // Beyond the per-run cap: queue the remainder (D1) — it re-presents
            // in a later run's rotation window (D2), so the whole candidate set
            // is covered over a full rotation.
            out.push(Finding {
                key: key.clone(),
                facet: facet.to_string(),
                target: FindingTarget::Anchor {
                    entity: entity.clone(),
                    artifact: anchor.artifact.clone(),
                },
                class: FindingClass::QueuedForAdjudication,
                detail: format!(
                    "adjudication of '{}' deferred (per-run adjudication cap reached); queued",
                    anchor.artifact
                ),
                created_at: created_at.to_string(),
            });
        }
    }
    out
}

/// Stable identity of a finding's subject, class-independent — the unit the
/// head-durable merge ([`merge_with_prior`]) matches prior and fresh findings
/// on.
fn target_key(target: &FindingTarget) -> String {
    match target {
        FindingTarget::Anchor { entity, artifact } => format!("a\u{1f}{entity}\u{1f}{artifact}"),
        FindingTarget::Artifact { artifact } => format!("f\u{1f}{artifact}"),
    }
}

/// What one verify pass **observed** and what still exists — the inputs the
/// head-durable merge judges prior findings against.
struct PassObservation {
    /// Anchor targets ([`target_key`] form) whose live state this pass
    /// resolved (`Some(state)`).
    anchors_observed: BTreeSet<String>,
    /// Anchor targets still present in the mem's sidecar — any state,
    /// observed or not.
    anchors_existing: BTreeSet<String>,
    /// Artifact ids the coverage leg looked at this pass (the sample window,
    /// or the whole of `S(D)` on a full walk).
    files_observed: BTreeSet<String>,
    /// The binding's enumerable source set `S(D)`.
    s_d: BTreeSet<String>,
}

/// Merge this pass's fresh findings with the prior open batch — the write half
/// of head-durable findings (the store keys on `hash(D)` alone; see the module
/// docs).
///
/// A **re-observed** target's outcome is this pass's: a prior finding for it
/// is closed (observed clean — no fresh finding) or replaced (observed still
/// wrong — fresh finding wins). One exception keeps supersession honest: a
/// fresh `queued-for-adjudication` entry is a scheduling deferral, not an
/// observation, so it never downgrades a prior substantive adjudication —
/// a prior `drifted`/`wrong` verdict stands in its place.
///
/// An **unobserved** prior finding carries forward iff its subject is still
/// open:
/// - an anchor finding carries while its anchor still exists but was
///   unobservable this pass; a vanished anchor closes it;
/// - a coverage (artifact) finding carries while the artifact is still in
///   `S(D)` and is still unaccounted (`accounted_now`: no covering anchor
///   and no ledger exclusion); departure from `S(D)`, gained coverage, or a
///   recorded exclusion closes it — so an exclusion supersedes a standing
///   `uncovered` finding in the store itself, not only in the presentation
///   filter, and the verdict count cannot contradict the coverage section.
///
/// Carried findings keep their original [`Finding::key`] (the head they were
/// observed at). The carry rules are the growth bound: nothing is carried
/// whose subject left the source or re-adjudicated clean, so the open set
/// cannot grow without bound — and a closed/superseded finding is never
/// resurrected (it is simply absent from the recorded batch).
fn merge_with_prior(
    mut fresh: Vec<Finding>,
    prior: &[Finding],
    obs: &PassObservation,
    accounted_now: impl Fn(&str) -> bool,
) -> Vec<Finding> {
    let fresh_idx: BTreeMap<String, usize> = fresh
        .iter()
        .enumerate()
        .map(|(i, f)| (target_key(&f.target), i))
        .collect();
    let mut carried: Vec<Finding> = Vec::new();
    for f in prior {
        let tkey = target_key(&f.target);
        let observed = match &f.target {
            FindingTarget::Anchor { .. } => obs.anchors_observed.contains(&tkey),
            FindingTarget::Artifact { artifact } => obs.files_observed.contains(artifact),
        };
        if observed {
            // Deferral must not supersede a substantive prior verdict.
            if matches!(f.class, FindingClass::Drifted | FindingClass::Wrong)
                && let Some(&i) = fresh_idx.get(&tkey)
                && fresh[i].class == FindingClass::QueuedForAdjudication
            {
                fresh[i] = f.clone();
            }
            continue;
        }
        if fresh_idx.contains_key(&tkey) {
            continue; // a fresh outcome exists for this target anyway
        }
        let still_open = match &f.target {
            FindingTarget::Anchor { .. } => obs.anchors_existing.contains(&tkey),
            FindingTarget::Artifact { artifact } => {
                obs.s_d.contains(artifact) && !accounted_now(artifact)
            }
        };
        if still_open {
            carried.push(f.clone());
        }
    }
    fresh.extend(carried);
    fresh
}

/// The thin `projection verify` write path (group A). Measures a binding's
/// fidelity and records durable findings under the current `(hash(D),
/// source_head)` key; **read-only on the destination mem** — the `&Engine`
/// (shared, not `&mut`) makes a mem mutation structurally impossible (A5).
///
/// It does two things a real verify does, enough to populate and exercise the
/// store (A1/A2): it adjudicates the destination mem's anchors against their
/// live source observation (via [`adjudicate_anchor`], honouring the A2
/// hash-drift exclusion), and it samples in-scope source artifacts through the
/// retained [`next_batch`] rotation (A4 — the rotation's sole surviving
/// consumer, used only to schedule which artifacts a pass looks at) to surface
/// uncovered ones. The full tier-1 fidelity report and the sync brief are
/// group B/C — this path deliberately renders neither.
pub fn verify_binding(
    engine: &Engine,
    workspace_root: &Path,
    binding: &Binding,
    resolved: &ResolvedIngest,
) -> Result<VerifyOutcome, FindingsError> {
    run_verify(engine, workspace_root, binding, resolved, false)
}

/// [`verify_binding`]'s **full-measurement** mode (the CLI's `--full`):
/// enumerate the whole `S(D)` (the sampling scheduler is bypassed — the
/// rotation state is neither consulted nor advanced), treat the per-run
/// adjudication cap as unlimited, and observe every anchor — so the recorded
/// findings, and the tier-1 report computed over them, carry no
/// sampling/truncation caveat: coverage and accuracy are computed, not
/// sampled. The prepared-hash backfill worklist rides the outcome exactly as
/// on a sampled pass.
///
/// REFUSAL: a facet whose medium the capability matrix marks non-enumerable
/// refuses the **whole** run with the typed
/// [`FindingsError::FullWalkNonEnumerable`] — an explicit full measurement
/// promises complete figures, so a partial walk is never silently substituted
/// and a fabricated-complete report is never rendered. The sampled path
/// ([`verify_binding`]) is untouched by this mode's existence.
pub fn verify_binding_full(
    engine: &Engine,
    workspace_root: &Path,
    binding: &Binding,
    resolved: &ResolvedIngest,
) -> Result<VerifyOutcome, FindingsError> {
    run_verify(engine, workspace_root, binding, resolved, true)
}

/// The shared verify pass behind [`verify_binding`] (`full = false`, the
/// capped/sampled loop economics) and [`verify_binding_full`] (`full = true`,
/// the uncapped whole-`S(D)` measurement).
fn run_verify(
    engine: &Engine,
    workspace_root: &Path,
    binding: &Binding,
    resolved: &ResolvedIngest,
    full: bool,
) -> Result<VerifyOutcome, FindingsError> {
    let binding_id = resolved.name.clone();
    let (mem, name) = split_binding_id(&binding_id)?;

    // Full measurement requires every primary facet to be enumerable — refuse
    // the whole run typed before observing anything (never a fake-complete
    // report over a partially-walkable source).
    if full {
        for source in &resolved.sources {
            if let ResolvedSource::Primary(p) = source {
                let medium_type = medium_type_wire(p.medium_type);
                if !medium_capabilities(p.medium_type).enumerable {
                    return Err(FindingsError::FullWalkNonEnumerable(FullResyncRefusal {
                        facet: p.name.clone(),
                        medium_type: medium_type.clone(),
                        reason: format!(
                            "medium type '{medium_type}' is non-enumerable — a full-enumeration \
                             walk cannot cover it; the full measurement refuses rather than \
                             render a report with fabricated completeness"
                        ),
                    }));
                }
            }
        }

        // The matrix claiming enumerability is not evidence that a walk
        // happened. When a medium is declared enumerable but its walk yields
        // nothing, `--full` used to sail through the gate above and return
        // clean over a zero-artifact measurement — coverage 0/0, every anchor
        // unobserved, verdict green. That is the exact shape a full
        // measurement exists to make impossible, so refuse it.
        //
        // This guard survives the enumerator being fixed: it is the standing
        // check that a future medium cannot be added to the matrix as
        // enumerable without an enumeration arm and still report green.
        // Checked PER FACET. A binding-level union hides the mixed case: one
        // facet that walks makes the union non-empty, so `--full` returned
        // clean while a sibling enumerable facet was never walked at all —
        // complete coverage claimed over a scope nobody looked at. Each
        // enumerable facet must produce something of its own.
        for source in &resolved.sources {
            if let ResolvedSource::Primary(p) = source
                && medium_capabilities(p.medium_type).enumerable
            {
                let walked = super::cursor::enumerate_source_artifacts_reported(
                    engine,
                    p,
                    &resolved.deny_paths,
                    workspace_root,
                );
                let medium_type = medium_type_wire(p.medium_type);
                // A PARTIAL walk is the case the empty-check above cannot
                // see: some patterns resolved, so the facet is non-empty and
                // the gate waved it through, and `--full` then reported
                // complete coverage over a denominator missing whatever the
                // skipped patterns would have contributed. A full measurement
                // promises complete figures; a known-incomplete enumeration
                // cannot deliver one.
                if let Some(why) = walked.partiality_reason() {
                    return Err(FindingsError::FullWalkNonEnumerable(FullResyncRefusal {
                        facet: p.name.clone(),
                        medium_type: medium_type.clone(),
                        reason: format!(
                            "this facet's enumeration is incomplete — {why} — so a full \
                             measurement would claim complete coverage over a denominator \
                             that is not the population. Fix those patterns first"
                        ),
                    }));
                }
                if walked.files.is_empty() {
                    // The remedy text has to name the real cause. "Check that
                    // its scope patterns actually select something" is wrong
                    // advice when the patterns DO select artifacts and merely
                    // speak the retired workspace-relative dialect.
                    let remedy = if walked.legacy_dialect.is_empty() {
                        "Check that its scope patterns actually select something".to_string()
                    } else {
                        format!(
                            "its scope pattern(s) are still written against the workspace root \
                             rather than the source pointer ({}), so they select nothing under \
                             the pointer join — rewrite them relative to the pointer",
                            walked
                                .legacy_dialect
                                .iter()
                                .map(|n| n.pattern.as_str())
                                .collect::<Vec<_>>()
                                .join(", ")
                        )
                    };
                    return Err(FindingsError::FullWalkNonEnumerable(FullResyncRefusal {
                        facet: p.name.clone(),
                        medium_type: medium_type.clone(),
                        reason: format!(
                            "medium type '{medium_type}' claims to be enumerable, but this \
                             facet's enumeration yielded no artifacts — a full measurement over \
                             an empty walk would report complete coverage of nothing. {remedy}"
                        ),
                    }));
                }
            }
        }
    }

    // Refuse a vanished or unmounted path-based source before observing
    // anything: a missing tree would otherwise degrade to an empty
    // enumeration whose head token (the digest of nothing) masquerades as
    // a real observation — and the caller's completed-run baseline write
    // would clobber a genuine `#verified` token with it.
    for source in &resolved.sources {
        if let ResolvedSource::Primary(p) = source
            && matches!(
                p.medium_type,
                crate::pipeline::MediumType::Codebase
                    | crate::pipeline::MediumType::Filesystem
                    | crate::pipeline::MediumType::Git
            )
        {
            let base = super::resolve::source_base_path(p, workspace_root);
            // Unreachable is not only "absent". A directory that exists but
            // cannot be entered (permissions, a broken mount) enumerates
            // nothing, and the pass then reports every anchor unresolvable —
            // drift, in the verdict, blamed on a mem that did not move. The
            // read attempt is the test: existence alone let that through.
            // These mediums (codebase / filesystem / git) are all
            // directory-shaped — their scope globs enumerate under a tree —
            // so reachable means it IS a readable directory. A regular file
            // where the pointer promises a tree enumerates nothing and used
            // to slip through to be reported as drift, though the refusal
            // text already promised "present but not enumerable".
            let reachable = base.is_dir() && std::fs::read_dir(&base).is_ok();
            if !reachable {
                return Err(FindingsError::SourceUnreachable {
                    source_name: p.name.clone(),
                    path: base.display().to_string(),
                });
            }
        }
    }

    // The same refusal for a graph source, which needs it just as badly and
    // for a worse reason. A graph source's "tree" is a mounted mem; if that
    // mem is absent from the workspace, every entity anchor into it misses
    // the store and observes as ABSENT — a definite `orphaned`, not an
    // honest "unobserved". The pass would then report drift, tell the reader
    // to repoint or unset anchors that are perfectly fine, and — because
    // `orphaned` is the one state that satisfies prune's all-orphaned gate —
    // let prune propose deleting the destination entities. An unmounted mem
    // must never be indistinguishable from a deleted one.
    for source in &resolved.sources {
        if let ResolvedSource::Primary(p) = source
            && p.medium_type == crate::pipeline::MediumType::Graph
            && !engine.mem_names().iter().any(|m| *m == p.pointer)
        {
            return Err(FindingsError::SourceUnreachable {
                source_name: p.name.clone(),
                path: format!("mem `{}` (not mounted in this workspace)", p.pointer),
            });
        }
    }

    // The facet-head map is the key's per-facet decomposition: computed once,
    // joined into `key.source_head`, and returned on the outcome so a
    // completed run's baseline write records exactly what this run observed.
    let facet_heads = current_facet_heads(engine, workspace_root, resolved);
    let key = FindingKey {
        binding_hash: binding_hash_of(binding, resolved),
        source_head: join_facet_heads(&facet_heads),
    };
    let now = now_seconds();
    let facet = source_facet_label(resolved);
    let cache_root = workspace_root.join(".memstead.cache").join("ingest");

    // Tier-3 operations knobs (group D): the per-run adjudication cap (D1), the
    // scheduled full-walk cadence (D3), and the sample window size. All come off
    // the `verify` block, defaulting to the dogfood-tuned engine defaults when it
    // is absent (verify has no mutating operation to gate — an absent block is
    // defaults, never a refusal).
    let verify_op = binding.operations.verify.as_ref();
    let cap = verify_op.map_or(DEFAULT_ADJUDICATION_CAP, |v| v.adjudication_cap);
    let full_resync_every = verify_op.map_or(DEFAULT_FULL_RESYNC_EVERY, |v| v.full_resync_every);
    let sample_batch = verify_op
        .map_or(resolved.batch_size, |v| v.batch_size)
        .max(1) as usize;

    // Level-trigger clock + full-resync schedule (D3) — the counter ticks every
    // run (even a non-enumerable one) so the schedule can refuse on time. An
    // explicit full measurement ticks the same clock (it is a verify run) but
    // its walk decision is `Forced`, not schedule-derived: the every-facet-
    // enumerable gate above already held, so no per-facet refusal list exists.
    let run_count = bump_verify_runs(&cache_root, &binding_id);
    let facet_enum: Vec<FacetEnumerability> = resolved
        .sources
        .iter()
        .filter_map(|s| match s {
            ResolvedSource::Primary(p) => Some(FacetEnumerability {
                facet: p.name.clone(),
                medium_type: medium_type_wire(p.medium_type),
                enumerable: medium_capabilities(p.medium_type).enumerable,
            }),
            ResolvedSource::Reference { .. } => None,
        })
        .collect();
    let full_resync = if full {
        FullResyncDecision::Forced {
            walked_facets: facet_enum.iter().map(|f| f.facet.clone()).collect(),
        }
    } else {
        schedule_full_resync(full_resync_every, run_count, &facet_enum)
    };
    // A SCHEDULED due walk consults partiality the way `--full` does: the
    // scheduler branches on enumerability alone (it is pure and has no
    // filesystem), so a facet whose enumeration is known-incomplete — a
    // malformed or retired-dialect scope pattern — would be walked and
    // announced as full over a denominator that is not the population. Demote
    // such a facet into the typed refusal list instead, exactly where the
    // non-enumerable ones already land. The enumeration performed here is the
    // walk itself — its files feed the coverage pass below, so nothing is
    // enumerated twice. (`Forced` needs no demotion: the explicit-full gate
    // already refused the whole run on any partial facet.)
    let mut full_walk_files: Vec<String> = Vec::new();
    let full_resync = match full_resync {
        FullResyncDecision::Due {
            run_count,
            every,
            walked_facets,
            mut refused,
        } => {
            let mut kept: Vec<String> = Vec::new();
            for source in &resolved.sources {
                if let ResolvedSource::Primary(p) = source
                    && walked_facets.iter().any(|f| f == &p.name)
                {
                    let walked = super::cursor::enumerate_source_artifacts_reported(
                        engine,
                        p,
                        &resolved.deny_paths,
                        workspace_root,
                    );
                    if let Some(why) = walked.partiality_reason() {
                        refused.push(FullResyncRefusal {
                            facet: p.name.clone(),
                            medium_type: medium_type_wire(p.medium_type),
                            reason: format!(
                                "this facet's enumeration is incomplete — {why} — so the \
                                 scheduled full walk refuses it rather than announce complete \
                                 coverage over a denominator that is not the population"
                            ),
                        });
                    } else {
                        kept.push(p.name.clone());
                        full_walk_files.extend(walked.files);
                    }
                }
            }
            FullResyncDecision::Due {
                run_count,
                every,
                walked_facets: kept,
                refused,
            }
        }
        FullResyncDecision::Forced { walked_facets } => {
            for source in &resolved.sources {
                if let ResolvedSource::Primary(p) = source
                    && medium_capabilities(p.medium_type).enumerable
                {
                    full_walk_files.extend(enumerate_source_artifacts(
                        engine,
                        p,
                        &resolved.deny_paths,
                        workspace_root,
                    ));
                }
            }
            FullResyncDecision::Forced { walked_facets }
        }
        other => other,
    };

    let mut findings: Vec<Finding> = Vec::new();

    // 1. Adjudicate the destination mem's anchors against the live source, under
    //    the per-run cap (D1) with a rotating window (D2). Existence failures
    //    (orphaned) are cheap and always reported; hash-drift candidates are
    //    bounded — the cap-sized rotation window is adjudicated, the remainder
    //    queued, and successive runs rotate the window so the whole anchor set is
    //    covered over a full rotation.
    let mut existence: Vec<(String, Anchor, AnchorState)> = Vec::new();
    let mut candidates: Vec<(String, Anchor, AnchorState)> = Vec::new();
    // First-observation backfill worklist: a hash-less hash-bearing anchor
    // whose artifact resolved and yielded a prepared-content hash is not a
    // drift candidate (there is no recorded hash to compare — recorded ==
    // observed by construction once the backfill lands); it resolves clean
    // this pass and the observed hash rides the outcome for the caller's
    // [`record_anchor_hash_backfill`] write. From the next pass on the
    // anchor adjudicates deterministically — the recheck queue drains
    // instead of re-queueing forever.
    let mut hash_backfill: Vec<ObservedArtifactHash> = Vec::new();
    let mut backfill_seen: BTreeSet<(String, String)> = BTreeSet::new();
    // Observation bookkeeping for the head-durable merge: which anchor
    // targets exist, and which of them this pass actually resolved.
    let mut anchors_existing: BTreeSet<String> = BTreeSet::new();
    let mut anchors_observed: BTreeSet<String> = BTreeSet::new();
    // Scoped to this binding's population (consistency-sweep 03/01). An
    // excluded anchor must never raise a finding against a binding that did
    // not write it or has disclaimed the file; the report names the exclusions.
    let population = crate::ingest::anchor_population::population_for(
        engine,
        resolved,
        Some(binding_hash_of(binding, resolved).as_str()),
    );
    for (eid, resolved_anchor) in population.included {
        let tkey = target_key(&FindingTarget::Anchor {
            entity: eid.as_ref().to_string(),
            artifact: resolved_anchor.anchor.artifact.clone(),
        });
        anchors_existing.insert(tkey.clone());
        let Some(state) = resolved_anchor.state else {
            continue;
        };
        anchors_observed.insert(tkey);
        let observed_hash = resolved_anchor.observed_hash;
        let anchor = resolved_anchor.anchor;
        match state {
            AnchorState::Resolves => {}
            AnchorState::Orphaned => existence.push((eid.as_ref().to_string(), anchor, state)),
            AnchorState::Drifted | AnchorState::Recheck => {
                // Only hash-bearing anchors are hash-drift candidates (A2); a
                // non-hash-bearing class yields no adjudication.
                if !anchor.class.is_hash_bearing() {
                    continue;
                }
                if anchor.hash.is_none()
                    && let Some(hash) = observed_hash
                {
                    // First observation of a hash-less anchor on a resolvable
                    // artifact: backfill, not adjudication.
                    if backfill_seen.insert((eid.as_ref().to_string(), anchor.artifact.clone())) {
                        hash_backfill.push(ObservedArtifactHash {
                            entity: eid.as_ref().to_string(),
                            artifact: anchor.artifact.clone(),
                            hash,
                        });
                    }
                    continue;
                }
                candidates.push((eid.as_ref().to_string(), anchor, state));
            }
        }
    }
    for (entity, anchor, state) in &existence {
        if let Some(f) = adjudicate_anchor(&key, &facet, entity, anchor, *state, &now) {
            findings.push(f);
        }
    }
    // `cap == 0` disables the cap (adjudicate every candidate), and a full
    // measurement treats any configured cap as unlimited — its rotation state
    // is neither consulted nor advanced (the scheduler is bypassed, so the
    // sampled loop's window sequence is untouched by a full run). Otherwise a
    // cap-sized rotation window selects this run's adjudicated set (D1/D2).
    let window: Option<BTreeSet<String>> = if full || cap == 0 {
        None
    } else {
        let mut keys: Vec<String> = candidates
            .iter()
            .map(|(e, a, _)| candidate_key(e, a))
            .collect();
        keys.sort();
        keys.dedup();
        next_rotation_batch(
            &cache_root,
            &binding_id,
            ROTATION_ANCHOR_ADJUDICATION,
            keys,
            cap as usize,
        )
        .map(|b| b.files.into_iter().collect())
    };
    findings.extend(adjudicate_candidates(
        &key,
        &facet,
        &candidates,
        window.as_ref(),
        &now,
    ));

    // 2. Sample in-scope source artifacts for coverage. When a full walk is due
    //    (D3) or explicitly requested (`Forced`), enumerate the WHOLE source of
    //    every enumerable facet — guaranteeing complete coverage this run;
    //    otherwise sample a bounded rotating window (D2). Non-enumerable facets
    //    are refused (scheduled: the typed refusal rides on `full_resync`;
    //    explicit: the whole run refused before observing), never silently
    //    claimed as covered.
    // `S(D)` — the in-scope population under the binding as it is declared
    // NOW (deny_paths applied). Computed before the sample is drawn so the
    // window can be held to it: the rotation scheduler reconciles its
    // in-flight order against this set, and the retain below is the second
    // wall for the same invariant, a recorded `uncovered` finding names an
    // artifact of `S(D)` and nothing else.
    let mut s_d: BTreeSet<String> = BTreeSet::new();
    for source in &resolved.sources {
        if let ResolvedSource::Primary(p) = source
            && medium_capabilities(p.medium_type).enumerable
        {
            s_d.extend(enumerate_source_artifacts(
                engine,
                p,
                &resolved.deny_paths,
                workspace_root,
            ));
        }
    }
    let mut sample_files: Vec<String> = if full_resync.is_full_walk() {
        // Collected above where the walk decision was settled — only facets
        // the decision actually announces as walked contribute.
        let mut all = full_walk_files;
        all.sort();
        all.dedup();
        all
    } else {
        next_batch(engine, resolved, workspace_root, &cache_root, sample_batch)
            .map(|b| b.files)
            .unwrap_or_default()
    };
    sample_files.retain(|f| s_d.contains(f));
    // Filtered by BINDING, not merely by mem (consistency-sweep 03/01,
    // criterion 7). The report's coverage lookup was scoped first and this one
    // was missed, which is the worse of the two: this decides whether an
    // `Uncovered` finding is RECORDED and whether a prior one stays open, so a
    // mem filter here let another binding's anchor mark a file covered in the
    // durable store. An anchor with no recorded binding still counts, by the
    // same pre-provenance fallback the population uses.
    let this_binding = binding_hash_of(binding, resolved);
    // An anchor whose ENTITY is gone covers nothing (03/02, criterion 5),
    // guarded on the reconciliation having been possible at all so an
    // unreconcilable mem keeps its coverage rather than reading as wholly
    // uncovered.
    let entity_end_reconciled = engine
        .entity_set_is_reconcilable(&resolved.destination_mem)
        .is_ok();
    let covered_now = |artifact: &str| {
        engine
            .anchors_referencing_artifact(artifact)
            .iter()
            .any(|(eid, a)| {
                eid.mem() == resolved.destination_mem.as_str()
                    && a.binding
                        .as_deref()
                        .map(|b| b == this_binding.as_str())
                        .unwrap_or(true)
                    && (!entity_end_reconciled || !engine.entity_is_absent(eid))
            })
    };
    // The durable authored-exclusion ledger (B4) gates the RECORDING, not
    // only the report's decoration: an artifact mined and deliberately
    // excluded with a rationale is not an uncovered finding. Until
    // 2026-08-28 only the report body consulted the ledger, so the verdict
    // line and the findings store kept counting exclusions as uncovered
    // (three of them on plugin/graph) while the rationales rendered right
    // beside the count.
    // Reconciled first (A3 AC3): an exclusion whose source left the
    // declaration is dropped here as well, not only when a brief renders.
    let excluded: BTreeSet<String> =
        crate::ingest::advance::reconcile_exclusions(engine, workspace_root, resolved)
            .map(|l| l.active.into_iter().map(|e| e.artifact).collect())
            .unwrap_or_default();
    for file in &sample_files {
        if !covered_now(file) && !excluded.contains(file) {
            findings.push(Finding {
                key: key.clone(),
                facet: facet.clone(),
                target: FindingTarget::Artifact {
                    artifact: file.clone(),
                },
                class: FindingClass::Uncovered,
                detail: "source artifact in scope has no anchor in the destination mem".to_string(),
                created_at: now.clone(),
            });
        }
    }

    // 3. Head-durable merge (the store keys on hash(D) alone): fold the prior
    //    open batch into this pass's findings — re-observed targets take this
    //    pass's outcome; unobserved-but-still-open ones carry forward with
    //    their original observed head; departed/covered/vanished subjects
    //    close. Sync briefs thus keep presenting an open finding across
    //    source-head movement until a pass observes it clean.
    let mut store = read_findings_store(workspace_root, &mem, &name)
        .map_err(FindingsError::Store)?
        .unwrap_or_else(|| FindingsStore {
            binding: binding_id.clone(),
            ..Default::default()
        });
    let obs = PassObservation {
        anchors_observed,
        anchors_existing,
        files_observed: sample_files.into_iter().collect(),
        s_d,
    };
    let prior = store.current(&key).to_vec();
    // The merge's accounting closure folds the exclusion ledger in: an
    // artifact that gained an authored exclusion since its `uncovered`
    // finding was recorded is accounted for, so the stale finding closes in
    // the store instead of being carried forward and merely hidden by the
    // presentation filter.
    let findings = merge_with_prior(findings, &prior, &obs, |artifact: &str| {
        covered_now(artifact) || excluded.contains(artifact)
    });

    let backlog = findings
        .iter()
        .filter(|f| f.class == FindingClass::QueuedForAdjudication)
        .count();

    // Record under the current key (prior-hash batches retained, segregated —
    // A3), persist to the durable state tier (A1).
    let recorded = findings.len();
    store.record(key.clone(), now, findings);
    let superseded = store.superseded(&key).len();
    write_findings_store(workspace_root, &mem, &name, &store).map_err(FindingsError::Store)?;

    Ok(VerifyOutcome {
        binding: binding_id,
        key,
        recorded,
        superseded,
        backlog,
        full_resync,
        facet_heads,
        hash_backfill,
    })
}

/// The medium type's wire string (`codebase` / `web` / …) — the serde form the
/// capability matrix and reports use.
fn medium_type_wire(t: crate::pipeline::MediumType) -> String {
    serde_json::to_value(t)
        .ok()
        .and_then(|v| v.as_str().map(str::to_string))
        .unwrap_or_default()
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::anchor::{Anchor, AnchorGrain, AnchorHashStability, AnchorProvenanceClass};

    fn key(hash: &str, head: &str) -> FindingKey {
        FindingKey {
            binding_hash: hash.to_string(),
            source_head: head.to_string(),
        }
    }

    fn anchor(class: AnchorProvenanceClass) -> Anchor {
        Anchor {
            artifact: "src/lib.rs".to_string(),
            grain: AnchorGrain::File,
            class,
            at_version: None,
            hash: if class.is_hash_bearing() {
                Some("h1".to_string())
            } else {
                None
            },
            hash_stability: AnchorHashStability::Stable,
            derived_from: Vec::new(),
            binding: None,
            source: None,
            span_unvalidated: false,
            hash_source: None,
            last_observed: None,
        }
    }

    /// The store round-trips through serde and survives a write/read cycle on
    /// disk — the durability A1 rests on.
    #[test]
    fn store_round_trips_on_disk_and_delete_is_idempotent() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        assert!(
            read_findings_store(root, "engine", "graph")
                .unwrap()
                .is_none()
        );

        let mut store = FindingsStore {
            binding: "engine/graph".to_string(),
            ..Default::default()
        };
        let k = key("hashA", "head1");
        store.record(
            k.clone(),
            "1".to_string(),
            vec![Finding {
                key: k.clone(),
                facet: "src".to_string(),
                target: FindingTarget::Artifact {
                    artifact: "src/a.rs".to_string(),
                },
                class: FindingClass::Uncovered,
                detail: "d".to_string(),
                created_at: "1".to_string(),
            }],
        );
        write_findings_store(root, "engine", "graph", &store).unwrap();
        assert!(findings_store_path(root, "engine", "graph").exists());

        // The store subtree self-ignores: per-checkout engine state must
        // not surface as untracked noise in a tracked workspace.
        let ignore = root
            .join(WORKSPACE_STORE_DIR)
            .join(STATE_DIR)
            .join(FINDINGS_DIR)
            .join(".gitignore");
        assert_eq!(std::fs::read_to_string(&ignore).unwrap(), "*\n");

        // Fresh read from disk (a later process) sees the findings (A1).
        let back = read_findings_store(root, "engine", "graph")
            .unwrap()
            .unwrap();
        assert_eq!(back, store);
        assert_eq!(back.current(&k).len(), 1);

        delete_findings_store(root, "engine", "graph").unwrap();
        assert!(
            read_findings_store(root, "engine", "graph")
                .unwrap()
                .is_none()
        );
        // Idempotent.
        delete_findings_store(root, "engine", "graph").unwrap();
    }

    /// A3 — a changed `hash(D)` segregates the prior batch: findings under the
    /// old hash are never `current` under the new key, only `superseded`.
    #[test]
    fn changed_binding_hash_supersedes_prior_findings() {
        let mut store = FindingsStore::default();
        let old = key("hashOLD", "head1");
        let new = key("hashNEW", "head1");
        let f_old = Finding {
            key: old.clone(),
            facet: "src".to_string(),
            target: FindingTarget::Artifact {
                artifact: "src/old.rs".to_string(),
            },
            class: FindingClass::Uncovered,
            detail: "old".to_string(),
            created_at: "1".to_string(),
        };
        store.record(old.clone(), "1".to_string(), vec![f_old.clone()]);

        // Recording under the new key must not touch the old batch.
        store.record(new.clone(), "2".to_string(), Vec::new());
        assert!(store.current(&new).is_empty(), "new key has its own view");
        let superseded = store.superseded(&new);
        assert_eq!(superseded.len(), 1, "old batch is segregated as superseded");
        assert_eq!(superseded[0], &f_old);
        // The old findings are never presented as current under the new key.
        assert!(!store.current(&new).contains(&f_old));
    }

    /// The impl-version bump's documented invalidation-by-construction: a
    /// finding recorded under the `hash(D)` a prior engine generation
    /// computed (`PREPARATION_IMPL_VERSION` 0, for a binding declaring no
    /// preparation at all) is not current under the live hash — segregated
    /// as superseded, never presented — because the impl version is hashed
    /// into every binding's identity. The old key still reads its own batch,
    /// so nothing is deleted, only retired from the current view.
    #[test]
    fn impl_version_bump_invalidates_findings_by_construction() {
        use crate::binding::{
            PREPARATION_IMPL_VERSION, ScaffoldParams, hash_binding, hash_binding_at_impl_version,
            scaffold_binding,
        };
        let binding = scaffold_binding(ScaffoldParams {
            destination_mem: "plugin",
            source_name: "source-tree",
            pointer: "../public",
            medium_type: crate::pipeline::MediumType::Codebase,
            intent: None,
            additional_deny_paths: Vec::new(),
        })
        .binding;
        assert!(binding.sources[0].preparation.is_none());
        // The live constant is whatever the latest landed implementation set
        // it to; the pin is that the version-0 hash (the pre-registry
        // generation) is not the live one.
        let _ = PREPARATION_IMPL_VERSION;
        let old = key(&hash_binding_at_impl_version(&binding, 0), "head1");
        let live = key(&hash_binding(&binding), "head1");
        assert_ne!(old.binding_hash, live.binding_hash);

        let mut store = FindingsStore::default();
        let f_old = Finding {
            key: old.clone(),
            facet: "source-tree".to_string(),
            target: FindingTarget::Artifact {
                artifact: "src/old.rs".to_string(),
            },
            class: FindingClass::Uncovered,
            detail: "recorded before the bump".to_string(),
            created_at: "1".to_string(),
        };
        store.record(old.clone(), "1".to_string(), vec![f_old.clone()]);

        assert!(
            store.current(&live).is_empty(),
            "a finding keyed on the pre-bump hash is invalid under the live hash"
        );
        assert_eq!(store.superseded(&live), vec![&f_old]);
        assert_eq!(
            store.current(&old),
            &[f_old.clone()][..],
            "nothing is deleted"
        );
    }

    /// Criterion — findings survive head movement: the store keys on `hash(D)`
    /// alone, so a finding recorded at head1 stays `current` when read at
    /// head2 (the sync brief's read is head-agnostic), still carrying the head
    /// it was observed at as metadata. REFUSAL half: recording the hash's next
    /// batch (verify's post-merge write) replaces it — a finding absent from
    /// that batch (resolved) never re-presents, at any head.
    #[test]
    fn moved_source_head_keeps_findings_current_until_superseded() {
        let mut store = FindingsStore::default();
        let before = key("hashA", "head1");
        let after = key("hashA", "head2");
        let f = Finding {
            key: before.clone(),
            facet: "src".to_string(),
            target: FindingTarget::Anchor {
                entity: "engine--e".to_string(),
                artifact: "src/x.rs".to_string(),
            },
            class: FindingClass::UnresolvableAnchor,
            detail: "gone".to_string(),
            created_at: "1".to_string(),
        };
        store.record(before.clone(), "1".to_string(), vec![f.clone()]);

        // The head moved; the finding is still presented, with its observed
        // head intact, and it is not "superseded".
        assert_eq!(store.current(&after), std::slice::from_ref(&f));
        assert_eq!(store.current(&after)[0].key.source_head, "head1");
        assert!(store.superseded(&after).is_empty());

        // A verify at head2 records the hash's next batch WITHOUT the finding
        // (its target observed clean) → resolved, never re-presented.
        store.record(after.clone(), "2".to_string(), Vec::new());
        assert!(store.current(&after).is_empty());
        assert!(store.current(&before).is_empty(), "at the old head too");
        assert_eq!(store.batches.len(), 1, "one batch per hash(D)");
    }

    /// Migration/compat — a store written by the pre-re-key engine (batches
    /// keyed `(hash(D), source_head)`; the exact on-disk shape live dogfood
    /// workspaces carry) loads without loss: the other-hash batch stays
    /// segregated as superseded, the current-hash batch presents at ANY head,
    /// and a legacy same-hash pair collapses to its latest-recorded batch —
    /// never resurrecting the older (superseded-at-write-time) one. The next
    /// `record` folds the same-hash siblings into one batch.
    #[test]
    fn legacy_per_head_store_loads_and_presents_head_agnostically() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let path = findings_store_path(root, "engine", "graph");
        std::fs::create_dir_all(path.parent().unwrap()).unwrap();
        // Trimmed replica of the live on-disk format: `{binding, batches:[{key:
        // {binding_hash, source_head}, recorded_at, findings:[{key, facet,
        // target:{kind,...}, class, detail, created_at}]}]}` — one batch under
        // an old hash, two batches under the current hash at different heads.
        std::fs::write(
            &path,
            r#"{
              "binding": "engine/graph",
              "batches": [
                {
                  "key": { "binding_hash": "hashOLD", "source_head": "src=aaa" },
                  "recorded_at": "100",
                  "findings": [
                    {
                      "key": { "binding_hash": "hashOLD", "source_head": "src=aaa" },
                      "facet": "src",
                      "target": { "kind": "artifact", "artifact": "src/old.rs" },
                      "class": "uncovered",
                      "detail": "old declaration",
                      "created_at": "100"
                    }
                  ]
                },
                {
                  "key": { "binding_hash": "hashCUR", "source_head": "src=bbb" },
                  "recorded_at": "200",
                  "findings": [
                    {
                      "key": { "binding_hash": "hashCUR", "source_head": "src=bbb" },
                      "facet": "src",
                      "target": { "kind": "artifact", "artifact": "src/resolved-at-ccc.rs" },
                      "class": "uncovered",
                      "detail": "was open at bbb, absent from the ccc batch",
                      "created_at": "200"
                    }
                  ]
                },
                {
                  "key": { "binding_hash": "hashCUR", "source_head": "src=ccc" },
                  "recorded_at": "300",
                  "findings": [
                    {
                      "key": { "binding_hash": "hashCUR", "source_head": "src=ccc" },
                      "facet": "src",
                      "target": { "kind": "anchor", "entity": "engine--e", "artifact": "src/x.rs" },
                      "class": "unresolvable-anchor",
                      "detail": "gone",
                      "created_at": "300"
                    }
                  ]
                }
              ]
            }"#,
        )
        .unwrap();

        let mut store = read_findings_store(root, "engine", "graph")
            .unwrap()
            .expect("the legacy on-disk format loads as-is");
        assert_eq!(store.binding, "engine/graph");
        assert_eq!(store.batches.len(), 3, "loaded without loss");

        // Head-agnostic current view: reading at a NEWLY moved head (ddd —
        // recorded nowhere) presents the latest current-hash batch.
        let now = key("hashCUR", "src=ddd");
        let current = store.current(&now);
        assert_eq!(current.len(), 1);
        assert_eq!(current[0].detail, "gone");
        assert_eq!(
            current[0].key.source_head, "src=ccc",
            "the finding keeps the head it was observed at"
        );
        // The pre-re-key superseded batches (old hash + the older same-hash
        // head) stay segregated — never mixed into the current view.
        let superseded = store.superseded(&now);
        assert_eq!(superseded.len(), 2);
        assert!(
            !current.iter().any(|f| f.detail.contains("was open at bbb")),
            "the older same-hash batch was superseded at write time and is not resurrected"
        );

        // The next record under the current hash collapses the legacy
        // same-hash pair into one batch; the old-hash batch is untouched.
        store.record(now.clone(), "400".to_string(), Vec::new());
        assert_eq!(store.batches.len(), 2, "hashCUR collapsed, hashOLD kept");
        assert_eq!(store.superseded(&now).len(), 1);
    }

    /// An authored exclusion supersedes a standing `uncovered` finding in
    /// the STORE, not only in the presentation filter: the merge's
    /// accounting closure folds the exclusion ledger in, so an unsampled
    /// artifact that gained an exclusion since its finding was recorded
    /// closes instead of carrying forward — the verdict count can no longer
    /// contradict the coverage section's "0 unaccounted".
    #[test]
    fn merge_closes_uncovered_findings_for_ledger_excluded_artifacts() {
        let k_old = key("h", "head1");
        let uncovered = |artifact: &str| Finding {
            key: k_old.clone(),
            facet: "src".to_string(),
            target: FindingTarget::Artifact {
                artifact: artifact.to_string(),
            },
            class: FindingClass::Uncovered,
            detail: "no anchor".to_string(),
            created_at: "1".to_string(),
        };
        let prior = vec![uncovered("src/excluded.rs"), uncovered("src/open.rs")];
        let obs = PassObservation {
            anchors_observed: BTreeSet::new(),
            anchors_existing: BTreeSet::new(),
            files_observed: BTreeSet::new(), // neither sampled this pass
            s_d: ["src/excluded.rs".to_string(), "src/open.rs".to_string()].into(),
        };
        let excluded: BTreeSet<String> = ["src/excluded.rs".to_string()].into();
        let merged = merge_with_prior(Vec::new(), &prior, &obs, |artifact: &str| {
            excluded.contains(artifact)
        });
        assert_eq!(
            merged.len(),
            1,
            "the excluded finding closes, the open one carries: {merged:?}"
        );
        assert_eq!(
            merged[0].target,
            FindingTarget::Artifact {
                artifact: "src/open.rs".to_string()
            }
        );
    }

    /// The head-durable merge: an unobserved-but-still-open prior finding
    /// carries forward (original observed head intact); a prior finding whose
    /// artifact left `S(D)`, gained coverage, or whose anchor vanished closes;
    /// a re-observed target takes this pass's outcome (clean → closed).
    #[test]
    fn merge_carries_unobserved_open_findings_and_closes_departed() {
        let k_old = key("h", "head1");
        let mk_artifact = |artifact: &str, detail: &str| Finding {
            key: k_old.clone(),
            facet: "src".to_string(),
            target: FindingTarget::Artifact {
                artifact: artifact.to_string(),
            },
            class: FindingClass::Uncovered,
            detail: detail.to_string(),
            created_at: "1".to_string(),
        };
        let anchor_finding = Finding {
            key: k_old.clone(),
            facet: "src".to_string(),
            target: FindingTarget::Anchor {
                entity: "engine--gone".to_string(),
                artifact: "src/gone.rs".to_string(),
            },
            class: FindingClass::UnresolvableAnchor,
            detail: "anchor since removed from the mem".to_string(),
            created_at: "1".to_string(),
        };
        let prior = vec![
            mk_artifact("src/unsampled.rs", "still open, not in this window"),
            mk_artifact("src/departed.rs", "left S(D)"),
            mk_artifact("src/now-covered.rs", "gained an anchor since"),
            mk_artifact("src/observed-clean.rs", "re-sampled and now covered"),
            anchor_finding,
        ];
        let obs = PassObservation {
            anchors_observed: BTreeSet::new(),
            anchors_existing: BTreeSet::new(), // the anchor vanished
            files_observed: ["src/observed-clean.rs".to_string()].into(),
            s_d: [
                "src/unsampled.rs".to_string(),
                "src/now-covered.rs".to_string(),
                "src/observed-clean.rs".to_string(),
            ]
            .into(),
        };
        let merged = merge_with_prior(Vec::new(), &prior, &obs, |artifact| {
            artifact == "src/now-covered.rs" || artifact == "src/observed-clean.rs"
        });
        assert_eq!(merged.len(), 1, "only the still-open unsampled one carries");
        assert_eq!(
            merged[0].target,
            FindingTarget::Artifact {
                artifact: "src/unsampled.rs".to_string()
            }
        );
        assert_eq!(
            merged[0].key.source_head, "head1",
            "a carried finding keeps the head it was observed at"
        );
    }

    /// Supersession honesty: a fresh `queued-for-adjudication` entry is a
    /// scheduling deferral, not an observation — it never downgrades a prior
    /// substantive `drifted` verdict for the same target. A fresh substantive
    /// outcome (or a clean observation) still supersedes normally.
    #[test]
    fn merge_deferral_never_downgrades_prior_adjudication() {
        let k_old = key("h", "head1");
        let k_new = key("h", "head2");
        let target = FindingTarget::Anchor {
            entity: "engine--e".to_string(),
            artifact: "src/x.rs".to_string(),
        };
        let prior_drifted = Finding {
            key: k_old.clone(),
            facet: "src".to_string(),
            target: target.clone(),
            class: FindingClass::Drifted,
            detail: "adjudicated drifted at head1".to_string(),
            created_at: "1".to_string(),
        };
        let fresh_queued = Finding {
            key: k_new.clone(),
            facet: "src".to_string(),
            target: target.clone(),
            class: FindingClass::QueuedForAdjudication,
            detail: "deferred by the cap this run".to_string(),
            created_at: "2".to_string(),
        };
        let obs = PassObservation {
            anchors_observed: [target_key(&target)].into(),
            anchors_existing: [target_key(&target)].into(),
            files_observed: BTreeSet::new(),
            s_d: BTreeSet::new(),
        };
        let merged = merge_with_prior(
            vec![fresh_queued],
            std::slice::from_ref(&prior_drifted),
            &obs,
            |_| true,
        );
        assert_eq!(merged.len(), 1);
        assert_eq!(
            merged[0].class,
            FindingClass::Drifted,
            "the prior verdict stands over a deferral"
        );
        assert_eq!(merged[0].key.source_head, "head1");
    }

    /// A2 — hash-drift adjudication is excluded for `informed-by` (and every
    /// non-hash-bearing class): a drifted/recheck state yields NO finding.
    #[test]
    fn informed_by_anchor_never_drifts() {
        let k = key("h", "s");
        for class in [
            AnchorProvenanceClass::InformedBy,
            AnchorProvenanceClass::Authored,
        ] {
            let a = anchor(class);
            assert!(
                adjudicate_anchor(&k, "f", "engine--e", &a, AnchorState::Drifted, "1").is_none(),
                "{class:?} must not produce a drift finding"
            );
            assert!(
                adjudicate_anchor(&k, "f", "engine--e", &a, AnchorState::Recheck, "1").is_none(),
                "{class:?} must not produce a queued finding"
            );
        }
    }

    /// A2 — hash-bearing classes DO produce drift/recheck findings, and every
    /// class produces an existence (`unresolvable-anchor`) finding when orphaned.
    #[test]
    fn hash_bearing_drifts_and_orphan_is_class_independent() {
        let k = key("h", "s");
        let anchored = anchor(AnchorProvenanceClass::Anchored);
        let drifted =
            adjudicate_anchor(&k, "f", "engine--e", &anchored, AnchorState::Drifted, "1").unwrap();
        assert_eq!(drifted.class, FindingClass::Drifted);
        assert_eq!(drifted.key, k, "the finding carries its recording key (A2)");

        let queued =
            adjudicate_anchor(&k, "f", "engine--e", &anchored, AnchorState::Recheck, "1").unwrap();
        assert_eq!(queued.class, FindingClass::QueuedForAdjudication);

        // Orphaned is existence, not hash-drift — reported for informed-by too.
        let informed = anchor(AnchorProvenanceClass::InformedBy);
        let orphan =
            adjudicate_anchor(&k, "f", "engine--e", &informed, AnchorState::Orphaned, "1").unwrap();
        assert_eq!(orphan.class, FindingClass::UnresolvableAnchor);

        // Resolves yields nothing.
        assert!(
            adjudicate_anchor(&k, "f", "engine--e", &anchored, AnchorState::Resolves, "1")
                .is_none()
        );
    }

    /// The finding class vocabulary round-trips through its wire form.
    #[test]
    fn finding_class_wire_round_trips() {
        for w in FindingClass::WIRE_VALUES {
            let c = FindingClass::from_wire(w).expect("known wire value");
            assert_eq!(c.as_wire(), *w);
        }
        assert!(FindingClass::from_wire("nonsense").is_none());
    }

    /// A malformed binding id refuses before touching the store tier.
    #[test]
    fn malformed_binding_id_refuses() {
        assert!(matches!(
            split_binding_id("../escape"),
            Err(FindingsError::MalformedId(_))
        ));
        assert!(matches!(
            split_binding_id("no-slash"),
            Err(FindingsError::MalformedId(_))
        ));
        assert_eq!(
            split_binding_id("engine/graph").unwrap(),
            ("engine".to_string(), "graph".to_string())
        );
    }

    // ---- A1/A5 end-to-end: verify writes durable findings, no entity write --

    use crate::anchor::AnchorSidecar;
    use crate::binding::{
        BINDING_VERSION, BuildMode, BuildOperation, CoverageSemantics, DEFAULT_ADJUDICATION_CAP,
        DEFAULT_FULL_RESYNC_EVERY, Operations, VerifyOperation,
    };
    use crate::ingest::resolve::resolve_binding_run;
    use crate::pipeline::{IngestTrigger, MediumType, PatternEntry, PatternMode};
    use crate::pipeline_store::{load_pipeline_configs, write_binding};
    use crate::workspace::{
        Mount, MountCapability, MountLifecycle, MountStorage, Workspace, WorkspaceSettings,
    };
    use crate::workspace_store::WorkspaceStoreAdapter;

    /// A full verify pass over a folder mem: it adjudicates the mem's anchors
    /// against the live source (orphaned → unresolvable-anchor; present
    /// hash-bearing whose recorded hash mismatches the observed prepared form
    /// → deterministic `drifted`; informed-by → no finding, A2) and flags an
    /// uncovered source file, then persists the findings to the durable state
    /// tier. A **fresh** read from disk (a later process) sees them (A1). The
    /// pass runs on a shared `&Engine` — structurally read-only on the mem (A5).
    #[test]
    fn verify_persists_findings_readable_fresh() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();

        // Workspace state so `from_workspace_root` sets `workspace_root` (which
        // the anchor observation and cursor need) and mounts the `engine` mem.
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        // A git work tree at the workspace root so the codebase medium's `git`
        // change strategy resolves; source files: one anchored+present, one
        // uncovered.
        let out = std::process::Command::new("git")
            .args(["init", "-q"])
            .current_dir(root)
            .output()
            .unwrap();
        assert!(out.status.success());
        std::fs::create_dir_all(root.join("src")).unwrap();
        std::fs::write(root.join("src").join("present.rs"), "fn a() {}\n").unwrap();
        std::fs::write(root.join("src").join("uncovered.rs"), "fn b() {}\n").unwrap();

        // Seed the engine-owned anchors sidecar directly (test fixture — the
        // production write path is the mutation surface, not this verify code).
        let mk = |artifact: &str, class: AnchorProvenanceClass| Anchor {
            artifact: artifact.to_string(),
            grain: AnchorGrain::File,
            class,
            at_version: None,
            hash: class.is_hash_bearing().then(|| "recorded".to_string()),
            hash_stability: AnchorHashStability::Stable,
            derived_from: Vec::new(),
            binding: None,
            source: None,
            span_unvalidated: false,
            hash_source: None,
            last_observed: None,
        };
        // The entity the sidecar is keyed to. Written, because it exists:
        // a row whose entity does not is DANGLING (consistency-sweep 03/02)
        // and leaves the population before any figure counts it.
        std::fs::write(
            mem_dir.join("e.md"),
            "---\ntype: decision\n---\n\n# E\n\n## Decision\n\nBody.\n",
        )
        .unwrap();
        let mut sidecar = AnchorSidecar::default();
        sidecar.set(
            "engine--e",
            vec![
                mk("src/present.rs", AnchorProvenanceClass::Anchored), // recorded hash mismatches prepared form → drifted
                mk("src/gone.rs", AnchorProvenanceClass::Anchored), // absent → unresolvable-anchor
                mk("src/present.rs", AnchorProvenanceClass::InformedBy), // present, non-hash → no finding (A2)
            ],
        );
        std::fs::write(
            mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH),
            sidecar.to_bytes(),
        )
        .unwrap();

        // Binding engine/graph over a codebase facet (medium root = workspace).
        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: Some(BuildOperation {
                        mode: BuildMode::Discovery,
                        trigger: IngestTrigger::Loop,
                        batch_size: 20,
                        post_actions: None,
                    }),
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        let engine = Engine::from_workspace_root(root).unwrap();

        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        // `&engine` — shared borrow, structurally cannot mutate the mem (A5).
        let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
        assert!(
            outcome.recorded >= 3,
            "orphan + drifted + uncovered at least"
        );
        assert_eq!(outcome.superseded, 0, "no prior key yet");
        assert_eq!(
            outcome.backlog, 0,
            "the mismatching hash adjudicated deterministically — nothing queued"
        );
        assert!(
            outcome.hash_backfill.is_empty(),
            "every hash-bearing anchor already carries a recorded hash — nothing to backfill"
        );

        // Fresh read from disk — a later process / sync-brief render (A1).
        let store = read_findings_store(root, "engine", "graph")
            .unwrap()
            .unwrap();
        let current = store.current(&outcome.key);
        assert_eq!(current.len(), outcome.recorded);

        let has = |c: FindingClass, art: &str| {
            current.iter().any(|f| {
                f.class == c
                    && match &f.target {
                        FindingTarget::Anchor { artifact, .. } => artifact == art,
                        FindingTarget::Artifact { artifact } => artifact == art,
                    }
            })
        };
        assert!(has(FindingClass::UnresolvableAnchor, "src/gone.rs"));
        assert!(
            has(FindingClass::Drifted, "src/present.rs"),
            "recorded-hash mismatch on a stable medium adjudicates drifted deterministically"
        );
        assert!(has(FindingClass::Uncovered, "src/uncovered.rs"));
        // A2: the informed-by anchor on the present file produced no finding —
        // the one drifted finding above belongs to the anchored (hash-bearing)
        // anchor, and nothing queued.
        assert!(
            !current
                .iter()
                .any(|f| f.class == FindingClass::QueuedForAdjudication
                    || f.class == FindingClass::Wrong),
            "deterministic adjudication leaves nothing queued"
        );
        // The covered file is not flagged uncovered.
        assert!(!has(FindingClass::Uncovered, "src/present.rs"));
    }

    /// Criterion, end-to-end — **findings survive head movement**: a finding
    /// recorded at head H keeps presenting through the sync brief's read
    /// (`current_findings` / `render_sync_brief_for`) after the source
    /// advances to H′, until a verify observes its subject clean — and once
    /// resolved it never re-presents, at any head.
    #[test]
    fn finding_recorded_at_old_head_presents_in_brief_at_new_head() {
        use crate::ingest::render::render_sync_brief_for;

        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        // Git source tree at head A: src/present.rs committed.
        let git = |args: &[&str]| {
            let out = std::process::Command::new("git")
                .args(args)
                .current_dir(root)
                .env("GIT_AUTHOR_NAME", "t")
                .env("GIT_AUTHOR_EMAIL", "t@t")
                .env("GIT_COMMITTER_NAME", "t")
                .env("GIT_COMMITTER_EMAIL", "t@t")
                .output()
                .unwrap();
            assert!(
                out.status.success(),
                "git {args:?}: {}",
                String::from_utf8_lossy(&out.stderr)
            );
        };
        git(&["init", "-q"]);
        std::fs::create_dir_all(root.join("src")).unwrap();
        std::fs::write(root.join("src").join("present.rs"), "fn a() {}\n").unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-a"]);

        // Anchors: `informed-by` on the present file (clean, non-hash — no
        // finding) and on the ABSENT src/gone.rs (orphaned → the finding).
        let mk = |artifact: &str| Anchor {
            artifact: artifact.to_string(),
            grain: AnchorGrain::File,
            class: AnchorProvenanceClass::InformedBy,
            at_version: None,
            hash: None,
            hash_stability: AnchorHashStability::Stable,
            derived_from: Vec::new(),
            binding: None,
            source: None,
            span_unvalidated: false,
            hash_source: None,
            last_observed: None,
        };
        // The entity the sidecar is keyed to. Written, because it exists:
        // a row whose entity does not is DANGLING (consistency-sweep 03/02)
        // and leaves the population before any figure counts it.
        std::fs::write(
            mem_dir.join("e.md"),
            "---\ntype: decision\n---\n\n# E\n\n## Decision\n\nBody.\n",
        )
        .unwrap();
        let mut sidecar = AnchorSidecar::default();
        sidecar.set("engine--e", vec![mk("src/present.rs"), mk("src/gone.rs")]);
        std::fs::write(
            mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH),
            sidecar.to_bytes(),
        )
        .unwrap();

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: None,
                    sync: Some(crate::binding::SyncOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                    }),
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        // Verify at head A — records the orphaned-anchor finding.
        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();
        let head_a_outcome = {
            let engine = Engine::from_workspace_root(root).unwrap();
            verify_binding(&engine, root, binding, &resolved).unwrap()
        };
        assert!(
            head_a_outcome.key.source_head.contains("graph="),
            "the run observed a facet head"
        );

        // The source moves to head B.
        std::fs::write(root.join("src").join("present.rs"), "fn a() {} // more\n").unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-b"]);

        // A fresh process at head B: the finding recorded at head A is still
        // presented — by the brief's read AND in the rendered sync brief.
        {
            let engine = Engine::from_workspace_root(root).unwrap();
            let (key_b, findings) = current_findings(&engine, root, binding, &resolved).unwrap();
            assert_ne!(
                key_b.source_head, head_a_outcome.key.source_head,
                "the head really moved"
            );
            assert_eq!(findings.len(), 1);
            assert_eq!(findings[0].class, FindingClass::UnresolvableAnchor);
            assert_eq!(
                findings[0].key.source_head, head_a_outcome.key.source_head,
                "the finding still records the head it was observed at"
            );

            let brief = render_sync_brief_for(&engine, root, "engine/graph").unwrap();
            assert!(brief.contains("## Open findings to repair"));
            assert!(brief.contains("src/gone.rs"));
        }

        // The repair lands: src/gone.rs exists again (head C). A verify
        // observes the anchor clean → the finding closes…
        std::fs::write(root.join("src").join("gone.rs"), "fn g() {}\n").unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-c"]);
        {
            let engine = Engine::from_workspace_root(root).unwrap();
            verify_binding(&engine, root, binding, &resolved).unwrap();
        }
        // …and never re-presents (REFUSAL: resolved findings stay resolved).
        {
            let engine = Engine::from_workspace_root(root).unwrap();
            let (_key, findings) = current_findings(&engine, root, binding, &resolved).unwrap();
            assert!(
                findings
                    .iter()
                    .all(|f| f.class != FindingClass::UnresolvableAnchor),
                "the resolved orphan finding must not re-present: {findings:?}"
            );
        }
    }

    /// Prepared-hash backfill + deterministic drift, end-to-end over real git
    /// heads and fresh engines:
    ///
    /// 1. a hash-less `anchored`/`derived` anchor on a resolvable artifact is
    ///    backfilled by the first verify (once — a re-verify observes an empty
    ///    worklist and the recorded hash is never overwritten);
    /// 2. after a source change, a subsequent verify adjudicates `drifted`
    ///    deterministically — no LLM sampling, no queued deferral;
    /// 3. the tier-3 recheck queue for such anchors drains: post-backfill
    ///    clean passes queue nothing, instead of re-queueing forever.
    ///
    /// The plain-TREE sibling of this lifecycle is
    /// [`plain_tree_anchor_backfills_then_adjudicates_deterministically`].
    ///
    /// REFUSAL half: `authored` / `informed-by` anchors never gain hashes and
    /// never adjudicate `drifted`; an `unstable` hash-stability medium
    /// resolves `recheck` (queued), never `drifted`.
    #[test]
    fn hashless_anchor_backfills_once_then_drift_adjudicates_deterministically() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        // Git source tree at head A: two committed source files.
        let git = |args: &[&str]| {
            let out = std::process::Command::new("git")
                .args(args)
                .current_dir(root)
                .env("GIT_AUTHOR_NAME", "t")
                .env("GIT_AUTHOR_EMAIL", "t@t")
                .env("GIT_COMMITTER_NAME", "t")
                .env("GIT_COMMITTER_EMAIL", "t@t")
                .output()
                .unwrap();
            assert!(
                out.status.success(),
                "git {args:?}: {}",
                String::from_utf8_lossy(&out.stderr)
            );
        };
        git(&["init", "-q"]);
        std::fs::create_dir_all(root.join("src")).unwrap();
        std::fs::write(root.join("src").join("present.rs"), "fn a() {}\n").unwrap();
        std::fs::write(root.join("src").join("other.rs"), "fn o() {}\n").unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-a"]);

        // Anchors, all HASH-LESS: `anchored` (stable) + `derived` (stable) on
        // present.rs, `anchored` but UNSTABLE on other.rs, and the two
        // non-hash classes that must never gain a hash.
        let mk = |artifact: &str, class: AnchorProvenanceClass, stab: AnchorHashStability| Anchor {
            artifact: artifact.to_string(),
            grain: AnchorGrain::File,
            class,
            at_version: None,
            hash: None,
            hash_stability: stab,
            derived_from: if class == AnchorProvenanceClass::Derived {
                vec!["src/present.rs".to_string()]
            } else {
                Vec::new()
            },
            binding: None,
            source: None,
            span_unvalidated: false,
            hash_source: None,
            last_observed: None,
        };
        use AnchorHashStability::{Stable, Unstable};
        // The entity the sidecar is keyed to. Written, because it exists:
        // a row whose entity does not is DANGLING (consistency-sweep 03/02)
        // and leaves the population before any figure counts it.
        std::fs::write(
            mem_dir.join("e.md"),
            "---\ntype: decision\n---\n\n# E\n\n## Decision\n\nBody.\n",
        )
        .unwrap();
        let mut sidecar = AnchorSidecar::default();
        sidecar.set(
            "engine--e",
            vec![
                mk("src/present.rs", AnchorProvenanceClass::Anchored, Stable),
                mk("src/present.rs", AnchorProvenanceClass::Derived, Stable),
                mk("src/other.rs", AnchorProvenanceClass::Anchored, Unstable),
                mk("src/present.rs", AnchorProvenanceClass::Authored, Stable),
                mk("src/present.rs", AnchorProvenanceClass::InformedBy, Stable),
            ],
        );
        std::fs::write(
            mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH),
            sidecar.to_bytes(),
        )
        .unwrap();

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: None,
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        // --- Pass 1: first observation backfills, once. ---
        {
            let mut engine = Engine::from_workspace_root(root).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            // Every hash-less hash-bearing anchor is on the worklist —
            // including the unstable one; the non-hash classes are not.
            let mut backfilled: Vec<(&str, &str)> = outcome
                .hash_backfill
                .iter()
                .map(|b| (b.entity.as_str(), b.artifact.as_str()))
                .collect();
            backfilled.sort();
            backfilled.dedup();
            assert_eq!(
                backfilled,
                vec![
                    ("engine--e", "src/other.rs"),
                    ("engine--e", "src/present.rs"),
                ],
                "hash-bearing anchors backfill; authored/informed-by never appear"
            );
            // Backfill candidates are clean-by-construction this pass —
            // nothing queued, nothing drifted (the recheck queue drains).
            assert_eq!(
                outcome.backlog, 0,
                "no recheck queue for backfilled anchors"
            );
            let store = read_findings_store(root, "engine", "graph")
                .unwrap()
                .unwrap();
            assert!(
                store
                    .current(&outcome.key)
                    .iter()
                    .all(|f| !matches!(f.target, FindingTarget::Anchor { .. })),
                "no anchor finding on the backfill pass: {:?}",
                store.current(&outcome.key)
            );

            // The sanctioned post-run write records the hashes.
            let written =
                record_anchor_hash_backfill(&mut engine, "engine", &outcome, None).unwrap();
            assert_eq!(
                written, 3,
                "anchored + derived + unstable-anchored gain hashes"
            );
        }

        // The sidecar now carries the observed prepared-form hashes — and the
        // non-hash classes still carry none (class semantics preserved).
        let expected_present = crate::anchor::prepared_content_hash(
            &std::fs::read(root.join("src").join("present.rs")).unwrap(),
        );
        {
            let sc = AnchorSidecar::from_bytes(
                &std::fs::read(mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH)).unwrap(),
            )
            .unwrap();
            for a in sc.get("engine--e") {
                if a.class.is_hash_bearing() {
                    assert!(a.hash.is_some(), "hash-bearing anchor backfilled: {a:?}");
                } else {
                    assert!(a.hash.is_none(), "non-hash class never gains a hash: {a:?}");
                }
                if a.artifact == "src/present.rs" && a.class.is_hash_bearing() {
                    assert_eq!(a.hash.as_deref(), Some(expected_present.as_str()));
                }
            }
        }

        // --- Pass 2 (fresh engine): idempotent — nothing to backfill, clean. ---
        {
            let mut engine = Engine::from_workspace_root(root).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            assert!(
                outcome.hash_backfill.is_empty(),
                "backfill happens once — a re-verify observes an empty worklist"
            );
            assert_eq!(outcome.backlog, 0, "steady state: nothing re-queues");
            let store = read_findings_store(root, "engine", "graph")
                .unwrap()
                .unwrap();
            assert!(
                store
                    .current(&outcome.key)
                    .iter()
                    .all(|f| !matches!(f.target, FindingTarget::Anchor { .. })),
                "recorded hashes match the source — no anchor finding"
            );
            let written =
                record_anchor_hash_backfill(&mut engine, "engine", &outcome, None).unwrap();
            assert_eq!(written, 0, "no write, no commit on the idempotent pass");
        }

        // --- Source change: both anchored artifacts move (head B). ---
        std::fs::write(
            root.join("src").join("present.rs"),
            "fn a() { /* changed */ }\n",
        )
        .unwrap();
        std::fs::write(
            root.join("src").join("other.rs"),
            "fn o() { /* changed */ }\n",
        )
        .unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-b"]);

        // --- Pass 3: deterministic adjudication — stable drifts, unstable
        //     rechecks, non-hash classes stay silent. ---
        {
            let engine = Engine::from_workspace_root(root).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            assert!(
                outcome.hash_backfill.is_empty(),
                "recorded hashes are never overwritten by observation"
            );
            let store = read_findings_store(root, "engine", "graph")
                .unwrap()
                .unwrap();
            let current = store.current(&outcome.key);
            let drifted: Vec<&Finding> = current
                .iter()
                .filter(|f| f.class == FindingClass::Drifted)
                .collect();
            // The stable `anchored` + `derived` anchors on present.rs drift —
            // deterministically, from the hash comparison alone.
            assert_eq!(
                drifted.len(),
                2,
                "stable-medium mismatch → drifted: {current:?}"
            );
            assert!(drifted.iter().all(|f| matches!(
                &f.target,
                FindingTarget::Anchor { artifact, .. } if artifact == "src/present.rs"
            )));
            // REFUSAL: the unstable anchor on other.rs resolves recheck →
            // queued, never drifted.
            assert!(
                current
                    .iter()
                    .any(|f| f.class == FindingClass::QueuedForAdjudication
                        && matches!(
                            &f.target,
                            FindingTarget::Anchor { artifact, .. } if artifact == "src/other.rs"
                        )),
                "unstable medium resolves recheck (queued), not drifted: {current:?}"
            );
            assert!(
                !current.iter().any(|f| f.class == FindingClass::Drifted
                    && matches!(
                        &f.target,
                        FindingTarget::Anchor { artifact, .. } if artifact == "src/other.rs"
                    )),
                "an unstable hash break must never assert drift"
            );
        }
    }

    /// The plain-TREE sibling of the backfill lifecycle: a hash-less `tree`
    /// anchor under NO preparation observes the plain per-file digest of its
    /// scoped files, backfills once, and thereafter adjudicates
    /// deterministically — `drifted` on any scoped-file byte change or a
    /// file joining the tree, `resolves` when nothing moved. Before the
    /// plain tree digest existed, such an anchor observed no hash at all and
    /// re-issued `recheck` (queued-for-adjudication) on every pass, forever
    /// — the loop this test seals shut.
    #[test]
    fn plain_tree_anchor_backfills_then_adjudicates_deterministically() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![Mount {
                        mem: "engine".to_string(),
                        schema: Some("default@1.0.0".parse().unwrap()),
                        storage: MountStorage::Folder {
                            path: mem_dir.clone(),
                        },
                        capability: MountCapability::Write,
                        lifecycle: MountLifecycle::Eager,
                        cross_linkable: false,
                        migration_target: None,
                    }],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        let git = |args: &[&str]| {
            let out = std::process::Command::new("git")
                .args(args)
                .current_dir(root)
                .env("GIT_AUTHOR_NAME", "t")
                .env("GIT_AUTHOR_EMAIL", "t@t")
                .env("GIT_COMMITTER_NAME", "t")
                .env("GIT_COMMITTER_EMAIL", "t@t")
                .output()
                .unwrap();
            assert!(
                out.status.success(),
                "git {args:?}: {}",
                String::from_utf8_lossy(&out.stderr)
            );
        };
        git(&["init", "-q"]);
        std::fs::create_dir_all(root.join("src")).unwrap();
        std::fs::write(root.join("src").join("a.rs"), "fn a() {}\n").unwrap();
        std::fs::write(root.join("src").join("b.rs"), "fn b() {}\n").unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-a"]);

        std::fs::write(
            mem_dir.join("e.md"),
            "---\ntype: decision\n---\n\n# E\n\n## Decision\n\nBody.\n",
        )
        .unwrap();
        // One hash-less TREE anchor over `src`, carrying the declaring
        // source's NAME — the join is what scopes the enumeration, so a
        // tree anchor without a resolvable source stays honest `recheck`.
        let mut sidecar = AnchorSidecar::default();
        sidecar.set(
            "engine--e",
            vec![Anchor {
                artifact: "src".to_string(),
                grain: AnchorGrain::Tree,
                class: AnchorProvenanceClass::Anchored,
                at_version: None,
                hash: None,
                hash_stability: AnchorHashStability::Stable,
                derived_from: Vec::new(),
                binding: None,
                source: Some("graph".to_string()),
                span_unvalidated: false,
                hash_source: None,
                last_observed: None,
            }],
        );
        std::fs::write(
            mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH),
            sidecar.to_bytes(),
        )
        .unwrap();

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: None,
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        // --- Pass 1: the tree observes the plain digest and backfills. ---
        let expected_digest = crate::anchor::prepared_content_hash(
            crate::preparation::plain_tree_digest(&[
                ("src/a.rs".to_string(), b"fn a() {}\n".to_vec()),
                ("src/b.rs".to_string(), b"fn b() {}\n".to_vec()),
            ])
            .as_bytes(),
        );
        {
            let mut engine = Engine::from_workspace_root(root).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            let backfilled: Vec<(&str, &str, &str)> = outcome
                .hash_backfill
                .iter()
                .map(|b| (b.entity.as_str(), b.artifact.as_str(), b.hash.as_str()))
                .collect();
            assert_eq!(
                backfilled,
                vec![("engine--e", "src", expected_digest.as_str())],
                "the tree anchor observes the plain digest and backfills"
            );
            assert_eq!(outcome.backlog, 0, "no recheck queue: the digest exists");
            let written =
                record_anchor_hash_backfill(&mut engine, "engine", &outcome, None).unwrap();
            assert_eq!(written, 1);
        }

        // --- Pass 2: idempotent and clean. ---
        {
            let engine = Engine::from_workspace_root(root).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            assert!(outcome.hash_backfill.is_empty(), "backfill happens once");
            assert_eq!(outcome.backlog, 0, "steady state: nothing re-queues");
            let store = read_findings_store(root, "engine", "graph")
                .unwrap()
                .unwrap();
            assert!(
                store
                    .current(&outcome.key)
                    .iter()
                    .all(|f| !matches!(f.target, FindingTarget::Anchor { .. })),
                "unchanged tree resolves clean: {:?}",
                store.current(&outcome.key)
            );
        }

        // --- A file JOINS the tree: the digest moves. ---
        std::fs::write(root.join("src").join("c.rs"), "fn c() {}\n").unwrap();
        git(&["add", "-A"]);
        git(&["commit", "-qm", "head-b"]);

        // --- Pass 3: deterministic drift, no queued deferral. ---
        {
            let engine = Engine::from_workspace_root(root).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            assert!(outcome.hash_backfill.is_empty());
            assert_eq!(outcome.backlog, 0, "drift is asserted, never queued");
            let store = read_findings_store(root, "engine", "graph")
                .unwrap()
                .unwrap();
            let current = store.current(&outcome.key);
            assert!(
                current.iter().any(|f| f.class == FindingClass::Drifted
                    && matches!(
                        &f.target,
                        FindingTarget::Anchor { artifact, .. } if artifact == "src"
                    )),
                "a joined file drifts the tree anchor deterministically: {current:?}"
            );
            assert!(
                !current
                    .iter()
                    .any(|f| f.class == FindingClass::QueuedForAdjudication),
                "the perpetual recheck loop is sealed: {current:?}"
            );
        }
    }

    /// The engine's backfill writer enforces the class guard at the write
    /// seam: an `authored` / `informed-by` anchor never gains a hash even if
    /// a (buggy or malicious) caller hands one in, and a recorded hash is
    /// never overwritten.
    #[test]
    fn backfill_writer_refuses_non_hash_classes_and_never_overwrites() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![Mount {
                        mem: "engine".to_string(),
                        schema: Some("default@1.0.0".parse().unwrap()),
                        storage: MountStorage::Folder {
                            path: mem_dir.clone(),
                        },
                        capability: MountCapability::Write,
                        lifecycle: MountLifecycle::Eager,
                        cross_linkable: false,
                        migration_target: None,
                    }],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        let anchor = |class: AnchorProvenanceClass, hash: Option<&str>| Anchor {
            artifact: "src/a.rs".to_string(),
            grain: AnchorGrain::File,
            class,
            at_version: None,
            hash: hash.map(str::to_string),
            hash_stability: AnchorHashStability::Stable,
            derived_from: Vec::new(),
            binding: None,
            source: None,
            span_unvalidated: false,
            hash_source: None,
            last_observed: None,
        };
        // The entity the sidecar is keyed to. Written, because it exists:
        // a row whose entity does not is DANGLING (consistency-sweep 03/02)
        // and leaves the population before any figure counts it.
        std::fs::write(
            mem_dir.join("e.md"),
            "---\ntype: decision\n---\n\n# E\n\n## Decision\n\nBody.\n",
        )
        .unwrap();
        let mut sidecar = AnchorSidecar::default();
        sidecar.set(
            "engine--e",
            vec![
                anchor(AnchorProvenanceClass::Authored, None),
                anchor(AnchorProvenanceClass::InformedBy, None),
                anchor(AnchorProvenanceClass::Anchored, Some("recorded")),
            ],
        );
        std::fs::write(
            mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH),
            sidecar.to_bytes(),
        )
        .unwrap();

        let mut engine = Engine::from_workspace_root(root).unwrap();
        let written = engine
            .record_anchor_observed_hashes(
                "engine",
                &[crate::anchor::ObservedArtifactHash {
                    entity: "engine--e".to_string(),
                    artifact: "src/a.rs".to_string(),
                    hash: "observed".to_string(),
                }],
                None,
            )
            .unwrap();
        assert_eq!(
            written, 0,
            "non-hash classes refuse the hash; a recorded hash is never overwritten"
        );
        let sc = AnchorSidecar::from_bytes(
            &std::fs::read(mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH)).unwrap(),
        )
        .unwrap();
        for a in sc.get("engine--e") {
            match a.class {
                AnchorProvenanceClass::Anchored => {
                    assert_eq!(a.hash.as_deref(), Some("recorded"), "baseline stands")
                }
                _ => assert!(a.hash.is_none(), "non-hash class stays hash-less: {a:?}"),
            }
        }
    }

    /// The completed-run `#verified` writer (backlog 2026-07-11): a verify
    /// pass surfaces its observed facet heads on the outcome (the per-facet
    /// decomposition of `key.source_head`), and [`record_verified_baseline`]
    /// records them as `<binding>/<facet>#verified` through the engine's
    /// sync-state writer — durable on disk, visible to the same config read
    /// `report`/`status` consume. A failed pass returns
    /// `Err` before any caller reaches the writer, so the token never
    /// advances on an aborted run.
    /// A vanished source directory must refuse verify with the typed
    /// `SourceUnreachable` error instead of degrading to an empty
    /// enumeration: pre-fix, the missing tree produced an empty stat map
    /// whose aggregate (the digest of nothing) completed the run and let
    /// the caller overwrite a genuine `#verified` baseline with fake
    /// state. The engine mem itself stays loadable — only the binding's
    /// source is gone.
    #[test]
    fn verify_refuses_unreachable_source_with_typed_error() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        // The medium points at a subdirectory that does NOT exist — the
        // vanished-source case (`git` declared, so pre-fix the strategy
        // layer silently degraded instead of refusing).
        write_binding(
            root,
            "engine",
            "gone",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "gone".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: "vanished-src".to_string(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: None,
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        let engine = Engine::from_workspace_root(root).unwrap();
        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/gone", binding).unwrap();

        match verify_binding(&engine, root, binding, &resolved) {
            Err(FindingsError::SourceUnreachable { source_name, path }) => {
                assert_eq!(source_name, "gone");
                assert!(
                    path.ends_with("vanished-src"),
                    "refusal must name the resolved missing path, got `{path}`",
                );
            }
            other => panic!("expected SourceUnreachable refusal, got {other:?}"),
        }

        // Nothing was observed → no `#verified` token exists (the caller
        // never reaches its baseline write on an Err).
        assert!(
            !engine
                .mem_config_for("engine")
                .unwrap()
                .sync_state
                .keys()
                .any(|k| k.ends_with("#verified")),
            "a refused verify must not leave any #verified token",
        );
    }

    #[test]
    fn completed_verify_records_the_verified_baseline() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();
        let out = std::process::Command::new("git")
            .args(["init", "-q"])
            .current_dir(root)
            .output()
            .unwrap();
        assert!(out.status.success());

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: Some(BuildOperation {
                        mode: BuildMode::Discovery,
                        trigger: IngestTrigger::Loop,
                        batch_size: 20,
                        post_actions: None,
                    }),
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        let mut engine = Engine::from_workspace_root(root).unwrap();
        // A recorded `#synced` baseline is this facet's current head (the git
        // work tree has no commits, so the cursor contributes no newer token).
        engine
            .set_mem_sync_state("engine", "engine/graph/graph#synced", "deadbeef", None)
            .unwrap();

        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
        // The outcome decomposes its own key: joined facet heads == source_head.
        assert_eq!(
            outcome.facet_heads.get("graph").map(String::as_str),
            Some("deadbeef")
        );
        assert_eq!(outcome.key.source_head, "graph=deadbeef");
        assert_eq!(
            join_facet_heads(&outcome.facet_heads),
            outcome.key.source_head
        );

        // No `#verified` token exists before the writer runs.
        assert!(
            !engine
                .mem_config_for("engine")
                .unwrap()
                .sync_state
                .contains_key("engine/graph/graph#verified")
        );

        let written = record_verified_baseline(&mut engine, "engine", &outcome, None).unwrap();
        assert_eq!(written, vec!["engine/graph/graph#verified".to_string()]);

        // Visible to the engine's config read (the app's sync_state source)…
        assert_eq!(
            engine
                .mem_config_for("engine")
                .unwrap()
                .sync_state
                .get("engine/graph/graph#verified")
                .map(String::as_str),
            Some("deadbeef")
        );
        // …and durable on disk (what a fresh CLI process reads).
        let disk: serde_json::Value = serde_json::from_slice(
            &std::fs::read(mem_dir.join(".memstead").join("config.json")).unwrap(),
        )
        .unwrap();
        assert_eq!(
            disk["syncState"]["engine/graph/graph#verified"],
            serde_json::json!("deadbeef")
        );
    }

    // ---- D1: per-run adjudication cap -----------------------------------

    /// D1 — the per-run cap queues the remainder. A rotation window covering
    /// only a subset of drift candidates adjudicates the in-window ones and
    /// QUEUES every out-of-window candidate as `queued-for-adjudication` (the
    /// tier-3 backlog). Uncapped (`window = None`) adjudicates every candidate.
    #[test]
    fn adjudication_cap_queues_the_remainder() {
        let k = key("h", "s");
        let mk = |art: &str| {
            let mut a = anchor(AnchorProvenanceClass::Anchored);
            a.artifact = art.to_string();
            a
        };
        let candidates = vec![
            (
                "engine--a".to_string(),
                mk("src/a.rs"),
                AnchorState::Drifted,
            ),
            (
                "engine--b".to_string(),
                mk("src/b.rs"),
                AnchorState::Drifted,
            ),
            (
                "engine--c".to_string(),
                mk("src/c.rs"),
                AnchorState::Drifted,
            ),
        ];
        // A cap-1 window selects only src/a.rs.
        let window: BTreeSet<String> = [candidate_key("engine--a", &mk("src/a.rs"))]
            .into_iter()
            .collect();
        let out = adjudicate_candidates(&k, "f", &candidates, Some(&window), "1");
        let drifted = out
            .iter()
            .filter(|f| f.class == FindingClass::Drifted)
            .count();
        let queued = out
            .iter()
            .filter(|f| f.class == FindingClass::QueuedForAdjudication)
            .count();
        assert_eq!(drifted, 1, "only the in-window candidate is adjudicated");
        assert_eq!(queued, 2, "the remainder is queued as the tier-3 backlog");
        // A queued remainder finding carries the queued detail, not a drift claim.
        assert!(
            out.iter()
                .any(|f| f.class == FindingClass::QueuedForAdjudication
                    && f.detail.contains("cap reached")),
            "capped remainder states it was deferred by the cap"
        );

        // Uncapped: every candidate adjudicated, none queued.
        let uncapped = adjudicate_candidates(&k, "f", &candidates, None, "1");
        assert_eq!(
            uncapped
                .iter()
                .filter(|f| f.class == FindingClass::Drifted)
                .count(),
            3,
            "uncapped adjudicates every candidate"
        );
        assert_eq!(
            uncapped
                .iter()
                .filter(|f| f.class == FindingClass::QueuedForAdjudication)
                .count(),
            0
        );
    }

    // ---- D3: full_resync scheduling + non-enumerable refusal ------------

    /// D3 — `schedule_full_resync`: disabled at cadence 0; not-due off-cadence
    /// (with a countdown); due on-cadence for an enumerable facet (walked, no
    /// refusal).
    #[test]
    fn full_resync_schedule_disabled_notdue_due() {
        let codebase = FacetEnumerability {
            facet: "src".to_string(),
            medium_type: "codebase".to_string(),
            enumerable: true,
        };
        assert_eq!(
            schedule_full_resync(0, 5, std::slice::from_ref(&codebase)),
            FullResyncDecision::Disabled
        );
        match schedule_full_resync(3, 2, std::slice::from_ref(&codebase)) {
            FullResyncDecision::NotDue { runs_until_due, .. } => assert_eq!(runs_until_due, 1),
            other => panic!("expected NotDue, got {other:?}"),
        }
        match schedule_full_resync(3, 3, std::slice::from_ref(&codebase)) {
            FullResyncDecision::Due {
                walked_facets,
                refused,
                ..
            } => {
                assert_eq!(walked_facets, vec!["src".to_string()]);
                assert!(refused.is_empty(), "enumerable facet is not refused");
            }
            other => panic!("expected Due, got {other:?}"),
        }
    }

    /// D3 REFUSAL — a scheduled full walk over a NON-enumerable medium refuses
    /// with a typed signal: it never claims coverage and is never a silent skip.
    #[test]
    fn full_resync_refuses_non_enumerable_medium() {
        let web = FacetEnumerability {
            facet: "manual".to_string(),
            medium_type: "web".to_string(),
            enumerable: false,
        };
        let d = schedule_full_resync(1, 1, &[web]);
        assert!(
            d.is_full_walk(),
            "a due sweep is a full walk even when refused"
        );
        match d {
            FullResyncDecision::Due {
                walked_facets,
                refused,
                ..
            } => {
                assert!(walked_facets.is_empty(), "nothing enumerable to walk");
                assert_eq!(refused.len(), 1, "the non-enumerable facet is refused");
                assert_eq!(refused[0].facet, "manual");
                assert_eq!(refused[0].medium_type, "web");
                assert!(
                    refused[0].reason.contains("non-enumerable"),
                    "the refusal is typed and states why"
                );
            }
            other => panic!("expected Due with a refusal, got {other:?}"),
        }
    }

    /// D3 — a scheduled full walk fires the WHOLE-source enumeration this run:
    /// with `full_resync_every = 1` (due every run) and a sample `batch_size` of
    /// 1, all three uncovered source files are flagged, not just one — the full
    /// walk overrides the bounded rotating sample for an enumerable medium.
    #[test]
    fn full_resync_full_walk_covers_whole_source() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();
        let out = std::process::Command::new("git")
            .args(["init", "-q"])
            .current_dir(root)
            .output()
            .unwrap();
        assert!(out.status.success());
        std::fs::create_dir_all(root.join("src")).unwrap();
        for f in ["a.rs", "b.rs", "c.rs"] {
            std::fs::write(root.join("src").join(f), "fn x() {}\n").unwrap();
        }

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: Some(BuildOperation {
                        mode: BuildMode::Discovery,
                        trigger: IngestTrigger::Loop,
                        batch_size: 20,
                        post_actions: None,
                    }),
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 1, // a tiny rotating sample …
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: 1, // … but a full walk fires EVERY run
                    }),
                },
            },
        )
        .unwrap();

        let engine = Engine::from_workspace_root(root).unwrap();
        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
        // The full walk is due on run 1 and covers the enumerable facet.
        match &outcome.full_resync {
            FullResyncDecision::Due {
                walked_facets,
                refused,
                run_count,
                ..
            } => {
                assert_eq!(*run_count, 1);
                assert_eq!(walked_facets, &vec!["graph".to_string()]);
                assert!(refused.is_empty());
            }
            other => panic!("expected a due full walk, got {other:?}"),
        }
        // All three uncovered files flagged despite the batch_size-1 sample.
        let store = read_findings_store(root, "engine", "graph")
            .unwrap()
            .unwrap();
        let uncovered = store
            .current(&outcome.key)
            .iter()
            .filter(|f| f.class == FindingClass::Uncovered)
            .count();
        assert_eq!(
            uncovered, 3,
            "the scheduled full walk covers the whole source, not a batch of one"
        );
    }

    /// A SCHEDULED full walk consults partiality the way `--full` does: a facet
    /// whose enumeration is known-incomplete (here: a scope pattern still in
    /// the retired workspace-relative dialect) is demoted into the typed
    /// refusal list instead of being walked and announced as full. Without the
    /// demotion one report carries both "full-enumeration walk fired" and
    /// "`S(D)` is partial, no percentage".
    #[test]
    fn scheduled_full_walk_demotes_partial_facet_to_refusal() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: MountCapability::Write,
            lifecycle: MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![mount],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();
        let out = std::process::Command::new("git")
            .args(["init", "-q"])
            .current_dir(root)
            .output()
            .unwrap();
        assert!(out.status.success());
        std::fs::create_dir_all(root.join("src")).unwrap();
        std::fs::write(root.join("src").join("a.rs"), "fn x() {}\n").unwrap();

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: "src".to_string(),
                    change_detection: Some("git".to_string()),
                    // A MIXED scope: the prefix-free pattern still enumerates,
                    // so the facet is non-empty and looks like a population —
                    // while the retired-dialect pattern's share is absent.
                    scope: vec![
                        PatternEntry {
                            path: "**/*.rs".to_string(),
                            mode: PatternMode::Allow,
                        },
                        PatternEntry {
                            path: "src/nested.rs".to_string(),
                            mode: PatternMode::Allow,
                        },
                    ],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: Some(BuildOperation {
                        mode: BuildMode::Discovery,
                        trigger: IngestTrigger::Loop,
                        batch_size: 20,
                        post_actions: None,
                    }),
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 1,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: 1, // a full walk fires EVERY run …
                    }),
                },
            },
        )
        .unwrap();

        let engine = Engine::from_workspace_root(root).unwrap();
        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
        match &outcome.full_resync {
            FullResyncDecision::Due {
                walked_facets,
                refused,
                ..
            } => {
                assert!(
                    walked_facets.is_empty(),
                    "a partial facet must not be announced as walked-in-full: {walked_facets:?}"
                );
                assert_eq!(refused.len(), 1, "the partial facet is refused, typed");
                assert_eq!(refused[0].facet, "graph");
                assert!(
                    refused[0].reason.contains("incomplete"),
                    "the refusal names the partiality: {}",
                    refused[0].reason
                );
            }
            other => panic!("expected a due full walk decision, got {other:?}"),
        }
    }

    // ---- explicit full measurement (`verify_binding_full`) ----------------

    /// An explicit full measurement walks the whole `S(D)` and treats the
    /// adjudication cap as unlimited — every drift candidate adjudicates and
    /// every uncovered artifact is flagged in ONE run, with nothing deferred
    /// to a cap or a rotating sample, and the decision reports `Forced`.
    /// REFUSAL half (byte-compat): a no-flag run over the same binding keeps
    /// today's capped/sampled behavior exactly — cap-1 adjudicates one
    /// candidate and queues the remainder with the cap-reached detail, and
    /// the batch-1 sample flags at most one uncovered file.
    #[test]
    fn full_verify_uncaps_adjudication_and_walks_whole_source() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![Mount {
                        mem: "engine".to_string(),
                        schema: Some("default@1.0.0".parse().unwrap()),
                        storage: MountStorage::Folder {
                            path: mem_dir.clone(),
                        },
                        capability: MountCapability::Write,
                        lifecycle: MountLifecycle::Eager,
                        cross_linkable: false,
                        migration_target: None,
                    }],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();
        let out = std::process::Command::new("git")
            .args(["init", "-q"])
            .current_dir(root)
            .output()
            .unwrap();
        assert!(out.status.success());
        std::fs::create_dir_all(root.join("src")).unwrap();
        // Three anchored (drift-candidate) files + three uncovered files.
        for f in ["a.rs", "b.rs", "c.rs", "d.rs", "e.rs", "f.rs"] {
            std::fs::write(root.join("src").join(f), "fn x() {}\n").unwrap();
        }
        let mk = |art: &str| Anchor {
            artifact: art.to_string(),
            grain: AnchorGrain::File,
            class: AnchorProvenanceClass::Anchored,
            at_version: None,
            hash: Some("stale-recorded-hash".to_string()), // mismatches → drift candidate
            hash_stability: AnchorHashStability::Stable,
            derived_from: Vec::new(),
            binding: None,
            source: None,
            span_unvalidated: false,
            hash_source: None,
            last_observed: None,
        };
        // The entity the sidecar is keyed to. Written, because it exists:
        // a row whose entity does not is DANGLING (consistency-sweep 03/02)
        // and leaves the population before any figure counts it.
        std::fs::write(
            mem_dir.join("e.md"),
            "---\ntype: decision\n---\n\n# E\n\n## Decision\n\nBody.\n",
        )
        .unwrap();
        let mut sidecar = AnchorSidecar::default();
        sidecar.set(
            "engine--e",
            vec![mk("src/a.rs"), mk("src/b.rs"), mk("src/c.rs")],
        );
        std::fs::write(
            mem_dir.join(crate::anchor::ANCHOR_SIDECAR_PATH),
            sidecar.to_bytes(),
        )
        .unwrap();

        write_binding(
            root,
            "engine",
            "graph",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "graph".to_string(),
                    medium_type: MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![PatternEntry {
                        path: "src/**/*.rs".to_string(),
                        mode: PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: None,
                rules: None,
                prune: None,
                operations: Operations {
                    build: None,
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 1,        // tiny rotating sample …
                        adjudication_cap: 1,  // … and a tiny cap
                        full_resync_every: 0, // scheduled walks disabled
                    }),
                },
            },
        )
        .unwrap();

        let engine = Engine::from_workspace_root(root).unwrap();
        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/graph", binding).unwrap();

        // Byte-compat leg — the no-flag run keeps today's capped/sampled
        // economics: one candidate adjudicated, two queued by the cap, at
        // most one uncovered file from the batch-1 sample, no full walk.
        let sampled = verify_binding(&engine, root, binding, &resolved).unwrap();
        assert_eq!(sampled.full_resync, FullResyncDecision::Disabled);
        let store = read_findings_store(root, "engine", "graph")
            .unwrap()
            .unwrap();
        let current = store.current(&sampled.key);
        let count = |c: FindingClass| current.iter().filter(|f| f.class == c).count();
        assert_eq!(count(FindingClass::Drifted), 1, "cap-1 adjudicates one");
        assert_eq!(
            count(FindingClass::QueuedForAdjudication),
            2,
            "the remainder queues"
        );
        assert!(
            current
                .iter()
                .any(|f| f.class == FindingClass::QueuedForAdjudication
                    && f.detail.contains("cap reached")),
            "the sampled deferral states the cap"
        );
        assert!(
            count(FindingClass::Uncovered) <= 1,
            "batch-1 sample looks at one artifact"
        );

        // Full measurement: everything adjudicates, everything is walked,
        // nothing deferred — no sampling/truncation residue anywhere.
        let full = verify_binding_full(&engine, root, binding, &resolved).unwrap();
        assert_eq!(
            full.full_resync,
            FullResyncDecision::Forced {
                walked_facets: vec!["graph".to_string()]
            }
        );
        assert_eq!(full.backlog, 0, "cap treated as unlimited — no backlog");
        let store = read_findings_store(root, "engine", "graph")
            .unwrap()
            .unwrap();
        let current = store.current(&full.key);
        let count = |c: FindingClass| current.iter().filter(|f| f.class == c).count();
        assert_eq!(
            count(FindingClass::Drifted),
            3,
            "every candidate adjudicated"
        );
        assert_eq!(count(FindingClass::QueuedForAdjudication), 0);
        assert_eq!(
            count(FindingClass::Uncovered),
            3,
            "the whole S(D) walked — every uncovered file flagged"
        );
        assert!(
            current.iter().all(|f| !f.detail.contains("cap reached")),
            "a full run's findings carry no cap-deferral caveat"
        );
    }

    /// REFUSAL — an explicit full measurement over a non-enumerable medium
    /// refuses the whole run with the typed capability error (nothing
    /// observed, nothing recorded — never a fabricated-complete report),
    /// while the no-flag sampled verify over the same binding still runs.
    #[test]
    fn full_verify_refuses_non_enumerable_medium_typed() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        crate::FileWorkspaceStore::new()
            .save_state(
                root,
                &Workspace {
                    mounts: vec![Mount {
                        mem: "engine".to_string(),
                        schema: Some("default@1.0.0".parse().unwrap()),
                        storage: MountStorage::Folder {
                            path: mem_dir.clone(),
                        },
                        capability: MountCapability::Write,
                        lifecycle: MountLifecycle::Eager,
                        cross_linkable: false,
                        migration_target: None,
                    }],
                    settings: WorkspaceSettings::default(),
                },
            )
            .unwrap();

        // A web medium — the capability matrix marks it non-enumerable.
        write_binding(
            root,
            "engine",
            "manual",
            &Binding {
                version: BINDING_VERSION,
                intent: None,
                sources: vec![crate::pipeline::Source {
                    name: "manual".to_string(),
                    medium_type: MediumType::Web,
                    pointer: "https://example.com/docs".to_string(),
                    change_detection: None,
                    scope: Vec::new(),
                    engagement: None,
                    preparation: None,
                }],
                reference_mems: Vec::new(),
                destination_mem: "engine".to_string(),
                deny_paths: Vec::new(),
                coverage_semantics: Some(CoverageSemantics::Curated),
                rules: None,
                prune: None,
                operations: Operations {
                    build: None,
                    sync: None,
                    verify: Some(VerifyOperation {
                        trigger: IngestTrigger::Manual,
                        batch_size: 20,
                        adjudication_cap: DEFAULT_ADJUDICATION_CAP,
                        full_resync_every: DEFAULT_FULL_RESYNC_EVERY,
                    }),
                },
            },
        )
        .unwrap();

        let engine = Engine::from_workspace_root(root).unwrap();
        let configs = load_pipeline_configs(root).unwrap();
        let binding = &configs.bindings[0].config;
        let resolved = resolve_binding_run("engine/manual", binding).unwrap();

        // Full: typed refusal naming the facet and medium type; nothing recorded.
        let err = verify_binding_full(&engine, root, binding, &resolved).unwrap_err();
        match &err {
            FindingsError::FullWalkNonEnumerable(refusal) => {
                assert_eq!(refusal.facet, "manual");
                assert_eq!(refusal.medium_type, "web");
                assert!(refusal.reason.contains("non-enumerable"));
            }
            other => panic!("expected FullWalkNonEnumerable, got {other:?}"),
        }
        assert!(
            read_findings_store(root, "engine", "manual")
                .unwrap()
                .is_none(),
            "a refused full run records nothing"
        );

        // No-flag: the sampled verify over the same binding still runs.
        let sampled = verify_binding(&engine, root, binding, &resolved).unwrap();
        assert_eq!(sampled.binding, "engine/manual");
    }

    fn sourceless_binding() -> crate::binding::Binding {
        crate::binding::Binding {
            version: crate::binding::BINDING_VERSION,
            intent: None,
            sources: Vec::new(),
            reference_mems: Vec::new(),
            destination_mem: "m".to_string(),
            deny_paths: Vec::new(),
            coverage_semantics: None,
            rules: None,
            prune: None,
            operations: crate::binding::Operations {
                build: None,
                sync: None,
                verify: None,
            },
        }
    }

    fn uncovered(key: &FindingKey, artifact: &str) -> Finding {
        Finding {
            key: key.clone(),
            facet: "src".to_string(),
            target: FindingTarget::Artifact {
                artifact: artifact.to_string(),
            },
            class: FindingClass::Uncovered,
            detail: "source artifact in scope has no anchor in the destination mem".to_string(),
            created_at: "1".to_string(),
        }
    }

    /// An exclusion `projection exclude` just accepted takes effect on the
    /// VERY NEXT brief read, with no verify pass in between: the stored batch
    /// still carries the uncovered finding, and `current_findings` drops it
    /// against the durable exclusion ledger. Non-uncovered findings and
    /// uncovered artifacts the ledger does not name are untouched.
    #[test]
    fn current_findings_drops_ledger_excluded_uncovered_without_a_verify() {
        let ws = tempfile::tempdir().unwrap();
        let root = ws.path();
        let engine = crate::engine::Engine::from_mounts(Vec::new()).unwrap();
        let binding = sourceless_binding();
        let resolved = resolve_binding_run("m/s", &binding).unwrap();

        let key = FindingKey {
            binding_hash: crate::binding::hash_binding(&binding),
            source_head: String::new(),
        };
        let mut store = FindingsStore {
            binding: "m/s".to_string(),
            ..Default::default()
        };
        store.record(
            key.clone(),
            "1".to_string(),
            vec![uncovered(&key, "docs/a.md"), uncovered(&key, "docs/b.md")],
        );
        write_findings_store(root, "m", "s", &store).unwrap();

        // Before the exclusion: both present.
        let (_, before) = current_findings(&engine, root, &binding, &resolved).unwrap();
        assert_eq!(before.len(), 2);

        // The exclusion lands in the durable ledger (as `projection exclude`
        // records it) — no verify rewrites the batch.
        let state = crate::ingest::advance::AdvanceState {
            binding: "m/s".to_string(),
            exclusions: [("docs/a.md".to_string(), "generated; no entity".to_string())]
                .into_iter()
                .collect(),
            ..Default::default()
        };
        crate::ingest::advance::write_advance_store(root, "m", "s", &state).unwrap();

        let (_, after) = current_findings(&engine, root, &binding, &resolved).unwrap();
        assert_eq!(after.len(), 1);
        assert!(matches!(
            &after[0].target,
            FindingTarget::Artifact { artifact } if artifact == "docs/b.md"
        ));
    }

    /// Findings recorded under a prior `hash(D)` are superseded and never
    /// surface through `current_findings` — the brief renders the current
    /// batch alone.
    #[test]
    fn current_findings_never_serves_superseded_batches() {
        let ws = tempfile::tempdir().unwrap();
        let root = ws.path();
        let engine = crate::engine::Engine::from_mounts(Vec::new()).unwrap();
        let binding = sourceless_binding();
        let resolved = resolve_binding_run("m/s", &binding).unwrap();

        let old_key = key("a-prior-binding-hash", "head0");
        let cur_key = FindingKey {
            binding_hash: crate::binding::hash_binding(&binding),
            source_head: String::new(),
        };
        let mut store = FindingsStore {
            binding: "m/s".to_string(),
            ..Default::default()
        };
        store.record(
            old_key.clone(),
            "1".to_string(),
            vec![uncovered(&old_key, "docs/stale.md")],
        );
        store.record(
            cur_key.clone(),
            "2".to_string(),
            vec![uncovered(&cur_key, "docs/live.md")],
        );
        write_findings_store(root, "m", "s", &store).unwrap();

        let (_, current) = current_findings(&engine, root, &binding, &resolved).unwrap();
        assert_eq!(current.len(), 1);
        assert!(matches!(
            &current[0].target,
            FindingTarget::Artifact { artifact } if artifact == "docs/live.md"
        ));
    }

    /// A workspace with one folder mem `engine` (default@1.0.0), a git source
    /// tree at the root, and `files` written relative to the root. Returns the
    /// root; the caller writes the binding.
    fn a3_workspace(root: &std::path::Path, files: &[&str]) {
        let mem_dir = root.join("mem");
        std::fs::create_dir_all(mem_dir.join(".memstead")).unwrap();
        std::fs::write(
            mem_dir.join(".memstead").join("config.json"),
            r#"{"format":1,"schema":"default@1.0.0","version":"1.0.0"}"#,
        )
        .unwrap();
        std::fs::create_dir_all(root.join(".memstead")).unwrap();
        std::fs::write(
            root.join(".memstead").join("workspace.toml"),
            "format = \"memstead-git-branch-2\"\n\n[persistence_adapter]\nname = \"file-two-layer\"\n",
        )
        .unwrap();
        let mount = crate::workspace::Mount {
            mem: "engine".to_string(),
            schema: Some("default@1.0.0".parse().unwrap()),
            storage: crate::workspace::MountStorage::Folder {
                path: mem_dir.clone(),
            },
            capability: crate::workspace::MountCapability::Write,
            lifecycle: crate::workspace::MountLifecycle::Eager,
            cross_linkable: false,
            migration_target: None,
        };
        crate::workspace_store::WorkspaceStoreAdapter::save_state(
            &crate::FileWorkspaceStore::new(),
            root,
            &crate::workspace::Workspace {
                mounts: vec![mount],
                settings: crate::workspace::WorkspaceSettings::default(),
            },
        )
        .unwrap();
        let out = std::process::Command::new("git")
            .args(["init", "-q"])
            .current_dir(root)
            .output()
            .unwrap();
        assert!(out.status.success());
        for f in files {
            let p = root.join(f);
            std::fs::create_dir_all(p.parent().unwrap()).unwrap();
            std::fs::write(p, "fn x() {}\n").unwrap();
        }
    }

    fn a3_binding(
        sources: &[(&str, &str)],
        deny: &[&str],
        batch_size: u32,
    ) -> crate::binding::Binding {
        crate::binding::Binding {
            version: crate::binding::BINDING_VERSION,
            intent: None,
            sources: sources
                .iter()
                .map(|(name, glob)| crate::pipeline::Source {
                    name: name.to_string(),
                    medium_type: crate::pipeline::MediumType::Codebase,
                    pointer: String::new(),
                    change_detection: Some("git".to_string()),
                    scope: vec![crate::pipeline::PatternEntry {
                        path: glob.to_string(),
                        mode: crate::pipeline::PatternMode::Allow,
                    }],
                    engagement: None,
                    preparation: None,
                })
                .collect(),
            reference_mems: Vec::new(),
            destination_mem: "engine".to_string(),
            deny_paths: deny.iter().map(|d| d.to_string()).collect(),
            coverage_semantics: None,
            rules: None,
            prune: None,
            operations: crate::binding::Operations {
                build: Some(crate::binding::BuildOperation {
                    mode: crate::binding::BuildMode::Discovery,
                    trigger: crate::pipeline::IngestTrigger::Loop,
                    batch_size,
                    post_actions: None,
                }),
                sync: None,
                verify: Some(crate::binding::VerifyOperation {
                    trigger: crate::pipeline::IngestTrigger::Manual,
                    batch_size,
                    adjudication_cap: crate::binding::DEFAULT_ADJUDICATION_CAP,
                    // Scheduled full walks off: the sampled path is under test.
                    full_resync_every: 0,
                }),
            },
        }
    }

    /// A3 AC1: after `projection edit` adds a deny, every sampled verify
    /// records zero `uncovered` findings naming a denied file across five
    /// rotation windows while `S(D)` reads thirty; lifting the deny makes the
    /// denied files present again (the filter follows the binding, not the
    /// rotation cache).
    #[test]
    fn sampled_verify_records_nothing_for_denied_artifacts() {
        let tmp = tempfile::tempdir().unwrap();
        let root = tmp.path();
        let mut files: Vec<String> = (0..30).map(|i| format!("src/keep/k{i:02}.rs")).collect();
        files.extend((0..10).map(|i| format!("src/deny/d{i:02}.rs")));
        let refs: Vec<&str> = files.iter().map(String::as_str).collect();
        a3_workspace(root, &refs);
        let engine = Engine::from_workspace_root(root).unwrap();

        let run = |binding: &Binding| -> (VerifyOutcome, Vec<String>) {
            let resolved = resolve_binding_run("engine/graph", binding).unwrap();
            let outcome = verify_binding(&engine, root, binding, &resolved).unwrap();
            let store = read_findings_store(root, "engine", "graph")
                .unwrap()
                .expect("store written");
            let uncovered: Vec<String> = store
                .current(&outcome.key)
                .iter()
                .filter(|f| f.class == FindingClass::Uncovered)
                .filter_map(|f| match &f.target {
                    FindingTarget::Artifact { artifact } => Some(artifact.clone()),
                    _ => None,
                })
                .collect();
            (outcome, uncovered)
        };

        // One sampled run over the whole set seeds the rotation (40 files,
        // window 8).
        let open = a3_binding(&[("graph", "src/**/*.rs")], &[], 8);
        write_binding(root, "engine", "graph", &open).unwrap();
        let (_, first) = run(&open);
        assert!(!first.is_empty(), "the sample records uncovered files");

        // The edit: deny the ten files.
        let denied = a3_binding(&[("graph", "src/**/*.rs")], &["src/deny/**"], 8);
        write_binding(root, "engine", "graph", &denied).unwrap();
        let resolved = resolve_binding_run("engine/graph", &denied).unwrap();
        let ResolvedSource::Primary(p) = &resolved.sources[0] else {
            panic!("primary source")
        };
        assert_eq!(
            enumerate_source_artifacts(&engine, p, &resolved.deny_paths, root).len(),
            30,
            "the denominator honours the deny"
        );
        for pass in 0..5 {
            let (_, uncovered) = run(&denied);
            assert!(
                uncovered.iter().all(|a| !a.starts_with("src/deny/")),
                "pass {pass} recorded a denied artifact: {uncovered:?}"
            );
        }

        // Lifting the deny: the files come back into the sample.
        write_binding(root, "engine", "graph", &open).unwrap();
        let mut seen_denied = false;
        for _ in 0..8 {
            let (_, uncovered) = run(&open);
            if uncovered.iter().any(|a| a.starts_with("src/deny/")) {
                seen_denied = true;
                break;
            }
        }
        assert!(
            seen_denied,
            "with the deny lifted the files are sampled again"
        );
    }
}