core_rules/

engine.rs

use crate::def::{
    evaluate, is_keymatch_rooted, predicate_contains_keymatch, NodeView, Predicate, RuleDef,
    MAX_KEYMATCH_LIST,
};
use crate::hnsw::HnswIndex;
use crate::index::{
    candidate_spec, candidate_spec_approx_with_floor, hnsw_build_batch, hnsw_vector_present,
    ivf_drift_rebuild_threshold, spec_has_hnsw, vector_scan_forced, CandidateSpec, RuleIndex,
};
use core_storage::v8::encode::{decode_ivf_bytes, decode_provenance_bytes};
use core_storage::v8::seam::{ColumnsView, TopologyView};
use core_storage::{EdgeProps, IdMap, Interner, Topology, Value};
use serde::{Deserialize, Serialize};

/// Whether `def` may see node `id` — the namespace scoping check (v0.6.6 §7.4).
///
/// A global rule (`def.namespace == None`) sees every node and takes no column
/// read at all, so every rule written before namespaces existed runs exactly the
/// code it ran before. A scoped rule sees only nodes in its namespace, which is
/// what makes every edge it derives intra-namespace: the check is applied to
/// each side where candidates are enumerated, so no pair-level check exists.
fn rule_sees_node(def: &RuleDef, id: u32, props: &ColumnsView<'_>) -> bool {
    match &def.namespace {
        None => true,
        Some(ns) => {
            let value = props
                .get(id, core_storage::NS_PROP)
                .map(|vr| vr.into_value());
            core_storage::namespace_of_value(value.as_ref()) == ns.as_str()
        }
    }
}

/// [`rule_sees_node`] against the graph handle a hook already holds.
fn rule_sees(def: &RuleDef, id: u32, g: &GraphMut<'_>) -> bool {
    if def.namespace.is_none() {
        return true;
    }
    rule_sees_node(def, id, &g.props)
}

/// Decode one side's retained HNSW blob for the lazy clean-open read path.
///
/// Empty means "this side had no graph"; a decode failure is reported once on
/// stderr, because the consequence — every ANN query on this store running
/// brute force until the first write — is otherwise invisible.
fn lazy_decode(rule: &str, side: &str, blob: &[u8]) -> Option<HnswIndex> {
    if blob.is_empty() {
        return None;
    }
    match crate::hnsw::decode_hnsw_blob(blob) {
        Ok(h) => Some(h),
        Err(e) => {
            eprintln!(
                "[mushroomdb] rule {rule:?}: persisted {side}-side HNSW index failed to load \
                 ({e}); approximate queries fall back to a full scan until the next write"
            );
            None
        }
    }
}

/// Decode raw IVF section bytes into the `RuleIvfExport` format consumed by
/// `reindex_all_load_state`.  Returns an empty map when `bytes` is empty.
fn decode_ivf_bytes_to_export(bytes: &[u8]) -> BTreeMap<String, RuleIvfExport> {
    decode_ivf_bytes(bytes)
        .into_iter()
        .map(|(name, ps)| {
            (
                name,
                (
                    (ps.src.centroids, ps.src.clusters, ps.src.drift),
                    (ps.dst.centroids, ps.dst.clusters, ps.dst.drift),
                ),
            )
        })
        .collect()
}
use std::collections::{BTreeMap, BTreeSet};
use std::sync::atomic::{AtomicU32, Ordering as AtomicOrdering};
use std::sync::{Mutex, OnceLock};

/// A single derived-edge fire or retract captured during a commit.
///
/// Populated inside [`ProvSets::insert`] / [`ProvSets::remove`] while graph
/// state is fully intact (before any tombstone step in `DeleteNode`).
/// String keys are resolved at capture time so they remain valid even after
/// node deletion.
#[derive(Debug, Clone)]
pub struct EngineEdgeDelta {
    pub rule: String,
    /// User-facing source node key.
    pub src_key: String,
    /// User-facing destination node key.
    pub dst_key: String,
    /// Edge-type string.
    pub edge_type: String,
    /// Internal edge-type symbol (for edge_props weight lookup in db.rs).
    pub etype_sym: u32,
    /// Internal source node id (for edge_props weight lookup in db.rs).
    pub src_id: u32,
    /// Internal destination node id (for edge_props weight lookup in db.rs).
    pub dst_id: u32,
    /// `true` = edge was fired (added to provenance); `false` = retracted.
    pub fired: bool,
}

#[cfg(test)]
pub use crate::index::{with_ivf_drift_rebuild, with_vector_dim_reject, with_vector_early_exit};

/// Test-only: the largest number of desired (src,dst) pairs held in memory at
/// once during a backfill sweep. Lets scale tests assert bounded materialization.
#[cfg(test)]
pub(crate) static PEAK_DESIRED_PAIRS: std::sync::atomic::AtomicUsize =
    std::sync::atomic::AtomicUsize::new(0);

#[cfg(test)]
pub(crate) fn record_desired_len(n: usize) {
    use std::sync::atomic::Ordering;
    let mut cur = PEAK_DESIRED_PAIRS.load(Ordering::Relaxed);
    while n > cur {
        match PEAK_DESIRED_PAIRS.compare_exchange_weak(cur, n, Ordering::Relaxed, Ordering::Relaxed)
        {
            Ok(_) => break,
            Err(actual) => cur = actual,
        }
    }
}

/// Borrowed mutable view of graph state the engine writes derived edges into.
pub struct GraphMut<'a> {
    pub ids: &'a IdMap,
    pub syms: &'a mut Interner,
    pub labels: &'a [u32],
    pub props: ColumnsView<'a>,
    /// Edges written since the snapshot. Reads must go through
    /// [`GraphMut::neighbors`], not this field: on a store opened from a
    /// snapshot the overlay is empty and every edge lives in `base_topo`.
    pub topo: &'a mut Topology,
    /// The snapshot's archived CSR, when one is open. `None` for a store with
    /// no snapshot, where `topo` already holds everything.
    pub base_topo: Option<&'a core_storage::v8::layout::ArchivedCsr>,
    pub edge_props: &'a mut EdgeProps,
}

impl GraphMut<'_> {
    /// Add a derived edge, reporting whether it was not there before —
    /// counting the snapshot's edges as well as the overlay's.
    ///
    /// `Topology::add_edge` looks at the overlay alone. On a store opened from
    /// a snapshot, an edge one rule derived before the snapshot lives in the
    /// base, so a second rule over the same edge type that desires it was told
    /// it was new: it recorded the edge as its own beside the first rule, the
    /// edge was counted twice, and when the second rule let go of it the edge
    /// went from the graph while the first rule still counted it (ledger row
    /// 103). Every derived-edge insert in the engine goes through here.
    ///
    /// A binary search of the base row and a tombstone lookup, not a merge of
    /// the row: building the merged row for each insert made re-deriving a
    /// hub's out-edges after a snapshot quadratic in its degree.
    pub fn add_edge(&mut self, etype: u32, src: u32, dst: u32) -> bool {
        if let Some(base) = self.base_topo {
            let tombstoned = self
                .topo
                .out_tombstones_for(etype, src)
                .is_some_and(|t| t.contains(&dst));
            if !tombstoned && core_storage::v8::seam::base_has_out_edge(base, etype, src, dst) {
                return false;
            }
        }
        self.topo.add_edge(etype, src, dst)
    }

    /// Neighbours of `v` over `(etype, dir)`, merging the snapshot base with
    /// the post-snapshot overlay and subtracting the overlay's tombstones.
    ///
    /// A rule that reads the graph's shape — today only a via-hop rule, when it
    /// expands its hop — must use this rather than `topo` directly. Reading the
    /// overlay alone on a store opened from a snapshot returns nothing, which a
    /// via-hop rule cannot distinguish from "this source reaches no via node"
    /// and answers by retracting every edge it owns.
    pub fn neighbors(
        &self,
        etype: u32,
        dir: core_storage::Direction,
        v: u32,
    ) -> std::borrow::Cow<'_, [u32]> {
        match self.base_topo {
            None => TopologyView::owned(self.topo).neighbors(etype, dir, v),
            Some(base) => TopologyView::with_base(self.topo, base).neighbors(etype, dir, v),
        }
    }
}

/// Used when `RuleDef.max_edges` is `None`.
pub const DEFAULT_MAX_EDGES: u64 = 1_000_000;

/// How many chained levels a single write may cascade through.
///
/// A derived edge written by one rule can feed a via-hop rule, whose derived
/// edges can feed another, and so on. Chaining stops after this many levels
/// even if further rules would still fire, so one write is always bounded.
/// Cycles are rejected at rule-creation time; the cap bounds long acyclic
/// chains and any chain the creation-time check could not see (a rule created
/// in an earlier release, or a same-batch rule window).
pub const MAX_CHAIN_DEPTH: usize = 4;

/// `(etype, src, dst)` as stored in `provenance` / `owned`.
type Triple = (u32, u32, u32);
/// Reverse-index entry: `(rule_id, etype, src, dst)`. `rule_id` is interned.
type Touch = (u32, u32, u32, u32);

/// State captured when a top-level engine hook is entered, so its tail can
/// chain the derived-edge deltas that hook produced.
struct ChainScope {
    /// `pending_deltas.len()` at hook entry.
    cursor: usize,
    /// `emit_deltas` at hook entry, restored on exit.
    prev_emit: bool,
    /// Whether some rule hops over an edge type, i.e. chaining can do anything
    /// at all.
    active: bool,
}

/// IVF state for one index side, exported for V4 snapshot persistence:
/// `(centroids, node→cluster assignments, drift_counter)`.
pub type SideIvfExport = (Vec<Vec<f64>>, BTreeMap<u32, usize>, u64);
/// IVF state for both sides (src, dst) of one approximate rule.
pub type RuleIvfExport = (SideIvfExport, SideIvfExport);

/// Raw (src-graph, dst-graph) HNSW blobs retained from the last snapshot.
type HnswBlobMap = BTreeMap<String, (Vec<u8>, Vec<u8>)>;
/// Lazily-decoded HNSW graph pair (src-side, dst-side) keyed by rule name.
type LazyHnswMap = BTreeMap<String, (Option<HnswIndex>, Option<HnswIndex>)>;

/// How far a rule's vector index has got, for a rule whose build did not fit
/// in one commit.
///
/// `indexed == total` means the graph is whole and only the backfill is
/// outstanding — the rule still derives no edges until it disappears from
/// [`RuleEngine::builds_in_progress`]. Never persisted: a reopen re-derives it
/// from a blob with `complete == false`, or from the adopted graph and the
/// node scan.
#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct BuildProgress {
    pub rule: String,
    pub indexed: u64,
    pub total: u64,
}

/// The engine-side bookkeeping behind one [`BuildProgress`].
///
/// `cursor` is the next node id a slice will look at and `limit` the id bound
/// fixed when the rule was created, so the build walks a stable range even as
/// writes append new nodes — those go into the graph through the ordinary
/// write path instead.
#[derive(Clone, Debug)]
struct PendingBuild {
    indexed: u64,
    total: u64,
    cursor: u32,
    limit: u32,
}

/// Lazily-decoded provenance state used by `&self` read paths
/// (`stats()`, `explain()`, `provenance_touching`).
///
/// Populated once from the retained section-7 bytes via `ensure_provenance_loaded`.
/// After the first `&mut self` mutation (which calls `ensure_provenance_loaded_mut`
/// and installs into the live `RuleEngine` fields), read paths switch to the live
/// fields and this struct is no longer consulted.
#[derive(Debug, Default)]
struct LazyProvenance {
    provenance: BTreeMap<String, BTreeSet<Triple>>,
    by_node: BTreeMap<u32, BTreeSet<Touch>>,
    intern_rule: Vec<String>,
}

#[derive(Debug, Default)]
pub struct RuleEngine {
    rules: BTreeMap<String, RuleDef>,
    indexes: BTreeMap<String, RuleIndex>,
    provenance: BTreeMap<String, BTreeSet<Triple>>,
    owned: BTreeSet<Triple>,
    /// Derived reverse index: node → provenance triples that touch it.
    /// Never serialized; rebuilt from `provenance` on persist-restore.
    by_node: BTreeMap<u32, BTreeSet<Touch>>,
    /// Intern table for rule names used as `Touch` rule_ids. Derived.
    /// Additive-only: ids are never reused. `by_node` stores these ids, so
    /// pruning-and-reusing a slot would alias leftover touches to a new name.
    /// Bound: one slot per distinct rule name ever created in this process.
    rule_intern: BTreeMap<String, u32>,
    intern_rule: Vec<String>,
    tripped: BTreeMap<String, bool>,
    fires: BTreeMap<String, u64>,
    /// Staging buffer for post-commit [`EngineEdgeDelta`] events.
    ///
    /// Populated by [`ProvSets::insert`] / [`ProvSets::remove`] during
    /// `apply` (live writes AND WAL replay). Callers must drain via
    /// [`RuleEngine::drain_deltas`] immediately after apply to consume live
    /// events or discard replay noise.
    pending_deltas: Vec<EngineEdgeDelta>,
    /// Edges retracted while handling the node change in progress. Emptied at
    /// the start of each one and consumed at its end by
    /// [`reclaim_retracted`](RuleEngine::reclaim_retracted). Never persisted.
    retracted: Vec<(u32, Triple)>,
    /// Gate: whether to accumulate [`EngineEdgeDelta`] items during rule
    /// application.
    ///
    /// **Safety invariant:** events are fire-and-forget live streams — a
    /// subscriber that attaches *later* never receives past events by design.
    /// Similarly, views call `backfill_view` at creation time (reading directly
    /// from `topo`, not from pending deltas), so deltas accumulated before a
    /// view is defined are not needed. Accumulation can therefore be skipped
    /// whenever no subscriber and no view exists; the observable behaviour is
    /// identical. Set to `true` by `set_emit_deltas` before the first
    /// subscribe, create_view, or any operation that needs events; cleared when
    /// the last listener is removed.
    emit_deltas: bool,
    /// Approximate rule names whose dst-side IVF drift exceeded
    /// [`crate::IVF_DRIFT_REBUILD`] during the last index maintenance.
    /// Drained by [`RuleEngine::take_rebuild_needed`] after apply.
    rebuild_needed: BTreeSet<String>,
    /// Rules whose HNSW graph is still being filled a slice at a time, keyed by
    /// rule name. A rule listed here derives **no** edges: its backfill runs as
    /// one commit once the graph is whole, so there is never a partial edge set.
    ///
    /// Never persisted. A reopen re-derives an entry from a blob whose
    /// `complete` flag is false (clean open) or from a persisted graph shorter
    /// than the node scan (`reindex_all_load_state`, WAL-present open).
    pending_builds: BTreeMap<String, PendingBuild>,
    /// Rules whose sliced build has just finished and whose backfill has not
    /// run yet. Drained by `rebuild_inner`, which carries the finished graph
    /// across its reindex instead of rebuilding it. Never persisted; a stale
    /// entry only costs the next rebuild its compaction.
    builds_awaiting_backfill: BTreeSet<String>,
    /// Per-handle build-slice size, overriding [`crate::HNSW_BUILD_BATCH`] and
    /// the `with_hnsw_build_batch` thread-local when set.
    ///
    /// Test hook, never persisted. The thread-local is enough for a test that
    /// drives the engine directly, but a server runs its writes on a blocking
    /// thread pool, and a process-global would leak between tests running in
    /// parallel; a value on the handle reaches the write wherever it runs and
    /// no further.
    hnsw_build_batch: Option<usize>,
    /// Whether candidate indexes have been populated.  Starts `false` after a
    /// snapshot restore that defers index building.  Set to `true` by
    /// `reindex_all`, `reindex_all_load_state`, and `create_rule`.  On the first
    /// mutation call when this is `false`, the full O(n) scan runs (first-write
    /// cost), consuming and replacing `retained_hnsw_blobs`.
    indexes_populated: bool,
    /// Raw HNSW blobs retained from the last snapshot, not yet deserialized.
    ///
    /// Populated by `store_snapshot_state`.  Consumed (deserialized into each
    /// rule's `RuleIndex`) either eagerly in `consume_retained_state_eager` (WAL-
    /// present open) or lazily on the first mutation or first ANN query
    /// (`ensure_hnsw_loaded` / the lazy-init guard in the mutation hooks).
    /// Wrapped in Mutex so `ensure_hnsw_loaded` can be called from `&self`
    /// (shared-read ANN path in `find_similar_vector` / `search_hybrid`).
    retained_hnsw_blobs: Mutex<HnswBlobMap>,
    /// Raw bincode bytes of the IVF cluster state retained from the last snapshot.
    ///
    /// Same lifecycle as `retained_hnsw_blobs` (mutation path only; consumed
    /// in `consume_retained_state_eager` or the lazy-init guard in
    /// `on_node_changed`).  Decoded via `decode_ivf_bytes` on first use
    /// instead of at open time to avoid the ~544 MiB bincode overhead.
    /// Wrapped in Mutex so `store_snapshot_state` can take `&self`.
    retained_ivf_bytes: Mutex<Option<Vec<u8>>>,
    /// How many id slots the snapshot held, recorded by `store_snapshot_state`.
    ///
    /// Ids are dense and never reused, so every node created since the snapshot
    /// has an id at or above this. That is what lets `reindex_all_load_state`
    /// tell "the persisted graph was cut short mid-build" (a vector missing
    /// *below* the line) from "this is simply a newer node" (missing at or
    /// above it) — including the node whose own `apply` is what tripped the
    /// lazy index build in the first place.
    retained_node_count: AtomicU32,
    /// Raw rkyv bytes of the provenance section retained from the last snapshot.
    ///
    /// Wrapped in `Mutex` so the `&self` read path (`ensure_provenance_loaded`)
    /// can access it without `&mut self`.  The bytes are NOT cleared by
    /// `ensure_provenance_loaded`; they are consumed (set to `None`) only by
    /// `ensure_provenance_loaded_mut` on the first mutation.  This mirrors the
    /// `retained_hnsw_blobs` lifetime so the write path can still consume the
    /// raw bytes to install into the live mutable fields.
    retained_provenance_bytes: Mutex<Option<Vec<u8>>>,
    /// Lazily-decoded provenance for `&self` read paths (clean-open, no-WAL).
    ///
    /// Populated at most once via `OnceLock::get_or_init` inside
    /// `ensure_provenance_loaded`.  After the first mutation
    /// `ensure_provenance_loaded_mut` installs provenance into the live struct
    /// fields and clears `retained_provenance_bytes`; subsequent reads detect
    /// `retained_provenance_bytes.is_none()` and go directly to the live fields.
    lazy_provenance: OnceLock<LazyProvenance>,
    /// Lazily-loaded HNSW graphs for the clean-open (no-WAL) ANN read path.
    ///
    /// Populated once by `ensure_hnsw_loaded` on the first ANN query after a
    /// snapshot open with no WAL.  `OnceLock` guarantees exactly-once init
    /// even under concurrent shared-read access.  It is a bridge from the open
    /// to the first write, not a second copy: whichever path installs the
    /// persisted graphs into `indexes` (`consume_retained_state_eager` or
    /// `ensure_indexes_populated`) drops it again via `release_lazy_hnsw`.
    lazy_hnsw: OnceLock<LazyHnswMap>,
    /// Current chaining level. `0` while a top-level hook runs; `1..=MAX_CHAIN_DEPTH`
    /// while [`RuleEngine::chain_from`] re-enters `on_edge_changed`. Non-zero
    /// suppresses re-entrant chaining and enables the fire-once guard.
    chain_depth: usize,
    /// `(rule ordinal, rule src)` pairs already recomputed during the current
    /// chain *level*, where the ordinal is the rule's position in the
    /// BTree-ordered rule set. Cleared at the start of every level: within one
    /// level a second recompute can only repeat work, but across levels a rule
    /// may legitimately need to see an edge a later level produced.
    chain_fired: BTreeSet<(u32, u32)>,
    /// The node currently being deleted, for the duration of `on_node_removed`.
    ///
    /// Chained recomputes run while that node still carries its label and
    /// props (`db.rs` tombstones it only after the hook returns), and
    /// `compute_desired_via` enumerates candidates by scanning labels rather
    /// than the rule index, so without this the chain would happily re-derive
    /// an edge onto a node that is about to vanish — leaving provenance the
    /// later topology sweep never cleans up.
    doomed: Option<u32>,
    /// How many times a write hit [`MAX_CHAIN_DEPTH`] with work still pending.
    /// Never persisted; counts from engine construction. Surfaced in `Stats`.
    chain_truncations: u64,
    /// How many HNSW graphs this engine has built from scratch — one per side
    /// of an approximate rule, counted where `init_hnsw` hands the following
    /// node scan an empty graph to fill.
    ///
    /// Never persisted; counts from engine construction. A graph restored from
    /// a persisted blob is *not* a build and does not count, which is what
    /// makes "this open reused the persisted index" observable to a test.
    hnsw_builds: u64,
}

// ---------------------------------------------------------------------------
// Private helpers (free functions, not methods, to avoid whole-struct borrows)
// ---------------------------------------------------------------------------

/// Rule-aware candidate spec.
///
/// Both exact and approximate `VectorSimilar`-rooted rules probe the vector
/// index. The difference is the beam: an approximate rule takes one pass at
/// `k`; an exact rule widens the beam until the beam's own worst hit falls
/// below the rule's `min`, at which point nothing outside it can qualify.
/// Scoring is the same code either way — only the set fed into it differs.
///
/// `MUSHROOMDB_VECTOR_SCAN=1` returns an exact rule to `candidate_spec`: the
/// O(n²) full scan, and every pair above `min` provably found.
fn candidate_spec_for(def: &RuleDef) -> CandidateSpec<'_> {
    if !def.approximate && vector_scan_forced() {
        return candidate_spec(&def.predicate);
    }
    // k = max(max_edges, 128): return at least 128 candidates so the HNSW
    // beam's expanded reach (M₀=128 layer-0 edges) is not truncated before
    // evaluation; bounded by max_edges when set by the caller.
    let k = def.max_edges.map(|me| me.max(128)).unwrap_or(128) as usize;
    candidate_spec_approx_with_floor(&def.predicate, k, !def.approximate)
}

/// True when `def`'s candidate spec probes an HNSW graph, so this rule needs one
/// built, persisted and adopted.
///
/// From 0.6.6 that is every `VectorSimilar`-rooted rule, exact or approximate —
/// unless `MUSHROOMDB_VECTOR_SCAN` has put the exact ones back on the full scan,
/// in which case they need no graph at all.
fn uses_hnsw(def: &RuleDef) -> bool {
    // `src_lookup_spec_for` is either this spec or the KeyMatch reverse lookup,
    // which has no vector leg, so the dst spec decides for both sides.
    spec_has_hnsw(&candidate_spec_for(def))
}

/// True when `def` has a vector leg at all — whatever `MUSHROOMDB_VECTOR_SCAN`
/// says right now.
///
/// The question the snapshot asks. A store whose graph was built without the
/// variable and is then written to with it set would otherwise have that graph
/// dropped from the next snapshot and rebuilt on the open after, which is a
/// superlinear cost for a variable the operator may have set for one run.
fn has_vector_leg(def: &RuleDef) -> bool {
    spec_has_hnsw(&candidate_spec_approx_with_floor(&def.predicate, 1, false))
}

/// Rule-aware src-side lookup spec. KeyMatch is still exact on the src side
/// regardless of `approximate` (the approximation is on the dst candidate set).
/// For KeyMatch-rooted predicates, src side is indexed as `ScalarOrElements`
/// (FK field value → node bucket, one bucket per element for a list-valued
/// field) so reverse lookup uses the dst key. Non-KeyMatch `All` uses the full
/// [`candidate_spec_for`] Intersect (not `parts[0]`).
fn src_lookup_spec_for(def: &RuleDef) -> CandidateSpec<'_> {
    if is_keymatch_rooted(&def.predicate) {
        let field =
            keymatch_field(&def.predicate).expect("keymatch-rooted predicate has a KeyMatch field");
        CandidateSpec::ScalarOrElements { field }
    } else {
        candidate_spec_for(def)
    }
}

/// True when `p` contains a `VectorSimilar { field: f }` where `f == field`.
fn predicate_covers_field(p: &Predicate, field: &str) -> bool {
    match p {
        Predicate::VectorSimilar { field: f, .. } => f == field,
        Predicate::All(parts) | Predicate::Any(parts) => {
            parts.iter().any(|q| predicate_covers_field(q, field))
        }
        _ => false,
    }
}

/// Extract the FK field name from a KeyMatch (or All-leading-KeyMatch) predicate.
fn keymatch_field(p: &Predicate) -> Option<&str> {
    match p {
        Predicate::KeyMatch { field } => Some(field),
        Predicate::All(parts) => parts.first().and_then(keymatch_field),
        Predicate::Any(_) => None,
        _ => None,
    }
}

/// Every node id in the graph — the exact candidate set, used when the
/// candidate index cannot answer the predicate.
///
/// A `KeyMatch` outside the FK fast path (under `Any`, or as a non-first
/// conjunct of `All`) compiles to `CandidateSpec::ByKey`, which yields no index
/// keys because those candidates are resolved by id lookup instead. Probing the
/// index for such a predicate silently drops every destination that matches
/// only through the `KeyMatch` branch, so the full set is the only correct
/// input. The caller's loop still filters by label and `evaluate()` still
/// decides each pair, so this trades speed for exactness and nothing else.
fn all_node_ids(g: &GraphMut<'_>) -> BTreeSet<u32> {
    (0..g.ids.len() as u32).collect()
}

/// Compute the set of desired (src, dst) → score edges involving node `n` on
/// the given side.  Returns an empty map if `n`'s label doesn't match the rule.
fn compute_desired(
    def: &RuleDef,
    index: &RuleIndex,
    n: u32,
    on_src_side: bool,
    g: &GraphMut<'_>,
) -> BTreeMap<(u32, u32), f64> {
    let (my_label, other_label) = if on_src_side {
        (&def.src_label, &def.dst_label)
    } else {
        (&def.dst_label, &def.src_label)
    };

    let Some(my_sym) = g.syms.get(my_label) else {
        return BTreeMap::new();
    };
    if g.labels.get(n as usize).copied() != Some(my_sym) {
        return BTreeMap::new();
    }
    // Namespace scoping: a scoped rule sees neither side outside its namespace.
    if !rule_sees(def, n, g) {
        return BTreeMap::new();
    }
    let other_sym = g.syms.get(other_label);

    let n_key = match g.ids.key_of(n) {
        Some(k) => k,
        None => return BTreeMap::new(),
    };
    let n_get = |f: &str| g.props.get(n, f).map(|vr| vr.into_value());

    let spec = candidate_spec_for(def);
    let candidates: BTreeSet<u32> = if on_src_side {
        if is_keymatch_rooted(&def.predicate) {
            // KeyMatch src→dst: look up the dst node directly by FK field value.
            // Covers `ByKey` and `All` whose first conjunct is KeyMatch
            // (`Intersect([ByKey, …])`); evaluate() filters remaining conjuncts.
            let field = keymatch_field(&def.predicate).expect("ByKey always comes from KeyMatch");
            match n_get(field) {
                Some(Value::Str(ref target_key)) => match g.ids.get(target_key) {
                    Some(dst_id) => std::iter::once(dst_id).collect(),
                    None => BTreeSet::new(),
                },
                // A list-valued FK names one dst per string element (first
                // MAX_KEYMATCH_LIST in stored order). Elements naming no live
                // node drop out here; duplicates collapse into the set.
                Some(Value::List(items)) => items
                    .iter()
                    .take(MAX_KEYMATCH_LIST)
                    .filter_map(|v| match v {
                        Value::Str(target_key) => g.ids.get(target_key),
                        _ => None,
                    })
                    .collect(),
                _ => BTreeSet::new(),
            }
        } else if predicate_contains_keymatch(&def.predicate) {
            all_node_ids(g)
        } else {
            index.dst_side.candidates(&spec, &n_get)
        }
    } else {
        // n is dst: probe src_side to find src candidates.
        let src_spec = src_lookup_spec_for(def);
        if is_keymatch_rooted(&def.predicate) {
            // Synthetic getter: returns n's key for the FK field so we find
            // src nodes whose FK value points to n.
            let key_getter = |_: &str| Some(Value::Str(n_key.to_string()));
            index.src_side.candidates(&src_spec, &key_getter)
        } else if predicate_contains_keymatch(&def.predicate) {
            all_node_ids(g)
        } else {
            index.src_side.candidates(&src_spec, &n_get)
        }
    };

    // Fast path: Cauchy-Schwarz suffix-norm early exit for exact VectorSimilar.
    //
    // Skipped for approximate rules (`def.approximate == true`): the IVF
    // pre-filter already eliminates non-candidate nodes, and ScanAll metadata
    // (vec_meta / vec_checkpoints) is not maintained for VectorClusters specs.
    //
    // Pre-fetch n's live vector ONCE outside the candidate loop so it is
    // allocated only once per compute_desired call (not per candidate pair).
    // m's vector is still fetched per pair — unavoidable without caching full
    // vectors (which is the O(n·dim) trade-off the brief rules out).
    //
    // Freshness gate: `SideIndex::fresh_ckpts_for` returns `None` when the
    // cached norm differs from the live norm, preventing stale checkpoints from
    // producing a false reject (see doc comment on `fresh_ckpts_for`).
    let n_early_exit_hint: Option<(Vec<f64>, f64, [f64; 8])> = if !def.approximate {
        if let Predicate::VectorSimilar { field, .. } = &def.predicate {
            if crate::index::vector_early_exit_enabled() {
                let n_side = if on_src_side {
                    &index.src_side
                } else {
                    &index.dst_side
                };
                if let Some(vn_v) = n_get(field) {
                    if let Some(vn) = crate::index::as_numeric_list(&vn_v) {
                        if let Some((norm_n, ckpts_n)) = n_side.fresh_ckpts_for(n, &vn) {
                            Some((vn, norm_n, *ckpts_n))
                        } else {
                            None
                        }
                    } else {
                        None
                    }
                } else {
                    None
                }
            } else {
                None
            }
        } else {
            None
        }
    } else {
        None
    };

    let mut out = BTreeMap::new();
    for m in candidates {
        if m == n {
            continue; // never self-edges
        }
        if g.labels.get(m as usize).copied() != other_sym {
            continue; // label filter
        }
        if !rule_sees(def, m, g) {
            continue; // namespace filter — the other side of the pair
        }
        let m_key = match g.ids.key_of(m) {
            Some(k) => k,
            None => continue,
        };
        let m_get = |f: &str| g.props.get(m, f).map(|vr| vr.into_value());
        let (s_view, d_view, s_id, d_id) = if on_src_side {
            (
                NodeView {
                    key: n_key,
                    props: &n_get,
                },
                NodeView {
                    key: m_key,
                    props: &m_get,
                },
                n,
                m,
            )
        } else {
            (
                NodeView {
                    key: m_key,
                    props: &m_get,
                },
                NodeView {
                    key: n_key,
                    props: &n_get,
                },
                m,
                n,
            )
        };

        // Use the pre-fetched n hint if available; fetch m per-pair.
        if let (Some((ref vn, norm_n, ckpts_n)), Predicate::VectorSimilar { field, min }) =
            (&n_early_exit_hint, &def.predicate)
        {
            let m_side = if on_src_side {
                &index.dst_side
            } else {
                &index.src_side
            };
            if let Some(vm_v) = m_get(field) {
                if let Some(vm) = crate::index::as_numeric_list(&vm_v) {
                    if let Some((norm_m, ckpts_m)) = m_side.fresh_ckpts_for(m, &vm) {
                        let (va, ckpts_a, na, vb, ckpts_b, nb) = if on_src_side {
                            (
                                vn.as_slice(),
                                ckpts_n,
                                *norm_n,
                                vm.as_slice(),
                                ckpts_m,
                                norm_m,
                            )
                        } else {
                            (
                                vm.as_slice(),
                                ckpts_m,
                                norm_m,
                                vn.as_slice(),
                                ckpts_n,
                                *norm_n,
                            )
                        };
                        match crate::def::cosine_early_exit(va, vb, ckpts_a, ckpts_b, na, nb, *min)
                        {
                            None => continue, // exact reject
                            Some(score) => {
                                out.insert((s_id, d_id), score);
                                continue; // full cosine already computed
                            }
                        }
                    }
                }
            }
        }

        if let Some(score) = evaluate(&def.predicate, &s_view, &d_view) {
            out.insert((s_id, d_id), score);
        }
    }
    #[cfg(test)]
    record_desired_len(out.len());
    out
}

/// Compute the desired `(src, dst) → score` map for a **via-hop rule** where
/// `def.via_label.is_some()`.
///
/// Semantics: src -[via_edge/via_dir]→ via(via_label), evaluate predicate
/// between via and dst; fire src→dst if any via satisfies; score = max over via.
///
/// `anchor` selects which side of the computation to anchor:
/// - `ViaAnchor::Src(src_id)`: expand from one specific src node.
/// - `ViaAnchor::Dst(dst_id)`: n is a dst node; scan all src nodes and check
///   if any via hop to them evaluates with n.
///
/// Always returns `(src, dst)` keyed pairs regardless of anchor.
///
/// `doomed` is the node currently being deleted, if any. It is excluded from
/// every role — source, via hop, and destination — because candidates are
/// enumerated by scanning `g.labels`, and a node mid-delete still carries its
/// label and props. Deriving an edge onto it would leave provenance that the
/// caller's later topology sweep does not clean up.
///
/// `index` narrows the destinations considered for each via node. It is the
/// rule's own `RuleIndex`, whose dst side holds every `dst_label` node keyed by
/// the same candidate spec the non-via path probes. A via-hop rule evaluates its
/// predicate between the **via** node and the dst, so probing that side with the
/// via node's property values is the exact analogue of what `compute_desired`
/// does with the src node's — the same index, the same spec, one node
/// substituted. Any destination the probe drops cannot satisfy the predicate,
/// for the same reason it cannot on the non-via path.
///
/// `None` falls back to evaluating every `dst_label` node, which is what this
/// function did before the index was maintained for via-hop rules. The fallback
/// is also taken for `KeyMatch`-rooted predicates, whose candidates are resolved
/// by id lookup rather than through `by_key` (see `compute_desired`).
///
/// Only `on_node_changed_via` offers an index, because only there is the index
/// known to be populated: it runs after the lazy-init guard in
/// `on_node_changed_inner`, which rebuilds every rule's index before any hook
/// fires. The rebuild and node-deletion paths pass `None` — an index they have
/// not established is populated would narrow to nothing and retract a source's
/// whole edge set.
fn compute_desired_via(
    def: &RuleDef,
    index: Option<&RuleIndex>,
    anchor: ViaAnchor,
    doomed: Option<u32>,
    g: &GraphMut<'_>,
) -> BTreeMap<(u32, u32), f64> {
    let via_label = def.via_label.as_deref().unwrap();
    let via_edge_str = def.via_edge.as_deref().unwrap();
    let via_dir = def.via_dir.unwrap_or(core_storage::Direction::Out);

    let src_sym = match g.syms.get(&def.src_label) {
        Some(s) => s,
        None => return BTreeMap::new(),
    };
    let via_sym = match g.syms.get(via_label) {
        Some(s) => s,
        None => return BTreeMap::new(),
    };
    let dst_sym = match g.syms.get(&def.dst_label) {
        Some(s) => s,
        None => return BTreeMap::new(),
    };
    let via_etype = match g.syms.get(via_edge_str) {
        Some(e) => e,
        None => return BTreeMap::new(),
    };

    // Determine which src ids to iterate over.
    let srcs: Vec<u32> = match anchor {
        ViaAnchor::Src(src_id) => {
            if Some(src_id) == doomed {
                return BTreeMap::new();
            }
            if g.labels.get(src_id as usize).copied() == Some(src_sym) && rule_sees(def, src_id, g)
            {
                vec![src_id]
            } else {
                return BTreeMap::new();
            }
        }
        ViaAnchor::Dst(_) => {
            // Scan all src-label nodes.
            (0..g.ids.len() as u32)
                .filter(|&id| {
                    Some(id) != doomed
                        && matches!(
                            g.labels.get(id as usize).copied(),
                            Some(s) if s != u32::MAX && s == src_sym
                        )
                        && rule_sees(def, id, g)
                })
                .collect()
        }
    };

    // Collect dst candidates: all dst-label nodes (or just the anchored dst).
    let anchored_dst: Option<u32> = match anchor {
        ViaAnchor::Dst(dst_id) => {
            if Some(dst_id) == doomed {
                return BTreeMap::new();
            }
            if g.labels.get(dst_id as usize).copied() == Some(dst_sym) && rule_sees(def, dst_id, g)
            {
                Some(dst_id)
            } else {
                return BTreeMap::new();
            }
        }
        _ => None,
    };

    // An `Overlap` score is a Jaccard ratio and so cannot exceed 1.0, which lets
    // the maximum over via nodes settle early. No other predicate has a bound
    // this function knows, so none of them takes that exit.
    let ceiling = matches!(def.predicate, Predicate::Overlap { .. });

    let mut out = BTreeMap::new();

    for src in srcs {
        let _src_key = match g.ids.key_of(src) {
            Some(k) => k,
            None => continue,
        };
        // Expand via hops from src.
        let via_neighbors: Vec<u32> = g
            .neighbors(via_etype, via_dir, src)
            .iter()
            .copied()
            .filter(|&v| {
                Some(v) != doomed
                    && g.labels.get(v as usize).copied() == Some(via_sym)
                    // The via node is a node: a scoped rule does not hop through
                    // one in another namespace.
                    && rule_sees(def, v, g)
            })
            .collect();

        if via_neighbors.is_empty() {
            continue;
        }
        // Read only by the ceiling exit, so it is only built when that applies.
        let via_set: BTreeSet<u32> = if ceiling {
            via_neighbors.iter().copied().collect()
        } else {
            BTreeSet::new()
        };

        // Collect dsts to evaluate: the anchored one, the candidates the index
        // offers for this src's via nodes, or — with no usable index — every
        // dst-label node.
        // A predicate holding a `KeyMatch` anywhere cannot be narrowed by the
        // index: `ByKey` contributes no index keys, so a destination matching
        // only through that branch would never be offered. Fall back to the
        // exact full candidate set below.
        let indexed = index.filter(|_| !predicate_contains_keymatch(&def.predicate));
        let dsts: Vec<u32> = if let Some(dst_id) = anchored_dst {
            vec![dst_id]
        } else if let Some(idx) = indexed {
            let spec = candidate_spec_for(def);
            let mut set = BTreeSet::new();
            for &via_id in &via_neighbors {
                let via_get = |f: &str| g.props.get(via_id, f).map(|vr| vr.into_value());
                set.extend(idx.dst_side.candidates(&spec, &via_get));
            }
            set.into_iter()
                .filter(|&id| {
                    id != src
                        && Some(id) != doomed
                        && matches!(
                            g.labels.get(id as usize).copied(),
                            Some(s) if s != u32::MAX && s == dst_sym
                        )
                        && rule_sees(def, id, g)
                })
                .collect()
        } else {
            (0..g.ids.len() as u32)
                .filter(|&id| {
                    id != src
                        && Some(id) != doomed
                        && matches!(
                            g.labels.get(id as usize).copied(),
                            Some(s) if s != u32::MAX && s == dst_sym
                        )
                        && rule_sees(def, id, g)
                })
                .collect()
        };

        for dst in dsts {
            if dst == src {
                continue; // no self-edges
            }
            let dst_key = match g.ids.key_of(dst) {
                Some(k) => k,
                None => continue,
            };
            let dst_get = |f: &str| g.props.get(dst, f).map(|vr| vr.into_value());
            let dst_view = NodeView {
                key: dst_key,
                props: &dst_get,
            };

            // Score = max over via nodes that satisfy predicate(via, dst).
            //
            // Once some via has scored 1.0 the max is settled and the remaining
            // vias cannot change it — the scan ends there. This is an early exit
            // from a maximum, not a different maximum: the value written to
            // `out` is what the full scan would have produced.
            //
            // The destination is tried first when it is itself one of the vias,
            // because a token set is identical to itself and therefore scores
            // exactly 1.0. Rules whose via and dst carry the same label — one
            // person's files against all files, say — settle on the first
            // comparison instead of after every via.
            let mut best: Option<f64> = None;
            let first = (ceiling && via_set.contains(&dst)).then_some(dst);
            for via_id in first.into_iter().chain(via_neighbors.iter().copied()) {
                let via_key = match g.ids.key_of(via_id) {
                    Some(k) => k,
                    None => continue,
                };
                let via_get = |f: &str| g.props.get(via_id, f).map(|vr| vr.into_value());
                let via_view = NodeView {
                    key: via_key,
                    props: &via_get,
                };
                if let Some(score) = evaluate(&def.predicate, &via_view, &dst_view) {
                    best = Some(match best {
                        None => score,
                        Some(prev) => prev.max(score),
                    });
                    if ceiling && best == Some(1.0) {
                        break;
                    }
                }
            }

            if let Some(score) = best {
                out.insert((src, dst), score);
            }
        }
    }

    out
}

/// Anchor point for `compute_desired_via`.
enum ViaAnchor {
    /// Expand from one src node (src prop change or src insert).
    Src(u32),
    /// Re-evaluate all srcs that can reach some via satisfying predicate with
    /// this dst (dst prop change).
    Dst(u32),
}

fn edge_budget(def: &RuleDef) -> u64 {
    // Only applies when max_edges is None (global-budget path).
    // Some(k) rules use per-source top-k semantics, not this budget.
    def.max_edges.unwrap_or(DEFAULT_MAX_EDGES)
}

/// Filter a per-source candidate map to the top-k destinations.
///
/// `per_src` must contain only pairs with the same source node (all
/// `(src, dst)` keys share the same `src`).  Returns the top-`k` subset
/// ordered by **(score DESC, dst_key ASC)** — higher scores win; ties are
/// broken by the destination node's string key in ascending lexicographic
/// order, giving a deterministic result independent of internal node IDs.
///
/// When `k` equals or exceeds the number of candidates, the input is
/// returned unchanged (no allocation).
///
/// # Memory cost (per-source candidate ordering)
///
/// This function sorts and truncates a `Vec<((u32,u32), f64)>` of length
/// equal to the number of matching candidates for one source.  That is
/// O(M) per call, where M is the candidate count for this source.  Across
/// a backfill sweep the peak additional memory is O(M_max) — the largest
/// per-source candidate set — not the global total, because the Vec is
/// dropped after each source.  No persistent per-source ordering is
/// maintained beyond the materialized top-k provenance; backfill and
/// rebuild recompute the ordering on demand from the live candidate index.
pub(crate) fn filter_src_top_k(
    per_src: BTreeMap<(u32, u32), f64>,
    k: u64,
    ids: &core_storage::IdMap,
) -> BTreeMap<(u32, u32), f64> {
    if per_src.len() as u64 <= k {
        return per_src;
    }
    let mut candidates: Vec<((u32, u32), f64)> = per_src.into_iter().collect();
    // Sort: score DESC (higher = better), then dst_key ASC as tiebreak.
    candidates.sort_by(|&((_, da), sa), &((_, db), sb)| {
        sb.total_cmp(&sa).then_with(|| {
            let ka = ids.key_of(da).unwrap_or("");
            let kb = ids.key_of(db).unwrap_or("");
            ka.cmp(kb)
        })
    });
    candidates.truncate(k as usize);
    candidates.into_iter().collect()
}

/// Apply top-k derived-edge semantics for a single source node.
///
/// Retracts `(src, *)` provenance edges not in `desired_from_src`, then
/// adds / refreshes weights for those that are.  Does **not** use the
/// global tripped latch or budget check — top-k rules (`max_edges: Some(k)`)
/// are self-capping by construction.
fn apply_per_src_top_k(
    def: &RuleDef,
    src: u32,
    desired_from_src: BTreeMap<(u32, u32), f64>,
    prov: &mut ProvSets<'_>,
    g: &mut GraphMut<'_>,
) {
    let et = g.syms.intern(&def.edge_type);

    // Collect current (src, *) provenance triples for this rule.
    // We filter to s == src so that (*, src) triples — where src is a dst
    // for some other source — are not mistakenly retracted.
    let current: Vec<Triple> = {
        let rid = prov.rule_intern.get(&def.name).copied();
        prov.by_node
            .get(&src)
            .into_iter()
            .flatten()
            .filter(|(r, t, s, _d)| Some(*r) == rid && *t == et && *s == src)
            .map(|(_, t, s, d)| (*t, *s, *d))
            .collect()
    };

    // Retract (src, dst) pairs no longer in the top-k.
    for (t, s, d) in current {
        if !desired_from_src.contains_key(&(s, d)) {
            g.topo.remove_edge(t, s, d);
            g.edge_props.remove_edge(t, s, d);
            prov.remove(&def.name, (t, s, d), g.ids, g.syms);
            let by = prov.rule_intern.get(&def.name).copied().unwrap_or(u32::MAX);
            prov.retracted.push((by, (t, s, d)));
        }
    }

    // Insert new top-k pairs; refresh weights on already-owned pairs.
    for ((s, d), score) in &desired_from_src {
        let triple = (et, *s, *d);
        let already = prov.contains(&triple);
        if !already {
            let newly = g.add_edge(et, *s, *d);
            if newly {
                prov.insert(&def.name, triple, g.ids, g.syms);
            }
        }
        let is_owned = already || prov.contains(&triple);
        if is_owned {
            if let Some(p) = &def.weight_prop {
                g.edge_props.set(et, *s, *d, p, Value::Float(*score));
            }
        }
    }
}

/// Never recycles ids. See `RuleEngine::rule_intern` for why.
fn intern_rule(intern: &mut BTreeMap<String, u32>, names: &mut Vec<String>, rule: &str) -> u32 {
    if let Some(&id) = intern.get(rule) {
        return id;
    }
    let id = names.len() as u32;
    intern.insert(rule.to_string(), id);
    names.push(rule.to_string());
    id
}

type ByNodeRebuild = (
    BTreeMap<u32, BTreeSet<Touch>>,
    BTreeMap<String, u32>,
    Vec<String>,
);

fn rebuild_by_node(provenance: &BTreeMap<String, BTreeSet<Triple>>) -> ByNodeRebuild {
    let mut by_node = BTreeMap::new();
    let mut intern = BTreeMap::new();
    let mut names = Vec::new();
    for (rule, set) in provenance {
        let rid = intern_rule(&mut intern, &mut names, rule);
        for &triple in set {
            touch_insert(&mut by_node, rid, triple);
        }
    }
    (by_node, intern, names)
}

fn touch_insert(by_node: &mut BTreeMap<u32, BTreeSet<Touch>>, rid: u32, triple: Triple) {
    let (t, s, d) = triple;
    let entry = (rid, t, s, d);
    by_node.entry(s).or_default().insert(entry);
    if s != d {
        by_node.entry(d).or_default().insert(entry);
    }
}

fn touch_remove(by_node: &mut BTreeMap<u32, BTreeSet<Touch>>, rid: u32, triple: Triple) {
    let (t, s, d) = triple;
    let entry = (rid, t, s, d);
    if let Some(set) = by_node.get_mut(&s) {
        set.remove(&entry);
        if set.is_empty() {
            by_node.remove(&s);
        }
    }
    if s != d {
        if let Some(set) = by_node.get_mut(&d) {
            set.remove(&entry);
            if set.is_empty() {
                by_node.remove(&d);
            }
        }
    }
}

#[cfg(test)]
fn resolve_by_node(
    by_node: &BTreeMap<u32, BTreeSet<Touch>>,
    names: &[String],
) -> BTreeMap<u32, BTreeSet<(String, Triple)>> {
    by_node
        .iter()
        .map(|(&n, set)| {
            let resolved = set
                .iter()
                .map(|&(rid, t, s, d)| (names[rid as usize].clone(), (t, s, d)))
                .collect();
            (n, resolved)
        })
        .collect()
}

/// Mutable provenance + derived reverse index. Every insert/remove goes
/// through [`ProvSets::insert`] / [`ProvSets::remove`].
struct ProvSets<'a> {
    set: &'a mut BTreeSet<Triple>,
    owned: &'a mut BTreeSet<Triple>,
    by_node: &'a mut BTreeMap<u32, BTreeSet<Touch>>,
    rule_intern: &'a mut BTreeMap<String, u32>,
    intern_rule: &'a mut Vec<String>,
    /// Staging buffer for post-commit events. Keys are resolved at capture
    /// time (before any tombstone step) so the strings remain valid after
    /// node deletion.
    deltas: &'a mut Vec<EngineEdgeDelta>,
    /// Mirror of [`RuleEngine::emit_deltas`]: when `false`, pushes to
    /// `deltas` are skipped entirely (no heap allocation, no String clone).
    emit: bool,
    /// Edges this rule has just taken out of the topology because it no longer
    /// desires them, each with the interned id of the rule that did it.
    /// Another rule over the same labels and edge type may still desire one:
    /// see [`RuleEngine::reclaim_retracted`].
    retracted: &'a mut Vec<(u32, Triple)>,
}

impl ProvSets<'_> {
    /// `ids` and `syms` are passed by the caller (not stored in ProvSets) to
    /// avoid a conflicting borrow when callers also need `&mut g.syms` for
    /// `intern` calls in the same function body.
    fn insert(&mut self, rule: &str, triple: Triple, ids: &IdMap, syms: &Interner) -> bool {
        if !self.set.insert(triple) {
            return false;
        }
        self.owned.insert(triple);
        let rid = intern_rule(self.rule_intern, self.intern_rule, rule);
        touch_insert(self.by_node, rid, triple);
        let (etype, src, dst) = triple;
        if self.emit {
            if let (Some(sk), Some(dk), Some(et)) =
                (ids.key_of(src), ids.key_of(dst), syms.resolve(etype))
            {
                self.deltas.push(EngineEdgeDelta {
                    rule: rule.to_string(),
                    src_key: sk.to_string(),
                    dst_key: dk.to_string(),
                    edge_type: et.to_string(),
                    etype_sym: etype,
                    src_id: src,
                    dst_id: dst,
                    fired: true,
                });
            }
        }
        true
    }

    fn remove(&mut self, rule: &str, triple: Triple, ids: &IdMap, syms: &Interner) -> bool {
        if !self.set.remove(&triple) {
            return false;
        }
        self.owned.remove(&triple);
        let rid = intern_rule(self.rule_intern, self.intern_rule, rule);
        touch_remove(self.by_node, rid, triple);
        let (etype, src, dst) = triple;
        if self.emit {
            if let (Some(sk), Some(dk), Some(et)) =
                (ids.key_of(src), ids.key_of(dst), syms.resolve(etype))
            {
                self.deltas.push(EngineEdgeDelta {
                    rule: rule.to_string(),
                    src_key: sk.to_string(),
                    dst_key: dk.to_string(),
                    edge_type: et.to_string(),
                    etype_sym: etype,
                    src_id: src,
                    dst_id: dst,
                    fired: false,
                });
            }
        }
        true
    }

    fn contains(&self, triple: &Triple) -> bool {
        self.set.contains(triple)
    }

    fn len(&self) -> usize {
        self.set.len()
    }
}

/// Diff-apply `desired` against provenance. `retract_touching = Some(n)` only
/// retracts triples that involve `n` (incremental fire). `None` retracts any
/// current provenance triple not in `desired` (backfill / rebuild).
///
/// `tripped` is a one-way latch: once set, no new provenance edges are added
/// (gate on the flag itself, not `prov.len()`), even if retracts have brought
/// the set below budget. Retracts and weight refreshes on already-owned edges
/// still run. Crossing the budget on a not-yet-tripped rule sets the latch
/// and skips that add and every later add in this call. Never an error.
/// First-N (pre-trip) is BTree `(src, dst)` order of `desired` after retract.
fn apply_desired(
    def: &RuleDef,
    desired: BTreeMap<(u32, u32), f64>,
    retract_touching: Option<u32>,
    prov: &mut ProvSets<'_>,
    tripped: &mut bool,
    g: &mut GraphMut<'_>,
) {
    apply_desired_scoped(def, desired, retract_touching, false, prov, tripped, g);
}

/// [`apply_desired`] for a desired set that holds `src`'s outgoing edges only:
/// it retracts only edges *from* `src`.
///
/// A via-hop rule's desired set for a source is computed from the source
/// outwards. For a rule that links a label to itself the edges of the rule
/// touching `src` include the ones *into* it, and diffing those against an
/// outgoing set retracted them — an edge another source had just derived into
/// `src` went again (ledger rows 84 and 105). Putting the incoming edges into
/// the desired set instead meant scanning every source for each one, which
/// made a write to a via node quadratic in its sources.
fn apply_desired_from(
    def: &RuleDef,
    desired: BTreeMap<(u32, u32), f64>,
    src: u32,
    prov: &mut ProvSets<'_>,
    tripped: &mut bool,
    g: &mut GraphMut<'_>,
) {
    apply_desired_scoped(def, desired, Some(src), true, prov, tripped, g);
}

fn apply_desired_scoped(
    def: &RuleDef,
    desired: BTreeMap<(u32, u32), f64>,
    retract_touching: Option<u32>,
    outgoing_only: bool,
    prov: &mut ProvSets<'_>,
    tripped: &mut bool,
    g: &mut GraphMut<'_>,
) {
    let budget = edge_budget(def);
    let et = g.syms.intern(&def.edge_type);

    let current: Vec<Triple> = match retract_touching {
        None => prov
            .set
            .iter()
            .filter(|(t, _, _)| *t == et)
            .copied()
            .collect(),
        Some(n) => {
            let rid = prov.rule_intern.get(&def.name).copied();
            prov.by_node
                .get(&n)
                .into_iter()
                .flatten()
                .filter(|(r, t, s, _)| Some(*r) == rid && *t == et && (!outgoing_only || *s == n))
                .map(|(_, t, s, d)| (*t, *s, *d))
                .collect()
        }
    };

    for (t, s, d) in current {
        if !desired.contains_key(&(s, d)) {
            g.topo.remove_edge(t, s, d);
            g.edge_props.remove_edge(t, s, d);
            prov.remove(&def.name, (t, s, d), g.ids, g.syms);
            let by = prov.rule_intern.get(&def.name).copied().unwrap_or(u32::MAX);
            prov.retracted.push((by, (t, s, d)));
        }
    }

    for ((s, d), score) in desired {
        let triple = (et, s, d);
        let already = prov.contains(&triple);
        if !already {
            if *tripped || prov.len() as u64 >= budget {
                *tripped = true;
                continue;
            }
            let newly = g.add_edge(et, s, d);
            if newly {
                prov.insert(&def.name, triple, g.ids, g.syms);
            }
        }
        // Only set weight_prop on edges this rule owns (newly added now, or
        // already in provenance). Pre-existing user edges are never owned, so
        // writing a weight to them would leave a ghost property after deletion.
        let is_owned_here = already || prov.contains(&triple);
        if is_owned_here {
            if let Some(p) = &def.weight_prop {
                g.edge_props.set(et, s, d, p, Value::Float(score));
            }
        }
    }
}

/// Union of `compute_desired(..., as_src)` over every live src-label node.
/// BTree iteration of the result is the engine's deterministic first-N order
/// for backfill and rebuild.
///
/// Kept for test reference comparators only.  Production paths use the
/// streaming variants (`apply_streaming_create`, `apply_streaming_rebuild`)
/// which never materialise the global map.
#[cfg(test)]
#[allow(dead_code)]
fn compute_full_desired(
    def: &RuleDef,
    index: &RuleIndex,
    g: &GraphMut<'_>,
) -> BTreeMap<(u32, u32), f64> {
    let mut desired = BTreeMap::new();
    let src_sym = g.syms.get(&def.src_label);
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym == Some(label_sym) {
            desired.extend(compute_desired(def, index, id, true, g));
            #[cfg(test)]
            record_desired_len(desired.len());
        }
    }
    desired
}

/// Returns `true` if the `(s, d)` pair is still desired under `def` given the
/// current graph state.  Calls `evaluate` directly — bypasses the candidate
/// index.  Valid in `rebuild` after a full reindex because every pair that
/// evaluates to `Some` is reachable via the freshly-built index; the direct
/// call is therefore semantically equivalent to membership in
/// `compute_desired(def, index, s, true, g)`.  O(eval) per call.
fn pair_still_desired(def: &RuleDef, s: u32, d: u32, g: &GraphMut<'_>) -> bool {
    let src_sym = match g.syms.get(&def.src_label) {
        Some(sym) => sym,
        None => return false,
    };
    let dst_sym = match g.syms.get(&def.dst_label) {
        Some(sym) => sym,
        None => return false,
    };
    if g.labels.get(s as usize).copied() != Some(src_sym) {
        return false;
    }
    if g.labels.get(d as usize).copied() != Some(dst_sym) {
        return false;
    }
    // A scoped rule desires no pair with an endpoint outside its namespace, so
    // the retract pass withdraws an edge whose endpoint moved out of reach.
    if !rule_sees(def, s, g) || !rule_sees(def, d, g) {
        return false;
    }
    let s_key = match g.ids.key_of(s) {
        Some(k) => k,
        None => return false,
    };
    let d_key = match g.ids.key_of(d) {
        Some(k) => k,
        None => return false,
    };
    let s_get = |f: &str| g.props.get(s, f).map(|vr| vr.into_value());
    let d_get = |f: &str| g.props.get(d, f).map(|vr| vr.into_value());
    evaluate(
        &def.predicate,
        &NodeView {
            key: s_key,
            props: &s_get,
        },
        &NodeView {
            key: d_key,
            props: &d_get,
        },
    )
    .is_some()
}

/// Whether `def`'s predicate held for `(s, d)` with `d` as it was before
/// `changed` — the field that changed, and its previous value — or as it is,
/// when nothing changed.
///
/// One evaluation, no index probe. A top-k rule's best match for `s` could
/// only have been `d` if this held, so a source it does not hold for has
/// nothing to lose when `d` changes (ledger row 83's guard).
fn pair_matched_before(
    def: &RuleDef,
    s: u32,
    d: u32,
    changed: Option<(&str, &Option<Value>)>,
    g: &GraphMut<'_>,
) -> bool {
    let (Some(s_key), Some(d_key)) = (g.ids.key_of(s), g.ids.key_of(d)) else {
        return false;
    };
    let s_get = |f: &str| g.props.get(s, f).map(|vr| vr.into_value());
    let d_get = |f: &str| match changed {
        Some((field, old)) if f == field => old.clone(),
        _ => g.props.get(d, f).map(|vr| vr.into_value()),
    };
    evaluate(
        &def.predicate,
        &NodeView {
            key: s_key,
            props: &s_get,
        },
        &NodeView {
            key: d_key,
            props: &d_get,
        },
    )
    .is_some()
}

/// Count desired `(src, dst)` pairs up to `limit + 1`; returns as soon as the
/// threshold is crossed.  Peak additional memory: O(max-candidates-per-src).
/// Used in `rebuild` to detect the over-budget case without materialising the
/// full desired map.
fn count_desired_up_to(def: &RuleDef, index: &RuleIndex, limit: u64, g: &GraphMut<'_>) -> u64 {
    let mut count = 0u64;
    let src_sym = g.syms.get(&def.src_label);
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym != Some(label_sym) {
            continue;
        }
        count += compute_desired(def, index, id, true, g).len() as u64;
        if count > limit {
            return count;
        }
    }
    count
}

/// Streaming backfill for `create_rule`.
///
/// Iterates src nodes in ascending id order.  For each src, computes and
/// immediately applies the per-src desired edges (already dst-sorted within
/// that src).  This traversal visits `(src, dst)` pairs in exactly the same
/// order as iterating the result of `compute_full_desired` would — because the
/// global BTree order on `(u32, u32)` keys is src-major ascending with
/// dst-sorted-within, matching the per-src ascending-dst order emitted by
/// `compute_desired`.
///
/// Consequently the first-N edges selected by the running cap are byte-identical
/// to what the old full-map approach would have selected for EXACT rules
/// (`def.approximate == false`).  For approximate rules the IVF candidate order
/// is deterministic (replay-identical within the same fitted clusters) but is not
/// equivalent to the old full-map path, which was never exercised for approximate
/// rules.
///
/// Cap semantics: on `create_rule` there is no pre-existing provenance for
/// this rule, so when the cap trips we can `break` immediately — no
/// weight-refresh-on-existing path can be skipped, because every remaining
/// `already == false` entry would have been `continue`-d by the old loop too.
fn apply_streaming_create(
    def: &RuleDef,
    index: &RuleIndex,
    prov: &mut ProvSets<'_>,
    tripped: &mut bool,
    g: &mut GraphMut<'_>,
) {
    let budget = edge_budget(def);
    let et = g.syms.intern(&def.edge_type);
    let src_sym = g.syms.get(&def.src_label);

    'outer: for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym != Some(label_sym) {
            continue;
        }
        let per_src = compute_desired(def, index, id, true, g);
        for ((s, d), score) in per_src {
            let triple = (et, s, d);
            // On create_rule, this rule has no pre-existing provenance, so
            // `already` is always false.  The path is kept for correctness
            // if the same edge is co-owned by another rule (topo.add_edge
            // returns false; we do not record it in our provenance).
            let already = prov.contains(&triple);
            if !already {
                if *tripped || prov.len() as u64 >= budget {
                    *tripped = true;
                    break 'outer;
                }
                let newly = g.add_edge(et, s, d);
                if newly {
                    prov.insert(&def.name, triple, g.ids, g.syms);
                }
            }
            let is_owned_here = already || prov.contains(&triple);
            if is_owned_here {
                if let Some(p) = &def.weight_prop {
                    g.edge_props.set(et, s, d, p, Value::Float(score));
                }
            }
        }
    }
}

/// Streaming backfill for `create_rule` with top-k per-source semantics.
///
/// Iterates src-label nodes in ascending id order. For each src, computes
/// the full candidate set, filters to the top-k destinations (score DESC,
/// dst_key ASC), and applies via `apply_per_src_top_k`.  No global budget or
/// tripped latch is used — the per-source cap is enforced by `filter_src_top_k`.
fn apply_streaming_create_top_k(
    def: &RuleDef,
    k: u64,
    index: &RuleIndex,
    prov: &mut ProvSets<'_>,
    g: &mut GraphMut<'_>,
) {
    let src_sym = g.syms.get(&def.src_label);
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym != Some(label_sym) {
            continue;
        }
        let per_src = compute_desired(def, index, id, true, g);
        let top_k = filter_src_top_k(per_src, k, g.ids);
        apply_per_src_top_k(def, id, top_k, prov, g);
    }
}

/// Streaming rebuild for top-k per-source rules.
///
/// Iterates all src-label nodes. For each src, computes fresh desired set,
/// filters to top-k, and applies via `apply_per_src_top_k` — which retracts
/// stale edges and inserts newly-ranked ones.  No budget counting, no tripped
/// latch.
fn apply_streaming_rebuild_top_k(
    def: &RuleDef,
    k: u64,
    index: &RuleIndex,
    doomed: Option<u32>,
    prov: &mut ProvSets<'_>,
    g: &mut GraphMut<'_>,
) {
    let et = g.syms.intern(&def.edge_type);

    // Collect all src nodes: those currently in provenance (may have lost their
    // label since last fire) + all live src-label nodes.
    let existing_srcs: BTreeSet<u32> = prov
        .set
        .iter()
        .filter(|(t, _, _)| *t == et)
        .map(|(_, s, _)| *s)
        .collect();

    let src_sym = g.syms.get(&def.src_label);
    let mut all_srcs: BTreeSet<u32> = existing_srcs;
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym == Some(label_sym) {
            all_srcs.insert(id);
        }
    }

    for src in all_srcs {
        // A via-hop rule evaluates its predicate between the *via* node and the
        // dst, so `compute_desired` cannot express it; see `apply_via_rebuild`.
        // No candidate index is offered either: a rebuild has to stand on its
        // own, and narrowing against an index this path has not established is
        // populated would retract the source's whole set if it were empty.
        let desired_src = if def.via_edge.is_some() {
            compute_desired_via(def, None, ViaAnchor::Src(src), doomed, g)
        } else {
            compute_desired(def, index, src, true, g)
        };
        let top_k = filter_src_top_k(desired_src, k, g.ids);
        apply_per_src_top_k(def, src, top_k, prov, g);
    }
}

/// Full recompute of a via-hop rule's edge set, one source at a time.
///
/// Via-hop rules are never rebuilt through the candidate index. `compute_desired`
/// evaluates the rule's predicate between the source and the destination, but a
/// via-hop rule evaluates it between the *via* node and the destination — so the
/// index path returns an empty desired set and silently retracts every edge the
/// rule legitimately owns. This is the via counterpart of
/// [`apply_streaming_rebuild`] and keeps its all-or-nothing budget contract:
/// over budget leaves provenance untouched and the tripped latch set.
///
/// Retraction is scoped per source rather than through `by_node`, so the result
/// does not depend on the order sources are visited even when a rule's
/// `src_label` and `dst_label` are the same.
fn apply_via_rebuild(
    def: &RuleDef,
    doomed: Option<u32>,
    prov: &mut ProvSets<'_>,
    tripped: &mut bool,
    g: &mut GraphMut<'_>,
) {
    let budget = edge_budget(def);
    let et = g.syms.intern(&def.edge_type);

    // Sources: every node this rule currently derives an edge from (its label
    // may have changed since), plus every live src-label node. BTree order.
    let mut sources: BTreeSet<u32> = prov
        .set
        .iter()
        .filter(|(t, _, _)| *t == et)
        .map(|(_, s, _)| *s)
        .collect();
    let src_sym = g.syms.get(&def.src_label);
    for id in 0..g.ids.len() as u32 {
        if let Some(s) = g.labels.get(id as usize).copied() {
            if s != u32::MAX && Some(s) == src_sym {
                sources.insert(id);
            }
        }
    }
    let sources: Vec<u32> = sources.into_iter().collect();

    // Pass 1: does the whole desired set fit? Rebuild is the only exit from the
    // tripped latch, and it is all-or-nothing.
    let mut total: u64 = 0;
    for &src in &sources {
        total += compute_desired_via(def, None, ViaAnchor::Src(src), doomed, g).len() as u64;
        if total > budget {
            *tripped = true;
            return; // provenance untouched; latch stays set
        }
    }
    *tripped = false;

    // Pass 2: per source, retract what it no longer derives, then add what it
    // does. Pass 1 proved the total fits, so no trip guard is needed here.
    for src in sources {
        let desired = compute_desired_via(def, None, ViaAnchor::Src(src), doomed, g);
        let current: Vec<Triple> = prov
            .set
            .iter()
            .filter(|&&(t, s, _)| t == et && s == src)
            .copied()
            .collect();
        for triple in current {
            let (t, s, d) = triple;
            if !desired.contains_key(&(s, d)) {
                g.topo.remove_edge(t, s, d);
                g.edge_props.remove_edge(t, s, d);
                prov.remove(&def.name, triple, g.ids, g.syms);
            }
        }
        for ((s, d), score) in desired {
            let triple = (et, s, d);
            let already = prov.contains(&triple);
            if !already && g.add_edge(et, s, d) {
                prov.insert(&def.name, triple, g.ids, g.syms);
            }
            // Only weight edges this rule owns; a pre-existing user edge is not
            // ours to annotate.
            if already || prov.contains(&triple) {
                if let Some(p) = &def.weight_prop {
                    g.edge_props.set(et, s, d, p, Value::Float(score));
                }
            }
        }
    }
}

/// Streaming rebuild for `rebuild`.
///
/// Replaces `compute_full_desired` + size-check + `apply_desired(None)`.
///
/// Over-budget path: counts desired pairs up to `budget + 1` (early exit);
/// if the total exceeds the budget, sets the tripped latch and returns without
/// touching provenance (identical to the current no-op rebuild behaviour).
///
/// Fits-budget path: un-trips, retracts each existing provenance triple whose
/// pair is no longer desired via direct `evaluate` — O(existing × eval) —
/// then streams-adds all desired edges in the same src-ascending / dst-within
/// order as `apply_streaming_create`.
fn apply_streaming_rebuild(
    def: &RuleDef,
    index: &RuleIndex,
    prov: &mut ProvSets<'_>,
    tripped: &mut bool,
    g: &mut GraphMut<'_>,
) {
    let budget = edge_budget(def);
    let et = g.syms.intern(&def.edge_type);

    // 1. Count: early-exit as soon as the budget is exceeded.
    let total = count_desired_up_to(def, index, budget, g);
    if total > budget {
        *tripped = true;
        return; // provenance untouched; latch stays set.
    }

    // 2. Un-trip — full desired fits.
    *tripped = false;

    // 3. Retract existing edges that are no longer desired.
    //    O(existing × eval): evaluate each pair directly, no full-map build.
    let current: Vec<Triple> = prov
        .set
        .iter()
        .filter(|(t, _, _)| *t == et)
        .copied()
        .collect();
    for (t, s, d) in current {
        if !pair_still_desired(def, s, d, g) {
            g.topo.remove_edge(t, s, d);
            g.edge_props.remove_edge(t, s, d);
            prov.remove(&def.name, (t, s, d), g.ids, g.syms);
        }
    }

    // 4. Stream-add desired edges; refresh weights on already-owned edges.
    //    count_desired_up_to verified total <= budget so no trip guard is needed.
    let src_sym = g.syms.get(&def.src_label);
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym != Some(label_sym) {
            continue;
        }
        let per_src = compute_desired(def, index, id, true, g);
        for ((s, d), score) in per_src {
            let triple = (et, s, d);
            let already = prov.contains(&triple);
            if !already {
                let newly = g.add_edge(et, s, d);
                if newly {
                    prov.insert(&def.name, triple, g.ids, g.syms);
                }
            }
            let is_owned_here = already || prov.contains(&triple);
            if is_owned_here {
                if let Some(p) = &def.weight_prop {
                    g.edge_props.set(et, s, d, p, Value::Float(score));
                }
            }
        }
    }
}

/// Increment `fires` once per live node whose label matches either side.
/// Backfill / rebuild counting: one tick per participating node evaluated.
fn bump_fires_for_participants(def: &RuleDef, g: &GraphMut<'_>, fires: &mut u64) {
    let src_sym = g.syms.get(&def.src_label);
    let dst_sym = g.syms.get(&def.dst_label);
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if (src_sym == Some(label_sym) || dst_sym == Some(label_sym)) && rule_sees(def, id, g) {
            *fires += 1;
        }
    }
}

/// Insert node `id` into the rule's src/dst indexes where its label matches.
fn index_node_for_rule(
    id: u32,
    label_sym: u32,
    def: &RuleDef,
    index: &mut RuleIndex,
    syms: &Interner,
    props: ColumnsView<'_>,
) {
    const NONE: (BTreeSet<u32>, BTreeSet<u32>) = (BTreeSet::new(), BTreeSet::new());
    index_node_for_rule_skipping(id, label_sym, def, index, syms, props, &NONE);
}

/// `index_node_for_rule`, but the sliced build's version: every leg except the
/// HNSW graph is filed now, and the vectors arrive later through
/// [`RuleEngine::run_build_slice`].
fn index_node_for_rule_deferring_hnsw(
    id: u32,
    label_sym: u32,
    def: &RuleDef,
    index: &mut RuleIndex,
    syms: &Interner,
    props: ColumnsView<'_>,
) {
    if !rule_sees_node(def, id, &props) {
        return;
    }
    let get = |f: &str| props.get(id, f).map(|vr| vr.into_value());
    if syms.get(&def.src_label) == Some(label_sym) {
        let spec = src_lookup_spec_for(def);
        index.src_side.insert_deferring_hnsw(&spec, id, &get);
    }
    if syms.get(&def.dst_label) == Some(label_sym) {
        let spec = candidate_spec_for(def);
        index.dst_side.insert_deferring_hnsw(&spec, id, &get);
    }
}

/// How many nodes `def` would put at least one vector into an HNSW graph for.
///
/// Counted in **nodes**, not vectors: a rule whose src and dst labels are the
/// same indexes each node on both sides but counts it once, so `total` and the
/// progress a slice reports are on the same scale.
///
/// Zero for a rule with no HNSW leg — one with no vector predicate, one whose
/// vector predicate sits under an `Any`, or any rule at all while
/// `MUSHROOMDB_VECTOR_SCAN` is set — which is what keeps those on the unchanged
/// one-commit path.
fn hnsw_build_total(def: &RuleDef, g: &GraphMut<'_>) -> u64 {
    if !uses_hnsw(def) {
        return 0;
    }
    let src_spec = src_lookup_spec_for(def);
    let dst_spec = candidate_spec_for(def);
    let src_sym = g.syms.get(&def.src_label);
    let dst_sym = g.syms.get(&def.dst_label);
    let mut total = 0u64;
    for id in 0..g.ids.len() as u32 {
        let label_sym = match g.labels.get(id as usize).copied() {
            Some(s) if s != u32::MAX => s,
            _ => continue,
        };
        if src_sym != Some(label_sym) && dst_sym != Some(label_sym) {
            continue;
        }
        // A scoped rule files no vector for a node outside its namespace, so it
        // must not count one either or the build never reports complete.
        if !rule_sees(def, id, g) {
            continue;
        }
        let get = |f: &str| g.props.get(id, f).map(|vr| vr.into_value());
        let hit = (src_sym == Some(label_sym) && hnsw_vector_present(&src_spec, &get))
            || (dst_sym == Some(label_sym) && hnsw_vector_present(&dst_spec, &get));
        if hit {
            total += 1;
        }
    }
    total
}

/// `index_node_for_rule`, but the open-time scan's version: `skip` holds the
/// `(src, dst)` node ids the adopted HNSW graphs already contain, so the scan
/// only inserts vectors the persisted graphs did not carry.
fn index_node_for_rule_skipping(
    id: u32,
    label_sym: u32,
    def: &RuleDef,
    index: &mut RuleIndex,
    syms: &Interner,
    props: ColumnsView<'_>,
    skip: &(BTreeSet<u32>, BTreeSet<u32>),
) {
    // Namespace scoping: a scoped rule's candidate index holds only its own
    // namespace, so a probe can never offer a candidate across the boundary.
    if !rule_sees_node(def, id, &props) {
        return;
    }
    let get = |f: &str| props.get(id, f).map(|vr| vr.into_value());
    if syms.get(&def.src_label) == Some(label_sym) {
        let spec = src_lookup_spec_for(def);
        index.src_side.insert_skipping(&spec, id, &skip.0, &get);
    }
    if syms.get(&def.dst_label) == Some(label_sym) {
        let spec = candidate_spec_for(def);
        index.dst_side.insert_skipping(&spec, id, &skip.1, &get);
    }
}

// ---------------------------------------------------------------------------
// RuleEngine
// ---------------------------------------------------------------------------

impl RuleEngine {
    pub fn new() -> Self {
        Self::default()
    }

    /// True when at least one rule hops over an edge type, so a derived edge
    /// could feed another rule. Rule counts are small; this is a cheap scan.
    fn chaining_possible(&self) -> bool {
        self.rules.values().any(|r| r.via_edge.is_some())
    }

    /// Open a chaining scope at the entry of a top-level hook.
    ///
    /// Chaining reads the deltas the hook appends to `pending_deltas`, and
    /// those are only recorded while `emit_deltas` is on. Live commits already
    /// force it on for every apply (db.rs needs the deltas for history
    /// markers), but WAL replay does not — and replay has to chain identically
    /// or reopening a store would lose every chained edge. So the scope turns
    /// emission on for the duration and restores it afterwards; the extra
    /// deltas are drained and discarded by the replay loop either way.
    ///
    /// `active` is decided on entry. A hook that *creates* the first via-hop
    /// rule therefore does not chain, which is correct: the only rules that
    /// could consume that rule's fresh edges are themselves via-hop rules, and
    /// any such rule would already have made `chaining_possible` true.
    ///
    /// There is no nesting to worry about: every hook that could be reached
    /// from inside another one is called through its `*_inner` form
    /// (`delete_rule` → `rebuild_inner`, `chain_from` → `on_edge_changed_inner`),
    /// so a scope is only ever opened at the outermost frame.
    fn begin_chain(&mut self) -> ChainScope {
        let active = self.chain_depth == 0 && self.chaining_possible();
        let prev_emit = self.emit_deltas;
        if active {
            self.emit_deltas = true;
        }
        ChainScope {
            cursor: self.pending_deltas.len(),
            prev_emit,
            active,
        }
    }

    /// Close a chaining scope: run the chain, then restore what was saved.
    fn end_chain(&mut self, scope: ChainScope, g: &mut GraphMut<'_>) {
        if scope.active {
            self.chain_from(scope.cursor, g);
        }
        self.emit_deltas = scope.prev_emit;
    }

    /// Reset the transient chaining state.
    ///
    /// Called by `db.rs` from the same RAII guard that restores `emit_deltas`
    /// after every apply, so a panic unwinding out of a hook cannot leave
    /// `chain_depth` non-zero — which would make `begin_chain` compute
    /// `active = false` and silently disable chaining for the life of the
    /// engine. On the normal path this state is already clean and the call is
    /// a no-op.
    pub fn reset_chain_state(&mut self) {
        self.chain_depth = 0;
        self.chain_fired.clear();
        self.doomed = None;
    }

    /// Feed derived-edge deltas appended since `cursor` back into via-hop rules.
    ///
    /// Runs at most [`MAX_CHAIN_DEPTH`] levels. Deterministic throughout: deltas
    /// are consumed in append order, rules iterate in BTree name order, and
    /// nothing reads a hash-ordered container. Because replay runs the identical
    /// hooks, it reproduces the identical chain.
    fn chain_from(&mut self, mut cursor: usize, g: &mut GraphMut<'_>) {
        debug_assert_eq!(self.chain_depth, 0);
        if self.pending_deltas.len() == cursor {
            return; // nothing was written; allocate nothing
        }
        // Only a delta on an edge type some rule hops over can trigger further
        // work. Filtering here keeps a large backfill from paying
        // O(deltas * rules) in the per-rule scan inside on_edge_changed.
        let via_edges: BTreeSet<String> = self
            .rules
            .values()
            .filter_map(|r| r.via_edge.clone())
            .collect();
        let rule_count = self.rules.len();
        for level in 1..=MAX_CHAIN_DEPTH {
            let end = self.pending_deltas.len();
            if end == cursor {
                return; // reached a fixpoint inside the cap
            }
            let batch: Vec<(String, u32, u32)> = self.pending_deltas[cursor..end]
                .iter()
                .filter(|d| via_edges.contains(&d.edge_type))
                .map(|d| (d.edge_type.clone(), d.src_id, d.dst_id))
                .collect();
            cursor = end;
            if batch.is_empty() {
                return; // nothing left that any rule hops over
            }
            // Fire-once is per LEVEL, not per write: a rule that already
            // recomputed at level N may still need to see an edge another rule
            // writes at level N+1. Within one level the guard is sound, because
            // every edge that level consumes was already in `g.topo` before the
            // level began, and each recompute re-evaluates the whole desired set
            // for that source.
            self.chain_fired.clear();
            self.chain_depth = level;
            for (etype, src, dst) in batch {
                self.on_edge_changed_inner(&etype, src, dst, g);
            }
            self.chain_depth = 0;
            // The fire-once key is a rule's position in the BTree-ordered rule
            // set, which is only stable because nothing a chained recompute does
            // can create or delete a rule.
            debug_assert_eq!(
                self.rules.len(),
                rule_count,
                "the rule set must not change during a chain"
            );
        }
        // Fell out of the loop with the cap reached. If the last level wrote
        // anything a rule hops over, the chain was truncated and the store is
        // not a fixpoint of its own rule set.
        let truncated = self.pending_deltas[cursor..]
            .iter()
            .any(|d| via_edges.contains(&d.edge_type));
        if truncated {
            self.chain_truncations = self.chain_truncations.saturating_add(1);
        }
    }

    pub fn rules(&self) -> impl Iterator<Item = &RuleDef> {
        self.rules.values()
    }

    /// How many writes hit [`MAX_CHAIN_DEPTH`] with rule-relevant work still
    /// pending, since this engine was constructed. A non-zero value means some
    /// derived edges beyond the cap are stale: the store is not a fixpoint of
    /// its own rule set, and no single later write will repair it. Not
    /// persisted; replay re-runs the same hooks, so the value is re-derived
    /// identically on reopen.
    pub fn chain_truncations(&self) -> u64 {
        self.chain_truncations
    }

    pub fn is_owned(&self, etype: u32, src: u32, dst: u32) -> bool {
        self.owned.contains(&(etype, src, dst))
    }

    /// Whether provenance bytes are still retained (not yet consumed by a mutation).
    ///
    /// When `true`, `provenance()` and `provenance_touching*` dispatch to
    /// `lazy_provenance`; when `false` they use the live mutable fields.
    fn provenance_is_retained(&self) -> bool {
        self.retained_provenance_bytes
            .lock()
            .expect("lock poisoned")
            .is_some()
    }

    /// Read-only view of the provenance map: rule name → set of (etype_sym, src, dst).
    ///
    /// Triggers a one-time lazy decode from retained bytes when called before
    /// the first mutation on a clean-open (no-WAL) store.
    pub fn provenance(&self) -> &BTreeMap<String, BTreeSet<(u32, u32, u32)>> {
        if self.provenance_is_retained() {
            self.ensure_provenance_loaded();
            &self.lazy_provenance.get().unwrap().provenance
        } else {
            &self.provenance
        }
    }

    /// O(degree) reverse-index lookup: every provenance triple that touches `node`.
    ///
    /// Dispatches to the lazy-decoded or live index depending on whether
    /// retained bytes have already been consumed by a mutation.
    pub fn provenance_touching(
        &self,
        node: u32,
    ) -> impl Iterator<Item = (&str, u32, u32, u32)> + '_ {
        let use_lazy = self.provenance_is_retained();
        let (by_node, intern_rule): (&BTreeMap<u32, BTreeSet<Touch>>, &Vec<String>) = if use_lazy {
            self.ensure_provenance_loaded();
            let lp = self.lazy_provenance.get().unwrap();
            (&lp.by_node, &lp.intern_rule)
        } else {
            (&self.by_node, &self.intern_rule)
        };
        by_node
            .get(&node)
            .into_iter()
            .flatten()
            .map(move |&(rid, t, s, d)| (intern_rule[rid as usize].as_str(), t, s, d))
    }

    /// Number of provenance triples incident on `node`.
    pub fn provenance_touching_len(&self, node: u32) -> usize {
        if self.provenance_is_retained() {
            self.ensure_provenance_loaded();
            self.lazy_provenance
                .get()
                .unwrap()
                .by_node
                .get(&node)
                .map_or(0, BTreeSet::len)
        } else {
            self.by_node.get(&node).map_or(0, BTreeSet::len)
        }
    }

    /// One-way latch: `true` after a budget breach until [`Self::rebuild`]
    /// is the only exit (and only if the full desired set then fits).
    pub fn is_tripped(&self, name: &str) -> bool {
        self.tripped.get(name).copied().unwrap_or(false)
    }

    /// Evaluations of this rule: one tick per `on_node_changed` fire, and
    /// one tick per participating node on backfill **and rebuild** (even
    /// when rebuild is a provenance no-op).
    pub fn fire_count(&self, name: &str) -> u64 {
        self.fires.get(name).copied().unwrap_or(0)
    }

    /// Drain and return all pending edge-fire / retract deltas since the last
    /// call.  Callers (`db.rs` `log_then_apply_with`) invoke this after a
    /// successful WAL commit + apply to build [`DbEvent`]s for live
    /// subscriptions.  [`GraphDb::open_with`] drains and discards after WAL
    /// replay so replay noise never leaks to subscribers.
    ///
    /// # T2 note (as-of replay)
    ///
    /// When Plan-15 T2 adds as-of replay for subscribers, that path should
    /// call apply-only (no `log_then_apply_with`) and then call
    /// `drain_deltas()` to feed those events to the replaying subscriber.
    /// The suppression is already in place: `apply` accumulates but never
    /// emits; `drain_deltas` is the only emission gate.
    pub fn drain_deltas(&mut self) -> Vec<EngineEdgeDelta> {
        std::mem::take(&mut self.pending_deltas)
    }

    /// Number of accumulated deltas not yet drained.  Used by
    /// `debug_assert` in `log_then_apply_with` to catch stale-delta bugs.
    pub fn pending_delta_count(&self) -> usize {
        self.pending_deltas.len()
    }

    /// Borrow the slice of deltas accumulated since `cursor` without
    /// consuming them.  `cursor` should be the value returned by
    /// `pending_delta_count()` before an engine call.
    ///
    /// The returned slice is valid until the next call to `drain_deltas()`.
    /// T1's drain discipline is preserved: these deltas are still in the
    /// buffer and will be drained by `log_then_apply_with` after `apply`
    /// returns.
    pub fn pending_deltas_since(&self, cursor: usize) -> &[EngineEdgeDelta] {
        &self.pending_deltas[cursor..]
    }

    /// Snapshot support: definitions + provenance + tripped/fires. Candidate
    /// indexes and the `by_node` reverse index are NOT included (derived:
    /// `reindex_all` / `rebuild_by_node` on open).
    #[allow(clippy::type_complexity)]
    pub fn to_persist(
        &self,
    ) -> (
        Vec<RuleDef>,
        BTreeMap<String, BTreeSet<(u32, u32, u32)>>,
        BTreeMap<String, bool>,
        BTreeMap<String, u64>,
    ) {
        (
            self.rules.values().cloned().collect(),
            self.provenance.clone(),
            self.tripped.clone(),
            self.fires.clone(),
        )
    }

    /// Reconstruct engine from a snapshot.  Caller must call `reindex_all` after.
    pub fn from_persist(
        rules: Vec<RuleDef>,
        prov: BTreeMap<String, BTreeSet<(u32, u32, u32)>>,
        tripped: BTreeMap<String, bool>,
        fires: BTreeMap<String, u64>,
    ) -> Self {
        let mut owned = BTreeSet::new();
        for set in prov.values() {
            owned.extend(set.iter().copied());
        }
        let indexes = rules
            .iter()
            .map(|r| (r.name.clone(), RuleIndex::default()))
            .collect();
        let rules: BTreeMap<String, RuleDef> =
            rules.into_iter().map(|r| (r.name.clone(), r)).collect();
        // Fill any missing keys so live rules always have entries.
        let mut tripped = tripped;
        let mut fires = fires;
        for name in rules.keys() {
            tripped.entry(name.clone()).or_insert(false);
            fires.entry(name.clone()).or_insert(0);
        }
        let (by_node, rule_intern, intern_rule) = rebuild_by_node(&prov);
        Self {
            rules,
            indexes,
            provenance: prov,
            owned,
            by_node,
            rule_intern,
            intern_rule,
            tripped,
            fires,
            pending_deltas: Vec::new(),
            retracted: Vec::new(),
            emit_deltas: false,
            rebuild_needed: BTreeSet::new(),
            pending_builds: BTreeMap::new(),
            builds_awaiting_backfill: BTreeSet::new(),
            hnsw_build_batch: None,
            // Candidate indexes start empty; caller must either call
            // consume_retained_state_eager (WAL-present open) or rely on the
            // lazy init in the mutation hooks (clean open, first-write cost).
            indexes_populated: false,
            retained_hnsw_blobs: Mutex::new(BTreeMap::new()),
            retained_ivf_bytes: Mutex::new(None),
            retained_node_count: AtomicU32::new(0),
            retained_provenance_bytes: Mutex::new(None),
            lazy_provenance: OnceLock::new(),
            lazy_hnsw: OnceLock::new(),
            chain_depth: 0,
            chain_fired: BTreeSet::new(),
            doomed: None,
            chain_truncations: 0,
            hnsw_builds: 0,
        }
    }

    /// Enable or disable delta accumulation.
    ///
    /// Set to `true` before the first subscriber or view is added.
    /// Set to `false` when the last subscriber and last view are removed.
    /// See the `emit_deltas` field doc for the safety invariant.
    pub fn set_emit_deltas(&mut self, emit: bool) {
        self.emit_deltas = emit;
    }

    /// Whether delta accumulation is currently enabled.
    pub fn emit_deltas(&self) -> bool {
        self.emit_deltas
    }

    /// Drain rule names that exceeded the IVF dst-drift rebuild threshold
    /// during the most recent `on_node_changed` / `on_node_removed`.
    pub fn take_rebuild_needed(&mut self) -> Vec<String> {
        std::mem::take(&mut self.rebuild_needed)
            .into_iter()
            .collect()
    }

    /// Re-queue `name` so a later write can issue `RebuildRule`.
    ///
    /// Used when auto-rebuild WAL IO fails after a durable user op.
    pub fn queue_rebuild_needed(&mut self, name: String) {
        self.rebuild_needed.insert(name);
    }

    // -----------------------------------------------------------------------
    // Sliced HNSW builds (v0.6.6 T2)
    // -----------------------------------------------------------------------

    /// Override the build-slice size for this engine. `None` restores
    /// [`crate::HNSW_BUILD_BATCH`] (or whatever `with_hnsw_build_batch` has
    /// installed on the calling thread).
    ///
    /// Test observability, not stable surface.
    #[doc(hidden)]
    pub fn set_hnsw_build_batch(&mut self, batch: Option<usize>) {
        self.hnsw_build_batch = batch.map(|b| b.max(1));
    }

    /// Never zero: a zero slice would insert nothing per pump, and
    /// `build_index_on` would spin forever on a build that cannot advance.
    fn build_batch(&self) -> usize {
        self.hnsw_build_batch
            .unwrap_or_else(hnsw_build_batch)
            .max(1)
    }

    /// Rules whose vector index is still being built, in name order.
    ///
    /// Empty for every store whose rules were created over a corpus at or
    /// below [`crate::HNSW_BUILD_BATCH`] vectors — that is, for every store
    /// that behaved the way 0.6.5 behaved.
    pub fn builds_in_progress(&self) -> Vec<BuildProgress> {
        self.pending_builds
            .iter()
            .map(|(name, pb)| BuildProgress {
                rule: name.clone(),
                indexed: pb.indexed,
                total: pb.total,
            })
            .collect()
    }

    /// Advance every pending build by one slice.
    ///
    /// Returns the builds that finished, in rule order, carrying their final
    /// `indexed`/`total` so a caller can report what it just completed. The
    /// caller **must** backfill each of them through `RebuildRule`: the rule
    /// derives nothing until it does, and it has already vanished from
    /// [`RuleEngine::builds_in_progress`].
    ///
    /// Does at most [`crate::HNSW_BUILD_BATCH`] vector inserts per pending
    /// rule, so a caller can drive a large build to completion without holding
    /// a write lock for more than a slice at a time.
    pub fn pump_index_build(&mut self, g: &mut GraphMut<'_>) -> Vec<BuildProgress> {
        // A clean-open handle that has never written reaches this with empty
        // indexes and a rule set restored from the snapshot. Populating them
        // adopts the persisted graphs and, for an incomplete blob already in
        // `pending_builds`, leaves the remainder to the slice loop below.
        self.ensure_indexes_populated(g);
        if self.pending_builds.is_empty() {
            return Vec::new();
        }
        let batch = self.build_batch();
        let names: Vec<String> = self.pending_builds.keys().cloned().collect();
        let mut finished: Vec<BuildProgress> = Vec::new();
        for name in names {
            let Some(pb) = self.pending_builds.get(&name).cloned() else {
                continue;
            };
            let Some(def) = self.rules.get(&name).cloned() else {
                // The rule was dropped while its build was outstanding.
                self.pending_builds.remove(&name);
                continue;
            };
            let (inserted, cursor) =
                self.run_build_slice(&name, &def, pb.cursor, pb.limit, batch, g);
            let entry = self
                .pending_builds
                .get_mut(&name)
                .expect("pending build removed mid-slice");
            entry.indexed = entry.indexed.saturating_add(inserted).min(entry.total);
            entry.cursor = cursor;
            if cursor >= pb.limit {
                // The graph is whole: fit the legacy IVF fallback exactly where
                // the one-commit path fits it, then hand the name back so the
                // caller can run the backfill as its own commit.
                if let Some(idx) = self.indexes.get_mut(&name) {
                    idx.src_side.fit_ivf_clusters(&name);
                    idx.dst_side.fit_ivf_clusters(&name);
                }
                let done = self
                    .pending_builds
                    .remove(&name)
                    .expect("pending build vanished mid-slice");
                // Tells the `RebuildRule` this name is about to trigger that the
                // graph is already built and must be carried, not rebuilt.
                self.builds_awaiting_backfill.insert(name.clone());
                finished.push(BuildProgress {
                    rule: name,
                    indexed: done.indexed,
                    total: done.total,
                });
            }
        }
        finished
    }

    /// Insert up to `batch` vector-bearing nodes from `[cursor, limit)` into
    /// `name`'s HNSW graphs. Returns `(nodes inserted, new cursor)`.
    ///
    /// Counts nodes by the same predicate [`hnsw_build_total`] counts them
    /// with, so `indexed` can never overshoot `total`. Ids already in the
    /// graph are skipped and not counted: a reopen of an incomplete blob
    /// starts the cursor at 0 so a write-during-build that landed a high id
    /// cannot hide a gap, and walking the prefix has to be free.
    fn run_build_slice(
        &mut self,
        name: &str,
        def: &RuleDef,
        cursor: u32,
        limit: u32,
        batch: usize,
        g: &GraphMut<'_>,
    ) -> (u64, u32) {
        let src_spec = src_lookup_spec_for(def);
        let dst_spec = candidate_spec_for(def);
        let src_sym = g.syms.get(&def.src_label);
        let dst_sym = g.syms.get(&def.dst_label);
        let Some(idx) = self.indexes.get_mut(name) else {
            return (0, limit);
        };
        let mut inserted = 0u64;
        let mut id = cursor;
        while id < limit && (inserted as usize) < batch {
            let at = id;
            id += 1;
            let label_sym = match g.labels.get(at as usize).copied() {
                Some(s) if s != u32::MAX => s,
                _ => continue,
            };
            if src_sym != Some(label_sym) && dst_sym != Some(label_sym) {
                continue;
            }
            // Namespace scoping (v0.6.6 §7.4): the sliced build files the
            // vectors `index_node_for_rule_deferring_hnsw` deferred, so it has to
            // apply the same gate — a scoped rule's HNSW graph holds its own
            // namespace only. `hnsw_build_total` counts the same way, so the
            // progress this slice reports is against the same population.
            if !rule_sees(def, at, g) {
                continue;
            }
            // `accounts_for`, not `contains`: a slice resuming over a v4 blob
            // meets ids the graph does not hold but the index has already
            // judged — parked, or refused for a dimension disagreement.
            // `contains` only sees the graph, so the slice would re-offer them:
            // a parked vector is superseded and then refused (losing the one
            // copy that made it recoverable), and a refusal is counted twice.
            // `can_answer` is false while a build is incomplete either way, so
            // nothing would have failed loudly.
            let src_has = idx.src_side.hnsw_ref().is_some_and(|h| h.accounts_for(at));
            let dst_has = idx.dst_side.hnsw_ref().is_some_and(|h| h.accounts_for(at));
            let get = |f: &str| g.props.get(at, f).map(|vr| vr.into_value());
            let mut any = false;
            if src_sym == Some(label_sym) && !src_has {
                any |= idx.src_side.insert_hnsw_only(&src_spec, at, &get);
            }
            if dst_sym == Some(label_sym) && !dst_has {
                any |= idx.dst_side.insert_hnsw_only(&dst_spec, at, &get);
            }
            if any {
                inserted += 1;
            }
        }
        (inserted, id)
    }

    fn maybe_queue_ivf_rebuild(&mut self, rule_name: &str, def: &RuleDef) {
        if !def.approximate {
            return;
        }
        let Some(idx) = self.indexes.get(rule_name) else {
            return;
        };
        if idx.dst_side.ivf_drift > ivf_drift_rebuild_threshold() {
            self.rebuild_needed.insert(rule_name.to_string());
        }
    }

    /// How many HNSW graphs this engine instance has built from scratch since
    /// it was constructed (one per side of an approximate rule).
    ///
    /// Zero after an open that restored every graph from the snapshot; non-zero
    /// when a rule was created, or when a graph had to be rebuilt because no
    /// blob was persisted for it or the blob failed to load.
    ///
    /// Test observability, not stable surface: never persisted, and counted
    /// per engine instance rather than per store.
    #[doc(hidden)]
    pub fn hnsw_build_count(&self) -> u64 {
        self.hnsw_builds
    }

    /// How many rules currently hold a lazily-decoded HNSW graph pair.
    ///
    /// Zero before the first ANN query on a clean open, and zero again once a
    /// write has moved the persisted graphs into the live indexes. A non-zero
    /// count after a write means the handle is holding two copies of every
    /// approximate rule's graph.
    ///
    /// Test observability, not stable surface.
    #[doc(hidden)]
    pub fn lazy_hnsw_len(&self) -> usize {
        self.lazy_hnsw.get().map_or(0, |m| m.len())
    }

    /// Export IVF state for all approximate rules.  Passed to `snapshot()` in
    /// `core-api` and stored in the V4 snapshot so `open()` can restore cluster
    /// assignments without re-fitting k-means.
    pub fn export_ivf_state(&self) -> BTreeMap<String, RuleIvfExport> {
        let mut out = BTreeMap::new();
        for (name, def) in &self.rules {
            if def.approximate {
                if let Some(idx) = self.indexes.get(name) {
                    out.insert(
                        name.clone(),
                        (
                            idx.src_side.export_ivf_state(),
                            idx.dst_side.export_ivf_state(),
                        ),
                    );
                }
            }
        }
        out
    }

    /// Rebuild all candidate indexes by scanning every node.  Call on open.
    pub fn reindex_all(
        &mut self,
        ids: &IdMap,
        syms: &Interner,
        labels: &[u32],
        props: ColumnsView<'_>,
    ) {
        for idx in self.indexes.values_mut() {
            *idx = RuleIndex::default();
        }
        // Collect rule names once outside the per-node loop to avoid repeated
        // allocation and to satisfy the borrow checker without cloning inside.
        let rule_names: Vec<String> = self.rules.keys().cloned().collect();

        // Init HNSW for every rule with a vector leg before inserting nodes.
        for name in &rule_names {
            if uses_hnsw(&self.rules[name]) {
                let idx = self.indexes.get_mut(name).unwrap();
                idx.src_side.init_hnsw(name);
                idx.dst_side.init_hnsw(name);
                self.hnsw_builds += 2;
            }
        }

        for id in 0..ids.len() as u32 {
            let label_sym = match labels.get(id as usize).copied() {
                Some(s) if s != u32::MAX => s,
                _ => continue,
            };
            for name in &rule_names {
                let def = self.rules[name].clone();
                let idx = self.indexes.get_mut(name).unwrap();
                index_node_for_rule(id, label_sym, &def, idx, syms, props);
            }
        }
        // After all nodes are indexed, fit IVF clusters for approximate rules.
        // HNSW was built incrementally; IVF kept as legacy fallback.
        for name in &rule_names {
            if self.rules[name].approximate {
                let idx = self.indexes.get_mut(name).unwrap();
                idx.src_side.fit_ivf_clusters(name);
                idx.dst_side.fit_ivf_clusters(name);
            }
        }
        self.indexes_populated = true;
        self.release_lazy_hnsw();
    }

    /// Like `reindex_all` but LOADS persisted IVF state for approximate rules
    /// instead of re-fitting k-means.  This eliminates the cold-start re-fit
    /// cost when opening a V4 snapshot.
    ///
    /// `ivf_state`: map from rule name to `(src_export, dst_export)` as
    /// produced by `export_ivf_state` / stored in the V4 snapshot.
    ///
    /// For approximate rules absent from `ivf_state` (e.g. a rule added
    /// after the snapshot), falls back to `fit_ivf_clusters`.
    ///
    /// **Always rebuilds every approximate rule's HNSW graph from scratch**, at
    /// a cost superlinear in the number of embeddings.  Nothing in this
    /// repository calls it; it is retained only because it is published API.
    /// Any caller holding persisted HNSW blobs — every open path does — must
    /// use [`RuleEngine::reindex_all_load_state`], which installs those graphs
    /// and skips the build instead of doing it and throwing it away.
    pub fn reindex_all_load_ivf(
        &mut self,
        ids: &IdMap,
        syms: &Interner,
        labels: &[u32],
        props: ColumnsView<'_>,
        ivf_state: BTreeMap<String, RuleIvfExport>,
    ) {
        self.reindex_all_load_state(ids, syms, labels, props, ivf_state, BTreeMap::new());
    }

    /// Like `reindex_all_load_ivf`, but also restores the persisted HNSW graphs
    /// **instead of rebuilding them**.
    ///
    /// `hnsw_state`: map from rule name to `(src_blob, dst_blob)` as produced
    /// by `export_hnsw_state` / stored in the snapshot.
    ///
    /// The persisted graph is adopted **before** the node scan, and the scan is
    /// told which ids it already holds so it inserts only what the snapshot did
    /// not carry.  That is the whole point — building the graph during the scan
    /// is superlinear in the number of embeddings, and the persisted graph
    /// replaced it wholesale anyway, so the build was pure waste on every open.
    /// Adopting first also means a node the scan *does* see but the graph does
    /// not — a rule whose blob predates a write — is inserted rather than
    /// dropped.  An incomplete blob already registered in `pending_builds` is
    /// the exception: the scan files every non-vector leg and leaves the HNSW
    /// remainder to [`RuleEngine::pump_index_build`].
    ///
    /// A side falls back to the full rebuild when:
    ///   * `hnsw_state` has no entry for the rule — a store written before HNSW
    ///     persistence existed, or a rule created since the last snapshot;
    ///   * the blob for that side is empty — the side had no graph to export;
    ///   * the blob is corrupt or carries a version this build does not read —
    ///     the reason is logged to stderr and the scan rebuilds the graph.
    ///
    /// Entries naming a rule this engine does not treat as approximate are left
    /// for `load_hnsw_state` after the scan, exactly as before.
    pub fn reindex_all_load_state(
        &mut self,
        ids: &IdMap,
        syms: &Interner,
        labels: &[u32],
        props: ColumnsView<'_>,
        ivf_state: BTreeMap<String, RuleIvfExport>,
        hnsw_state: BTreeMap<String, (Vec<u8>, Vec<u8>)>,
    ) {
        for idx in self.indexes.values_mut() {
            *idx = RuleIndex::default();
        }
        let rule_names: Vec<String> = self.rules.keys().cloned().collect();

        // Adopt the persisted graphs up front, before the node scan, and keep
        // the ids each one already holds so the scan can skip them.  Sides with
        // no usable blob get `init_hnsw` and are filled by the scan.
        let mut leftover_blobs = hnsw_state;
        let mut adopted: BTreeMap<String, (BTreeSet<u32>, BTreeSet<u32>)> = BTreeMap::new();
        // Rules whose graph the snapshot did not carry, so this scan has to
        // build it inline. Reported once below, with the size, because the cost
        // is superlinear in the vectors and otherwise invisible.
        let mut built_inline: Vec<String> = Vec::new();
        for name in &rule_names {
            if !uses_hnsw(&self.rules[name]) {
                continue;
            }
            let (src_blob, dst_blob) = leftover_blobs.remove(name).unwrap_or_default();
            let idx = self.indexes.get_mut(name).unwrap();
            let (src_ids, src_adopted) = idx.src_side.init_or_adopt_hnsw(name, &src_blob);
            let (dst_ids, dst_adopted) = idx.dst_side.init_or_adopt_hnsw(name, &dst_blob);
            if !src_adopted {
                self.hnsw_builds += 1;
            }
            if !dst_adopted {
                self.hnsw_builds += 1;
            }
            if !src_adopted || !dst_adopted {
                built_inline.push(name.clone());
            }
            adopted.insert(name.clone(), (src_ids, dst_ids));
        }

        // Rules whose remainder is already registered (a mid-build blob
        // `register_incomplete_hnsw_builds` saw at open): leave HNSW inserts
        // to `pump_index_build`. Complete blobs keep the inline path so a
        // handful of vectors written after the snapshot still land in one pass.
        let defer_hnsw: BTreeSet<String> = self.pending_builds.keys().cloned().collect();

        let empty: (BTreeSet<u32>, BTreeSet<u32>) = (BTreeSet::new(), BTreeSet::new());
        for id in 0..ids.len() as u32 {
            let label_sym = match labels.get(id as usize).copied() {
                Some(s) if s != u32::MAX => s,
                _ => continue,
            };
            for name in &rule_names {
                let def = self.rules[name].clone();
                let skip = adopted.get(name).unwrap_or(&empty);
                let idx = self.indexes.get_mut(name).unwrap();
                if defer_hnsw.contains(name) {
                    index_node_for_rule_deferring_hnsw(id, label_sym, &def, idx, syms, props);
                } else {
                    index_node_for_rule_skipping(id, label_sym, &def, idx, syms, props, skip);
                }
            }
        }

        // One line per rule whose graph this scan had to build, because it is
        // the one cost on this path that is superlinear in the corpus and it is
        // otherwise silent: a store written before vector indexes were persisted,
        // a rule created since the last snapshot, or a blob that failed to load.
        for name in &built_inline {
            let vectors = self
                .indexes
                .get(name)
                .and_then(|idx| idx.dst_side.hnsw_ref().map(|h| h.len()))
                .unwrap_or(0);
            // A rule whose side never held a vector built nothing worth saying.
            if vectors == 0 {
                continue;
            }
            eprintln!(
                "[mushroomdb] rule {name:?}: no persisted vector index; built one from the \
                 node scan ({vectors} vectors)"
            );
        }

        // Re-derive the pending builds a mid-build snapshot left behind.
        //
        // `pending_builds` is never persisted. On a clean reopen, open already
        // registered the unfinished blob (`register_incomplete_hnsw_builds`);
        // the scan above deferred those HNSW inserts, so we keep that entry
        // and reset its cursor to 0. Open stored `max(node_ids)+1`, which is
        // not the slice cursor `run_build_slice` left behind: a write-during-
        // build that inserted a higher id would skip the gap if we resumed
        // from there. Starting at 0, `run_build_slice` skips ids already in
        // the graph.
        //
        // WAL-present opens still go through `cut_short` (`indexes_populated`
        // already true, so open's registration is a no-op). Evidence that a
        // build was unfinished is that the scan had to supply a vector the
        // adopted graph did not carry. That is only sound because the write
        // path populates the indexes *before* it applies a record
        // (`needs_index_population`): the scan sees exactly the persisted
        // state, so a vector it has to supply really was missing from the
        // snapshot's graph rather than being the in-flight write's own.
        //
        // `retained_node_count` is the belt to that's braces. Ids are dense and
        // never reused, so a node the snapshot did not hold has an id at or
        // above the count it recorded; restricting the evidence to ids below
        // the line keeps any path that still populates lazily — a `what_if`
        // clone, or a caller reaching the engine directly — from reading its
        // own newer nodes as an interrupted build.
        //
        // On this path the scan has already finished the graph; what is still
        // owed is the backfill, so the entry is registered complete and the
        // next pump turns it into one `RebuildRule`.
        let n = ids.len() as u32;
        for name in &defer_hnsw {
            if let Some(pb) = self.pending_builds.get_mut(name) {
                pb.cursor = 0;
                pb.limit = n;
            }
        }
        let snapshot_ids = self.retained_node_count.load(AtomicOrdering::Relaxed);
        for (name, (src_ids, dst_ids)) in &adopted {
            if defer_hnsw.contains(name) {
                continue; // already registered; remainder is sliced, not inline
            }
            if src_ids.is_empty() && dst_ids.is_empty() {
                continue; // nothing was adopted: this was a plain rebuild
            }
            let Some(idx) = self.indexes.get(name) else {
                continue;
            };
            let src_now = idx.src_side.hnsw_ref().map(|h| h.node_ids());
            let dst_now = idx.dst_side.hnsw_ref().map(|h| h.node_ids());
            let cut_short = |now: &Option<BTreeSet<u32>>, adopted: &BTreeSet<u32>| {
                now.as_ref().is_some_and(|now| {
                    now.iter()
                        .take_while(|id| **id < snapshot_ids)
                        .any(|id| !adopted.contains(id))
                })
            };
            if !cut_short(&src_now, src_ids) && !cut_short(&dst_now, dst_ids) {
                continue; // the persisted graph was whole
            }
            let total = src_now
                .map_or(0, |s| s.len())
                .max(dst_now.map_or(0, |s| s.len())) as u64;
            self.remember_pending_build(name.clone(), total, total, n, n);
        }

        // Any blob naming a rule that is not approximate here (or not a rule at
        // all) is applied exactly as the old `load_hnsw_state` call site did.
        if !leftover_blobs.is_empty() {
            self.load_hnsw_state(leftover_blobs);
        }

        // For approximate rules: restore persisted IVF state (no re-fit).
        for name in &rule_names {
            if !self.rules[name].approximate {
                continue;
            }
            let idx = self.indexes.get_mut(name).unwrap();
            if let Some(((sc, sa, sd), (dc, da, dd))) = ivf_state.get(name) {
                idx.src_side.load_ivf_state(sc.clone(), sa.clone(), *sd);
                idx.dst_side.load_ivf_state(dc.clone(), da.clone(), *dd);
            } else {
                // No persisted state for this rule: fall back to full re-fit.
                idx.src_side.fit_ivf_clusters(name);
                idx.dst_side.fit_ivf_clusters(name);
            }
        }
        self.indexes_populated = true;
        self.release_lazy_hnsw();
    }

    /// Store HNSW blobs and raw IVF bytes from a snapshot **without deserializing**.
    ///
    /// Called from `restore_snapshot_state` in db.rs.  Neither the HNSW graphs
    /// nor the IVF centroids are materialized here; they are consumed lazily:
    ///   - `consume_retained_state_eager` (WAL-present open, before WAL replay)
    ///   - The mutation-hook lazy-init guard (clean open, first-write cost)
    ///   - `ensure_hnsw_loaded` (first ANN query on a clean open)
    ///
    /// `node_count` is the number of id slots the snapshot holds. It is the
    /// line between "the snapshot had this node" and "this node is newer",
    /// which `reindex_all_load_state` needs to recognise an interrupted build
    /// without mistaking an in-flight write for one.
    pub fn store_snapshot_state(
        &self,
        hnsw_blobs: BTreeMap<String, (Vec<u8>, Vec<u8>)>,
        ivf_bytes: Vec<u8>,
        node_count: u32,
    ) {
        self.retained_node_count
            .store(node_count, AtomicOrdering::Relaxed);
        *self
            .retained_hnsw_blobs
            .lock()
            .expect("retained_hnsw_blobs lock poisoned") = hnsw_blobs;
        *self
            .retained_ivf_bytes
            .lock()
            .expect("retained_ivf_bytes lock poisoned") = if ivf_bytes.is_empty() {
            None
        } else {
            Some(ivf_bytes)
        };
        // indexes_populated remains false.
    }

    /// Register a sliced build a snapshot cut short, from blobs whose
    /// `complete` flag is false.
    ///
    /// `pending_builds` is not persisted; the blob flag is. A clean open never
    /// runs the node scan, so this is how `serve`'s ticker learns there is work
    /// without waiting for a write.
    ///
    /// `extra` is the incomplete `(src, dst)` pair per rule, typically peeked
    /// from a V8 mmap without copying complete graphs. When it is empty, the
    /// retained blobs from [`Self::store_snapshot_state`] are inspected
    /// instead (V5–V7, or a caller that already loaded the section).
    ///
    /// No-op when indexes are already populated: the scan's `cut_short` path
    /// owns that case and uses the same [`PendingBuild`] representation.
    pub fn register_incomplete_hnsw_builds(
        &mut self,
        extra: &BTreeMap<String, (Vec<u8>, Vec<u8>)>,
        g: &GraphMut<'_>,
    ) {
        if self.indexes_populated {
            return;
        }
        let retained = self
            .retained_hnsw_blobs
            .lock()
            .expect("retained_hnsw_blobs lock poisoned");
        if extra.is_empty() && retained.is_empty() {
            return;
        }
        let names: Vec<String> = extra
            .keys()
            .cloned()
            .chain(retained.keys().filter(|n| !extra.contains_key(*n)).cloned())
            .collect();
        let mut found: Vec<(String, Vec<u8>, Vec<u8>)> = Vec::new();
        for name in names {
            if !self.rules.get(&name).is_some_and(uses_hnsw) {
                continue;
            }
            let Some((src, dst)) = extra.get(&name).or_else(|| retained.get(&name)) else {
                continue;
            };
            if crate::hnsw::hnsw_blob_complete(src) != Some(false)
                && crate::hnsw::hnsw_blob_complete(dst) != Some(false)
            {
                continue;
            }
            found.push((name, src.clone(), dst.clone()));
        }
        drop(retained);
        for (name, src, dst) in found {
            self.register_one_incomplete_build(&name, &src, &dst, g);
        }
    }

    fn register_one_incomplete_build(
        &mut self,
        name: &str,
        src_blob: &[u8],
        dst_blob: &[u8],
        g: &GraphMut<'_>,
    ) {
        let src = if src_blob.is_empty() {
            None
        } else {
            crate::hnsw::decode_hnsw_blob(src_blob).ok()
        };
        let dst = if dst_blob.is_empty() {
            None
        } else {
            crate::hnsw::decode_hnsw_blob(dst_blob).ok()
        };
        if src.is_none() && dst.is_none() {
            return;
        }
        let indexed = src
            .as_ref()
            .map(|h| h.len())
            .unwrap_or(0)
            .max(dst.as_ref().map(|h| h.len()).unwrap_or(0)) as u64;
        let Some(def) = self.rules.get(name).cloned() else {
            return;
        };
        let total = hnsw_build_total(&def, g).max(indexed);
        let limit = g.ids.len() as u32;
        let cursor = src
            .iter()
            .chain(dst.iter())
            .filter_map(|h| h.node_ids().iter().next_back().copied())
            .max()
            .map(|id| id.saturating_add(1))
            .unwrap_or(0)
            .min(limit);
        self.remember_pending_build(name.to_string(), indexed, total, cursor, limit);
    }

    fn remember_pending_build(
        &mut self,
        name: String,
        indexed: u64,
        total: u64,
        cursor: u32,
        limit: u32,
    ) {
        self.pending_builds.insert(
            name,
            PendingBuild {
                indexed,
                total,
                cursor,
                limit,
            },
        );
    }

    /// Store raw rkyv provenance bytes retained from a V8 snapshot.
    ///
    /// Called from `restore_v8_base` in db.rs after open.  Provenance is not
    /// decoded here; it is materialized lazily — either by the `&self` read path
    /// (`ensure_provenance_loaded`) for stats/explain, or by the `&mut self`
    /// write path (`ensure_provenance_loaded_mut`) on the first mutation.
    pub fn store_provenance_bytes(&self, bytes: Vec<u8>) {
        *self
            .retained_provenance_bytes
            .lock()
            .expect("lock poisoned") = if bytes.is_empty() { None } else { Some(bytes) };
    }

    /// Populate `lazy_provenance` from retained bytes for `&self` read paths.
    ///
    /// Uses `OnceLock` for exactly-once initialization.  The retained bytes are
    /// NOT consumed here; `ensure_provenance_loaded_mut` still has access to them
    /// for the write path.  After the first mutation, `retained_provenance_bytes`
    /// is `None` and callers switch to the live `self.provenance` field instead.
    pub fn ensure_provenance_loaded(&self) {
        self.lazy_provenance.get_or_init(|| {
            // Hold the Mutex across decode to avoid cloning 115 MiB.  This is a
            // one-time cost; subsequent calls return immediately via OnceLock.
            let guard = self
                .retained_provenance_bytes
                .lock()
                .expect("retained_provenance_bytes lock poisoned");
            let bytes = match &*guard {
                Some(b) if !b.is_empty() => b,
                _ => return LazyProvenance::default(),
            };
            let prov = decode_provenance_bytes(bytes);
            let (by_node, _rule_intern, intern_rule) = rebuild_by_node(&prov);
            LazyProvenance {
                provenance: prov,
                by_node,
                intern_rule,
            }
        });
    }

    /// Decode and install retained provenance bytes into the live mutable fields.
    ///
    /// No-op if bytes have already been consumed or were never stored.
    /// Must be called under `&mut self` before any operation that reads or
    /// diffs against `self.provenance`, `self.owned`, or `self.by_node`.
    pub fn ensure_provenance_loaded_mut(&mut self) {
        let bytes = match self
            .retained_provenance_bytes
            .lock()
            .expect("lock poisoned")
            .take()
        {
            Some(b) => b,
            None => return,
        };
        let prov = decode_provenance_bytes(&bytes);
        for set in prov.values() {
            self.owned.extend(set.iter().copied());
        }
        let (by_node, rule_intern, intern_rule) = rebuild_by_node(&prov);
        self.provenance = prov;
        self.by_node = by_node;
        self.rule_intern = rule_intern;
        self.intern_rule = intern_rule;
    }

    /// Eagerly consume retained snapshot state before WAL replay.
    ///
    /// Call this in `open_with` when the WAL has records.  Runs the O(n) node
    /// scan + restores persisted IVF centroids and HNSW blobs so that WAL
    /// replay finds fully-populated indexes.  Marks `indexes_populated = true`.
    pub fn consume_retained_state_eager(
        &mut self,
        ids: &IdMap,
        syms: &Interner,
        labels: &[u32],
        props: ColumnsView<'_>,
    ) {
        if self.indexes_populated {
            return;
        }
        // Also ensure provenance is loaded before WAL replay so diffs apply
        // against the correct pre-snapshot provenance state.
        self.ensure_provenance_loaded_mut();
        let hnsw = std::mem::take(
            &mut *self
                .retained_hnsw_blobs
                .lock()
                .expect("retained_hnsw_blobs lock poisoned"),
        );
        let ivf_bytes = self
            .retained_ivf_bytes
            .lock()
            .expect("retained_ivf_bytes lock poisoned")
            .take()
            .unwrap_or_default();
        let ivf = decode_ivf_bytes_to_export(&ivf_bytes);
        // The persisted HNSW graphs go in as part of the reindex, not after it:
        // the scan skips the build for every side that has one, because the
        // load used to overwrite that build wholesale.
        self.reindex_all_load_state(ids, syms, labels, props, ivf, hnsw);
    }

    /// Deserialize retained HNSW blobs into `lazy_hnsw` for the clean-open ANN
    /// read path.  Takes `&self` so it can be called from `find_similar_vector`
    /// and `search_hybrid` under a shared (`db.read()`) lock.
    ///
    /// Uses `OnceLock` to guarantee exactly-once initialization even under
    /// concurrent shared access.  The retained blobs are borrowed (not consumed)
    /// so that a subsequent first-mutation call to `consume_retained_state_eager`
    /// can still load the persisted HNSW graphs into `self.indexes`.
    ///
    /// Called before the first ANN query on a clean-open (no WAL) store.
    pub fn ensure_hnsw_loaded(&self) {
        self.lazy_hnsw.get_or_init(|| {
            // Snapshot blob entries into a local Vec, then release the Mutex
            // before deserialization so the lock is not held across potentially
            // expensive bincode::deserialize calls.
            let snapshot: Vec<(String, Vec<u8>, Vec<u8>)> = {
                let guard = self
                    .retained_hnsw_blobs
                    .lock()
                    .expect("retained_hnsw_blobs lock poisoned");
                if guard.is_empty() {
                    return BTreeMap::new();
                }
                guard
                    .iter()
                    .map(|(name, (sb, db))| (name.clone(), sb.clone(), db.clone()))
                    .collect()
            }; // lock released here
            snapshot
                .into_iter()
                .map(|(name, sb, db)| {
                    // Must go through `decode_hnsw_blob`, not a bare bincode
                    // decode: the persisted bytes are the versioned `MHNS`
                    // wrapper, and a 0.6.5 store's bytes are the old id-keyed
                    // shape.  Getting this wrong is silent — `lazy_hnsw` stays
                    // empty and every ANN query on a clean-open store falls
                    // back to brute force until the first write.
                    let src = lazy_decode(&name, "src", &sb);
                    let dst = lazy_decode(&name, "dst", &db);
                    (name, (src, dst))
                })
                .collect()
        });
    }

    /// Drop the lazily-decoded HNSW graphs.
    ///
    /// Called at every site that sets `indexes_populated` — the two reindex
    /// entry points and both arms of `create_rule` — so the lazy copies never
    /// outlive the live indexes taking over. Two things go wrong if they are
    /// kept:
    ///
    /// * **Memory.** A handle that served one ANN query and then wrote holds
    ///   the graph twice — once decoded here, once in the live index — for the
    ///   rest of its life, and the snapshot copy is never consulted again.
    /// * **Staleness.** The ANN read paths chain `live.or(lazy)`, and `live`
    ///   is filtered on `!is_empty()`. A live graph legitimately emptied by
    ///   deletes would therefore fall through to the graph the store held at
    ///   snapshot time, which suppresses the brute-force scan.
    ///
    /// Safe to call unconditionally: `ensure_hnsw_loaded` re-initializes the
    /// `OnceLock` on demand, and by this point the retained blobs have been
    /// taken, so it re-initializes to an empty map.
    fn release_lazy_hnsw(&mut self) {
        self.lazy_hnsw = OnceLock::new();
    }

    /// True when a write has to populate the candidate indexes before it
    /// mutates anything.
    ///
    /// The lazy population is a full node scan, and it reads the graph it is
    /// handed. Run from inside a hook it therefore reads the *half-applied*
    /// record — the in-flight node's new label and props are already in the
    /// columns — and the scan then attributes that node's vector to the
    /// snapshot, which is how a perfectly ordinary write came to look like a
    /// build the store had been killed in the middle of. Hoisting it to before
    /// the mutation makes the scan see exactly the persisted state, and the
    /// write's own hook then inserts its vector through the normal path.
    pub fn needs_index_population(&self) -> bool {
        !self.indexes_populated && !self.rules.is_empty()
    }

    /// Build every rule's candidate index from `g` if that has not happened
    /// yet. The `&mut self` entry point behind [`RuleEngine::needs_index_population`].
    pub fn populate_indexes(&mut self, g: &GraphMut<'_>) {
        self.ensure_indexes_populated(g);
    }

    /// Returns `true` if candidate indexes have been built (either eagerly or
    /// via the lazy mutation-hook trigger).
    pub fn indexes_populated(&self) -> bool {
        self.indexes_populated
    }

    /// Export the HNSW graph of every rule with a vector leg as an opaque
    /// bincoded blob.
    ///
    /// Returns a map from rule name to `(src_blob, dst_blob)`.  An empty `Vec`
    /// means the corresponding side has no initialized HNSW graph.
    pub fn export_hnsw_state(&self) -> BTreeMap<String, (Vec<u8>, Vec<u8>)> {
        let mut out = BTreeMap::new();
        for (name, def) in &self.rules {
            if has_vector_leg(def) {
                if let Some(idx) = self.indexes.get(name) {
                    // A rule still in `pending_builds` has a graph holding a
                    // prefix of its corpus. `pending_builds` is not persisted,
                    // so the blob has to carry that fact itself or a reader
                    // over this snapshot will answer `find_similar` from the
                    // prefix and say nothing about it.
                    let complete = !self.pending_builds.contains_key(name);
                    out.insert(
                        name.clone(),
                        (
                            idx.src_side.export_hnsw_blob(complete),
                            idx.dst_side.export_hnsw_blob(complete),
                        ),
                    );
                }
            }
        }
        out
    }

    /// Returns HNSW state for snapshotting.  When indexes are not yet populated
    /// (clean open with no mutation), returns the retained raw blobs directly so
    /// that a migrate/snapshot does not silently drop fitted indexes.
    pub fn export_hnsw_state_passthrough(&self) -> BTreeMap<String, (Vec<u8>, Vec<u8>)> {
        if !self.indexes_populated {
            let guard = self
                .retained_hnsw_blobs
                .lock()
                .expect("retained_hnsw_blobs lock poisoned");
            if !guard.is_empty() {
                return guard.clone();
            }
        }
        self.export_hnsw_state()
    }

    /// Returns a clone of the retained raw IVF bincode bytes.
    ///
    /// Returns `None` if no bytes are retained (fresh store or indexes already
    /// consumed by a mutation).  Used by `snapshot_with` for passthrough when
    /// indexes have not yet been populated.
    pub fn retained_ivf_bytes_clone(&self) -> Option<Vec<u8>> {
        self.retained_ivf_bytes
            .lock()
            .expect("retained_ivf_bytes lock poisoned")
            .clone()
    }

    /// Restore HNSW graphs from bincoded blobs (overrides any graphs the node
    /// scan built).
    ///
    /// The open paths no longer need this: `reindex_all_load_state` installs the
    /// persisted graphs itself and skips the build for every side it can supply.
    /// It is still used for blobs naming a rule this engine does not hold as
    /// approximate.
    ///
    /// Called from `restore_snapshot_state` in db.rs after reindex.
    pub fn load_hnsw_state(&mut self, blobs: BTreeMap<String, (Vec<u8>, Vec<u8>)>) {
        for (name, (src_blob, dst_blob)) in blobs {
            if let Some(idx) = self.indexes.get_mut(&name) {
                if !src_blob.is_empty() {
                    idx.src_side.load_hnsw_blob(&src_blob);
                }
                if !dst_blob.is_empty() {
                    idx.dst_side.load_hnsw_blob(&dst_blob);
                }
            }
        }
    }

    /// Dst-side HNSW graph that can answer a query of `q_len` for this rule.
    ///
    /// A sliced build still in `pending_builds` is skipped — the graph holds a
    /// prefix of its corpus and must not answer. Live indexes first, then the
    /// lazily-decoded blobs, matching [`Self::hnsw_search_dst`].
    fn dst_hnsw_answering(&self, name: &str, q_len: usize) -> Option<&HnswIndex> {
        if self.pending_builds.contains_key(name) {
            return None;
        }
        let live = self
            .indexes
            .get(name)
            .and_then(|idx| idx.dst_side.hnsw_ref())
            .filter(|h| h.can_answer(q_len));
        let lazy = self
            .lazy_hnsw
            .get()
            .and_then(|l| l.get(name))
            .and_then(|(_, dst)| dst.as_ref())
            .filter(|h| h.can_answer(q_len));
        live.or(lazy)
    }

    /// First dst-side index covering `(dst_label, field)` that can answer.
    fn hnsw_dst_index(&self, field: &str, dst_label: &str, q_len: usize) -> Option<&HnswIndex> {
        for (name, def) in &self.rules {
            if !def.approximate || def.dst_label != dst_label {
                continue;
            }
            if !predicate_covers_field(&def.predicate, field) {
                continue;
            }
            if let Some(h) = self.dst_hnsw_answering(name, q_len) {
                return Some(h);
            }
        }
        None
    }

    /// Find approximate nearest-neighbor ids on the dst side of the first
    /// approximate VectorSimilar rule covering `(dst_label, field)`.
    ///
    /// Returns `None` when no matching rule or HNSW index exists.
    pub fn hnsw_search_dst(
        &self,
        field: &str,
        dst_label: &str,
        q: &[f64],
        k: usize,
    ) -> Option<Vec<(u32, f64)>> {
        self.hnsw_dst_index(field, dst_label, q.len())
            .map(|h| h.search(q, k))
    }

    /// [`Self::hnsw_search_dst`] with an explicit layer-0 beam width, so a
    /// caller can widen the beam the same way exact `VectorSimilar` rules do.
    pub fn hnsw_search_dst_with_ef(
        &self,
        field: &str,
        dst_label: &str,
        q: &[f64],
        k: usize,
        ef: usize,
    ) -> Option<Vec<(u32, f64)>> {
        self.hnsw_dst_index(field, dst_label, q.len())
            .map(|h| h.search_with_ef(q, k, ef))
    }

    /// Number of vectors in the dst-side index that would answer this query.
    pub fn hnsw_dst_len(&self, field: &str, dst_label: &str, q_len: usize) -> Option<usize> {
        self.hnsw_dst_index(field, dst_label, q_len)
            .map(|h| h.len())
    }

    /// Returns `true` if any approximate VectorSimilar rule covers `field`.
    ///
    /// Use as a capability probe before calling `hnsw_search_dst` or
    /// `hnsw_search_any_dst` — presence of the rule guarantees the native Rust
    /// path will be used (HNSW when the index is populated, Rust brute-force
    /// otherwise); it does NOT guarantee a populated HNSW index.
    pub fn hnsw_has_rule(&self, field: &str) -> bool {
        self.rules
            .values()
            .any(|def| def.approximate && predicate_covers_field(&def.predicate, field))
    }

    /// Like `hnsw_search_dst` but searches across **all** dst_labels that have
    /// an approximate VectorSimilar rule covering `field`.
    ///
    /// Results from multiple rules are merged by node id (keeping the maximum
    /// score for any id that appears in more than one rule's index), then
    /// sorted descending and truncated to `k`.
    ///
    /// Returns `None` when no applicable rule has a populated HNSW index
    /// (same sentinel convention as `hnsw_search_dst`).
    pub fn hnsw_search_any_dst(&self, field: &str, q: &[f64], k: usize) -> Option<Vec<(u32, f64)>> {
        self.merge_dst_searches(field, q, k, |h| h.search(q, k))
    }

    /// [`Self::hnsw_search_any_dst`] with an explicit layer-0 beam width.
    pub fn hnsw_search_any_dst_with_ef(
        &self,
        field: &str,
        q: &[f64],
        k: usize,
        ef: usize,
    ) -> Option<Vec<(u32, f64)>> {
        self.merge_dst_searches(field, q, k, |h| h.search_with_ef(q, k, ef))
    }

    /// Sum of vector counts across dst-side indexes covering `field`.
    pub fn hnsw_any_dst_len(&self, field: &str, q_len: usize) -> Option<usize> {
        let mut total = 0usize;
        let mut found = false;
        for (name, def) in &self.rules {
            if !def.approximate {
                continue;
            }
            if !predicate_covers_field(&def.predicate, field) {
                continue;
            }
            if let Some(h) = self.dst_hnsw_answering(name, q_len) {
                found = true;
                total = total.saturating_add(h.len());
            }
        }
        found.then_some(total)
    }

    fn merge_dst_searches(
        &self,
        field: &str,
        q: &[f64],
        k: usize,
        search: impl Fn(&HnswIndex) -> Vec<(u32, f64)>,
    ) -> Option<Vec<(u32, f64)>> {
        let mut merged: std::collections::BTreeMap<u32, f64> = std::collections::BTreeMap::new();
        let mut found_index = false;

        for (name, def) in &self.rules {
            if !def.approximate {
                continue;
            }
            if !predicate_covers_field(&def.predicate, field) {
                continue;
            }
            // As in `hnsw_search_dst`: a half-built graph answers about a prefix
            // of the corpus, so it does not answer here at all. Live index
            // first, then the lazily-decoded blobs — as a *fallback*, not an
            // alternative. `self.indexes` holds an entry for every rule from
            // `from_persist` onwards, so an `else if` here would mean a
            // clean-open handle never reached `lazy_hnsw` at all and answered
            // every label-less query by brute force.
            let Some(h) = self.dst_hnsw_answering(name, q.len()) else {
                continue;
            };
            found_index = true;
            for (id, score) in search(h) {
                merged
                    .entry(id)
                    .and_modify(|s| {
                        if score > *s {
                            *s = score;
                        }
                    })
                    .or_insert(score);
            }
        }

        if !found_index {
            return None;
        }
        let mut result: Vec<(u32, f64)> = merged.into_iter().collect();
        result.sort_by(|a, b| b.1.partial_cmp(&a.1).unwrap_or(std::cmp::Ordering::Equal));
        result.truncate(k);
        Some(result)
    }

    /// Build every rule's candidate index if that has not happened yet.
    ///
    /// A store opened from a snapshot whose WAL is empty replays no frames, so
    /// `consume_retained_state_eager` never runs and every index starts empty.
    /// The first operation that needs one pays for all of them here.
    ///
    /// Retained HNSW and IVF blobs from the snapshot are consumed in the same
    /// step, so the reindex loads them rather than wiping the graphs they hold.
    ///
    /// Every caller that reads `self.indexes` must go through this first.
    /// `indexes_populated` speaks for the whole engine, and probing an index
    /// that was never built yields no candidates — which reads as "this rule
    /// derives nothing" and silently retracts the edges it owns.
    fn ensure_indexes_populated(&mut self, g: &GraphMut<'_>) {
        if self.indexes_populated || self.rules.is_empty() {
            return;
        }
        let hnsw = std::mem::take(
            &mut *self
                .retained_hnsw_blobs
                .lock()
                .expect("retained_hnsw_blobs lock poisoned"),
        );
        let ivf_bytes = self
            .retained_ivf_bytes
            .lock()
            .expect("retained_ivf_bytes lock poisoned")
            .take()
            .unwrap_or_default();
        let ivf = decode_ivf_bytes_to_export(&ivf_bytes);
        self.reindex_all_load_state(g.ids, g.syms, g.labels, g.props, ivf, hnsw);
    }

    /// Register a rule and backfill existing nodes.
    /// Returns Err on failed validate() or duplicate name.
    pub fn create_rule(&mut self, def: RuleDef, g: &mut GraphMut<'_>) -> Result<(), String> {
        def.validate()?;
        if self.rules.contains_key(&def.name) {
            return Err(format!("rule {:?} already exists", def.name));
        }
        // Before this rule's index is built, because the flag set at the end of
        // this function claims every rule's index is ready. Creating a rule is
        // not a mutation, so nothing else would have built the indexes of the
        // rules that already existed, and the next property write would probe
        // them empty and retract their edges.
        self.ensure_indexes_populated(g);
        // Backfilled edges chain like any other derived edge: creating a rule
        // whose edge type an existing via-hop rule hops over recomputes that
        // rule in the same commit.
        let scope = self.begin_chain();
        let name = def.name.clone();
        self.rules.insert(name.clone(), def);
        self.indexes.insert(name.clone(), RuleIndex::default());
        self.provenance.entry(name.clone()).or_default();
        self.tripped.insert(name.clone(), false);
        self.fires.insert(name.clone(), 0);

        // Phase 1: index all existing nodes for this rule.
        let n_total = g.ids.len() as u32;
        let def = self.rules[&name].clone();

        // A corpus that fits in one slice is built inline and backfilled below,
        // byte for byte as it was before 0.6.6. A larger one is built a slice
        // at a time by `pump_index_build`, and this call returns with the rule
        // installed, consistent, and deriving nothing yet.
        let batch = self.build_batch();
        let build_total = hnsw_build_total(&def, g);
        let deferred = build_total > batch as u64;

        // Phase 1a: init HNSW for a rule with a vector leg before inserting
        // nodes so each insert also populates the HNSW graph incrementally.
        if uses_hnsw(&def) {
            let idx = self.indexes.get_mut(&name).unwrap();
            if deferred {
                // Same empty graph `init_hnsw` gives, reached through the
                // adopt-aware entry point so the sliced build and the open-time
                // scan agree on how a graph comes into existence.
                idx.src_side.init_or_adopt_hnsw(&name, &[]);
                idx.dst_side.init_or_adopt_hnsw(&name, &[]);
            } else {
                idx.src_side.init_hnsw(&name);
                idx.dst_side.init_hnsw(&name);
            }
            self.hnsw_builds += 2;
        }

        for id in 0..n_total {
            let label_sym = match g.labels.get(id as usize).copied() {
                Some(s) if s != u32::MAX => s,
                _ => continue,
            };
            let idx = self.indexes.get_mut(&name).unwrap();
            if deferred {
                // The non-vector legs are O(n) and cheap, and the rule would be
                // internally inconsistent without them; only the graph waits.
                index_node_for_rule_deferring_hnsw(id, label_sym, &def, idx, g.syms, g.props);
            } else {
                index_node_for_rule(id, label_sym, &def, idx, g.syms, g.props);
            }
        }

        if deferred {
            self.remember_pending_build(name.clone(), 0, build_total, 0, n_total);
            let (inserted, cursor) = self.run_build_slice(&name, &def, 0, n_total, batch, g);
            let entry = self.pending_builds.get_mut(&name).expect("just inserted");
            entry.indexed = inserted;
            entry.cursor = cursor;
            // The engine's other rules were populated by `ensure_indexes_populated`
            // above and this rule's non-vector legs are whole, so the flag is as
            // true here as it is on the one-commit path.
            self.indexes_populated = true;
            self.release_lazy_hnsw();
            self.end_chain(scope, g);
            return Ok(());
        }

        // Phase 1b: fit IVF clusters for approximate rules (after all nodes indexed).
        // HNSW was built incrementally above; IVF is kept as legacy fallback.
        if def.approximate {
            let idx = self.indexes.get_mut(&name).unwrap();
            idx.src_side.fit_ivf_clusters(&name);
            idx.dst_side.fit_ivf_clusters(&name);
        }

        // Phase 2: streaming backfill.
        // Branches on max_edges semantics:
        //   None    → global-budget path (tripped latch, first-N in BTree order)
        //   Some(k) → per-source top-k path (no tripped latch, score-ordered)
        let mut prov = ProvSets {
            set: self.provenance.get_mut(&name).unwrap(),
            owned: &mut self.owned,
            by_node: &mut self.by_node,
            rule_intern: &mut self.rule_intern,
            intern_rule: &mut self.intern_rule,
            deltas: &mut self.pending_deltas,
            emit: self.emit_deltas,
            retracted: &mut self.retracted,
        };
        if def.via_label.is_some() {
            // Via-hop backfill: bypass the candidate index; use compute_desired_via.
            let budget = edge_budget(&def);
            let et = g.syms.intern(&def.edge_type);
            let src_sym = g.syms.get(&def.src_label);
            let tripped = self.tripped.get_mut(&name).unwrap();
            'via_outer: for id in 0..g.ids.len() as u32 {
                let label_sym = match g.labels.get(id as usize).copied() {
                    Some(s) if s != u32::MAX => s,
                    _ => continue,
                };
                if src_sym != Some(label_sym) {
                    continue;
                }
                let per_src = compute_desired_via(&def, None, ViaAnchor::Src(id), self.doomed, g);
                if let Some(k) = def.max_edges {
                    let top_k = filter_src_top_k(per_src, k, g.ids);
                    apply_per_src_top_k(&def, id, top_k, &mut prov, g);
                } else {
                    for ((s, d), score) in per_src {
                        let triple = (et, s, d);
                        let already = prov.contains(&triple);
                        if !already {
                            if *tripped || prov.len() as u64 >= budget {
                                *tripped = true;
                                break 'via_outer;
                            }
                            let newly = g.add_edge(et, s, d);
                            if newly {
                                prov.insert(&name, triple, g.ids, g.syms);
                            }
                        }
                        let is_owned_here = already || prov.contains(&triple);
                        if is_owned_here {
                            if let Some(p) = &def.weight_prop {
                                g.edge_props.set(et, s, d, p, Value::Float(score));
                            }
                        }
                    }
                }
            }
        } else if let Some(k) = def.max_edges {
            apply_streaming_create_top_k(&def, k, &self.indexes[&name], &mut prov, g);
        } else {
            let tripped = self.tripped.get_mut(&name).unwrap();
            apply_streaming_create(&def, &self.indexes[&name], &mut prov, tripped, g);
        }
        // Fires: one tick per participating node evaluated (same unit as
        // on_node_changed). Empty-graph create_rule therefore leaves fires=0.
        let fires = self.fires.get_mut(&name).unwrap();
        bump_fires_for_participants(&def, g, fires);

        // This rule's index is now populated. If prior rules' indexes were
        // already populated (or there are no other rules) mark the whole engine
        // as ready; otherwise a later reindex_all call will set the flag.
        self.indexes_populated = true;
        self.release_lazy_hnsw();

        self.end_chain(scope, g);
        Ok(())
    }

    /// Remove the rule and exactly its owned edges.  Returns Err if unknown.
    pub fn delete_rule(&mut self, name: &str, g: &mut GraphMut<'_>) -> Result<(), String> {
        if !self.rules.contains_key(name) {
            return Err(format!("rule {:?} not found", name));
        }
        // Retracting a rule's edges chains: a via-hop rule that hopped over them
        // loses its own derived edges in the same commit. The scope spans the
        // survivor rebuilds below too, so the chain runs once at the end.
        let scope = self.begin_chain();
        let def = self.rules.remove(name).unwrap();
        self.indexes.remove(name);
        self.tripped.remove(name);
        self.fires.remove(name);
        // A rule that is gone is not building: its slice state would otherwise
        // keep it in `builds_in_progress` until the next pump noticed.
        self.pending_builds.remove(name);
        self.builds_awaiting_backfill.remove(name);
        let mut leftover = self.provenance.remove(name).unwrap_or_default();
        // intern so the symbol exists; edge_type was already interned at create time.
        let _et = g.syms.intern(&def.edge_type);
        let triples: Vec<Triple> = leftover.iter().copied().collect();
        let mut sets = ProvSets {
            set: &mut leftover,
            owned: &mut self.owned,
            by_node: &mut self.by_node,
            rule_intern: &mut self.rule_intern,
            intern_rule: &mut self.intern_rule,
            deltas: &mut self.pending_deltas,
            emit: self.emit_deltas,
            retracted: &mut self.retracted,
        };
        for triple in triples {
            let (t, s, d) = triple;
            g.topo.remove_edge(t, s, d);
            g.edge_props.remove_edge(t, s, d);
            sets.remove(name, triple, g.ids, g.syms);
        }
        // Surviving rules that share the same edge_type may derive edges that
        // were previously blocked (add_edge returned false because the deleted
        // rule already owned them, so their provenance never recorded them).
        // Rebuilding each such rule lets it claim those edges now that the
        // deleted rule's entries have been removed from the topology.
        let same_etype_survivors: Vec<String> = self
            .rules
            .values()
            .filter(|r| r.edge_type == def.edge_type)
            .map(|r| r.name.clone())
            .collect();
        for survivor in same_etype_survivors {
            // rebuild returns Err only for unknown rules; survivor is live.
            let _ = self.rebuild_inner(&survivor, g);
        }
        self.end_chain(scope, g);
        Ok(())
    }

    /// Called when node `n` is inserted (changed=None) or a field is updated.
    /// - None: all rules where n's label matches either side fire; index gains n.
    /// - Some((field, old_value)): only rules watching `field` fire; index is
    ///   updated using old_value for removal so stale buckets are cleaned.
    ///
    /// For via-hop rules (`def.via_label.is_some()`), also fires when n carries
    /// the via-label: finds all srcs that route through n and recomputes their
    /// derived edges. Via-hop rules bypass the candidate index and use
    /// `compute_desired_via` instead.
    ///
    /// Derived edges written here are chained into via-hop rules before the
    /// call returns (see [`RuleEngine::chain_from`]), so one write reaches a
    /// bounded fixpoint.
    pub fn on_node_changed(
        &mut self,
        n: u32,
        changed: Option<(&str, Option<Value>)>,
        g: &mut GraphMut<'_>,
    ) {
        let scope = self.begin_chain();
        self.on_node_changed_inner(n, changed, g);
        self.end_chain(scope, g);
    }

    fn on_node_changed_inner(
        &mut self,
        n: u32,
        changed: Option<(&str, Option<Value>)>,
        g: &mut GraphMut<'_>,
    ) {
        // Ensure provenance is decoded before diffing against existing edges.
        self.ensure_provenance_loaded_mut();
        // Lazy index build: on restore from a V8 snapshot, candidate indexes
        // start empty to avoid an O(n) scan at open time.  The first mutation
        // pays the cost instead.  Subsequent calls skip this branch.
        // Retained HNSW/IVF blobs from the snapshot are consumed here so the
        // reindex does NOT wipe the loaded HNSW graphs.
        self.ensure_indexes_populated(g);

        let n_label = g.labels.get(n as usize).copied();
        let rule_names: Vec<String> = self.rules.keys().cloned().collect();
        // Only this change's retractions are reclaimed below. A rebuild or a
        // rule deletion goes through the same two functions and may have left
        // entries behind.
        self.retracted.clear();

        for rule_name in rule_names {
            let def = self.rules[&rule_name].clone();

            // Namespace scoping (v0.6.6 §7.4): a scoped rule does not see this
            // node at all, so neither its candidate index nor its derived edges
            // can reach across the boundary. A global rule takes no read here.
            if !rule_sees(&def, n, g) {
                continue;
            }

            if def.via_label.is_some() {
                // --- Via-hop rule path ---
                self.on_node_changed_via(&rule_name, &def, n, n_label, changed.clone(), g);
            } else {
                // --- Standard 2-node rule path ---
                let src_sym = g.syms.get(&def.src_label);
                let dst_sym = g.syms.get(&def.dst_label);
                let as_src = src_sym.is_some() && n_label == src_sym;
                let as_dst = dst_sym.is_some() && n_label == dst_sym;

                let fires = match changed {
                    None => as_src || as_dst,
                    Some((field, _)) => def.watched_fields().contains(field) && (as_src || as_dst),
                };
                if !fires {
                    continue;
                }
                *self.fires.entry(rule_name.clone()).or_default() += 1;

                // --- Index maintenance ---
                if let Some((field, ref old_val)) = changed {
                    let old_val_cloned = old_val.clone();
                    let old_getter = |f: &str| {
                        if f == field {
                            old_val_cloned.clone()
                        } else {
                            g.props.get(n, f).map(|vr| vr.into_value())
                        }
                    };
                    let idx = self.indexes.get_mut(&rule_name).unwrap();
                    if as_src {
                        let spec = src_lookup_spec_for(&def);
                        idx.src_side.remove(&spec, n, &old_getter);
                    }
                    if as_dst {
                        let spec = candidate_spec_for(&def);
                        idx.dst_side.remove(&spec, n, &old_getter);
                    }
                }

                {
                    let cur_getter = |f: &str| g.props.get(n, f).map(|vr| vr.into_value());
                    let idx = self.indexes.get_mut(&rule_name).unwrap();
                    if as_src {
                        let spec = src_lookup_spec_for(&def);
                        idx.src_side.insert(&spec, n, &cur_getter);
                    }
                    if as_dst {
                        let spec = candidate_spec_for(&def);
                        idx.dst_side.insert(&spec, n, &cur_getter);
                    }
                }

                // A rule whose vector index is still being built derives
                // nothing. The write above has gone into the index and will be
                // there when the build completes; deriving from a half-built
                // graph here would put a partial, wrong edge set on the store
                // for the duration, and the backfill that runs when the build
                // finishes derives the whole set anyway. The drift counter is
                // left alone too: a rebuild queued now would throw the sliced
                // build away and redo it in one commit.
                if self.pending_builds.contains_key(&rule_name) {
                    continue;
                }

                self.maybe_queue_ivf_rebuild(&rule_name, &def);

                // --- Desired set + diff-apply ---
                if let Some(k) = def.max_edges {
                    let et = g.syms.intern(&def.edge_type);
                    let affected_srcs_for_n_dst: BTreeSet<u32> = if as_dst {
                        let rid = self.rule_intern.get(&def.name).copied();
                        let mut srcs: BTreeSet<u32> = self
                            .by_node
                            .get(&n)
                            .into_iter()
                            .flatten()
                            .filter(|(r, t, _s, d)| Some(*r) == rid && *t == et && *d == n)
                            .map(|(_, _, s, _)| *s)
                            .collect();
                        // And every source with the edge into `n` whatever
                        // owns it. A top-k rule whose best match is an edge
                        // another rule already owns records nothing for it —
                        // the edge is there — and gives up its own next-best
                        // edge. Found through this rule's provenance alone,
                        // such a source was not re-evaluated when `n` stopped
                        // matching, and the next-best edge stayed missing
                        // until a rebuild (ledger row 83). The edge in the
                        // graph is the only trace of that choice; bounded by
                        // `n`'s in-degree over this edge type.
                        // Only a source for which `n` was a match before
                        // this change can have lost it; one predicate
                        // evaluation each, so a hub the rule never matched
                        // costs no re-evaluation of its in-neighbours.
                        let src_sym = g.syms.get(&def.src_label);
                        let before = changed.as_ref().map(|(f, old)| (*f, old));
                        let in_srcs: Vec<u32> =
                            g.neighbors(et, core_storage::Direction::In, n).to_vec();
                        for s in in_srcs {
                            if !srcs.contains(&s)
                                && g.labels.get(s as usize).copied() == src_sym
                                && rule_sees(&def, s, g)
                                && pair_matched_before(&def, s, n, before, g)
                            {
                                srcs.insert(s);
                            }
                        }
                        srcs
                    } else {
                        BTreeSet::new()
                    };

                    let mut prov = ProvSets {
                        set: self.provenance.entry(rule_name.clone()).or_default(),
                        owned: &mut self.owned,
                        by_node: &mut self.by_node,
                        rule_intern: &mut self.rule_intern,
                        intern_rule: &mut self.intern_rule,
                        deltas: &mut self.pending_deltas,
                        emit: self.emit_deltas,
                        retracted: &mut self.retracted,
                    };

                    if as_src {
                        let desired_n_src =
                            compute_desired(&def, &self.indexes[&rule_name], n, true, g);
                        let top_k = filter_src_top_k(desired_n_src, k, g.ids);
                        apply_per_src_top_k(&def, n, top_k, &mut prov, g);
                    }

                    if as_dst {
                        let new_desired =
                            compute_desired(&def, &self.indexes[&rule_name], n, false, g);
                        let new_srcs: BTreeSet<u32> = new_desired.keys().map(|(s, _)| *s).collect();
                        let affected_srcs: BTreeSet<u32> =
                            affected_srcs_for_n_dst.union(&new_srcs).copied().collect();
                        for src in affected_srcs {
                            if src == n {
                                continue;
                            }
                            let desired_src =
                                compute_desired(&def, &self.indexes[&rule_name], src, true, g);
                            let top_k = filter_src_top_k(desired_src, k, g.ids);
                            apply_per_src_top_k(&def, src, top_k, &mut prov, g);
                        }
                    }
                } else {
                    let mut desired = BTreeMap::new();
                    if as_src {
                        desired.extend(compute_desired(
                            &def,
                            &self.indexes[&rule_name],
                            n,
                            true,
                            g,
                        ));
                    }
                    if as_dst {
                        desired.extend(compute_desired(
                            &def,
                            &self.indexes[&rule_name],
                            n,
                            false,
                            g,
                        ));
                    }
                    let tripped = self.tripped.entry(rule_name.clone()).or_default();
                    apply_desired(
                        &def,
                        desired,
                        Some(n),
                        &mut ProvSets {
                            set: self.provenance.entry(rule_name).or_default(),
                            owned: &mut self.owned,
                            by_node: &mut self.by_node,
                            rule_intern: &mut self.rule_intern,
                            intern_rule: &mut self.intern_rule,
                            deltas: &mut self.pending_deltas,
                            emit: self.emit_deltas,
                            retracted: &mut self.retracted,
                        },
                        tripped,
                        g,
                    );
                }
            }
        }

        let retracted = std::mem::take(&mut self.retracted);
        if !retracted.is_empty() {
            self.reclaim_retracted(&retracted, g);
        }
    }

    /// Let a rule that still desires an edge take it, when the rule that owned
    /// it has just retracted it.
    ///
    /// Two rules may share a source label, a destination label and an edge
    /// type. When both desire the same directed edge the engine gives it one
    /// owner — whichever added it — and the other records nothing, because
    /// `add_edge` reports the edge as already there. So when the owner's
    /// predicate stops holding and it removes the edge, the other rule does
    /// not know it has lost anything: it fires only when a field *it* watches
    /// changes. The edge stayed gone until that rule was rebuilt, or happened
    /// to be fired by a write of its own (ledger row 37).
    ///
    /// `delete_rule` already handles the same collision, by rebuilding the
    /// surviving rules of that edge type. This is the incremental equivalent,
    /// and narrower: each *other* rule over the retracted edge's type is
    /// re-evaluated for the source nodes that just lost an edge, and only for
    /// those (see [`reclaim_targets`](Self::reclaim_targets)). A rule
    /// that still desires the pair finds the edge absent, adds it, and owns
    /// it, at its own weight. A rule that does not, changes nothing.
    ///
    /// It runs after every rule has handled the change, not inside the loop:
    /// rules fire in name order, and a rule that sorts before the owner has
    /// already seen the edge present and recorded nothing by the time the
    /// owner retracts it.
    ///
    /// Candidate indexes are not touched. No property changed for these rules
    /// that the loop above has not already filed, and re-filing a node in an
    /// index is not idempotent for every index kind.
    ///
    /// A via-hop rule is re-evaluated along its hop, as when the source itself
    /// changes (ledger row 84).
    fn reclaim_retracted(&mut self, retracted: &[(u32, Triple)], g: &mut GraphMut<'_>) {
        let doomed = self.doomed;
        for (rule_name, s) in self.reclaim_targets(retracted, g) {
            // Nothing is reclaimed for, or onto, a node being deleted: a rule
            // that finds candidates by key still sees it (ledger row 106).
            if Some(s) == doomed {
                continue;
            }
            let def = self.rules[&rule_name].clone();
            let label = g.labels.get(s as usize).copied();
            if def.via_label.is_some() {
                // A via-hop rule's desired set for `s` is computed along its
                // hop, exactly as when `s` itself changes (ledger row 84).
                let doomed = self.doomed;
                let desired = compute_desired_via(
                    &def,
                    self.indexes.get(&rule_name),
                    ViaAnchor::Src(s),
                    doomed,
                    g,
                );
                let mut prov = ProvSets {
                    set: self.provenance.entry(rule_name.clone()).or_default(),
                    owned: &mut self.owned,
                    by_node: &mut self.by_node,
                    rule_intern: &mut self.rule_intern,
                    intern_rule: &mut self.intern_rule,
                    deltas: &mut self.pending_deltas,
                    emit: self.emit_deltas,
                    retracted: &mut self.retracted,
                };
                if let Some(k) = def.max_edges {
                    let top_k = filter_src_top_k(desired, k, g.ids);
                    apply_per_src_top_k(&def, s, top_k, &mut prov, g);
                } else {
                    let tripped = self.tripped.entry(rule_name.clone()).or_default();
                    if !*tripped {
                        apply_desired_from(&def, desired, s, &mut prov, tripped, g);
                    }
                }
            } else if let Some(k) = def.max_edges {
                let mut desired = compute_desired(&def, &self.indexes[&rule_name], s, true, g);
                if let Some(gone) = doomed {
                    desired.retain(|&(_, d), _| d != gone);
                }
                let top_k = filter_src_top_k(desired, k, g.ids);
                let mut prov = ProvSets {
                    set: self.provenance.entry(rule_name.clone()).or_default(),
                    owned: &mut self.owned,
                    by_node: &mut self.by_node,
                    rule_intern: &mut self.rule_intern,
                    intern_rule: &mut self.intern_rule,
                    deltas: &mut self.pending_deltas,
                    emit: self.emit_deltas,
                    retracted: &mut self.retracted,
                };
                apply_per_src_top_k(&def, s, top_k, &mut prov, g);
            } else {
                // The same desired set a fire for `s` builds: as a source,
                // and as a destination when the rule links a label to
                // itself, so that `apply_desired` does not take edges
                // *into* `s` for ones it should retract.
                let dst_sym = g.syms.get(&def.dst_label);
                let as_dst = dst_sym.is_some() && label == dst_sym;
                let mut desired = compute_desired(&def, &self.indexes[&rule_name], s, true, g);
                if as_dst {
                    desired.extend(compute_desired(
                        &def,
                        &self.indexes[&rule_name],
                        s,
                        false,
                        g,
                    ));
                }
                if let Some(gone) = doomed {
                    desired.retain(|&(a, b), _| a != gone && b != gone);
                }
                let tripped = self.tripped.entry(rule_name.clone()).or_default();
                apply_desired(
                    &def,
                    desired,
                    Some(s),
                    &mut ProvSets {
                        set: self.provenance.entry(rule_name.clone()).or_default(),
                        owned: &mut self.owned,
                        by_node: &mut self.by_node,
                        rule_intern: &mut self.rule_intern,
                        intern_rule: &mut self.intern_rule,
                        deltas: &mut self.pending_deltas,
                        emit: self.emit_deltas,
                        retracted: &mut self.retracted,
                    },
                    tripped,
                    g,
                );
            }
        }
        // What a re-evaluated rule retracts in turn is not chased further.
        self.retracted.clear();
    }

    /// The `(rule, source)` pairs a set of retractions calls for: every rule
    /// *other than the one that retracted* over the same edge type, whose
    /// source label the losing node has.
    ///
    /// Leaving out the retracting rule is what keeps the common case free. A
    /// store where no two rules share an edge type gets an empty list however
    /// many edges one write retracts — and one write can retract thousands,
    /// when a hub loses a tag. Re-evaluating the rule that has just been
    /// evaluated, once for every source, turned a 13 ms write into 1.4 s in
    /// the review of this change.
    fn reclaim_targets(
        &self,
        retracted: &[(u32, Triple)],
        g: &GraphMut<'_>,
    ) -> BTreeSet<(String, u32)> {
        let mut targets = BTreeSet::new();
        for (rule_name, def) in &self.rules {
            if self.pending_builds.contains_key(rule_name) {
                continue;
            }
            let Some(et) = g.syms.get(&def.edge_type) else {
                continue;
            };
            let src_sym = g.syms.get(&def.src_label);
            if src_sym.is_none() {
                continue;
            }
            let id = self.rule_intern.get(rule_name).copied();
            for &(by, (t, s, _)) in retracted {
                if t != et || id == Some(by) {
                    continue;
                }
                if g.labels.get(s as usize).copied() == src_sym && rule_sees(def, s, g) {
                    targets.insert((rule_name.clone(), s));
                }
            }
        }
        targets
    }

    /// Inner handler for `on_node_changed` when the rule is a via-hop rule.
    ///
    /// For each role n can play (src, via, dst), computes and applies the
    /// desired edge set using `compute_desired_via`.
    ///
    /// The dst side of the rule's candidate index is maintained here, because
    /// `compute_desired_via` probes it to narrow destinations: a change to a
    /// `dst_label` node is withdrawn under its previous value and filed under
    /// the current one, exactly as on the non-via path. The src side is left
    /// alone — it would hold `src_label` nodes and nothing probes it. A
    /// predicate the index cannot answer (one holding a `KeyMatch` anywhere)
    /// falls back to the full candidate set instead.
    ///
    /// Incremental correctness by change class:
    /// - **src prop / insert** (`as_src`): re-expand via from n, recompute all
    ///   (n, dst) pairs. `apply_via_for_srcs([n])`.
    /// - **via-node prop change** (`as_via`, field in watched_fields): find
    ///   srcs that hop to n via `via_edge`, recompute their (src, dst) pairs.
    ///   `apply_via_for_srcs(reverse_via_neighbors(n))`.
    /// - **dst prop / insert** (`as_dst`): anchor on n, compute desired for all
    ///   srcs. `apply_via_for_srcs(all_src_label_nodes)`.
    fn on_node_changed_via(
        &mut self,
        rule_name: &str,
        def: &RuleDef,
        n: u32,
        n_label: Option<u32>,
        changed: Option<(&str, Option<Value>)>,
        g: &mut GraphMut<'_>,
    ) {
        let doomed = self.doomed;
        let src_sym = g.syms.get(&def.src_label);
        let dst_sym = g.syms.get(&def.dst_label);
        let via_sym = def.via_label.as_deref().and_then(|l| g.syms.get(l));

        let as_src = src_sym.is_some() && n_label == src_sym;
        let as_dst = dst_sym.is_some() && n_label == dst_sym;
        let as_via = via_sym.is_some() && n_label == via_sym;

        // Via-hop predicates are evaluated between via and dst, so watched_fields
        // cover both via-node and dst-node fields (predicate fields come from the
        // via→dst evaluation). A via-node prop change fires if its field is watched.
        let fires = match changed {
            None => as_src || as_via || as_dst,
            Some((field, _)) => {
                let wf = def.watched_fields();
                (wf.contains(field)) && (as_src || as_via || as_dst)
            }
        };
        if !fires {
            return;
        }
        *self.fires.entry(rule_name.to_string()).or_default() += 1;

        // Keep the dst side of this rule's candidate index current.
        //
        // Via-hop rules used to leave their index alone because nothing read it;
        // `compute_desired_via` now probes it to narrow destinations, so a stale
        // entry would hide a real candidate. Maintenance mirrors the non-via
        // path: withdraw the node under its previous value, then file it under
        // the current one. Only the dst side is touched — the src side of a
        // via-hop rule holds `src_label` nodes, and nothing probes it.
        if as_dst {
            let spec = candidate_spec_for(def);
            let idx = self.indexes.entry(rule_name.to_string()).or_default();
            if let Some((field, ref old_val)) = changed {
                let old_val_cloned = old_val.clone();
                let old_getter = |f: &str| {
                    if f == field {
                        old_val_cloned.clone()
                    } else {
                        g.props.get(n, f).map(|vr| vr.into_value())
                    }
                };
                idx.dst_side.remove(&spec, n, &old_getter);
            }
            let cur_getter = |f: &str| g.props.get(n, f).map(|vr| vr.into_value());
            idx.dst_side.insert(&spec, n, &cur_getter);
        }

        // Collect affected srcs: union of srcs identified from each role.
        let mut affected_srcs: BTreeSet<u32> = BTreeSet::new();
        if as_src {
            affected_srcs.insert(n);
        }
        if as_via {
            // Srcs that hop to this via-node via via_edge (reverse direction).
            let via_edge_str = def.via_edge.as_deref().unwrap();
            let via_dir = def.via_dir.unwrap_or(core_storage::Direction::Out);
            let rev_dir = match via_dir {
                core_storage::Direction::Out => core_storage::Direction::In,
                core_storage::Direction::In => core_storage::Direction::Out,
            };
            if let (Some(via_etype), Some(s_sym)) = (g.syms.get(via_edge_str), src_sym) {
                for &src in g.neighbors(via_etype, rev_dir, n).as_ref() {
                    if g.labels.get(src as usize).copied() == Some(s_sym) {
                        affected_srcs.insert(src);
                    }
                }
            }
        }
        if as_dst {
            // Recompute all srcs whose via-hops might produce edges to n.
            let desired_touching_n = compute_desired_via(
                def,
                self.indexes.get(rule_name),
                ViaAnchor::Dst(n),
                doomed,
                g,
            );
            for (src, _dst) in desired_touching_n.keys() {
                affected_srcs.insert(*src);
            }
            // Also include any srcs that currently have provenance pointing to n.
            let et = g.syms.intern(&def.edge_type);
            let rid = self.rule_intern.get(rule_name).copied();
            let old_srcs: Vec<u32> = self
                .by_node
                .get(&n)
                .into_iter()
                .flatten()
                .filter(|(r, t, _s, d)| Some(*r) == rid && *t == et && *d == n)
                .map(|(_, _, s, _)| *s)
                .collect();
            affected_srcs.extend(old_srcs);
        }

        // For each affected src, compute desired_via(Src) and apply.
        let affected_srcs: Vec<u32> = affected_srcs.into_iter().collect();
        // Borrowed before `prov` takes the provenance fields: disjoint fields of
        // the same struct, so both live across the loop below.
        let rule_index = self.indexes.get(rule_name);

        if let Some(k) = def.max_edges {
            let mut prov = ProvSets {
                set: self.provenance.entry(rule_name.to_string()).or_default(),
                owned: &mut self.owned,
                by_node: &mut self.by_node,
                rule_intern: &mut self.rule_intern,
                intern_rule: &mut self.intern_rule,
                deltas: &mut self.pending_deltas,
                emit: self.emit_deltas,
                retracted: &mut self.retracted,
            };
            for src in affected_srcs {
                let desired_src =
                    compute_desired_via(def, rule_index, ViaAnchor::Src(src), doomed, g);
                let top_k = filter_src_top_k(desired_src, k, g.ids);
                apply_per_src_top_k(def, src, top_k, &mut prov, g);
            }
        } else {
            let tripped = self.tripped.entry(rule_name.to_string()).or_default();
            let budget = edge_budget(def);
            // Apply per-src so each affected src retracts its stale edges and
            // adds its new desired edges independently.
            // Only the source's outgoing edges are retracted: its desired set
            // is computed from it outwards, and for a rule that links a label
            // to itself the edges into it belong to the other sources (ledger
            // row 105; `apply_desired_from`).
            for src in affected_srcs {
                let desired_src =
                    compute_desired_via(def, rule_index, ViaAnchor::Src(src), doomed, g);
                if !*tripped {
                    let mut prov = ProvSets {
                        set: self.provenance.entry(rule_name.to_string()).or_default(),
                        owned: &mut self.owned,
                        by_node: &mut self.by_node,
                        rule_intern: &mut self.rule_intern,
                        intern_rule: &mut self.intern_rule,
                        deltas: &mut self.pending_deltas,
                        emit: self.emit_deltas,
                        retracted: &mut self.retracted,
                    };
                    apply_desired_from(def, desired_src, src, &mut prov, tripped, g);
                }
                // If budget was just tripped inside apply_desired, stop adding
                // but continue retracting stale edges for already-processed srcs
                // (apply_desired handles retracts even when tripped).
                let _ = budget;
            }
        }
    }

    /// Called when a user edge `(etype_str, src_id, dst_id)` is inserted or
    /// deleted (not a derived edge — those are managed by provenance, not here).
    ///
    /// For any via-hop rule where `via_edge == etype_str` and src_id carries
    /// `src_label`, the src_id's desired derived-edge set may have changed:
    /// a new WORKS_AT edge makes a new Org reachable as a via-node, and a
    /// deleted WORKS_AT removes a previously reachable Org.
    ///
    /// This is the only hook the engine exposes for topology changes. It is
    /// called from `db.rs` on `WalRecord::InsertEdge` and `WalRecord::DeleteEdge`
    /// immediately after the topo is updated (so `g.topo` already reflects the
    /// new state), and re-entrantly by [`RuleEngine::chain_from`] for derived
    /// edges a rule just wrote.
    pub fn on_edge_changed(
        &mut self,
        etype_str: &str,
        src_id: u32,
        dst_id: u32,
        g: &mut GraphMut<'_>,
    ) {
        let scope = self.begin_chain();
        self.on_edge_changed_inner(etype_str, src_id, dst_id, g);
        self.end_chain(scope, g);
    }

    fn on_edge_changed_inner(
        &mut self,
        etype_str: &str,
        src_id: u32,
        dst_id: u32,
        g: &mut GraphMut<'_>,
    ) {
        // Ensure provenance is decoded before diffing against existing edges.
        self.ensure_provenance_loaded_mut();
        // Lazy index build: same guard as on_node_changed.  Retained snapshot
        // blobs are consumed to avoid wiping any HNSW graphs.
        self.ensure_indexes_populated(g);
        self.retracted.clear();

        let rule_names: Vec<String> = self.rules.keys().cloned().collect();
        for (rule_idx, rule_name) in rule_names.into_iter().enumerate() {
            let def = self.rules[&rule_name].clone();
            let Some(ref via_edge) = def.via_edge else {
                continue; // not a via-hop rule
            };
            if via_edge != etype_str {
                continue; // edge type doesn't match this rule's via_edge
            }

            // Check that src_id carries src_label and dst_id carries via_label.
            let src_sym = match g.syms.get(&def.src_label) {
                Some(s) => s,
                None => continue,
            };
            let via_sym = match def.via_label.as_deref().and_then(|l| g.syms.get(l)) {
                Some(s) => s,
                None => continue,
            };
            // via_dir == Out → the edge goes src_id → dst_id (src-label node to via-label node)
            // via_dir == In  → the edge goes dst_id ← src_id, i.e., src_id is the via-label
            //                  end and dst_id is the src-label end. Adjust accordingly.
            let via_dir = def.via_dir.unwrap_or(core_storage::Direction::Out);
            let (rule_src, rule_via) = match via_dir {
                core_storage::Direction::Out => (src_id, dst_id),
                core_storage::Direction::In => (dst_id, src_id),
            };

            if g.labels.get(rule_src as usize).copied() != Some(src_sym) {
                continue;
            }
            if g.labels.get(rule_via as usize).copied() != Some(via_sym) {
                continue;
            }

            // Fire-once, scoped to one chain LEVEL. Every edge a level consumes
            // was already in `g.topo` before that level began, and the work
            // below is a *full* recompute of this src's desired set rather than
            // an incremental patch — so a second recompute at the same level can
            // only repeat itself. That argument does not extend across levels: a
            // rule that recomputed at level N may still need to see an edge
            // another rule writes at level N+1, which is why `chain_fired` is
            // cleared per level rather than per write. The key is the rule's
            // ordinal in the BTree-ordered rule set, stable because nothing a
            // chained recompute does can add or remove a rule.
            if self.chain_depth > 0 && !self.chain_fired.insert((rule_idx as u32, rule_src)) {
                continue;
            }

            // Recompute derived edges for rule_src — its via-hop set just changed.
            *self.fires.entry(rule_name.clone()).or_default() += 1;
            let desired_src =
                compute_desired_via(&def, None, ViaAnchor::Src(rule_src), self.doomed, g);

            if let Some(k) = def.max_edges {
                let mut prov = ProvSets {
                    set: self.provenance.entry(rule_name).or_default(),
                    owned: &mut self.owned,
                    by_node: &mut self.by_node,
                    rule_intern: &mut self.rule_intern,
                    intern_rule: &mut self.intern_rule,
                    deltas: &mut self.pending_deltas,
                    emit: self.emit_deltas,
                    retracted: &mut self.retracted,
                };
                let top_k = filter_src_top_k(desired_src, k, g.ids);
                apply_per_src_top_k(&def, rule_src, top_k, &mut prov, g);
            } else {
                let tripped = self.tripped.entry(rule_name.clone()).or_default();
                let mut prov = ProvSets {
                    set: self.provenance.entry(rule_name).or_default(),
                    owned: &mut self.owned,
                    by_node: &mut self.by_node,
                    rule_intern: &mut self.rule_intern,
                    intern_rule: &mut self.intern_rule,
                    deltas: &mut self.pending_deltas,
                    emit: self.emit_deltas,
                    retracted: &mut self.retracted,
                };
                apply_desired_from(&def, desired_src, rule_src, &mut prov, tripped, g);
            }
        }

        // A via-hop rule stops when its hop edge is deleted; a plain rule over
        // the same edge type may still desire what it retracted.
        let retracted = std::mem::take(&mut self.retracted);
        if !retracted.is_empty() {
            self.reclaim_retracted(&retracted, g);
        }
    }

    /// Retract every provenance edge touching `n` across all rules and drop
    /// `n` from every rule index using its *current* props.
    ///
    /// Caller must invoke this while labels/props are still intact (before
    /// tombstone). Rules are walked in BTree name order; touching edges in
    /// BTree triple order. A second call on an already-retracted node is a
    /// no-op (crash-window replay / absent state).
    ///
    /// Retractions chain: a retracted derived edge that some via-hop rule hops
    /// over retracts that rule's edges too, bounded by [`MAX_CHAIN_DEPTH`].
    pub fn on_node_removed(&mut self, n: u32, g: &mut GraphMut<'_>) {
        // `n` is still fully alive here — `db.rs` strips its edges and stamps
        // the label sentinel only after this returns — so mark it doomed for
        // the whole hook, chain included. Without this, a chained via-hop
        // recompute would scan labels, find `n` still matching, and re-derive
        // an edge onto it; the caller's topology sweep would then remove that
        // edge without removing its provenance.
        let prev_doomed = self.doomed;
        self.doomed = Some(n);
        let scope = self.begin_chain();
        self.on_node_removed_inner(n, g);
        self.end_chain(scope, g);
        self.doomed = prev_doomed;
    }

    fn on_node_removed_inner(&mut self, n: u32, g: &mut GraphMut<'_>) {
        // Ensure provenance is decoded before diffing against existing edges.
        self.ensure_provenance_loaded_mut();
        // Only this delete's retractions are reclaimed at the end.
        self.retracted.clear();
        // Lazy index build: same guard as on_node_changed.  Top-k backfill
        // compute_desired consults the candidate index; an empty index would
        // silently produce no backfill.  Consume retained snapshot blobs here
        // rather than wiping any loaded HNSW graphs.
        self.ensure_indexes_populated(g);

        let n_label = g.labels.get(n as usize).copied();
        let rule_names: Vec<String> = self.rules.keys().cloned().collect();

        for rule_name in rule_names {
            let def = self.rules[&rule_name].clone();
            let src_sym = g.syms.get(&def.src_label);
            let dst_sym = g.syms.get(&def.dst_label);
            let as_src = src_sym.is_some() && n_label == src_sym;
            let as_dst = dst_sym.is_some() && n_label == dst_sym;

            {
                let cur_getter = |f: &str| g.props.get(n, f).map(|vr| vr.into_value());
                let idx = self.indexes.get_mut(&rule_name).unwrap();
                if as_src {
                    let spec = src_lookup_spec_for(&def);
                    idx.src_side.remove(&spec, n, &cur_getter);
                }
                if as_dst {
                    let spec = candidate_spec_for(&def);
                    idx.dst_side.remove(&spec, n, &cur_getter);
                }
            }

            // A rule that is still building owns no edges to retract, and a
            // drift rebuild queued now would discard its sliced graph.
            if self.pending_builds.contains_key(&rule_name) {
                continue;
            }
            self.maybe_queue_ivf_rebuild(&rule_name, &def);
        }

        let touching: Vec<(String, Triple)> = self
            .by_node
            .get(&n)
            .into_iter()
            .flatten()
            .map(|&(rid, t, s, d)| (self.intern_rule[rid as usize].clone(), (t, s, d)))
            .collect();

        // Collect srcs that need top-k backfill BEFORE retracting provenance.
        // For top-k rules: when n is a dst, the src loses one from its top-k
        // and needs the next-best candidate added.
        let mut topk_backfill: BTreeSet<(String, u32)> = touching
            .iter()
            .filter_map(|(rule_name, triple)| {
                let &(_, s, d) = triple;
                let def = self.rules.get(rule_name)?;
                def.max_edges?; // only top-k rules need backfill
                if d == n && s != n {
                    Some((rule_name.clone(), s))
                } else {
                    None
                }
            })
            .collect();
        // And the sources whose edge into `n` another rule owns: a top-k rule
        // whose best match was that edge recorded nothing for it and gave up
        // its own next-best, and has no provenance here to say so (ledger row
        // 83). Read from the graph while the edges are still in it.
        for (rule_name, def) in &self.rules {
            if def.max_edges.is_none() || def.via_label.is_some() {
                continue;
            }
            if self.pending_builds.contains_key(rule_name) {
                continue;
            }
            let dst_sym = g.syms.get(&def.dst_label);
            if dst_sym.is_none() || n_label != dst_sym {
                continue;
            }
            let Some(et) = g.syms.get(&def.edge_type) else {
                continue;
            };
            let src_sym = g.syms.get(&def.src_label);
            for s in g.neighbors(et, core_storage::Direction::In, n).iter() {
                if *s != n
                    && g.labels.get(*s as usize).copied() == src_sym
                    && rule_sees(def, *s, g)
                    && pair_matched_before(def, *s, n, None, g)
                {
                    topk_backfill.insert((rule_name.clone(), *s));
                }
            }
        }

        // Sources that hop through `n`, for every via-hop rule `n` is a via
        // node of. The edges such a rule derived through `n` touch neither
        // end at `n`, so the retraction above never sees them; the sources
        // are evaluated again below, with `n` out of the hop (ledger row 104).
        // Read while the hop edges are still in the graph.
        let mut via_srcs: BTreeSet<(String, u32)> = BTreeSet::new();
        for (rule_name, def) in &self.rules {
            let (Some(via_label), Some(via_edge)) = (&def.via_label, &def.via_edge) else {
                continue;
            };
            if self.pending_builds.contains_key(rule_name) {
                continue;
            }
            let via_sym = g.syms.get(via_label);
            if via_sym.is_none() || n_label != via_sym {
                continue;
            }
            let Some(hop) = g.syms.get(via_edge) else {
                continue;
            };
            let back = match def.via_dir.unwrap_or(core_storage::Direction::Out) {
                core_storage::Direction::Out => core_storage::Direction::In,
                core_storage::Direction::In => core_storage::Direction::Out,
            };
            let src_sym = g.syms.get(&def.src_label);
            for s in g.neighbors(hop, back, n).iter() {
                if *s != n && g.labels.get(*s as usize).copied() == src_sym {
                    via_srcs.insert((rule_name.clone(), *s));
                }
            }
        }

        for (rule_name, triple) in touching {
            let (t, s, d) = triple;
            g.topo.remove_edge(t, s, d);
            g.edge_props.remove_edge(t, s, d);
            if let Some(set) = self.provenance.get_mut(&rule_name) {
                ProvSets {
                    set,
                    owned: &mut self.owned,
                    by_node: &mut self.by_node,
                    rule_intern: &mut self.rule_intern,
                    intern_rule: &mut self.intern_rule,
                    deltas: &mut self.pending_deltas,
                    emit: self.emit_deltas,
                    retracted: &mut self.retracted,
                }
                .remove(&rule_name, triple, g.ids, g.syms);
            }
        }

        // Backfill top-k srcs whose dst was removed.
        // By now n is removed from the dst index (done in the first loop above),
        // so compute_desired(src, true) will not include n in candidates — the
        // resulting top-k automatically promotes the next-best candidate.
        for (rule_name, src) in topk_backfill {
            let def = self.rules[&rule_name].clone();
            let k = def.max_edges.unwrap(); // guarded by filter above
                                            // Via-hop rules cannot be evaluated through the candidate index; the
                                            // index path would return nothing and retract this source's whole
                                            // set. `self.doomed` keeps the node being deleted out of the result.
            let mut desired_src = if def.via_edge.is_some() {
                compute_desired_via(&def, None, ViaAnchor::Src(src), self.doomed, g)
            } else {
                compute_desired(&def, &self.indexes[&rule_name], src, true, g)
            };
            // Not the node being deleted. The index path leaves it out because
            // it has left the index, but a KeyMatch rule finds its candidates
            // by key, and the doomed node still answers to its key here: it
            // was re-picked, its edge re-added with provenance, and the delete
            // then swept the edge and left the provenance (ledger row 106).
            if let Some(gone) = self.doomed {
                desired_src.retain(|&(_, d), _| d != gone);
            }
            let top_k = filter_src_top_k(desired_src, k, g.ids);
            let mut prov = ProvSets {
                set: self.provenance.entry(rule_name.clone()).or_default(),
                owned: &mut self.owned,
                by_node: &mut self.by_node,
                rule_intern: &mut self.rule_intern,
                intern_rule: &mut self.intern_rule,
                deltas: &mut self.pending_deltas,
                emit: self.emit_deltas,
                retracted: &mut self.retracted,
            };
            apply_per_src_top_k(&def, src, top_k, &mut prov, g);
        }

        for (rule_name, src) in via_srcs {
            let def = self.rules[&rule_name].clone();
            let doomed = self.doomed;
            // Through the rule's index, as any other re-evaluation of a via
            // source: without it every source scanned every destination,
            // and deleting a via node that 50,000 sources hop through took
            // minutes.
            let desired = compute_desired_via(
                &def,
                self.indexes.get(&rule_name),
                ViaAnchor::Src(src),
                doomed,
                g,
            );
            let mut prov = ProvSets {
                set: self.provenance.entry(rule_name.clone()).or_default(),
                owned: &mut self.owned,
                by_node: &mut self.by_node,
                rule_intern: &mut self.rule_intern,
                intern_rule: &mut self.intern_rule,
                deltas: &mut self.pending_deltas,
                emit: self.emit_deltas,
                retracted: &mut self.retracted,
            };
            if let Some(k) = def.max_edges {
                let top_k = filter_src_top_k(desired, k, g.ids);
                apply_per_src_top_k(&def, src, top_k, &mut prov, g);
            } else {
                let tripped = self.tripped.entry(rule_name.clone()).or_default();
                apply_desired_from(&def, desired, src, &mut prov, tripped, g);
            }
        }

        // What those re-evaluations retracted, another rule over the same edge
        // type may still want: the second pass, as after any other change
        // (row 37). Edges into the node being deleted are left out of it.
        let retracted = std::mem::take(&mut self.retracted);
        if !retracted.is_empty() {
            self.reclaim_retracted(&retracted, g);
        }
    }

    /// Recompute one rule from scratch. Only exit from the tripped latch.
    ///
    /// If the full desired set fits in the budget, it is applied completely
    /// and `tripped` is cleared. If it still exceeds the budget, existing
    /// provenance is left completely untouched and `tripped` stays true
    /// (rebuild-is-noop for at/over-cap rules). Always counts as a fire
    /// evaluation per participating node. Returns Err if unknown.
    ///
    /// A via-hop rule is never rebuilt through the candidate index — its
    /// predicate holds between the via node and the destination, which the
    /// index cannot express — so it goes through [`apply_via_rebuild`] or the
    /// via arm of [`apply_streaming_rebuild_top_k`] instead.
    pub fn rebuild(&mut self, name: &str, g: &mut GraphMut<'_>) -> Result<(), String> {
        let scope = self.begin_chain();
        let out = self.rebuild_inner(name, g);
        self.end_chain(scope, g);
        out
    }

    /// `rebuild` without the chaining scope, for callers that already hold one
    /// (`delete_rule` rebuilds every same-etype survivor and must chain once,
    /// at its own exit, not once per survivor).
    fn rebuild_inner(&mut self, name: &str, g: &mut GraphMut<'_>) -> Result<(), String> {
        if !self.rules.contains_key(name) {
            return Err(format!("rule {:?} not found", name));
        }
        self.rebuild_needed.remove(name);
        // A full reindex builds the whole graph, so whatever a sliced build had
        // left to do is done by the time this returns.
        self.pending_builds.remove(name);
        let def = self.rules[name].clone();

        // The rebuild a finished slice-build asks for is about the derived
        // edges, not the graph: rebuilding the graph here would redo, in one
        // commit, exactly the superlinear build the slicing spent several
        // commits avoiding. So that one caller carries its graph across the
        // reset and the scan skips the ids it holds. Every other caller —
        // IVF drift, `delete_rule`'s survivors, an explicit `rebuild_rule` —
        // keeps today's behaviour and rebuilds (and thereby compacts) it.
        let carry = uses_hnsw(&def) && self.builds_awaiting_backfill.remove(name);
        let carried = if carry {
            self.indexes
                .get_mut(name)
                .map(|idx| (idx.src_side.take_hnsw(), idx.dst_side.take_hnsw()))
        } else {
            None
        };

        // Reindex this rule from scratch (indexes only).
        *self.indexes.get_mut(name).unwrap() = RuleIndex::default();

        // Init HNSW before indexing so inserts populate the graph incrementally.
        let mut skip: (BTreeSet<u32>, BTreeSet<u32>) = (BTreeSet::new(), BTreeSet::new());
        if uses_hnsw(&def) {
            let (src_h, dst_h) = carried.unwrap_or((None, None));
            let mut built = 0u64;
            let idx = self.indexes.get_mut(name).unwrap();
            match src_h {
                Some(h) => {
                    // `accounted_ids`, for the reason the open path and the
                    // sliced build use it: a carried graph keeps its parked and
                    // refused state in memory, and re-offering a parked vector
                    // destroys it — `insert` supersedes the parked copy and
                    // then refuses the vector against the elected stride.
                    skip.0 = h.accounted_ids();
                    idx.src_side.adopt_hnsw(h);
                }
                None => {
                    idx.src_side.init_hnsw(name);
                    built += 1;
                }
            }
            match dst_h {
                Some(h) => {
                    // Same reason as the src side above.
                    skip.1 = h.accounted_ids();
                    idx.dst_side.adopt_hnsw(h);
                }
                None => {
                    idx.dst_side.init_hnsw(name);
                    built += 1;
                }
            }
            self.hnsw_builds += built;
        }

        let n_total = g.ids.len() as u32;
        for id in 0..n_total {
            let label_sym = match g.labels.get(id as usize).copied() {
                Some(s) if s != u32::MAX => s,
                _ => continue,
            };
            let idx = self.indexes.get_mut(name).unwrap();
            index_node_for_rule_skipping(id, label_sym, &def, idx, g.syms, g.props, &skip);
        }

        // Fit IVF clusters for approximate rules after reindex (drift reset).
        // HNSW was built incrementally; IVF kept as legacy fallback.
        if def.approximate {
            let idx = self.indexes.get_mut(name).unwrap();
            idx.src_side.fit_ivf_clusters(name);
            idx.dst_side.fit_ivf_clusters(name);
        }

        // Streaming rebuild: branches on max_edges semantics.
        //   None    → global-budget path (may no-op if still over budget)
        //   Some(k) → per-source top-k rebuild (always converges; no tripped latch)
        // Via-hop rules take the via path in both arms: their predicate is
        // evaluated between the via node and the dst, which the candidate index
        // cannot express.
        let doomed = self.doomed;
        let mut prov = ProvSets {
            set: self.provenance.get_mut(name).unwrap(),
            owned: &mut self.owned,
            by_node: &mut self.by_node,
            rule_intern: &mut self.rule_intern,
            intern_rule: &mut self.intern_rule,
            deltas: &mut self.pending_deltas,
            emit: self.emit_deltas,
            retracted: &mut self.retracted,
        };
        if let Some(k) = def.max_edges {
            apply_streaming_rebuild_top_k(&def, k, &self.indexes[name], doomed, &mut prov, g);
        } else {
            let tripped = self.tripped.get_mut(name).unwrap();
            if def.via_edge.is_some() {
                apply_via_rebuild(&def, doomed, &mut prov, tripped, g);
            } else {
                apply_streaming_rebuild(&def, &self.indexes[name], &mut prov, tripped, g);
            }
        }
        let fires = self.fires.entry(name.to_string()).or_default();
        bump_fires_for_participants(&def, g, fires);

        Ok(())
    }

    #[cfg(test)]
    fn by_node_consistent(&self) -> bool {
        let (rebuilt, intern, names) = rebuild_by_node(&self.provenance);
        resolve_by_node(&self.by_node, &self.intern_rule) == resolve_by_node(&rebuilt, &names)
            && intern.len() == names.len()
    }
}

// ---------------------------------------------------------------------------
// Tests
// ---------------------------------------------------------------------------

#[cfg(test)]
mod tests {
    use super::*;
    use crate::def::{evaluate, NodeView, Predicate, RuleDef};
    use core_storage::{ColumnStore, Direction, EdgeProps, IdMap, Interner, Topology, Value};

    struct Fx {
        ids: IdMap,
        syms: Interner,
        labels: Vec<u32>,
        props: ColumnStore,
        topo: Topology,
        eprops: EdgeProps,
    }
    impl Fx {
        fn new() -> Self {
            Fx {
                ids: IdMap::new(),
                syms: Interner::new(),
                labels: vec![],
                props: ColumnStore::new(),
                topo: Topology::new(),
                eprops: EdgeProps::new(),
            }
        }
        fn add(&mut self, label: &str, key: &str, props: Vec<(&str, Value)>) -> u32 {
            let id = self.ids.get_or_insert(key);
            let sym = self.syms.intern(label);
            self.labels.resize(id as usize + 1, u32::MAX);
            self.labels[id as usize] = sym;
            for (f, v) in props {
                self.props.set(id, f, v);
            }
            id
        }
        fn g(&mut self) -> GraphMut<'_> {
            GraphMut {
                ids: &self.ids,
                syms: &mut self.syms,
                labels: &self.labels,
                props: ColumnsView::owned(&self.props),
                topo: &mut self.topo,
                base_topo: None,
                edge_props: &mut self.eprops,
            }
        }
    }

    fn tags(items: &[&str]) -> Value {
        Value::List(items.iter().map(|s| Value::Str((*s).into())).collect())
    }

    fn overlap_rule() -> RuleDef {
        RuleDef {
            name: "rel".into(),
            src_label: "A".into(),
            dst_label: "A".into(),
            predicate: Predicate::Overlap {
                field: "tags".into(),
                min: 0.4,
            },
            edge_type: "REL".into(),
            weight_prop: Some("score".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    fn emb(xs: &[f64]) -> Value {
        Value::List(xs.iter().copied().map(Value::Float).collect())
    }

    fn approx_vec_rule() -> RuleDef {
        RuleDef {
            name: "sim".into(),
            src_label: "V".into(),
            dst_label: "V".into(),
            predicate: Predicate::VectorSimilar {
                field: "emb".into(),
                min: 0.5,
            },
            edge_type: "SIM".into(),
            weight_prop: None,
            max_edges: None,
            approximate: true,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    // -----------------------------------------------------------------------
    // reindex_all_load_state: reuse the persisted HNSW graph, never rebuild it
    // -----------------------------------------------------------------------

    /// A populated engine plus the fixture that built it, ready to be reindexed
    /// into a fresh engine the way an open would.
    fn approx_fixture() -> (Fx, RuleEngine) {
        let mut fx = Fx::new();
        for i in 0..8 {
            let t = i as f64 * std::f64::consts::FRAC_PI_4;
            fx.add(
                "V",
                &format!("v{i}"),
                vec![("emb", emb(&[t.cos(), t.sin()]))],
            );
        }
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(approx_vec_rule(), &mut g).unwrap();
        }
        (fx, eng)
    }

    fn reopened(
        fx: &Fx,
        ivf: BTreeMap<String, RuleIvfExport>,
        hnsw: BTreeMap<String, (Vec<u8>, Vec<u8>)>,
    ) -> RuleEngine {
        let mut eng = RuleEngine::from_persist(
            vec![approx_vec_rule()],
            BTreeMap::new(),
            BTreeMap::new(),
            BTreeMap::new(),
        );
        eng.reindex_all_load_state(
            &fx.ids,
            &fx.syms,
            &fx.labels,
            ColumnsView::owned(&fx.props),
            ivf,
            hnsw,
        );
        eng
    }

    /// The open path must install the persisted graph rather than build one the
    /// install would immediately throw away.
    #[test]
    fn reindex_with_persisted_hnsw_skips_the_build() {
        let (fx, eng) = approx_fixture();
        assert!(
            eng.hnsw_build_count() > 0,
            "create_rule builds the graph for the first time"
        );
        let before = eng.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4);
        assert!(before.is_some(), "fixture must have a populated HNSW");

        let eng2 = reopened(&fx, eng.export_ivf_state(), eng.export_hnsw_state());
        assert_eq!(
            eng2.hnsw_build_count(),
            0,
            "no HNSW graph may be built when the snapshot persisted one"
        );
        assert_eq!(
            eng2.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4),
            before,
            "the restored graph must answer exactly as the built one did"
        );
    }

    /// No persisted state — a store written before HNSW persistence, or a rule
    /// created since the last snapshot — still gets a full rebuild.
    #[test]
    fn reindex_without_persisted_hnsw_rebuilds() {
        let (fx, eng) = approx_fixture();
        let before = eng.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4);

        let eng2 = reopened(&fx, eng.export_ivf_state(), BTreeMap::new());
        assert_eq!(
            eng2.hnsw_build_count(),
            2,
            "both sides of the rule must be rebuilt when no blob is persisted"
        );
        assert_eq!(eng2.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4), before);
    }

    /// A blob that fails to deserialize falls back to the rebuild rather than
    /// leaving the rule with an empty index.
    #[test]
    fn reindex_with_corrupt_hnsw_blob_rebuilds() {
        let (fx, eng) = approx_fixture();
        let before = eng.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4);

        let mut hnsw = eng.export_hnsw_state();
        for (src, dst) in hnsw.values_mut() {
            src.truncate(src.len() / 2);
            dst.truncate(dst.len() / 2);
        }
        let eng2 = reopened(&fx, eng.export_ivf_state(), hnsw);
        assert_eq!(
            eng2.hnsw_build_count(),
            2,
            "a corrupt blob must cost a rebuild, not an empty index"
        );
        assert_eq!(
            eng2.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4),
            before,
            "the rebuilt graph must answer as the original did"
        );
    }

    /// A node the scan sees but the blob predates must be inserted, not
    /// dropped. Adopting *before* the scan is what makes the load incremental:
    /// the persisted graph is the base, the newer nodes are the delta.
    #[test]
    fn reindex_inserts_nodes_the_blob_predates() {
        let (mut fx, eng) = approx_fixture();
        let hnsw = eng.export_hnsw_state();
        let ivf = eng.export_ivf_state();

        // A node written after that blob was taken.
        fx.add("V", "late", vec![("emb", emb(&[0.999, 0.045]))]);

        let eng2 = reopened(&fx, ivf, hnsw);
        assert_eq!(
            eng2.hnsw_build_count(),
            0,
            "adopting the blob must still skip both builds"
        );
        let late_id = fx.ids.len() as u32 - 1;
        let hits = eng2
            .hnsw_search_dst("emb", "V", &[1.0, 0.0], 8)
            .expect("the dst side must have a graph");
        assert!(
            hits.iter().any(|&(id, _)| id == late_id),
            "a node the blob predates must be inserted by the scan; got {hits:?}"
        );
    }

    /// One side persisted, the other not: only the missing side is rebuilt.
    #[test]
    fn reindex_rebuilds_only_the_side_without_a_blob() {
        let (fx, eng) = approx_fixture();
        let mut hnsw = eng.export_hnsw_state();
        for (src, _) in hnsw.values_mut() {
            src.clear();
        }
        let eng2 = reopened(&fx, eng.export_ivf_state(), hnsw);
        assert_eq!(eng2.hnsw_build_count(), 1);
        assert_eq!(
            eng2.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4),
            eng.hnsw_search_dst("emb", "V", &[1.0, 0.0], 4)
        );
    }

    #[test]
    fn approximate_rule_rebuilds_after_drift_threshold() {
        with_ivf_drift_rebuild(1, || {
            let mut fx = Fx::new();
            let mut ids = Vec::new();
            for i in 0..6 {
                let x = i as f64 * 0.2;
                ids.push(fx.add("V", &format!("v{i}"), vec![("emb", emb(&[x, 1.0 - x]))]));
            }
            let mut eng = RuleEngine::new();
            {
                let mut g = fx.g();
                eng.create_rule(approx_vec_rule(), &mut g).unwrap();
            }
            assert!(eng.take_rebuild_needed().is_empty());
            {
                let mut g = fx.g();
                eng.on_node_removed(ids[0], &mut g);
            }
            assert!(
                eng.take_rebuild_needed().is_empty(),
                "drift=1 is not > threshold 1"
            );
            {
                let mut g = fx.g();
                eng.on_node_removed(ids[1], &mut g);
            }
            assert_eq!(eng.take_rebuild_needed(), vec!["sim".to_string()]);
            {
                let mut g = fx.g();
                eng.rebuild("sim", &mut g).unwrap();
            }
            assert!(
                eng.take_rebuild_needed().is_empty(),
                "rebuild must reset drift and not re-queue itself"
            );
            let drift = eng
                .export_ivf_state()
                .get("sim")
                .map(|(_, dst)| dst.2)
                .unwrap();
            assert_eq!(drift, 0, "rebuild resets dst-side IVF drift");
        });
    }

    #[test]
    fn backfill_creates_edges_with_scores_and_delete_removes_exactly_them() {
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let _c = fx.add("A", "c", vec![("tags", tags(&["q"]))]);
        // pre-existing user edge with same type: must survive rule delete
        let et = fx.syms.intern("REL");
        fx.topo.add_edge(et, a, b);
        let mut eng = RuleEngine::new();
        let mut g = fx.g();
        eng.create_rule(overlap_rule(), &mut g).unwrap();
        // a↔b jaccard 1.0 both directions; user edge a→b pre-existed so only b→a is owned
        assert!(g.topo.neighbors(et, Direction::Out, b).contains(&a));
        assert_eq!(
            g.edge_props.get(et, b, a, "score"),
            Some(&Value::Float(1.0))
        );
        assert!(!eng.is_owned(et, a, b));
        assert!(eng.is_owned(et, b, a));
        eng.delete_rule("rel", &mut g).unwrap();
        assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b)); // user edge kept
        assert!(!g.topo.neighbors(et, Direction::Out, b).contains(&a)); // derived removed
        assert_eq!(g.edge_props.get(et, b, a, "score"), None);
    }

    #[test]
    fn incremental_update_adds_and_removes_edges() {
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["y", "z"]))]);
        let et = fx.syms.intern("REL");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(overlap_rule(), &mut g).unwrap(); // jaccard 1/3 < 0.4 → no edges
            assert_eq!(g.topo.edge_count(), 0);
        }
        // b's tags change to overlap strongly
        let old = fx.props.get(b, "tags").cloned();
        fx.props.set(b, "tags", tags(&["x", "y"]));
        {
            let mut g = fx.g();
            eng.on_node_changed(b, Some(("tags", old)), &mut g);
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
            assert!(g.topo.neighbors(et, Direction::Out, b).contains(&a));
        }
        // and change away again → edges retract
        let old = fx.props.get(b, "tags").cloned();
        fx.props.set(b, "tags", tags(&["qqq"]));
        let mut g = fx.g();
        eng.on_node_changed(b, Some(("tags", old)), &mut g);
        assert_eq!(g.topo.edge_count(), 0);
        assert_eq!(g.edge_props.get(et, a, b, "score"), None);
    }

    #[test]
    fn key_match_new_node_links_and_rebuild_is_noop() {
        let mut fx = Fx::new();
        fx.add("C", "c1", vec![]);
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(
                RuleDef {
                    name: "fk".into(),
                    src_label: "T".into(),
                    dst_label: "C".into(),
                    predicate: Predicate::KeyMatch {
                        field: "cid".into(),
                    },
                    edge_type: "AT".into(),
                    weight_prop: None,
                    max_edges: None,
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                },
                &mut g,
            )
            .unwrap();
        }
        let t = fx.add("T", "t1", vec![("cid", Value::Str("c1".into()))]);
        let (at, c1, count_before) = {
            let mut g = fx.g();
            eng.on_node_changed(t, None, &mut g);
            let at = g.syms.get("AT").unwrap();
            let c1 = g.ids.get("c1").unwrap();
            assert!(g.topo.neighbors(at, Direction::Out, t).contains(&c1));
            (at, c1, g.topo.edge_count())
        };
        let mut g = fx.g();
        eng.rebuild("fk", &mut g).unwrap();
        assert_eq!(g.topo.edge_count(), count_before); // rebuild is a no-op on consistent state
        assert!(g.topo.neighbors(at, Direction::Out, t).contains(&c1));
    }

    #[test]
    fn score_refresh_on_persisting_owned_edge() {
        // Pins: weight set unconditionally even when add_edge returns false (edge persists).
        // jaccard({x,y,z},{x,y,q}) = |{x,y}|/|{x,y,z,q}| = 2/4 = 0.5 ≥ 0.2 → edges both ways.
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y", "z"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y", "q"]))]);
        let et = fx.syms.intern("SIM");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(
                RuleDef {
                    name: "sim".into(),
                    src_label: "A".into(),
                    dst_label: "A".into(),
                    predicate: Predicate::Overlap {
                        field: "tags".into(),
                        min: 0.2,
                    },
                    edge_type: "SIM".into(),
                    weight_prop: Some("score".into()),
                    max_edges: None,
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                },
                &mut g,
            )
            .unwrap();
            // Both directions present and owned with score ≈ 0.5.
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
            assert!(g.topo.neighbors(et, Direction::Out, b).contains(&a));
            assert!(eng.is_owned(et, a, b) || eng.is_owned(et, b, a));
            let check = |v: Option<&Value>| {
                if let Some(Value::Float(f)) = v {
                    assert!(
                        (f - 0.5).abs() < 1e-9,
                        "initial score should be 0.5, got {f}"
                    );
                }
            };
            check(g.edge_props.get(et, a, b, "score"));
            check(g.edge_props.get(et, b, a, "score"));
        }
        // Change b's tags to match a exactly → jaccard = 1.0.
        let old = fx.props.get(b, "tags").cloned();
        fx.props.set(b, "tags", tags(&["x", "y", "z"]));
        {
            let mut g = fx.g();
            eng.on_node_changed(b, Some(("tags", old)), &mut g);
            // Both directions still present.
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
            assert!(g.topo.neighbors(et, Direction::Out, b).contains(&a));
            // Scores must now be 1.0 on both directions.
            assert_eq!(
                g.edge_props.get(et, a, b, "score"),
                Some(&Value::Float(1.0)),
                "score on a→b must refresh to 1.0"
            );
            assert_eq!(
                g.edge_props.get(et, b, a, "score"),
                Some(&Value::Float(1.0)),
                "score on b→a must refresh to 1.0"
            );
        }
    }

    #[test]
    fn dst_side_keymatch_links_when_c_node_inserted_after_t() {
        // Exercises the synthetic key-probe on src_side Scalar index (dst-side KeyMatch path).
        let mut fx = Fx::new();
        // Insert T node first with cid="c9" — no C node yet → no edge.
        let t = fx.add("T", "t1", vec![("cid", Value::Str("c9".into()))]);
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(
                RuleDef {
                    name: "fk".into(),
                    src_label: "T".into(),
                    dst_label: "C".into(),
                    predicate: Predicate::KeyMatch {
                        field: "cid".into(),
                    },
                    edge_type: "AT".into(),
                    weight_prop: None,
                    max_edges: None,
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                },
                &mut g,
            )
            .unwrap();
            // No C node → no edge.
            let at = g.syms.intern("AT");
            assert_eq!(g.topo.edge_count(), 0, "no C node yet → no edge");
            // t is indexed in src_side with Scalar{cid}="c9"
            let _ = at;
        }
        // Now insert C node "c9" and notify the engine.
        let c9 = fx.add("C", "c9", vec![]);
        {
            let mut g = fx.g();
            eng.on_node_changed(c9, None, &mut g);
            let at = g.syms.get("AT").unwrap();
            // The dst-side path must have probed src_side with key="c9" and found t.
            assert!(
                g.topo.neighbors(at, Direction::Out, t).contains(&c9),
                "T→C edge must appear when C node is inserted"
            );
            assert!(eng.is_owned(at, t, c9));
        }
    }

    #[test]
    fn on_node_removed_retracts_both_sides_and_deindexes() {
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let et = fx.syms.intern("REL");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(overlap_rule(), &mut g).unwrap();
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
            assert!(g.topo.neighbors(et, Direction::Out, b).contains(&a));
        }
        {
            let mut g = fx.g();
            eng.on_node_removed(a, &mut g);
            assert!(!g.topo.neighbors(et, Direction::Out, a).contains(&b));
            assert!(!g.topo.neighbors(et, Direction::Out, b).contains(&a));
            assert_eq!(g.edge_props.get(et, a, b, "score"), None);
            assert_eq!(g.edge_props.get(et, b, a, "score"), None);
            assert!(!eng.is_owned(et, a, b));
            assert!(!eng.is_owned(et, b, a));
        }
        // Partner re-links to a NEW matching node; de-indexed a is not a candidate.
        let c = fx.add("A", "c", vec![("tags", tags(&["x", "y"]))]);
        {
            let mut g = fx.g();
            eng.on_node_changed(c, None, &mut g);
            assert!(g.topo.neighbors(et, Direction::Out, b).contains(&c));
            assert!(g.topo.neighbors(et, Direction::Out, c).contains(&b));
            assert!(!g.topo.neighbors(et, Direction::Out, c).contains(&a));
            assert!(!g.topo.neighbors(et, Direction::Out, a).contains(&c));
        }
        // Second remove is a no-op (crash-window / already-retracted).
        {
            let mut g = fx.g();
            eng.on_node_removed(a, &mut g);
            assert!(g.topo.neighbors(et, Direction::Out, b).contains(&c));
        }
    }

    #[test]
    fn duplicate_name_and_unknown_delete_error() {
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        let mut g = fx.g();
        eng.create_rule(overlap_rule(), &mut g).unwrap();
        assert!(eng.create_rule(overlap_rule(), &mut g).is_err());
        assert!(eng.delete_rule("nope", &mut g).is_err());
    }

    /// C1: two rules sharing the same edge_type both match a pair of nodes.
    /// During backfill of R2, add_edge returns false for edges R1 already owns,
    /// so R2's provenance lacks them.  Deleting R1 removes those edges from the
    /// topology — but the rebuild-survivors step must then re-run R2 so it claims
    /// them.  Deleting R2 afterward must actually remove the edge.
    #[test]
    fn coowned_edge_type_survives_first_delete_gone_after_second() {
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            // R1: Overlap min=0.1 — derives a↔b (jaccard 1.0 ≥ 0.1).
            eng.create_rule(
                RuleDef {
                    name: "r1".into(),
                    src_label: "A".into(),
                    dst_label: "A".into(),
                    predicate: Predicate::Overlap {
                        field: "tags".into(),
                        min: 0.1,
                    },
                    edge_type: "REL2".into(),
                    weight_prop: None,
                    max_edges: None,
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                },
                &mut g,
            )
            .unwrap();
            // R2: same edge_type, Overlap min=0.2 — also derives a↔b.
            eng.create_rule(
                RuleDef {
                    name: "r2".into(),
                    src_label: "A".into(),
                    dst_label: "A".into(),
                    predicate: Predicate::Overlap {
                        field: "tags".into(),
                        min: 0.2,
                    },
                    edge_type: "REL2".into(),
                    weight_prop: None,
                    max_edges: None,
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                },
                &mut g,
            )
            .unwrap();

            let et = g.syms.intern("REL2");
            // Both directions must exist (either rule claims them).
            assert!(
                g.topo.neighbors(et, Direction::Out, a).contains(&b),
                "a→b must exist after both rules created"
            );
            assert!(
                g.topo.neighbors(et, Direction::Out, b).contains(&a),
                "b→a must exist after both rules created"
            );

            // Delete R1 — rebuild-survivors re-runs R2 which must reclaim the edges.
            eng.delete_rule("r1", &mut g).unwrap();
            assert!(
                g.topo.neighbors(et, Direction::Out, a).contains(&b),
                "a→b must survive R1 deletion (R2 rebuilds and claims it)"
            );
            assert!(
                g.topo.neighbors(et, Direction::Out, b).contains(&a),
                "b→a must survive R1 deletion (R2 rebuilds and claims it)"
            );
            // R2 now owns both directions.
            assert!(
                eng.is_owned(et, a, b),
                "a→b must be owned by R2 after rebuild"
            );
            assert!(
                eng.is_owned(et, b, a),
                "b→a must be owned by R2 after rebuild"
            );

            // Delete R2 — no survivor left, edges must be gone.
            eng.delete_rule("r2", &mut g).unwrap();
            assert!(
                !g.topo.neighbors(et, Direction::Out, a).contains(&b),
                "a→b must be gone after both rules deleted"
            );
            assert!(
                !g.topo.neighbors(et, Direction::Out, b).contains(&a),
                "b→a must be gone after both rules deleted"
            );
        }
    }

    /// Defect ledger row 37 (`docs/roadmap/v0.6.10-defects.md`), deferred to
    /// 0.8. Two rules share `(src_label, dst_label, edge_type)` and both
    /// desire `a→b`. An edge has one owner, the rule that added it; the other
    /// records nothing. When the owner's predicate stops holding it removes
    /// the edge without asking whether another rule still desires it, and the
    /// other rule is not fired, because no field it watches changed. The edge
    /// stays gone until that rule is rebuilt or one of its own fields is
    /// written. `delete_rule` already handles the same collision with a
    /// survivor rebuild (`coowned_edge_type_survives_first_delete_gone_after_second`);
    /// incremental retraction has no equivalent.
    ///
    /// This asserts what should be true, so it fails today.
    #[test]
    fn an_edge_two_rules_desire_survives_the_owners_retraction() {
        let rule = |name: &str, predicate: Predicate| RuleDef {
            name: name.into(),
            src_label: "A".into(),
            dst_label: "A".into(),
            predicate,
            edge_type: "SAME".into(),
            weight_prop: Some("weight".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let et = fx.syms.intern("SAME");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            let overlap = Predicate::Overlap {
                field: "tags".into(),
                min: 0.6,
            };
            eng.create_rule(rule("overlap", overlap), &mut g).unwrap();
            let claim = Predicate::KeyMatch { field: "fk".into() };
            eng.create_rule(rule("claim", claim), &mut g).unwrap();
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
        }
        // `a` now names `b` by key: the claim rule desires a→b too.
        fx.props.set(a, "fk", Value::Str("b".into()));
        {
            let mut g = fx.g();
            eng.on_node_changed(a, Some(("fk", None)), &mut g);
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
        }
        // `a`'s tags change: the overlap no longer holds, the claim still does.
        let old = fx.props.get(a, "tags").cloned();
        fx.props.set(a, "tags", tags(&["q"]));
        let mut g = fx.g();
        eng.on_node_changed(a, Some(("tags", old)), &mut g);
        assert!(
            g.topo.neighbors(et, Direction::Out, a).contains(&b),
            "a→b is still desired by the claim rule and must survive the overlap rule's retraction"
        );
        assert_eq!(
            g.edge_props.get(et, a, b, "weight"),
            Some(&Value::Float(1.0)),
            "and it is the claim's edge now, at the claim's weight"
        );
    }

    /// The same collision with the roles reversed: the rule that sorts first
    /// by name owns the edge, and the one that sorts after it takes over.
    /// Together with the test above this covers both orders the rule loop can
    /// meet an owner and a claimant in.
    #[test]
    fn the_surviving_rule_takes_the_edge_whichever_of_the_two_sorts_first() {
        let rule = |name: &str, predicate: Predicate| RuleDef {
            name: name.into(),
            src_label: "A".into(),
            dst_label: "A".into(),
            predicate,
            edge_type: "SAME".into(),
            weight_prop: Some("weight".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut fx = Fx::new();
        let a = fx.add(
            "A",
            "a",
            vec![
                ("tags", tags(&["x", "y", "z"])),
                ("fk", Value::Str("b".into())),
            ],
        );
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let et = fx.syms.intern("SAME");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            // `claim` is created first, so it owns a→b, at 1.0.
            let claim = Predicate::KeyMatch { field: "fk".into() };
            eng.create_rule(rule("claim", claim), &mut g).unwrap();
            let overlap = Predicate::Overlap {
                field: "tags".into(),
                min: 0.6,
            };
            eng.create_rule(rule("overlap", overlap), &mut g).unwrap();
            assert_eq!(
                g.edge_props.get(et, a, b, "weight"),
                Some(&Value::Float(1.0)),
                "the claim owns the edge"
            );
        }
        // `a` stops naming `b`. The overlap (2 of 3) still holds.
        let old = fx.props.get(a, "fk").cloned();
        fx.props.remove(a, "fk");
        let mut g = fx.g();
        eng.on_node_changed(a, Some(("fk", old)), &mut g);
        assert!(
            g.topo.neighbors(et, Direction::Out, a).contains(&b),
            "a→b is still desired by the overlap rule"
        );
        let weight = match g.edge_props.get(et, a, b, "weight") {
            Some(Value::Float(w)) => *w,
            other => panic!("the overlap rule's weight should be on the edge, got {other:?}"),
        };
        assert!(
            (weight - 2.0 / 3.0).abs() < 1e-9,
            "it is the overlap's edge now, at the overlap's score, got {weight}"
        );
    }

    /// When no other rule desires the edge, a retraction is still a retraction.
    #[test]
    fn an_edge_only_its_owner_desired_is_gone_after_the_retraction() {
        let rule = |name: &str, predicate: Predicate| RuleDef {
            name: name.into(),
            src_label: "A".into(),
            dst_label: "A".into(),
            predicate,
            edge_type: "SAME".into(),
            weight_prop: Some("weight".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let et = fx.syms.intern("SAME");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            let overlap = Predicate::Overlap {
                field: "tags".into(),
                min: 0.6,
            };
            eng.create_rule(rule("overlap", overlap), &mut g).unwrap();
            // A second rule over the same labels and edge type that desires nothing here.
            let claim = Predicate::KeyMatch { field: "fk".into() };
            eng.create_rule(rule("claim", claim), &mut g).unwrap();
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
        }
        let old = fx.props.get(a, "tags").cloned();
        fx.props.set(a, "tags", tags(&["q"]));
        let mut g = fx.g();
        eng.on_node_changed(a, Some(("tags", old)), &mut g);
        assert!(
            !g.topo.neighbors(et, Direction::Out, a).contains(&b),
            "nothing desires a→b any more"
        );
        assert_eq!(g.edge_props.get(et, a, b, "weight"), None);
    }

    /// The same takeover when the surviving rule keeps a best-k per source.
    #[test]
    fn a_top_k_rule_takes_an_edge_its_sibling_retracted() {
        let rule = |name: &str, predicate: Predicate, max_edges: Option<u64>| RuleDef {
            name: name.into(),
            src_label: "A".into(),
            dst_label: "A".into(),
            predicate,
            edge_type: "SAME".into(),
            weight_prop: Some("weight".into()),
            max_edges,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut fx = Fx::new();
        let a = fx.add(
            "A",
            "a",
            vec![("tags", tags(&["x", "y"])), ("fk", Value::Str("b".into()))],
        );
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let et = fx.syms.intern("SAME");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            let overlap = Predicate::Overlap {
                field: "tags".into(),
                min: 0.6,
            };
            eng.create_rule(rule("overlap", overlap, None), &mut g)
                .unwrap();
            let claim = Predicate::KeyMatch { field: "fk".into() };
            eng.create_rule(rule("claim", claim, Some(4)), &mut g)
                .unwrap();
            assert!(g.topo.neighbors(et, Direction::Out, a).contains(&b));
        }
        let old = fx.props.get(a, "tags").cloned();
        fx.props.set(a, "tags", tags(&["q"]));
        let mut g = fx.g();
        eng.on_node_changed(a, Some(("tags", old)), &mut g);
        assert!(
            g.topo.neighbors(et, Direction::Out, a).contains(&b),
            "the top-k claim rule still desires a→b and takes it"
        );
        assert_eq!(
            g.edge_props.get(et, a, b, "weight"),
            Some(&Value::Float(1.0))
        );
    }

    /// The second pass is for *other* rules. With one rule there is nobody to
    /// take a retracted edge, and with two the rule that retracted is not
    /// asked again. This is the cost guard: re-evaluating the retracting rule
    /// for every source that lost an edge made a hub's write a hundred times
    /// slower on a store with a single rule.
    #[test]
    fn the_second_pass_never_re_evaluates_the_rule_that_retracted() {
        let rule = |name: &str, predicate: Predicate| RuleDef {
            name: name.into(),
            src_label: "A".into(),
            dst_label: "A".into(),
            predicate,
            edge_type: "SAME".into(),
            weight_prop: None,
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut fx = Fx::new();
        let a = fx.add("A", "a", vec![("tags", tags(&["x", "y"]))]);
        let b = fx.add("A", "b", vec![("tags", tags(&["x", "y"]))]);
        let et = fx.syms.intern("SAME");
        let mut eng = RuleEngine::new();
        let mut g = fx.g();
        let overlap = Predicate::Overlap {
            field: "tags".into(),
            min: 0.6,
        };
        eng.create_rule(rule("overlap", overlap), &mut g).unwrap();
        let by = eng.rule_intern["overlap"];
        let retracted = vec![(by, (et, a, b)), (by, (et, b, a))];

        assert!(
            eng.reclaim_targets(&retracted, &g).is_empty(),
            "one rule: nothing to re-evaluate, however many edges it retracted"
        );

        let claim = Predicate::KeyMatch { field: "fk".into() };
        eng.create_rule(rule("claim", claim), &mut g).unwrap();
        let targets: Vec<(String, u32)> = eng.reclaim_targets(&retracted, &g).into_iter().collect();
        assert_eq!(
            targets,
            vec![("claim".to_string(), a), ("claim".to_string(), b)],
            "two rules: the other one, for each source that lost an edge, and not the retractor"
        );

        // An edge of another type is nobody's business here.
        let other = g.syms.intern("OTHER");
        assert!(eng.reclaim_targets(&[(by, (other, a, b))], &g).is_empty());
    }

    /// Helper: FieldEqual rule with top-k per-source cap.
    fn topk_eq_rule(k: u64) -> RuleDef {
        RuleDef {
            name: "eq".into(),
            src_label: "N".into(),
            dst_label: "N".into(),
            predicate: Predicate::FieldEqual { field: "k".into() },
            edge_type: "EQ".into(),
            weight_prop: None,
            max_edges: Some(k),
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    fn prov_pairs(eng: &RuleEngine, name: &str) -> BTreeSet<(u32, u32)> {
        eng.provenance()
            .get(name)
            .map(|s| s.iter().map(|&(_, a, b)| (a, b)).collect())
            .unwrap_or_default()
    }

    /// k=1: each src gets its single best-scored dst (score DESC, key ASC
    /// tiebreak).  FieldEqual has uniform score 1.0, so the winner is the dst
    /// with the lexicographically smallest key that is not the src itself.
    #[test]
    fn topk_k1_keeps_best_scored_dst() {
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(topk_eq_rule(1), &mut g).unwrap();
        }
        // Insert 4 nodes all sharing k="const".  Keys: n0 < n1 < n2 < n3.
        let mut ids = Vec::new();
        for i in 0..4usize {
            let id = fx.add(
                "N",
                &format!("n{i}"),
                vec![("k", Value::Str("const".into()))],
            );
            ids.push(id);
            let mut g = fx.g();
            eng.on_node_changed(id, None, &mut g);
        }
        let et = fx.syms.get("EQ").unwrap();
        // Each src's single allowed dst must be the smallest key ≠ self.
        // n0 → n1 (smallest other)
        // n1 → n0 (n0 < n1)
        // n2 → n0
        // n3 → n0
        let expected_dsts = [ids[1], ids[0], ids[0], ids[0]];
        for (i, (&src, &expected_dst)) in ids.iter().zip(expected_dsts.iter()).enumerate() {
            let out: Vec<u32> = fx.topo.neighbors(et, Direction::Out, src).to_vec();
            assert_eq!(
                out,
                vec![expected_dst],
                "src n{i} should point only to the best dst"
            );
        }
        assert_eq!(eng.provenance()["eq"].len(), 4);
        assert!(!eng.is_tripped("eq"), "top-k rules never trip");
    }

    /// k=2 insert-evict: adding a better dst evicts the worst of the current k.
    /// Uses NumericWithin (scored) so scores differ across dsts.
    #[test]
    fn topk_insert_evict() {
        // Rule: S→D with VectorSimilar-alike (we use NumericWithin for simplicity).
        // 3 src nodes, numeric field "v"; tolerance 10.0 so score = 1-|Δ|/10.
        // k=1 per source.
        let mut fx = Fx::new();
        let rule = RuleDef {
            name: "nw".into(),
            src_label: "S".into(),
            dst_label: "D".into(),
            predicate: Predicate::NumericWithin {
                field: "v".into(),
                tolerance: 10.0,
            },
            edge_type: "NEAR".into(),
            weight_prop: Some("score".into()),
            max_edges: Some(1),
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(rule, &mut g).unwrap();
        }

        // src s0 with v=0.0
        let s0 = fx.add("S", "s0", vec![("v", Value::Float(0.0))]);
        // dst d_far with v=9.0 → score=0.1 (worst)
        let d_far = fx.add("D", "d_far", vec![("v", Value::Float(9.0))]);
        {
            let mut g = fx.g();
            eng.on_node_changed(s0, None, &mut g);
            eng.on_node_changed(d_far, None, &mut g);
        }
        let et = fx.syms.get("NEAR").unwrap();
        // s0 → d_far (only candidate)
        assert!(fx.topo.neighbors(et, Direction::Out, s0).contains(&d_far));
        assert_eq!(eng.provenance()["nw"].len(), 1);

        // Insert d_close with v=1.0 → score=0.9 (better than d_far).
        let d_close = fx.add("D", "d_close", vec![("v", Value::Float(1.0))]);
        {
            let mut g = fx.g();
            eng.on_node_changed(d_close, None, &mut g);
        }
        // s0 should now point to d_close (evicting d_far).
        let out: Vec<u32> = fx.topo.neighbors(et, Direction::Out, s0).to_vec();
        assert_eq!(out, vec![d_close], "d_close should evict d_far");
        assert!(!fx.topo.neighbors(et, Direction::Out, s0).contains(&d_far));
        assert_eq!(eng.provenance()["nw"].len(), 1);
        assert!(eng.by_node_consistent());
    }

    /// Retract-backfill: removing the best dst causes the next-best to fill in.
    #[test]
    fn topk_retract_backfill() {
        let mut fx = Fx::new();
        let rule = RuleDef {
            name: "nw".into(),
            src_label: "S".into(),
            dst_label: "D".into(),
            predicate: Predicate::NumericWithin {
                field: "v".into(),
                tolerance: 10.0,
            },
            edge_type: "NEAR".into(),
            weight_prop: Some("score".into()),
            max_edges: Some(1),
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        let mut eng = RuleEngine::new();

        let s0 = fx.add("S", "s0", vec![("v", Value::Float(0.0))]);
        let d_close = fx.add("D", "d_close", vec![("v", Value::Float(1.0))]); // score=0.9
        let d_far = fx.add("D", "d_far", vec![("v", Value::Float(8.0))]); // score=0.2
        {
            let mut g = fx.g();
            eng.create_rule(rule, &mut g).unwrap();
        }
        let et = fx.syms.get("NEAR").unwrap();
        // d_close is the top-1 dst.
        assert!(fx.topo.neighbors(et, Direction::Out, s0).contains(&d_close));
        assert!(!fx.topo.neighbors(et, Direction::Out, s0).contains(&d_far));
        assert_eq!(eng.provenance()["nw"].len(), 1);

        // Break d_close's match by pushing its v out of tolerance.
        let old = fx.props.get(d_close, "v").cloned();
        fx.props.set(d_close, "v", Value::Float(50.0));
        {
            let mut g = fx.g();
            eng.on_node_changed(d_close, Some(("v", old)), &mut g);
        }
        // d_far should backfill.
        assert!(!fx.topo.neighbors(et, Direction::Out, s0).contains(&d_close));
        assert!(
            fx.topo.neighbors(et, Direction::Out, s0).contains(&d_far),
            "d_far should backfill after d_close retracted"
        );
        assert_eq!(eng.provenance()["nw"].len(), 1);
        assert!(eng.by_node_consistent());
    }

    /// Tie-breaking: equal scores → dst_key ASC wins.
    #[test]
    fn topk_tie_broken_by_dst_key() {
        // FieldEqual: all dsts have score 1.0 → tiebreak by key.
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(topk_eq_rule(2), &mut g).unwrap();
        }
        // 5 nodes all with k="x" → each src matches 4 others; top-2 by key.
        // Keys: a, b, c, d, e (alphabetical).
        for name in ["a", "b", "c", "d", "e"] {
            let id = fx.add("N", name, vec![("k", Value::Str("x".into()))]);
            let mut g = fx.g();
            eng.on_node_changed(id, None, &mut g);
        }
        let et = fx.syms.get("EQ").unwrap();
        let get_id = |key: &str| fx.ids.get(key).unwrap();
        // Node "a" should point to the two smallest keys that aren't "a": b, c.
        let a = get_id("a");
        let b = get_id("b");
        let c = get_id("c");
        let out_a: BTreeSet<u32> = fx
            .topo
            .neighbors(et, Direction::Out, a)
            .iter()
            .copied()
            .collect();
        assert!(out_a.contains(&b), "a→b (b is best key after a)");
        assert!(out_a.contains(&c), "a→c (c is 2nd best key)");
        assert_eq!(out_a.len(), 2);
        // Node "e" should point to "a" and "b" (two smallest keys ≠ "e").
        let e = get_id("e");
        let out_e: BTreeSet<u32> = fx
            .topo
            .neighbors(et, Direction::Out, e)
            .iter()
            .copied()
            .collect();
        assert!(out_e.contains(&a), "e→a");
        assert!(out_e.contains(&b), "e→b");
        assert_eq!(out_e.len(), 2);
        assert!(eng.by_node_consistent());
    }

    /// When k >= candidate count, all candidates are included (no truncation).
    #[test]
    fn topk_k_larger_than_candidate_count() {
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            // k=100 but only 3 other nodes → all 3 included.
            eng.create_rule(topk_eq_rule(100), &mut g).unwrap();
        }
        for i in 0..4usize {
            let id = fx.add("N", &format!("n{i}"), vec![("k", Value::Str("c".into()))]);
            let mut g = fx.g();
            eng.on_node_changed(id, None, &mut g);
        }
        // 4 nodes × 3 matches each = 12 directed edges.
        assert_eq!(eng.provenance()["eq"].len(), 12);
        assert!(!eng.is_tripped("eq"));
    }

    /// rebuild() with top-k rule re-converges to the correct per-source top-k
    /// after externally removing a node's field.
    #[test]
    fn topk_rebuild_exact() {
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(topk_eq_rule(1), &mut g).unwrap();
        }
        // 3 nodes with k="x" → each gets 1 dst (smallest key ≠ self).
        let _a = fx.add("N", "a", vec![("k", Value::Str("x".into()))]);
        let _b = fx.add("N", "b", vec![("k", Value::Str("x".into()))]);
        let _c = fx.add("N", "c", vec![("k", Value::Str("x".into()))]);
        {
            let mut g = fx.g();
            eng.on_node_changed(_a, None, &mut g);
            eng.on_node_changed(_b, None, &mut g);
            eng.on_node_changed(_c, None, &mut g);
        }
        assert_eq!(eng.provenance()["eq"].len(), 3);

        // rebuild should produce the same result.
        {
            let mut g = fx.g();
            eng.rebuild("eq", &mut g).unwrap();
        }
        assert_eq!(eng.provenance()["eq"].len(), 3);
        assert!(!eng.is_tripped("eq"));
        assert!(eng.by_node_consistent());
    }

    /// by_node index stays consistent across top-k inserts, evictions and rebuild.
    #[test]
    fn topk_by_node_consistent() {
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(topk_eq_rule(2), &mut g).unwrap();
        }
        for i in 0..5usize {
            let id = fx.add(
                "N",
                &format!("n{i}"),
                vec![("k", Value::Str("const".into()))],
            );
            let mut g = fx.g();
            eng.on_node_changed(id, None, &mut g);
        }
        assert!(eng.by_node_consistent(), "consistent after insertions");

        // Evict by changing a prop.
        let id2 = fx.ids.get("n2").unwrap();
        let old = fx.props.get(id2, "k").cloned();
        fx.props.set(id2, "k", Value::Str("other".into()));
        {
            let mut g = fx.g();
            eng.on_node_changed(id2, Some(("k", old)), &mut g);
        }
        assert!(eng.by_node_consistent(), "consistent after eviction");

        {
            let mut g = fx.g();
            eng.rebuild("eq", &mut g).unwrap();
        }
        assert!(eng.by_node_consistent(), "consistent after rebuild");
    }

    fn numeric_rule() -> RuleDef {
        RuleDef {
            name: "nw".into(),
            src_label: "C".into(),
            dst_label: "C".into(),
            predicate: Predicate::NumericWithin {
                field: "year".into(),
                tolerance: 2.0,
            },
            edge_type: "NEAR".into(),
            weight_prop: Some("score".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    fn geo_rule() -> RuleDef {
        RuleDef {
            name: "geo".into(),
            src_label: "City".into(),
            dst_label: "City".into(),
            predicate: Predicate::GeoRadius {
                field: "loc".into(),
                km: 400.0,
            },
            edge_type: "NEAR_GEO".into(),
            weight_prop: Some("score".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    fn vec_rule() -> RuleDef {
        RuleDef {
            name: "vec".into(),
            src_label: "Doc".into(),
            dst_label: "Doc".into(),
            predicate: Predicate::VectorSimilar {
                field: "emb".into(),
                min: 0.9,
            },
            edge_type: "SIM".into(),
            weight_prop: Some("score".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    fn pair_edges(topo: &Topology, et: u32, a: u32, b: u32) -> bool {
        topo.neighbors(et, Direction::Out, a).contains(&b)
            && topo.neighbors(et, Direction::Out, b).contains(&a)
    }

    #[test]
    fn numeric_within_incremental_crosses_bucket_and_clears_old_index() {
        let mut fx = Fx::new();
        let a = fx.add("C", "a", vec![("year", Value::Float(10.0))]);
        let b = fx.add("C", "b", vec![("year", Value::Float(12.0))]);
        let et = fx.syms.intern("NEAR");
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(numeric_rule(), &mut g).unwrap();
            // |12−10| = 2 ≤ 2 → score 0.0 both ways
            assert!(pair_edges(g.topo, et, a, b));
        }

        // 12.0 (bucket 6) → 16.1 (bucket 8): two buckets away, so the old
        // value's ±1 probe no longer reaches b. Match breaks.
        let old = fx.props.get(b, "year").cloned();
        fx.props.set(b, "year", Value::Float(16.1));
        {
            let mut g = fx.g();
            eng.on_node_changed(b, Some(("year", old)), &mut g);
            assert!(!pair_edges(g.topo, et, a, b));
            assert_eq!(g.topo.edge_count(), 0);
        }
        let def = numeric_rule();
        let spec = candidate_spec_for(&def);
        let old_map: std::collections::HashMap<_, _> =
            [("year".to_string(), Value::Float(12.0))].into();
        let old_get = |f: &str| old_map.get(f).cloned();
        let src_hits = eng.indexes["nw"].src_side.candidates(&spec, &old_get);
        let dst_hits = eng.indexes["nw"].dst_side.candidates(&spec, &old_get);
        assert!(!src_hits.contains(&b), "old src bucket must drop b");
        assert!(!dst_hits.contains(&b), "old dst bucket must drop b");
        assert!(src_hits.contains(&a));

        // 16.1 → 11.9 (bucket 5): match returns.
        let old = fx.props.get(b, "year").cloned();
        fx.props.set(b, "year", Value::Float(11.9));
        let mut g = fx.g();
        eng.on_node_changed(b, Some(("year", old)), &mut g);
        assert!(pair_edges(g.topo, et, a, b));
    }

    fn loc_val(lat: f64, lon: f64) -> Value {
        Value::List(vec![Value::Float(lat), Value::Float(lon)])
    }

    fn emb_val(vals: &[f64]) -> Value {
        Value::List(vals.iter().copied().map(Value::Float).collect())
    }

    #[test]
    fn rebuild_is_noop_for_numeric_geo_and_vector() {
        let mut fx = Fx::new();
        let ca = fx.add("C", "ca", vec![("year", Value::Int(1998))]);
        let cb = fx.add("C", "cb", vec![("year", Value::Float(2000.0))]);
        let pa = fx.add("City", "paris", vec![("loc", loc_val(48.8566, 2.3522))]);
        let lo = fx.add("City", "london", vec![("loc", loc_val(51.5074, -0.1278))]);
        let da = fx.add("Doc", "d1", vec![("emb", emb_val(&[1.0, 0.0]))]);
        let db = fx.add("Doc", "d2", vec![("emb", emb_val(&[1.0, 0.0]))]);

        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(numeric_rule(), &mut g).unwrap();
            eng.create_rule(geo_rule(), &mut g).unwrap();
            eng.create_rule(vec_rule(), &mut g).unwrap();
        }

        let (near, ngeo, sim) = (
            fx.syms.get("NEAR").unwrap(),
            fx.syms.get("NEAR_GEO").unwrap(),
            fx.syms.get("SIM").unwrap(),
        );
        assert!(pair_edges(&fx.topo, near, ca, cb));
        assert!(pair_edges(&fx.topo, ngeo, pa, lo));
        assert!(pair_edges(&fx.topo, sim, da, db));
        let before = fx.topo.edge_count();

        {
            let mut g = fx.g();
            eng.rebuild("nw", &mut g).unwrap();
            eng.rebuild("geo", &mut g).unwrap();
            eng.rebuild("vec", &mut g).unwrap();
        }
        assert_eq!(fx.topo.edge_count(), before);
        assert!(pair_edges(&fx.topo, near, ca, cb));
        assert!(pair_edges(&fx.topo, ngeo, pa, lo));
        assert!(pair_edges(&fx.topo, sim, da, db));
    }

    fn fk_rule() -> RuleDef {
        RuleDef {
            name: "works_at".into(),
            src_label: "T".into(),
            dst_label: "C".into(),
            predicate: Predicate::KeyMatch {
                field: "cid".into(),
            },
            edge_type: "AT".into(),
            weight_prop: None,
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    #[test]
    fn by_node_matches_rebuild_after_mutation_storm() {
        let mut fx = Fx::new();
        let hub = fx.add("C", "hub", vec![]);
        let other = fx.add("C", "other", vec![]);
        let mut people = Vec::new();
        for i in 0..40 {
            let cid = if i < 30 { "hub" } else { "other" };
            people.push(fx.add(
                "T",
                &format!("t{i}"),
                vec![("cid", Value::Str(cid.into())), ("tags", tags(&["x", "y"]))],
            ));
        }
        let mut overlap = overlap_rule();
        overlap.src_label = "T".into();
        overlap.dst_label = "T".into();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(fk_rule(), &mut g).unwrap();
            eng.create_rule(overlap, &mut g).unwrap();
        }
        assert!(eng.by_node_consistent());
        assert_eq!(eng.provenance_touching_len(hub), 30);

        // Incremental: re-home half the hub people, flip tags, then restore.
        for (i, &id) in people.iter().enumerate().take(15) {
            let old = fx.props.get(id, "cid").cloned();
            fx.props.set(id, "cid", Value::Str("other".into()));
            let mut g = fx.g();
            eng.on_node_changed(id, Some(("cid", old)), &mut g);
            assert!(
                eng.by_node_consistent(),
                "inconsistent after cid update {i}"
            );
        }
        for &id in people.iter().take(8) {
            let old = fx.props.get(id, "tags").cloned();
            fx.props.set(id, "tags", tags(&["q"]));
            let mut g = fx.g();
            eng.on_node_changed(id, Some(("tags", old)), &mut g);
        }
        assert!(eng.by_node_consistent());

        // Delete-node cleanup uses the reverse index.
        {
            let mut g = fx.g();
            eng.on_node_removed(people[0], &mut g);
        }
        fx.labels[people[0] as usize] = u32::MAX;
        assert!(eng.by_node_consistent());
        assert_eq!(eng.provenance_touching_len(people[0]), 0);

        {
            let mut g = fx.g();
            eng.rebuild("works_at", &mut g).unwrap();
            eng.rebuild("rel", &mut g).unwrap();
        }
        assert!(eng.by_node_consistent());

        {
            let mut g = fx.g();
            eng.delete_rule("rel", &mut g).unwrap();
        }
        assert!(eng.by_node_consistent());
        assert_eq!(eng.provenance_touching(people[1]).count(), 1);

        // Persist-restore rebuilds the reverse index from provenance.
        let (defs, prov, tripped, fires) = eng.to_persist();
        let restored = RuleEngine::from_persist(defs, prov, tripped, fires);
        assert!(restored.by_node_consistent());
        assert_eq!(
            restored.provenance_touching_len(hub),
            eng.provenance_touching_len(hub)
        );
        assert_eq!(
            restored.provenance_touching_len(other),
            eng.provenance_touching_len(other)
        );
    }

    #[test]
    fn provenance_touching_high_degree_hub() {
        let mut fx = Fx::new();
        let hub = fx.add("C", "hub", vec![]);
        let mut first = None;
        for i in 0..256 {
            let id = fx.add(
                "T",
                &format!("t{i}"),
                vec![("cid", Value::Str("hub".into()))],
            );
            if first.is_none() {
                first = Some(id);
            }
        }
        let first = first.unwrap();
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(fk_rule(), &mut g).unwrap();
        }
        assert!(eng.by_node_consistent());
        assert_eq!(eng.provenance_touching_len(hub), 256);
        assert_eq!(eng.provenance_touching_len(first), 1);
        let hits: Vec<_> = eng.provenance_touching(first).collect();
        assert_eq!(hits.len(), 1);
        assert_eq!(hits[0].0, "works_at");
        assert_eq!(hits[0].2, first);
        assert_eq!(hits[0].3, hub);
    }

    /// by_node index stays consistent across global-budget trip and rebuild
    /// (max_edges: None path — DEFAULT_MAX_EDGES = 1_000_000).
    ///
    /// Uses a tiny budget via a special rule with `max_edges: None` but many
    /// nodes to naturally exceed the default; instead we directly test the
    /// None-path by verifying that the by_node index is consistent at each
    /// step of normal insertions and rebuilds.
    #[test]
    fn by_node_consistent_across_inserts_and_rebuild() {
        let mut fx = Fx::new();
        let mut eng = RuleEngine::new();
        let rule = RuleDef {
            name: "eq".into(),
            src_label: "N".into(),
            dst_label: "N".into(),
            predicate: Predicate::FieldEqual { field: "k".into() },
            edge_type: "EQ".into(),
            weight_prop: None,
            max_edges: None, // global-budget path, DEFAULT_MAX_EDGES = 1_000_000
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };
        {
            let mut g = fx.g();
            eng.create_rule(rule, &mut g).unwrap();
        }
        let mut ids = Vec::new();
        for i in 0..6 {
            let id = fx.add(
                "N",
                &format!("n{i}"),
                vec![("k", Value::Str("const".into()))],
            );
            ids.push(id);
            let mut g = fx.g();
            eng.on_node_changed(id, None, &mut g);
        }
        // 6 nodes × 5 matches each = 30 directed edges (well under 1M budget).
        assert_eq!(eng.provenance()["eq"].len(), 30);
        assert!(!eng.is_tripped("eq"));
        assert!(eng.by_node_consistent(), "consistent after insertions");

        // Change one node's field — triggers retract + backfill on that src.
        let old = fx.props.get(ids[3], "k").cloned();
        fx.props.set(ids[3], "k", Value::Str("other".into()));
        {
            let mut g = fx.g();
            eng.on_node_changed(ids[3], Some(("k", old)), &mut g);
        }
        assert!(eng.by_node_consistent(), "consistent after property change");

        {
            let mut g = fx.g();
            eng.rebuild("eq", &mut g).unwrap();
        }
        assert!(!eng.is_tripped("eq"));
        assert!(eng.by_node_consistent(), "consistent after rebuild");
    }

    fn mix64(mut x: u64) -> u64 {
        x = x.wrapping_add(0x9E3779B97F4A7C15);
        x = (x ^ (x >> 30)).wrapping_mul(0xBF58476D1CE4E5B9);
        x = (x ^ (x >> 27)).wrapping_mul(0x94D049BB133111EB);
        x ^ (x >> 31)
    }

    fn rand_emb(seed: u64, i: u32, dim: usize) -> Value {
        let vals: Vec<f64> = (0..dim)
            .map(|d| {
                let bits = mix64(seed ^ ((i as u64 + 1).wrapping_mul(0x100000001)) ^ (d as u64));
                let mut f = (bits as f64) / (u64::MAX as f64) * 2.0 - 1.0;
                if f == 0.0 {
                    f = 1.0;
                }
                f
            })
            .collect();
        emb_val(&vals)
    }

    fn seed_docs(n: u32, seed: u64) -> (Fx, Vec<u32>) {
        let dims = [2usize, 3, 4, 8];
        let mut fx = Fx::new();
        let mut ids = Vec::new();
        for i in 0..n {
            let dim = dims[(i as usize) % dims.len()];
            ids.push(fx.add(
                "Doc",
                &format!("d{i}"),
                vec![("emb", rand_emb(seed, i, dim))],
            ));
        }
        (fx, ids)
    }

    /// Identity proof: 500 mixed-dim vectors, derived edges with the dim
    /// reject on vs forced off (and vs brute-force evaluate) are identical.
    #[test]
    fn vector_dim_reject_matches_unfiltered_and_oracle() {
        const N: u32 = 500;
        const SEED: u64 = 0xC0FF_EE00_D15C;
        let def = vec_rule();

        let (mut fx_on, ids) = seed_docs(N, SEED);
        let mut eng_on = RuleEngine::new();
        {
            let mut g = fx_on.g();
            eng_on.create_rule(def.clone(), &mut g).unwrap();
        }
        let on = prov_pairs(&eng_on, "vec");
        assert!(!on.is_empty(), "seeded set must produce some edges");

        let (mut fx_off, _) = seed_docs(N, SEED);
        let mut eng_off = RuleEngine::new();
        {
            let mut g = fx_off.g();
            with_vector_dim_reject(false, || {
                eng_off.create_rule(def.clone(), &mut g).unwrap();
            });
        }
        assert_eq!(on, prov_pairs(&eng_off, "vec"), "filter vs no-filter");

        let mut brute = BTreeSet::new();
        for &s in &ids {
            for &d in &ids {
                if s == d {
                    continue;
                }
                let skey = fx_on.ids.key_of(s).unwrap();
                let dkey = fx_on.ids.key_of(d).unwrap();
                let sget = |f: &str| fx_on.props.get(s, f).cloned();
                let dget = |f: &str| fx_on.props.get(d, f).cloned();
                if evaluate(
                    &def.predicate,
                    &NodeView {
                        key: skey,
                        props: &sget,
                    },
                    &NodeView {
                        key: dkey,
                        props: &dget,
                    },
                )
                .is_some()
                {
                    brute.insert((s, d));
                }
            }
        }
        assert_eq!(on, brute, "filter vs brute-force evaluate");
    }

    /// Dim change must flow through remove(old)+insert(new); edges match a
    /// fresh engine built from the post-update props.
    #[test]
    fn vector_dim_change_updates_cache_and_matches_fresh_build() {
        let mut fx = Fx::new();
        let a = fx.add("Doc", "a", vec![("emb", emb_val(&[1.0, 0.0]))]);
        let b = fx.add("Doc", "b", vec![("emb", emb_val(&[1.0, 0.0]))]);
        let c = fx.add("Doc", "c", vec![("emb", emb_val(&[1.0, 0.0, 0.0]))]);
        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(vec_rule(), &mut g).unwrap();
        }
        assert_eq!(eng.indexes["vec"].src_side.vec_dim(a), Some(2));
        assert_eq!(eng.indexes["vec"].src_side.vec_dim(c), Some(3));
        assert_eq!(prov_pairs(&eng, "vec"), BTreeSet::from([(a, b), (b, a)]));

        let old = fx.props.get(b, "emb").cloned();
        fx.props.set(b, "emb", emb_val(&[1.0, 0.0, 0.0]));
        {
            let mut g = fx.g();
            eng.on_node_changed(b, Some(("emb", old)), &mut g);
        }
        assert_eq!(eng.indexes["vec"].src_side.vec_dim(b), Some(3));
        assert_eq!(eng.indexes["vec"].dst_side.vec_dim(b), Some(3));
        let after = prov_pairs(&eng, "vec");
        assert_eq!(after, BTreeSet::from([(b, c), (c, b)]));

        // Separate graph: first engine already owns the b↔c edges in `fx.topo`.
        let mut fresh_fx = Fx::new();
        let fa = fresh_fx.add("Doc", "a", vec![("emb", emb_val(&[1.0, 0.0]))]);
        let fb = fresh_fx.add("Doc", "b", vec![("emb", emb_val(&[1.0, 0.0, 0.0]))]);
        let fc = fresh_fx.add("Doc", "c", vec![("emb", emb_val(&[1.0, 0.0, 0.0]))]);
        let mut fresh = RuleEngine::new();
        {
            let mut g = fresh_fx.g();
            fresh.create_rule(vec_rule(), &mut g).unwrap();
        }
        assert_eq!(
            prov_pairs(&fresh, "vec"),
            BTreeSet::from([(fb, fc), (fc, fb)])
        );
        assert_eq!(fresh.indexes["vec"].src_side.vec_dim(fb), Some(3));
        assert_eq!(fresh.indexes["vec"].src_side.vec_dim(fa), Some(2));
    }

    // -----------------------------------------------------------------------
    // Streaming backfill — order-identity and memory-bound tests (Plan 11 M1)
    // -----------------------------------------------------------------------

    /// Top-k order-identity property test.
    ///
    /// For rules with `max_edges: Some(k)` (top-k per-source semantics),
    /// verifies that `create_rule` streaming backfill produces the same
    /// per-source top-k set as an independent brute-force reference.
    ///
    /// The reference is intentionally independent of `filter_src_top_k`:
    /// it sorts candidates inline (score DESC, dst-key ASC, take k) so a
    /// comparator bug cannot self-agree between reference and actual.
    ///
    /// Covers all four `CandidateSpec` paths through `compute_desired`:
    /// - `FieldEqual` → `CandidateSpec::Scalar` (uniform score=1.0, tiebreak by key)
    /// - `NumericWithin` → `CandidateSpec::NumericBucket` (scored, variable top-k)
    /// - `KeyMatch` → `CandidateSpec::ByKey` (FK probe, at most 1 dst per src)
    /// - `VectorSimilar` / `approximate=false` → `CandidateSpec::ScanAll` (scored)
    #[test]
    fn streaming_topk_order_identity_property_test() {
        // Reference: build index, compute_desired per src, then brute-force
        // sort (score DESC, dst-key ASC, take k) — independent of filter_src_top_k.
        fn reference_topk(rule: &RuleDef, k: u64, fx: &mut Fx) -> BTreeSet<(u32, u32)> {
            let mut idx = RuleIndex::default();
            for id in 0..fx.ids.len() as u32 {
                let label_sym = match fx.labels.get(id as usize).copied() {
                    Some(s) if s != u32::MAX => s,
                    _ => continue,
                };
                index_node_for_rule(
                    id,
                    label_sym,
                    rule,
                    &mut idx,
                    &fx.syms,
                    ColumnsView::owned(&fx.props),
                );
            }
            let src_sym = fx.syms.get(&rule.src_label);
            let mut out = BTreeSet::new();
            let ids_snap: Vec<u32> = (0..fx.ids.len() as u32).collect();
            for id in ids_snap {
                let label_sym = match fx.labels.get(id as usize).copied() {
                    Some(s) if s != u32::MAX => s,
                    _ => continue,
                };
                if src_sym != Some(label_sym) {
                    continue;
                }
                let g = GraphMut {
                    ids: &fx.ids,
                    syms: &mut fx.syms,
                    labels: &fx.labels,
                    props: ColumnsView::owned(&fx.props),
                    topo: &mut fx.topo,
                    base_topo: None,
                    edge_props: &mut fx.eprops,
                };
                let per_src = compute_desired(rule, &idx, id, true, &g);
                // Independent brute-force sort: score DESC, dst-key ASC, take k.
                let mut candidates: Vec<((u32, u32), f64)> = per_src.into_iter().collect();
                candidates.sort_by(|&((_, da), sa), &((_, db), sb)| {
                    sb.total_cmp(&sa).then_with(|| {
                        let ka = fx.ids.key_of(da).unwrap_or("");
                        let kb = fx.ids.key_of(db).unwrap_or("");
                        ka.cmp(kb)
                    })
                });
                candidates.truncate(k as usize);
                out.extend(candidates.into_iter().map(|(k, _)| k));
            }
            out
        }

        // Helper: run create_rule and return provenance (src,dst) pairs.
        fn streaming_pairs(rule: RuleDef, fx: &mut Fx) -> BTreeSet<(u32, u32)> {
            let name = rule.name.clone();
            let mut eng = RuleEngine::new();
            eng.create_rule(rule, &mut fx.g()).unwrap();
            eng.provenance()
                .get(&name)
                .map(|s| s.iter().map(|&(_, a, b)| (a, b)).collect())
                .unwrap_or_default()
        }

        // ----------------------------------------------------------------
        // Case 1: FieldEqual (uniform score=1.0, tiebreak by key ASC)
        // N→N, 3-value "k" field; top-k filters per src by key.
        // ----------------------------------------------------------------
        for seed in [0u64, 1, 42, 0xDEAD_BEEF, 0x1234_5678, 99, 12_648_430, 7] {
            for k in [1u64, 2, 3, 5] {
                let rule = RuleDef {
                    name: "eq".into(),
                    src_label: "N".into(),
                    dst_label: "N".into(),
                    predicate: Predicate::FieldEqual { field: "k".into() },
                    edge_type: "EQ".into(),
                    weight_prop: None,
                    max_edges: Some(k),
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                };

                let build = || {
                    let mut fx = Fx::new();
                    for i in 0..12u32 {
                        let h = mix64(seed ^ (i as u64 + 1));
                        let val = match h % 3 {
                            0 => "a",
                            1 => "b",
                            _ => "c",
                        };
                        fx.add(
                            "N",
                            &format!("n{i:02}"),
                            vec![("k", Value::Str(val.into()))],
                        );
                    }
                    fx
                };

                let expected = reference_topk(&rule, k, &mut build());
                let actual = streaming_pairs(rule, &mut build());

                assert_eq!(
                    expected, actual,
                    "FieldEqual seed={seed} k={k}: streaming top-k must match brute-force top-k"
                );
            }
        }

        // ----------------------------------------------------------------
        // Case 2: NumericWithin (scored — top-k filters by score DESC, key ASC)
        // S→D, numeric field "v", tolerance 10.0.
        // ----------------------------------------------------------------
        for seed in [0u64, 1, 42, 7] {
            for k in [1u64, 2, 4] {
                let rule = RuleDef {
                    name: "nw".into(),
                    src_label: "S".into(),
                    dst_label: "D".into(),
                    predicate: Predicate::NumericWithin {
                        field: "v".into(),
                        tolerance: 10.0,
                    },
                    edge_type: "NEAR".into(),
                    weight_prop: Some("score".into()),
                    max_edges: Some(k),
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                };

                let build = || {
                    let mut fx = Fx::new();
                    for i in 0..6u32 {
                        let h = mix64(seed ^ (i as u64 + 1));
                        let v = (h % 20) as f64;
                        fx.add("S", &format!("s{i}"), vec![("v", Value::Float(v))]);
                    }
                    for i in 0..8u32 {
                        let h = mix64(seed ^ (i as u64 + 101));
                        let v = (h % 20) as f64;
                        fx.add("D", &format!("d{i}"), vec![("v", Value::Float(v))]);
                    }
                    fx
                };

                let expected = reference_topk(&rule, k, &mut build());
                let actual = streaming_pairs(rule, &mut build());

                assert_eq!(
                    expected, actual,
                    "NumericWithin seed={seed} k={k}: streaming top-k must match brute-force top-k"
                );
            }
        }

        // ----------------------------------------------------------------
        // Case 3: KeyMatch (CandidateSpec::ByKey)
        // T→C FK rule: each T has a "cid" field whose value is the key of
        // a C node.  Each src has at most 1 candidate, so filter_src_top_k
        // is the identity — but the ByKey candidate path must be exercised.
        // ----------------------------------------------------------------
        for seed in [0u64, 1, 42, 7] {
            for k in [1u64, 2] {
                let rule = RuleDef {
                    name: "fk".into(),
                    src_label: "T".into(),
                    dst_label: "C".into(),
                    predicate: Predicate::KeyMatch {
                        field: "cid".into(),
                    },
                    edge_type: "AT".into(),
                    weight_prop: None,
                    max_edges: Some(k),
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                };

                let build = || {
                    let mut fx = Fx::new();
                    // 4 C nodes.
                    for i in 0..4u32 {
                        fx.add("C", &format!("c{i}"), vec![]);
                    }
                    // 8 T nodes, each pointing at a C node determined by hash.
                    for i in 0..8u32 {
                        let h = mix64(seed ^ (i as u64 + 1));
                        let cid = format!("c{}", h % 4);
                        fx.add("T", &format!("t{i}"), vec![("cid", Value::Str(cid))]);
                    }
                    fx
                };

                let expected = reference_topk(&rule, k, &mut build());
                let actual = streaming_pairs(rule, &mut build());

                assert_eq!(
                    expected, actual,
                    "KeyMatch seed={seed} k={k}: streaming top-k must match brute-force top-k"
                );
            }
        }

        // ----------------------------------------------------------------
        // Case 4: VectorSimilar approximate=false (CandidateSpec::ScanAll)
        // V→V cosine-sim rule.  6 nodes in 2 clusters of 3; min=0.9 so only
        // within-cluster pairs qualify.  top-k=2 filters the 2 best in cluster.
        // ----------------------------------------------------------------
        {
            // cluster A: unit vectors near [1,0]; cluster B: near [0,1].
            let cluster_a: &[(&str, f64, f64)] = &[
                ("va0", 1.0_f64, 0.0_f64),
                ("va1", 0.98_f64, 0.199_f64), // cos(~11.5°) ≈ 0.98
                ("va2", 0.97_f64, 0.243_f64), // cos(~14°) ≈ 0.97
            ];
            let cluster_b: &[(&str, f64, f64)] = &[
                ("vb0", 0.0_f64, 1.0_f64),
                ("vb1", 0.1_f64, 0.995_f64),
                ("vb2", 0.05_f64, 0.999_f64),
            ];
            for k in [1u64, 2] {
                let rule = RuleDef {
                    name: "vsim".into(),
                    src_label: "V".into(),
                    dst_label: "V".into(),
                    predicate: Predicate::VectorSimilar {
                        field: "emb".into(),
                        min: 0.9,
                    },
                    edge_type: "VSIM".into(),
                    weight_prop: Some("score".into()),
                    max_edges: Some(k),
                    approximate: false,
                    via_label: None,
                    via_edge: None,
                    via_dir: None,
                    namespace: None,
                };

                let build = || {
                    let mut fx = Fx::new();
                    let mut add_v = |key: &str, x: f64, y: f64| {
                        let norm = (x * x + y * y).sqrt();
                        let v = Value::List(vec![Value::Float(x / norm), Value::Float(y / norm)]);
                        fx.add("V", key, vec![("emb", v)]);
                    };
                    for &(k, x, y) in cluster_a.iter().chain(cluster_b.iter()) {
                        add_v(k, x, y);
                    }
                    fx
                };

                let expected = reference_topk(&rule, k, &mut build());
                let actual = streaming_pairs(rule, &mut build());

                assert_eq!(
                    expected, actual,
                    "VectorSimilar/ScanAll k={k}: streaming top-k must match brute-force top-k"
                );
            }
        }
    }

    /// Streaming peak-transient allocation bound.
    ///
    /// Measures the PEAK process RSS *during* `create_rule` by polling from a
    /// background sampler thread at ~1 ms intervals.  Unlike a before/after
    /// snapshot this captures transient allocations freed before the call
    /// returns.
    ///
    /// **Why the OLD code would fail this test:**
    /// The old `compute_full_desired` built a global `BTreeMap<(u32,u32),f64>`
    /// for ALL 250 000 desired pairs (500 Talent × 500 Company, same field
    /// value, FieldEqual) before applying the cap.  At ~26 bytes per BTree
    /// entry (amortised node overhead on aarch64) that is ≈6.5 MiB transient
    /// — held for the entire duration of `apply_desired`.  The peak sampler
    /// would observe this spike; the 3 MiB threshold would be exceeded.
    ///
    /// **Why the NEW code passes:**
    /// `apply_streaming_create` caps after ~1 000 evaluations (one pass over
    /// the first few src nodes).  The largest in-flight allocation is one
    /// per-src `BTreeMap` of ≤ 500 entries ≈ 13 KiB — never materialising
    /// the full 250 000-pair map.  Peak transient delta is sub-100 KiB.
    ///
    /// Threshold 3 MiB: old ≈ 6.5 MiB (FAILS); new ≈ 13 KiB (PASSES).
    ///
    /// Marked `#[ignore]` (forks `ps`, environment-dependent).
    /// Run: `cargo test -p core-rules streaming_peak_transient_bound -- --ignored --test-threads=1`
    #[test]
    #[ignore]
    fn streaming_peak_transient_bound() {
        use std::sync::{
            atomic::{AtomicBool, AtomicU64, Ordering},
            Arc,
        };

        // Sample process RSS every ~1 ms from a background thread.
        // Returns the peak RSS observed while `f` executes.
        fn peak_rss_during<F: FnOnce()>(f: F) -> u64 {
            let done = Arc::new(AtomicBool::new(false));
            let peak = Arc::new(AtomicU64::new(0));
            let done2 = done.clone();
            let peak2 = peak.clone();
            let pid = std::process::id().to_string();

            let handle = std::thread::spawn(move || {
                while !done2.load(Ordering::Relaxed) {
                    let rss = std::process::Command::new("ps")
                        .args(["-o", "rss=", "-p", &pid])
                        .output()
                        .ok()
                        .and_then(|o| String::from_utf8(o.stdout).ok())
                        .and_then(|s| s.trim().parse::<u64>().ok())
                        .unwrap_or(0)
                        * 1024;
                    peak2.fetch_max(rss, Ordering::Relaxed);
                    std::thread::sleep(std::time::Duration::from_millis(1));
                }
            });

            f();

            done.store(true, Ordering::Relaxed);
            let _ = handle.join();
            peak.load(Ordering::Relaxed)
        }

        // 500 Talent × 500 Company, all FieldEqual on k="same"
        // → 250 000 desired pairs, top-k = 2 per source (max_edges: Some(2)).
        // Peak transient: one per-src BTreeMap of ≤ 500 entries ≈ 13 KiB.
        let mut fx = Fx::new();
        for i in 0..500u32 {
            fx.add(
                "Talent",
                &format!("t{i}"),
                vec![("k", Value::Str("same".into()))],
            );
        }
        for i in 0..500u32 {
            fx.add(
                "Company",
                &format!("c{i}"),
                vec![("k", Value::Str("same".into()))],
            );
        }
        let rule = RuleDef {
            name: "eq_tc".into(),
            src_label: "Talent".into(),
            dst_label: "Company".into(),
            predicate: Predicate::FieldEqual { field: "k".into() },
            edge_type: "EQ".into(),
            weight_prop: None,
            max_edges: Some(2), // top-k=2 per source; 500 * 2 = 1000 total edges
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };

        // Baseline: RSS before any create_rule allocation.
        let pid = std::process::id().to_string();
        let baseline = std::process::Command::new("ps")
            .args(["-o", "rss=", "-p", &pid])
            .output()
            .ok()
            .and_then(|o| String::from_utf8(o.stdout).ok())
            .and_then(|s| s.trim().parse::<u64>().ok())
            .unwrap_or(0)
            * 1024;

        let mut eng = RuleEngine::new();
        let peak = peak_rss_during(|| {
            eng.create_rule(rule, &mut fx.g()).unwrap();
        });

        let peak_delta = peak.saturating_sub(baseline);

        // Threshold 3 MiB.  Old O(pairs) path: 250k entries × ~26 bytes ≈ 6.5 MiB
        // transient; would exceed threshold.  New streaming path: single per-src
        // BTreeMap ≤ 500 entries ≈ 13 KiB; never approaches threshold.
        assert!(
            peak_delta < 3 * 1024 * 1024,
            "peak transient delta {} bytes ({} KiB) exceeded 3 MiB; \
             streaming path may be building the full pairs map",
            peak_delta,
            peak_delta / 1024
        );
        assert_eq!(eng.provenance()["eq_tc"].len(), 1_000); // 500 Talent × top-k 2 = 1000
        assert!(!eng.is_tripped("eq_tc")); // top-k rules never trip
        eprintln!(
            "streaming_peak_transient_bound: baseline={baseline} peak={peak} \
             delta={peak_delta} bytes ({} KiB)",
            peak_delta / 1024
        );
    }

    // -----------------------------------------------------------------------
    // Task 3 (Plan 11): Checkpointed Cauchy-Schwarz suffix-norm early exit
    // -----------------------------------------------------------------------

    /// Helper: a near-threshold vector pair. Returns (a, b) where cos(a,b) is
    /// just above the provided threshold (so the pair SHOULD match).
    fn near_threshold_pair(dim: usize, min: f64) -> (Vec<f64>, Vec<f64>) {
        // Construct b = cos_target * a + epsilon * perp, then normalise both.
        // For simplicity: a = [1, 0, ..., 0], b = [cos_target, sin_small, 0, ...]
        let cos_target = min + 1e-6; // just above min
        let sin_small = (1.0 - cos_target * cos_target).sqrt();
        let mut a = vec![0.0f64; dim];
        a[0] = 1.0;
        let mut b = vec![0.0f64; dim];
        b[0] = cos_target;
        if dim > 1 {
            b[1] = sin_small;
        }
        (a, b)
    }

    fn emb_val2(xs: &[f64]) -> Value {
        Value::List(xs.iter().copied().map(Value::Float).collect())
    }

    /// Build an identical test fixture twice so ON/OFF/oracle comparisons all
    /// operate on the same graph topology.  Uses dims [2,4,8,16] with a
    /// near-threshold pair at dim=8 to exercise the checkpoint boundaries.
    fn make_early_exit_fixture(seed: u64, min: f64) -> (Fx, Vec<u32>, usize, usize) {
        let dims = [2usize, 4, 8, 16];
        let n = 100u32;
        let mut fx = Fx::new();
        let mut ids = Vec::new();
        for i in 0..n {
            let dim = dims[(i as usize) % dims.len()];
            let emb = rand_emb(seed, i, dim);
            ids.push(fx.add("Doc", &format!("d{i}"), vec![("emb", emb)]));
        }
        // Near-threshold pair at dim=8, cos just above min → must match.
        let (va, vb) = near_threshold_pair(8, min);
        let nt_a = fx.add("Doc", "nt_a", vec![("emb", emb_val2(&va))]);
        let nt_b = fx.add("Doc", "nt_b", vec![("emb", emb_val2(&vb))]);
        ids.push(nt_a);
        ids.push(nt_b);
        (fx, ids, nt_a as usize, nt_b as usize)
    }

    /// Identity proof: derived edges are identical with early-exit ON, OFF,
    /// and vs the brute-force oracle.  Tests mixed dims (2, 4, 8, 16) with
    /// near-threshold cosines (cos ≈ min ± epsilon) to exercise exact rejects.
    #[test]
    fn vector_early_exit_identity_proof() {
        const SEED: u64 = 0xEA_4E_5A;
        const MIN: f64 = 0.85;

        let def = RuleDef {
            name: "vec".into(),
            src_label: "Doc".into(),
            dst_label: "Doc".into(),
            predicate: Predicate::VectorSimilar {
                field: "emb".into(),
                min: MIN,
            },
            edge_type: "SIM".into(),
            weight_prop: Some("score".into()),
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };

        // Build three identical fixtures (independent topo state, same data).
        let (mut fx_on, ids, nt_a, nt_b) = make_early_exit_fixture(SEED, MIN);
        let (mut fx_off, _, _, _) = make_early_exit_fixture(SEED, MIN);
        let (fx_oracle, _, _, _) = make_early_exit_fixture(SEED, MIN);

        let nt_a = nt_a as u32;
        let nt_b = nt_b as u32;

        // Run with early-exit ON (default).
        let mut eng_on = RuleEngine::new();
        {
            let mut g = fx_on.g();
            eng_on.create_rule(def.clone(), &mut g).unwrap();
        }
        let edges_on = prov_pairs(&eng_on, "vec");
        assert!(!edges_on.is_empty(), "should produce some edges");

        // Near-threshold pair must appear with early-exit ON.
        assert!(
            edges_on.contains(&(nt_a, nt_b)),
            "near-threshold pair nt_a→nt_b must match with early-exit ON"
        );
        assert!(
            edges_on.contains(&(nt_b, nt_a)),
            "near-threshold pair nt_b→nt_a must match with early-exit ON"
        );

        // Run with early-exit OFF; must produce identical edge set.
        let mut eng_off = RuleEngine::new();
        {
            let mut g = fx_off.g();
            with_vector_early_exit(false, || {
                eng_off.create_rule(def.clone(), &mut g).unwrap();
            });
        }
        let edges_off = prov_pairs(&eng_off, "vec");
        assert_eq!(
            edges_on, edges_off,
            "early-exit ON vs OFF must produce identical edges"
        );

        // Brute-force oracle: evaluate() on all (s,d) pairs.
        let mut oracle = BTreeSet::new();
        for &s in &ids {
            for &d in &ids {
                if s == d {
                    continue;
                }
                let skey = fx_oracle.ids.key_of(s).unwrap();
                let dkey = fx_oracle.ids.key_of(d).unwrap();
                let sg = |f: &str| fx_oracle.props.get(s, f).cloned();
                let dg = |f: &str| fx_oracle.props.get(d, f).cloned();
                if evaluate(
                    &def.predicate,
                    &NodeView {
                        key: skey,
                        props: &sg,
                    },
                    &NodeView {
                        key: dkey,
                        props: &dg,
                    },
                )
                .is_some()
                {
                    oracle.insert((s, d));
                }
            }
        }
        assert_eq!(
            edges_on, oracle,
            "early-exit ON vs brute-force oracle must be identical"
        );
    }

    /// Coherence: checkpoints are rebuilt through the insert/remove choke-points
    /// when a vector prop is updated.  Dim change, freshness gate exercised.
    #[test]
    fn vector_early_exit_checkpoint_coherence() {
        let mut fx = Fx::new();
        // Two dim=4 nodes that match under VectorSimilar min=0.9.
        let a = fx.add("Doc", "a", vec![("emb", emb_val(&[1.0, 0.0, 0.0, 0.0]))]);
        let b = fx.add("Doc", "b", vec![("emb", emb_val(&[1.0, 0.0, 0.0, 0.0]))]);
        // dim=6 node that should NOT match dim=4 nodes.
        let c = fx.add(
            "Doc",
            "c",
            vec![("emb", emb_val(&[1.0, 0.0, 0.0, 0.0, 0.0, 0.0]))],
        );
        let def = RuleDef {
            name: "vec".into(),
            src_label: "Doc".into(),
            dst_label: "Doc".into(),
            predicate: Predicate::VectorSimilar {
                field: "emb".into(),
                min: 0.9,
            },
            edge_type: "SIM".into(),
            weight_prop: None,
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };

        let mut eng = RuleEngine::new();
        {
            let mut g = fx.g();
            eng.create_rule(def.clone(), &mut g).unwrap();
        }

        // Checkpoints must be populated for all three nodes.
        assert!(
            eng.indexes["vec"].src_side.vec_ckpts(a).is_some(),
            "a must have src checkpoints"
        );
        assert!(
            eng.indexes["vec"].dst_side.vec_ckpts(b).is_some(),
            "b must have dst checkpoints"
        );
        assert!(
            eng.indexes["vec"].src_side.vec_ckpts(c).is_some(),
            "c must have src checkpoints (dim=6)"
        );

        // ckpts[0] must equal the full L2 norm.
        let ckpts_a = *eng.indexes["vec"].src_side.vec_ckpts(a).unwrap();
        let norm_a = eng.indexes["vec"].src_side.vec_meta(a).unwrap().1;
        assert!(
            (ckpts_a[0] - norm_a).abs() < 1e-12,
            "ckpts[0] must equal the full L2 norm"
        );

        // Initial edges: a↔b only (c is different dim).
        assert_eq!(prov_pairs(&eng, "vec"), BTreeSet::from([(a, b), (b, a)]));

        // Update b to dim=6 (same as c) — choke-points must rebuild checkpoints.
        let old_b = fx.props.get(b, "emb").cloned();
        fx.props
            .set(b, "emb", emb_val(&[1.0, 0.0, 0.0, 0.0, 0.0, 0.0]));
        {
            let mut g = fx.g();
            eng.on_node_changed(b, Some(("emb", old_b)), &mut g);
        }
        // b's dim must now be 6 in both sides.
        assert_eq!(eng.indexes["vec"].src_side.vec_dim(b), Some(6));
        assert_eq!(eng.indexes["vec"].dst_side.vec_dim(b), Some(6));
        // b must have new checkpoints for dim=6.
        assert!(eng.indexes["vec"].src_side.vec_ckpts(b).is_some());
        // Edges must now be b↔c (both dim=6, cos=1.0 > 0.9).
        assert_eq!(prov_pairs(&eng, "vec"), BTreeSet::from([(b, c), (c, b)]));

        // Freshness gate: fresh_ckpts_for returns None when live vector differs.
        // Simulate by passing a different live vector to fresh_ckpts_for.
        let wrong_live = vec![2.0f64, 0.0, 0.0, 0.0, 0.0, 0.0]; // same dim, different norm
        let gate_result = eng.indexes["vec"].src_side.fresh_ckpts_for(b, &wrong_live);
        assert!(
            gate_result.is_none(),
            "freshness gate must reject a mismatched-norm live vector"
        );

        // fresh_ckpts_for must succeed with the correct live vector.
        let correct_live = vec![1.0f64, 0.0, 0.0, 0.0, 0.0, 0.0];
        let gate_result = eng.indexes["vec"]
            .src_side
            .fresh_ckpts_for(b, &correct_live);
        assert!(
            gate_result.is_some(),
            "freshness gate must accept the matching live vector"
        );
    }

    /// Razor test: dim=1536 pair with true cosine within 1e-12 of `min`.
    ///
    /// Purpose: with energy spread uniformly across all 1536 elements, each
    /// checkpoint boundary contributes a tiny slice of dot product.  Float
    /// rounding of suffix-norm accumulation can shift `cos_max` by O(dim × ε)
    /// ≈ 3.4 × 10⁻¹³ at dim=1536, inside the 1e-12 margin tested here.  The
    /// epsilon guard in `cosine_early_exit` absorbs this; ON/OFF/oracle must
    /// agree on all edges.
    #[test]
    fn vector_early_exit_razor_dim1536() {
        const MIN: f64 = 0.85;
        const DIM: usize = 1536;
        // target cosine = min + 5e-13: inside the dim-scale float-error zone.
        let target = MIN + 5e-13;
        let inv_sqrt = 1.0 / (DIM as f64).sqrt();

        // a: unit-norm uniform vector — energy spread equally across all chunks.
        let a: Vec<f64> = vec![inv_sqrt; DIM];

        // b = target * a + sqrt(1 - target^2) * e_perp
        // e_perp = [1, -1, 0, ..., 0] / sqrt(2) is perpendicular to uniform a:
        //   dot(a, e_perp) = inv_sqrt * (1 - 1) / sqrt(2) = 0  ✓
        // norm(b) = sqrt(target^2 + (1-target^2)) = 1            ✓
        // cos(a, b) = dot(a, b) = target * dot(a, a) = target    ✓
        let perp_scale = (1.0 - target * target).sqrt() / (2.0f64).sqrt();
        let mut b: Vec<f64> = vec![target * inv_sqrt; DIM];
        b[0] += perp_scale;
        b[1] -= perp_scale;

        let def = RuleDef {
            name: "razor".into(),
            src_label: "Doc".into(),
            dst_label: "Doc".into(),
            predicate: Predicate::VectorSimilar {
                field: "emb".into(),
                min: MIN,
            },
            edge_type: "SIM".into(),
            weight_prop: None,
            max_edges: None,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        };

        // Three independent fixtures with the same razor pair.
        let build_fx = || {
            let mut fx = Fx::new();
            let na = fx.add("Doc", "razor_a", vec![("emb", emb_val2(&a))]);
            let nb = fx.add("Doc", "razor_b", vec![("emb", emb_val2(&b))]);
            (fx, na, nb)
        };

        let (mut fx_on, na, nb) = build_fx();
        let (mut fx_off, _, _) = build_fx();
        let (fx_oracle, _, _) = build_fx();

        // ON
        let mut eng_on = RuleEngine::new();
        {
            let mut g = fx_on.g();
            eng_on.create_rule(def.clone(), &mut g).unwrap();
        }
        let edges_on = prov_pairs(&eng_on, "razor");
        assert!(
            edges_on.contains(&(na, nb)),
            "razor pair razor_a→razor_b must be present with early-exit ON (cos={target:.15}, min={MIN})"
        );
        assert!(
            edges_on.contains(&(nb, na)),
            "razor pair razor_b→razor_a must be present with early-exit ON"
        );

        // OFF
        let mut eng_off = RuleEngine::new();
        {
            let mut g = fx_off.g();
            with_vector_early_exit(false, || {
                eng_off.create_rule(def.clone(), &mut g).unwrap();
            });
        }
        let edges_off = prov_pairs(&eng_off, "razor");
        assert_eq!(
            edges_on, edges_off,
            "razor dim=1536: early-exit ON vs OFF must produce identical edges"
        );

        // Brute-force oracle.
        let ids = [na, nb];
        let mut oracle = BTreeSet::new();
        for &s in &ids {
            for &d in &ids {
                if s == d {
                    continue;
                }
                let skey = fx_oracle.ids.key_of(s).unwrap();
                let dkey = fx_oracle.ids.key_of(d).unwrap();
                let sg = |f: &str| fx_oracle.props.get(s, f).cloned();
                let dg = |f: &str| fx_oracle.props.get(d, f).cloned();
                if evaluate(
                    &def.predicate,
                    &NodeView {
                        key: skey,
                        props: &sg,
                    },
                    &NodeView {
                        key: dkey,
                        props: &dg,
                    },
                )
                .is_some()
                {
                    oracle.insert((s, d));
                }
            }
        }
        assert_eq!(
            edges_on, oracle,
            "razor dim=1536: early-exit ON vs brute-force oracle must be identical"
        );
    }

    // -----------------------------------------------------------------------
    // Scale test: backfill must not materialise the full cross-product
    // -----------------------------------------------------------------------
    //
    // Step-1 analysis (flow read per brief):
    //
    // compute_desired (~246): returns a BTreeMap<(u32,u32),f64> for ONE source
    //   node against all matching candidates from the dst-side index.  For a
    //   FieldEqual rule with 400 Org dsts all sharing city="austin", each call
    //   returns at most 400 pairs.  The per-source map is dropped after
    //   filter_src_top_k consumes it.
    //
    // compute_desired_via (~452): similar per-anchor scope; not exercised here.
    //
    // compute_full_desired (~945): TEST-ONLY reference implementation.  Iterates
    //   every src node and calls compute_desired, extending a GLOBAL BTreeMap.
    //   For 400 Person × 400 Org this accumulates 160 000 pairs — the full
    //   cross-product — before returning.  This is the memory wall the streaming
    //   rewrite was designed to eliminate.
    //
    // apply_streaming_create_top_k (~1106): the production path for
    //   max_edges=Some(k).  Calls compute_desired per src (≤400 pairs), passes
    //   ownership to filter_src_top_k (truncates to k=5), then drops the map.
    //   The largest map alive at any instant is one per-src BTreeMap of ≤400
    //   entries — never the 160 000-pair global map.
    //
    // filter_src_top_k (~626): runs BEFORE compute_full_desired is ever called
    //   (compute_full_desired is dead code in the production path).  It truncates
    //   the per-source map to k entries BEFORE apply_per_src_top_k sees it.
    //   Conclusion: filter_src_top_k IS applied per-source before any global map
    //   extension; compute_full_desired does NOT participate in create_rule.
    //
    // Expected test behaviour:
    //   The production path (apply_streaming_create_top_k) yields peak ≈ 400
    //   (one per-src BTreeMap).  The assertion bound is 400*5*4 = 8 000 — well
    //   below the 160 000 cross-product.  The test therefore PASSES with the
    //   current streaming code, confirming the fix is in place.
    //
    //   If someone reverts the streaming path and re-introduces a global
    //   compute_full_desired call inside create_rule, peak would reach 160 000
    //   and the assertion would FAIL — which is the regression this test guards.

    /// Helper: FieldEqual rule between two distinct labels with top-k cap.
    fn field_equal_rule(
        src_label: &str,
        dst_label: &str,
        field: &str,
        edge_type: &str,
        max_edges: Option<u64>,
    ) -> RuleDef {
        RuleDef {
            name: format!("{src_label}_{dst_label}_{field}"),
            src_label: src_label.into(),
            dst_label: dst_label.into(),
            predicate: Predicate::FieldEqual {
                field: field.into(),
            },
            edge_type: edge_type.into(),
            weight_prop: None,
            max_edges,
            approximate: false,
            via_label: None,
            via_edge: None,
            via_dir: None,
            namespace: None,
        }
    }

    #[test]
    fn backfill_does_not_materialize_the_cross_product() {
        use std::sync::atomic::Ordering;
        // 400 Person + 400 Org, all city="austin"; rule FieldEqual{city},
        // max_edges=Some(5).  Correct behaviour: 400 × 5 = 2000 derived edges,
        // and peak simultaneous pairs ≤ 400*5*4 (generous headroom), NOT the
        // 160 000 cross-product.
        let mut fx = Fx::new();
        for i in 0..400u32 {
            fx.add(
                "Person",
                &format!("p{i}"),
                vec![("city", Value::Str("austin".into()))],
            );
        }
        for i in 0..400u32 {
            fx.add(
                "Org",
                &format!("o{i}"),
                vec![("city", Value::Str("austin".into()))],
            );
        }

        let mut eng = RuleEngine::new();
        PEAK_DESIRED_PAIRS.store(0, Ordering::Relaxed);
        {
            let mut g = fx.g();
            eng.create_rule(
                field_equal_rule("Person", "Org", "city", "IN_CITY", Some(5)),
                &mut g,
            )
            .unwrap();
        }

        let edges = fx.topo.edge_count();
        assert_eq!(
            edges,
            400 * 5,
            "per-source top-k must yield exactly k per source"
        );

        let peak = PEAK_DESIRED_PAIRS.load(Ordering::Relaxed);
        assert!(
            peak <= 400 * 5 * 4, // generous headroom; NOT the 160_000 cross product
            "backfill must not materialize the full cross-product; peak was {peak}"
        );
    }

    /// Regression guard for the `max_edges = None` (global-budget) backfill path.
    ///
    /// With `max_edges = None`, `create_rule` routes to `apply_streaming_create`
    /// (engine.rs:~1075), which calls `compute_desired` once per source node and
    /// applies edges immediately under a `prov.len() >= budget` latch
    /// (budget = DEFAULT_MAX_EDGES = 1_000_000).  For 400 Person × 400 Org nodes
    /// the cross-product is 160_000 — well below the budget — so ALL pairs are
    /// applied.  Crucially, no global desired-map is ever materialised: the
    /// per-source map is computed, iterated, and dropped before the next source
    /// is processed.
    ///
    /// The budget latch itself (edges capped at DEFAULT_MAX_EDGES when the
    /// cross-product exceeds it) is covered by the existing `#[ignore]`d
    /// `streaming_peak_transient_bound` test (~line 4436); this test guards
    /// peak desired-pair memory only.
    #[test]
    fn global_budget_backfill_stays_per_source_bounded() {
        use std::sync::atomic::Ordering;
        // Same 400 Person × 400 Org shared-value fixture as the Task 1 test,
        // but rule has max_edges = None (global-budget path).
        let mut fx = Fx::new();
        for i in 0..400u32 {
            fx.add(
                "Person",
                &format!("p{i}"),
                vec![("city", Value::Str("austin".into()))],
            );
        }
        for i in 0..400u32 {
            fx.add(
                "Org",
                &format!("o{i}"),
                vec![("city", Value::Str("austin".into()))],
            );
        }

        let mut eng = RuleEngine::new();
        PEAK_DESIRED_PAIRS.store(0, Ordering::Relaxed);
        {
            let mut g = fx.g();
            eng.create_rule(
                field_equal_rule("Person", "Org", "city", "IN_CITY", None),
                &mut g,
            )
            .unwrap();
        }

        // All 160_000 pairs are below DEFAULT_MAX_EDGES (1_000_000), so every
        // pair is applied — edge count equals the full cross-product.
        let edges = fx.topo.edge_count();
        assert_eq!(
            edges,
            400 * 400,
            "none-path must apply all pairs when under budget; got {edges}"
        );

        // Peak simultaneous pairs must be bounded per-source (≤400 candidates),
        // NOT the full 160_000 cross-product.  Any reversion to global desired-map
        // accumulation would observe peak = 160_000 and trip this guard.
        let peak = PEAK_DESIRED_PAIRS.load(Ordering::Relaxed);
        assert!(
            peak <= 400 * 4, // one per-src map of ≤400 candidates, with headroom
            "none-path backfill must not accumulate a global desired-map; peak was {peak}"
        );
    }
}