vector-core 0.10.0

//! Side-by-side harness: run the engine against a live community and diff its
//! verdicts against the shipped assessor.
//!
//! The engine convicts nothing in production yet. `raid.rs` keeps driving the
//! moderation console while this runs alongside, so a disagreement is a finding
//! to read rather than a member wrongly removed. Everything here is diagnostic:
//! it reads local state, evaluates, and reports — it publishes nothing and
//! changes no membership.

use super::document::*;
use super::engine::{evaluate, evaluate_as, LoadedPolicy, MemberSignal, MessageSignal, Signals};
use super::types::*;
use super::engine::EvalMode;
use super::normalize::EmojiCodes;
use nostr_sdk::prelude::{PublicKey, ToBech32};
use std::collections::BTreeSet;

/// Hash a policy the way the wire will: over the exact bytes it arrived as,
/// never a re-serialization.
pub fn hash_policy_bytes(bytes: &[u8]) -> Hash32 {
    use sha2::{Digest, Sha256};
    let mut h = Sha256::new();
    h.update(bytes);
    Hash32(h.finalize().into())
}

fn subject_of(npub_or_hex: &str) -> Option<SubjectId> {
    PublicKey::parse(npub_or_hex).ok().map(|p| SubjectId(p.to_bytes()))
}

/// The reserved id a community's fork of the shipped defaults is stored under.
/// Writing this id is the only way to stand the defaults down.
pub const DEFAULTS_POLICY_ID: &str = "vector_defaults";

/// The span a repeat rule counts inside. Malicious repetition is a burst;
/// saying "gm" every morning is not, and a seven-day count cannot tell them
/// apart.
pub const REPEAT_BURST_SECS: u64 = 30 * 60;

/// What every community gets without asking: raid detection, and nothing else.
///
/// Not spam, not mass-tagging, not words. Those are a community's taste and it
/// can switch them on from a template; a swarm is the one thing nobody can be
/// expected to hand-configure before it arrives.
///
/// Deliberately NOT a link blocker. Which domains a community will not host is
/// its own call, and a list baked into the client makes that call for everyone
/// while looking like a law of the protocol. The bundled shortener list lives
/// in the Scam Links template instead, where turning it on is a choice someone
/// made. What is left here is the one thing no community can be expected to
/// hand-configure before it is attacked: the shape of a swarm.
pub fn default_policy() -> Policy {
    Policy {
        format: FORMAT,
        // `repeat` bounds its count to a burst; an engine that does not know
        // the field must go inert rather than count across the whole week.
        requires: vec!["armed_by_any".into()],
        name: "raid-detection".into(),
        emoji_codes: vec![],
        // A WEEK, not a day. Shield inputs are measured over the declared
        // window (that is what keeps them identical across clients), so a
        // 24-hour window asks members to earn trust daily and almost nobody
        // does: the first live run trusted 1 of 155.
        shields: Shields::default(),
        window: Window { hours: 168, max_messages: 4000 },
        exempt: Exempt::default(),
        rules: vec![
            // The raid shape: many identities, one line each. Heuristic, so it
            // flags for a human and never feeds `proven`.
            Rule {
                id: "cohort".into(),
                matcher: Match::Cohort { min: 3, quiet_max: 2, short_factor: 3, thin_ratio: None },
                tiers: None,
                severity: Some(Severity::Severe),
                weight: Some(85),
                pierces_trusted: false,
                family: None,
                armed_by: None,
                exempt: Exempt::default(),
                enforcement: Enforcement::Advisory,
            },
            // The SECOND conviction path, for a raid whose accounts each say
            // something different and never form a cohort cluster.
            //
            // A join flood is also what a popular invite link looks like, and the
            // fresh-account aggravator does NOT tell them apart — it fires on
            // anyone under a day old, talking or not (`quiet` folds into it at
            // max, so posting changes nothing). The only thing separating the two
            // is RATE, so the threshold carries that weight alone: twelve joins
            // inside five minutes is a join every twenty-five seconds sustained,
            // which is a script rather than a good afternoon.
            Rule {
                id: "burst".into(),
                matcher: Match::JoinBurst { gap_secs: 300, min: 12 },
                tiers: None,
                severity: Some(Severity::Major),
                weight: Some(40),
                pierces_trusted: false,
                family: None,
                armed_by: None,
                exempt: Exempt::default(),
                enforcement: Enforcement::Advisory,
            },
            // Aggravators, and ONLY aggravators: each fires only for a subject
            // the link rule already convicted. Unarmed, "has posted at most
            // twice" describes most of a healthy community — the first live run
            // convicted 147 of 155 on it alone, which is exactly the
            // weak-signal-convicts-nobody rule being violated by a policy the
            // engine faithfully executed.
            Rule {
                id: "fresh".into(),
                matcher: Match::TenureLt { secs: 24 * 3600 },
                tiers: None,
                severity: Some(Severity::Notice),
                // Twelve, not twenty: an aggravator must AGGRAVATE, never carry a
                // lone detector across a band on its own. At 20 a bare join flood
                // reached 52 and the console staged a whole invite wave for
                // removal; at 12 the same pair lands at 47 — a look, not a verdict
                // — while a real raid, which trips a second INDEPENDENT detector,
                // still stacks to the same 92 it always did.
                weight: Some(12),
                pierces_trusted: false,
                family: None,
                armed_by: Some(ArmedBy {
                    rule: "cohort".into(),
                    scope: ArmScope::Subject,
                    min_subjects: None,
                    also: vec!["burst".into()],
                }),
                exempt: Exempt::default(),
                enforcement: Enforcement::Advisory,
            },
            Rule {
                id: "quiet".into(),
                matcher: Match::MessagesLte { n: 2 },
                tiers: None,
                severity: Some(Severity::Notice),
                weight: Some(10),
                pierces_trusted: false,
                family: None,
                armed_by: Some(ArmedBy {
                    rule: "cohort".into(),
                    scope: ArmScope::Subject,
                    min_subjects: None,
                    also: vec!["burst".into()],
                }),
                exempt: Exempt::default(),
                enforcement: Enforcement::Advisory,
            },
        ],
    }
}

/// Everything an evaluation needs, assembled from local state once: the engine
/// inputs and the display facts the console shows beside each verdict. Both the
/// console and the side-by-side diff read this, so they can never disagree
/// about what they were looking at.
pub struct Assembled {
    pub signals: Signals,
    pub facts: std::collections::BTreeMap<String, MemberFacts>,
    pub corpus: usize,
}

/// `(member, joined_at_ms, is_staff, role names, invite label)`.
pub(crate) type MemberRow = (PublicKey, Option<u64>, bool, Vec<String>, Option<String>);

pub fn assemble(
    community_id_hex: &str,
    owner: &PublicKey,
    me: Option<&PublicKey>,
    members: &[MemberRow],
    now_ms: u64,
) -> Result<Assembled, String> {
    let rows = crate::db::community::community_policy_messages(community_id_hex, caps::WINDOW_MAX_MESSAGES)?;
    let corpus = rows.len();
    let mut messages: Vec<MessageSignal> = Vec::with_capacity(rows.len());
    for m in rows {
        let (Some(id), Some(author), Some(channel)) = (
            crate::simd::hex::hex_to_bytes_32_checked(&m.id),
            subject_of(&m.npub),
            crate::simd::hex::hex_to_bytes_32_checked(&m.channel_id),
        ) else {
            continue;
        };
        messages.push(MessageSignal {
            id: MessageId(id),
            author,
            channel: Hash32(channel),
            at_ms: m.at_ms,
            text: m.text,
            mentions: m.mentions,
        });
    }

    let footprints: std::collections::HashMap<String, crate::db::community::AuthorFootprint> =
        crate::db::community::community_author_footprints(community_id_hex)
            .unwrap_or_default()
            .into_iter()
            .map(|f| (f.npub.clone(), f))
            .collect();
    // Distinct shapes per author, over the window — how someone speaks now is
    // what tells a person from a script.
    let codes = EmojiCodes::from_policy(default_policy().emoji_codes.iter());
    let mut distinct: std::collections::HashMap<[u8; 32], BTreeSet<String>> = std::collections::HashMap::new();
    for m in &messages {
        let sk = super::normalize::skeleton(&m.text, &codes);
        if !sk.is_empty() {
            distinct.entry(m.author.0).or_default().insert(sk);
        }
    }

    let channels: BTreeSet<[u8; 32]> = messages.iter().map(|m| m.channel.0).collect();
    let mut member_signals = Vec::with_capacity(members.len());
    let mut facts = std::collections::BTreeMap::new();
    for (pk, joined, is_staff, roles, invite_label) in members {
        let b32 = pk.to_bech32().unwrap_or_default();
        let fp = footprints.get(&b32);
        let first_post_ms = fp.map(|f| f.first_secs).filter(|s| *s > 0).map(|s| s.saturating_mul(1000));
        let arrived_at_ms = arrival(*joined, first_post_ms);
        member_signals.push(MemberSignal {
            subject: SubjectId(pk.to_bytes()),
            joined_at_ms: arrived_at_ms,
            roles: roles.iter().filter_map(|r| crate::simd::hex::hex_to_bytes_32_checked(r)).map(Hash32).collect(),
            is_staff: *is_staff,
            lifetime_messages: fp.map(|f| f.messages).unwrap_or(0),
            first_post_ms,
        });
        // Tenure for DISPLAY uses the same oldest-trace rule the shield does.
        let oldest = arrived_at_ms;
        facts.insert(
            b32,
            MemberFacts {
                joined_at_ms: joined.unwrap_or(0),
                invite_label: invite_label.clone(),
                messages: fp.map(|f| f.messages).unwrap_or(0),
                distinct: distinct.get(&pk.to_bytes()).map(|d| d.len() as u64).unwrap_or(0),
                tenure_secs: oldest.map(|o| now_ms.saturating_sub(o) / 1000).unwrap_or(0),
                last_secs: fp.map(|f| f.last_secs).unwrap_or(0),
                is_owner: pk == owner,
                is_admin: *is_staff,
                is_me: me == Some(pk),
            },
        );
    }

    Ok(Assembled {
        signals: Signals {
            owner: SubjectId(owner.to_bytes()),
            members: member_signals,
            messages,
            channels: channels.into_iter().map(Hash32).collect(),
            relays: vec![],
            requested_from: 0,
            requested_to: now_ms,
            confirmed_from: u64::MAX,
            confirmed_to: now_ms,
            roster_version: Hash32([0; 32]),
        },
        facts,
        corpus,
    })
}

/// What a policy WOULD do, without storing it or touching anyone.
///
/// This is the safety rail the designer is built around: a policy is never
/// enabled from a form alone, it is enabled from a preview that named the
/// members it would catch. An over-broad rule announces itself by catching
/// regulars, and the fix is a button rather than a number.
#[derive(Debug, Clone, serde::Serialize)]
pub struct PolicyPreview {
    pub valid: bool,
    pub error: Option<String>,
    /// Members this policy would flag, worst first.
    pub flagged: Vec<PreviewRow>,
    /// Members whose messages ALSO matched, and who were spared only because
    /// they have standing. This is the number that tells an admin a rule
    /// catches ordinary conversation: the flagged list can look small and
    /// harmless while every regular in the room tripped the same wire.
    pub shielded_matches: Vec<PreviewRow>,
    pub messages_cited: usize,
    pub corpus: usize,
    /// Rules that could not run here, so a silent zero never reads as "clean".
    pub unevaluated: Vec<String>,
}

#[derive(Debug, Clone, serde::Serialize)]
pub struct PreviewRow {
    pub npub: String,
    pub score: u32,
    pub proven: u32,
    pub band: String,
    pub shield: String,
    pub reasons: Vec<String>,
    pub tenure_days: u64,
    pub messages: u64,
}

/// Evaluate a candidate policy against local history. Stores nothing, publishes
/// nothing, removes nobody.
pub fn preview_policy(assembled: &Assembled, bytes: &str, now_ms: u64) -> PolicyPreview {
    let doc: Policy = match serde_json::from_str(bytes) {
        Ok(d) => d,
        Err(e) => {
            return PolicyPreview {
                valid: false,
                error: Some(format!("not valid JSON: {e}")),
                flagged: vec![],
                shielded_matches: vec![],
                messages_cited: 0,
                corpus: assembled.corpus,
                unevaluated: vec![],
            }
        }
    };
    if let Err(reason) = doc.validate() {
        return PolicyPreview {
            valid: false,
            error: Some(format!("{reason:?}")),
            flagged: vec![],
            shielded_matches: vec![],
            messages_cited: 0,
            corpus: assembled.corpus,
            unevaluated: vec![],
        };
    }

    let lp = LoadedPolicy { hash: hash_policy_bytes(bytes.as_bytes()), policy: doc, activated_at: None };
    let report = evaluate_as(&assembled.signals, std::slice::from_ref(&lp), &[], now_ms, EvalMode::Admin);
    let Some(pr) = report.policies.first() else {
        return PolicyPreview {
            valid: true,
            error: None,
            flagged: vec![],
            shielded_matches: vec![],
            messages_cited: 0,
            corpus: assembled.corpus,
            unevaluated: vec![],
        };
    };

    let console = console_report(&report, &assembled.facts, now_ms / 1000);
    let rows_by_npub: std::collections::BTreeMap<String, serde_json::Value> = console["members"]
        .as_array()
        .map(|a| {
            a.iter()
                .filter_map(|m| m["npub"].as_str().map(|n| (n.to_string(), m.clone())))
                .collect()
        })
        .unwrap_or_default();

    let mut flagged: Vec<PreviewRow> = Vec::new();
    for s in &pr.subjects {
        if s.convictions.iter().all(|c| c.suppressed) {
            continue;
        }
        let Some(npub) = PublicKey::from_slice(&s.subject.0).ok().and_then(|p| p.to_bech32().ok()) else {
            continue;
        };
        let m = rows_by_npub.get(&npub);
        let facts = assembled.facts.get(&npub);
        let row = PreviewRow {
            npub: npub.clone(),
            score: s.confidence,
            proven: s.proven,
            band: format!("{:?}", s.band).to_lowercase(),
            shield: format!("{:?}", s.shield).to_lowercase(),
            reasons: m
                .and_then(|m| m["reasons"].as_array().cloned())
                .map(|a| a.iter().filter_map(|r| r.as_str().map(String::from)).collect())
                .unwrap_or_default(),
            tenure_days: facts.map(|f| f.tenure_secs / 86_400).unwrap_or(0),
            messages: facts.map(|f| f.messages).unwrap_or(0),
        };
        flagged.push(row);
    }
    flagged.sort_by(|a, b| b.score.cmp(&a.score).then_with(|| a.npub.cmp(&b.npub)));

    // Now the question the flagged list cannot answer: who ELSE matched, and
    // was spared only by their standing? Re-evaluate with the trust bar raised
    // out of reach — staff stay Protected, since a rule that needs to reach
    // them is a different conversation — and take the difference.
    let mut bare = lp.policy.clone();
    bare.shields.trusted.tenure_secs = u64::MAX;
    bare.shields.trusted.veteran_secs = u64::MAX;
    bare.shields.trusted.roles_trust = false;
    let bare_lp = LoadedPolicy { hash: lp.hash, policy: bare, activated_at: None };
    let bare_report = evaluate_as(&assembled.signals, &[bare_lp], &[], now_ms, EvalMode::Admin);
    let already: std::collections::BTreeSet<[u8; 32]> = pr
        .subjects
        .iter()
        .filter(|s| s.convictions.iter().any(|c| !c.suppressed))
        .map(|s| s.subject.0)
        .collect();
    let mut shielded_matches: Vec<PreviewRow> = Vec::new();
    if let Some(bpr) = bare_report.policies.first() {
        for s in &bpr.subjects {
            if already.contains(&s.subject.0) || s.convictions.iter().all(|c| c.suppressed) {
                continue;
            }
            let Some(npub) = PublicKey::from_slice(&s.subject.0).ok().and_then(|p| p.to_bech32().ok()) else {
                continue;
            };
            let facts = assembled.facts.get(&npub);
            shielded_matches.push(PreviewRow {
                npub,
                score: s.confidence,
                proven: s.proven,
                band: format!("{:?}", s.band).to_lowercase(),
                shield: "trusted".into(),
                reasons: vec![],
                tenure_days: facts.map(|f| f.tenure_secs / 86_400).unwrap_or(0),
                messages: facts.map(|f| f.messages).unwrap_or(0),
            });
        }
    }
    shielded_matches.sort_by(|a, b| b.messages.cmp(&a.messages).then_with(|| a.npub.cmp(&b.npub)));

    PolicyPreview {
        valid: true,
        error: None,
        messages_cited: pr.citations.len(),
        corpus: assembled.corpus,
        unevaluated: pr
            .rule_status
            .iter()
            .filter(|r| r.state != RuleState::Evaluated)
            .map(|r| format!("{} ({:?})", r.rule_id, r.state))
            .collect(),
        flagged,
        shielded_matches,
    }
}

/// The policies a community actually runs: everything it has stored and
/// enabled, or the built-in default when it has declared none.
///
/// A stored policy that no longer validates is loaded anyway and reported
/// INERT by the engine — silently dropping it would tell a moderator their
/// rules are running when they are not.
pub fn load_policies(community_id_hex: &str) -> Vec<LoadedPolicy> {
    select_policies(crate::db::community::get_community_policies(community_id_hex).unwrap_or_default())
}

/// Which policies actually run, given everything the community has stored.
///
/// A row under [`DEFAULTS_POLICY_ID`] is the community's own copy of the
/// shipped defaults, and its PRESENCE is what stands them down — enabled or
/// not, because a disabled fork means the admin turned raid and scam cover off
/// on purpose. Everything else runs ALONGSIDE the defaults rather than instead
/// of them: a word filter for spoilers must not silently drop scam-link cover.
pub fn select_policies(stored: Vec<crate::db::community::StoredPolicy>) -> Vec<LoadedPolicy> {
    let replaced = stored.iter().any(|p| p.policy_id == DEFAULTS_POLICY_ID);
    let mut loaded: Vec<LoadedPolicy> = stored
        .into_iter()
        .filter(|p| p.enabled)
        .filter_map(|p| {
            let policy: Policy = serde_json::from_str(&p.bytes).ok()?;
            Some(LoadedPolicy { hash: hash_policy_bytes(p.bytes.as_bytes()), policy, activated_at: None })
        })
        .collect();
    if !replaced {
        let policy = default_policy();
        let bytes = serde_json::to_vec(&policy).unwrap_or_default();
        loaded.push(LoadedPolicy { hash: hash_policy_bytes(&bytes), policy, activated_at: None });
    }
    loaded
}

/// Evaluate a community's policies and render the console's report.
pub fn evaluate_for_console(
    community_id_hex: &str,
    assembled: &Assembled,
    now_ms: u64,
) -> Result<serde_json::Value, String> {
    let policies = load_policies(community_id_hex);
    let report = evaluate_as(&assembled.signals, &policies, &[], now_ms, EvalMode::Admin);
    let mut console = console_report(&report, &assembled.facts, now_ms / 1000);
    // How much history this verdict was reached over. Without it an empty
    // suspect list reads as "this community is clean" when the truth may be
    // "four days of it were looked at" — a distinction that decides whether a
    // verdict means anything at all.
    let w = &report.window;
    console["coverage"] = serde_json::json!({
        "corpus": assembled.corpus,
        "corpus_max": caps::WINDOW_MAX_MESSAGES,
        "channels": w.channels.len(),
        "observed_from": w.observed_from,
        "observed_to": w.observed_to,
        "complete": w.complete,
    });
    Ok(console)
}

/// When a member turned up, by any route.
///
/// Arrival, not paperwork. The Guestbook is ONE witness that somebody appeared;
/// a member folded in from their first post (CORD-02 §5, "observed authors")
/// arrived just as much as one who filed a Join.
///
/// Those two definitions disagreeing is a hole, not a nuance. Anyone holding a
/// community's keys can post straight into it without ever publishing a Join,
/// and `stored_memberlist` counts them as a member — so a join-flood rule
/// reading only Guestbook entries sees a thousand such accounts as zero
/// arrivals. Taking the earliest evidence closes that, and restores tenure for
/// members whose Join was genuinely lost (a v1 migration, a pruned Guestbook)
/// who would otherwise read as having never arrived at all.
pub fn arrival(joined_at_ms: Option<u64>, first_post_ms: Option<u64>) -> Option<u64> {
    [joined_at_ms, first_post_ms].into_iter().flatten().min()
}

/// Screen ONE message, right now, against the community's stored policies.
///
/// Only stateless rules run — words, links, regex, mentions — because those are
/// the only ones a single message can answer. Rate, repetition, cohorts and
/// join bursts are statements about a window, and there is nothing for them to
/// measure here; they belong to the periodic sweep and are silently absent
/// rather than wrongly clean.
///
/// This is `EvalMode::Member`, the same path a sending client uses, so a
/// verdict reached here is the verdict the console reaches later over the same
/// text. Shields still gate: the owner and staff are not screened.
/// The instant a screen evaluates at: a moment AFTER the message it is about.
///
/// `clamp_corpus` keeps `at_ms < now_ms` strictly — a message stamped at the
/// evaluation instant is not yet history and no rule can see it. Screening a
/// message at its own timestamp therefore judged an empty corpus and convicted
/// nobody, ever.
fn screen_at(message_at_ms: u64) -> u64 {
    message_at_ms.saturating_add(1)
}

#[allow(clippy::too_many_arguments)]
pub fn screen_message(
    community_id_hex: &str,
    owner: &PublicKey,
    author: &PublicKey,
    author_roles: &[String],
    author_is_staff: bool,
    channel_id_hex: &str,
    text: &str,
    now_ms: u64,
) -> Vec<serde_json::Value> {
    let policies = load_policies(community_id_hex);
    if policies.is_empty() {
        return vec![];
    }
    let subject = SubjectId(author.to_bytes());
    let signals = Signals {
        owner: SubjectId(owner.to_bytes()),
        members: vec![MemberSignal {
            subject,
            // Tenure and volume are unknowable from one message, and no
            // stateless rule reads them. Left unknown rather than invented.
            joined_at_ms: None,
            roles: author_roles.iter().filter_map(|r| crate::simd::hex::hex_to_bytes_32_checked(r)).map(Hash32).collect(),
            is_staff: author_is_staff,
            lifetime_messages: 0,
            first_post_ms: None,
        }],
        messages: vec![MessageSignal {
            // A screen happens before the message has an id of its own.
            id: MessageId([0; 32]),
            author: subject,
            channel: Hash32(crate::simd::hex::hex_to_bytes_32(channel_id_hex)),
            at_ms: now_ms,
            text: text.to_string(),
            mentions: super::matchers::count_mentions(text),
        }],
        channels: vec![Hash32(crate::simd::hex::hex_to_bytes_32(channel_id_hex))],
        relays: vec![],
        requested_from: now_ms,
        requested_to: now_ms,
        confirmed_from: now_ms,
        confirmed_to: now_ms,
        roster_version: Hash32([0; 32]),
    };
    let report = evaluate_as(&signals, &policies, &[], screen_at(now_ms), EvalMode::Member);
    let mut out = Vec::new();
    for pr in &report.policies {
        let detail_of: std::collections::BTreeMap<[u8; 32], String> =
            pr.citations.iter().filter_map(|c| c.detail.clone().map(|d| (c.id.0, d))).collect();
        for s in &pr.subjects {
            for c in s.convictions.iter().filter(|c| !c.suppressed) {
                let detail: std::collections::BTreeSet<String> =
                    c.citations.iter().filter_map(|id| detail_of.get(&id.0).cloned()).collect();
                out.push(serde_json::json!({
                    "policy_hash": crate::simd::hex::bytes_to_hex_32(&pr.policy_hash.0),
                    "rule_id": c.rule_id,
                    "scope": wire(c.scope),
                    "basis": wire(c.basis),
                    "severity": wire(c.severity),
                    "stateless": true,
                    "hits": c.hits,
                    "weight": c.tier_weight,
                    "detail": detail.into_iter().collect::<Vec<_>>(),
                }));
            }
        }
    }
    out
}

/// What the moderation console needs about one member beyond the verdict:
/// the display facts a moderator reads before acting.
#[derive(Debug, Clone, Default)]
pub struct MemberFacts {
    pub joined_at_ms: u64,
    pub invite_label: Option<String>,
    pub messages: u64,
    pub distinct: u64,
    pub tenure_secs: u64,
    pub last_secs: u64,
    pub is_owner: bool,
    pub is_admin: bool,
    pub is_me: bool,
}

/// A wire-frozen enum as the console's string. Serde, never `Debug`: the wire
/// vocabulary is snake_case, and `format!("{:?}")` renders `PerMessage` as
/// "permessage" — a consumer matching on it would silently never match.
fn wire(v: impl serde::Serialize) -> String {
    serde_json::to_value(v).ok().and_then(|j| j.as_str().map(String::from)).unwrap_or_default()
}

/// Turn an engine report into the shape the moderation console already speaks,
/// so the panel changes its SOURCE without changing its contract. `raid.rs`
/// keeps running beside it (see [`run_side_by_side`]) until the two have agreed
/// on live data for long enough to retire one.
pub fn console_report(
    report: &ModerationReport,
    facts: &std::collections::BTreeMap<String, MemberFacts>,
    now_secs: u64,
) -> serde_json::Value {
    if report.policies.is_empty() {
        return serde_json::json!({ "members": [], "cohorts": [], "suspects": 0, "trusted": 0, "protected": 0,
                                   "raid_detected": false, "burst_size": 0, "burst_from_ms": 0, "burst_to_ms": 0,
                                   "inert_policies": 0 });
    }
    // Every law is scored independently, so the console folds ACROSS policies:
    // a member's worst standing and every conviction any policy reached.
    // Paired with its law: a conviction has to name the policy it came from, and
    // the hash lives on the PolicyReport rather than the subject.
    let mut by_subject: std::collections::BTreeMap<String, Vec<(&Hash32, &SubjectReport)>> =
        std::collections::BTreeMap::new();
    for pr in &report.policies {
        for s in &pr.subjects {
            if let Some(b32) = PublicKey::from_slice(&s.subject.0).ok().and_then(|p| p.to_bech32().ok()) {
                by_subject.entry(b32).or_default().push((&pr.policy_hash, s));
            }
        }
    }
    let inert = report.policies.iter().filter(|p| p.inert.is_some()).count();

    // What each citation actually matched, so a conviction can say the word
    // rather than the rule id.
    let detail_of: std::collections::BTreeMap<[u8; 32], String> = report
        .policies
        .iter()
        .flat_map(|p| p.citations.iter())
        .filter_map(|c| c.detail.clone().map(|d| (c.id.0, d)))
        .collect();

    // Which message each citation points at. Message targets only: a profile
    // field or an attachment is cited too, and neither is something to hide.
    let message_of: std::collections::BTreeMap<[u8; 32], String> = report
        .policies
        .iter()
        .flat_map(|p| p.citations.iter())
        .filter_map(|c| match &c.target {
            CitationTarget::Message { message_id } => {
                Some((c.id.0, crate::simd::hex::bytes_to_hex_32(&message_id.0)))
            }
            _ => None,
        })
        .collect();

    let (mut suspects, mut trusted, mut protected) = (0usize, 0usize, 0usize);
    let mut members: Vec<serde_json::Value> = Vec::with_capacity(facts.len());
    for (npub, f) in facts {
        let reports = by_subject.get(npub).cloned().unwrap_or_default();
        // (law, conviction) pairs: the prose below needs the conviction, the
        // machine-readable findings need the law it was reached under.
        let judged: Vec<(&Hash32, &Conviction)> = reports
            .iter()
            .flat_map(|(h, s)| s.convictions.iter().map(move |c| (*h, c)))
            .filter(|(_, c)| !c.suppressed)
            .collect();
        let convictions: Vec<&Conviction> = judged.iter().map(|(_, c)| *c).collect();
        // Shields are a property of the member, not of one law; every policy
        // computes the same one, so the strongest answer is the answer.
        let shield = reports
            .iter()
            .map(|(_, s)| s.shield)
            .max_by_key(|s| match s {
                Shield::Protected => 3,
                Shield::Trusted => 2,
                Shield::Indeterminate => 1,
                Shield::None => 0,
            })
            .unwrap_or(Shield::None);
        // Band travels with the confidence that earned it: taking each
        // separately across laws can report a band the score never reached.
        let worst = reports.iter().max_by_key(|(_, s)| s.confidence);
        let score = worst.map(|(_, s)| s.confidence).unwrap_or(0);
        let band = worst.map(|(_, s)| s.band).unwrap_or(Band::Clear);
        let proven_score = reports.iter().map(|(_, s)| s.proven).max().unwrap_or(0);
        // The console's four verdicts, from the engine's own vocabulary.
        let verdict = if shield == Shield::Protected {
            protected += 1;
            "protected"
        } else if !convictions.is_empty() {
            suspects += 1;
            "suspect"
        } else if shield == Shield::Trusted {
            trusted += 1;
            "trusted"
        } else {
            "neutral"
        };
        // Reasons in evidence, never in score — the panel shows WHY, and a
        // moderator who disagrees can see exactly what they are disagreeing with.
        let mut reasons: Vec<String> = Vec::new();
        let mut cohort_peers = 0u32;
        for c in &convictions {
            for e in &c.evidence {
                match e {
                    Evidence::Cohort { size, sample, .. } => {
                        cohort_peers = cohort_peers.max(size.saturating_sub(1));
                        let quoted: String = sample.chars().take(48).collect();
                        reasons.push(format!(
                            "Posted the same message as {} other member{} — \"{}\"",
                            size.saturating_sub(1),
                            if *size == 2 { "" } else { "s" },
                            quoted
                        ));
                    }
                    Evidence::Burst { size, .. } => reasons.push(format!("Joined in a burst of {size}")),
                    Evidence::Rate { count, window_secs, .. } => {
                        reasons.push(format!("Sent {count} messages in {window_secs}s"))
                    }
                    _ => {}
                }
            }
            if c.evidence.is_empty() {
                // Quote what matched when we can: "used 'darn' 3 times" tells a
                // moderator in one glance what "matched rule words" never could.
                let quoted: Vec<String> = c
                    .citations
                    .iter()
                    .filter_map(|id| detail_of.get(&id.0).cloned())
                    .collect::<std::collections::BTreeSet<_>>()
                    .into_iter()
                    .take(3)
                    .collect();
                reasons.push(match c.rule_id.as_str() {
                    "fresh" => "Joined in the last 24h".to_string(),
                    "quiet" => "Has barely posted".to_string(),
                    "repeat" => format!("Repeated one message {} times", c.hits),
                    "shorteners" | "links" => {
                        let which = quoted.join(", ");
                        if which.is_empty() {
                            format!("Posted {} flagged link(s)", c.hits)
                        } else {
                            format!("Posted {} flagged link(s): {which}", c.hits)
                        }
                    }
                    _ if !quoted.is_empty() => {
                        format!("Used {} ({} time{})", quoted.iter().map(|q| format!("\"{q}\"")).collect::<Vec<_>>().join(", "), c.hits, if c.hits == 1 { "" } else { "s" })
                    }
                    other => format!("Matched rule {other}"),
                });
            }
        }
        if verdict == "protected" {
            reasons.push(if f.is_owner { "Community owner".into() } else { "Holds a role".into() });
        } else if verdict == "trusted" && reasons.is_empty() {
            reasons.push("Long-standing member".into());
        }

        // The machine-readable spine beside the prose. `reasons` says what a
        // person reads; this says what a program acts on — which rule, how
        // grave its author called it, and which messages it cited. A consumer
        // that has to parse English cannot tell a swear from a scam link.
        let findings: Vec<serde_json::Value> = judged
            .iter()
            .map(|(policy_hash, c)| {
                let messages: Vec<String> =
                    c.citations.iter().filter_map(|id| message_of.get(&id.0).cloned()).collect();
                let detail: std::collections::BTreeSet<String> =
                    c.citations.iter().filter_map(|id| detail_of.get(&id.0).cloned()).collect();
                serde_json::json!({
                    // Stable per (policy, rule, scope, rung, subject) and
                    // deliberately NOT per hit, so a consumer can dedup across
                    // polls; escalating a rung mints a new one, which is the
                    // right moment to act again.
                    "conviction_id": crate::simd::hex::bytes_to_hex_32(&c.id.0),
                    "policy_hash": crate::simd::hex::bytes_to_hex_32(&policy_hash.0),
                    "rule_id": c.rule_id,
                    "scope": wire(c.scope),
                    "basis": wire(c.basis),
                    "severity": wire(c.severity),
                    // Could one message have settled this? Only content rules
                    // admit PerMessage, so the scope already answers it — and a
                    // consumer that screens live AND sweeps needs to know which
                    // findings the other clock has already answered, or one
                    // offense is counted twice.
                    "stateless": c.scope == Scope::PerMessage,
                    "rung": c.rung,
                    "hits": c.hits,
                    "weight": c.tier_weight,
                    "detail": detail.into_iter().collect::<Vec<_>>(),
                    "messages": messages,
                    "citation_count": c.citation_count,
                })
            })
            .collect();

        let mut row = serde_json::json!({
            "npub": npub,
            "verdict": verdict,
            // The standing itself, beside the console's word for it: a Trusted
            // member pierced by a grave rule reads "suspect", which answers what
            // to show and loses what may be done to them.
            "shield": wire(shield),
            "score": score,
            "band": wire(band),
            "proven": proven_score,
            "reasons": reasons,
            "joined_at_ms": f.joined_at_ms,
            "invite_label": f.invite_label,
            "messages": f.messages,
            "distinct": f.distinct,
            "cohort": cohort_peers,
            "tenure_secs": f.tenure_secs,
            "last_secs": f.last_secs,
            "is_owner": f.is_owner,
            "is_admin": f.is_admin,
            "is_me": f.is_me,
        });
        // Absent rather than empty for the clean majority: 512 members may each
        // hold 16 convictions, and this crosses an IPC boundary Android feels.
        if !findings.is_empty() {
            row["findings"] = serde_json::Value::Array(findings);
        }
        members.push(row);
    }
    // Suspects first — the panel opens on what needs deciding — then the people
    // who hold this place together, and the unremarkable majority last. Sorting
    // neutral above trusted buried every regular below a hundred rows of nobody
    // in particular.
    members.sort_by(|a, b| {
        let rank = |v: &serde_json::Value| match v["verdict"].as_str() {
            Some("suspect") => 0,
            Some("protected") => 1,
            Some("trusted") => 2,
            _ => 3,
        };
        rank(a)
            .cmp(&rank(b))
            .then_with(|| b["score"].as_u64().cmp(&a["score"].as_u64()))
            .then_with(|| b["messages"].as_u64().cmp(&a["messages"].as_u64()))
    });

    // Cohort exhibits, largest first.
    let mut cohorts: std::collections::BTreeMap<[u8; 32], (usize, String)> = std::collections::BTreeMap::new();
    let mut burst = (0u32, 0u64, 0u64);
    for s in report.policies.iter().flat_map(|p| p.subjects.iter()) {
        for c in s.convictions.iter().filter(|c| !c.suppressed) {
            for e in &c.evidence {
                match e {
                    Evidence::Cohort { skeleton_hash, size, sample, .. } => {
                        let slot = cohorts.entry(skeleton_hash.0).or_insert((0, sample.clone()));
                        slot.0 = slot.0.max(*size as usize);
                    }
                    Evidence::Burst { size, from, to } if *size > burst.0 => {
                        burst = (*size, *from, *to);
                    }
                    _ => {}
                }
            }
        }
    }
    let mut cohort_list: Vec<serde_json::Value> = cohorts
        .into_values()
        .map(|(size, sample)| serde_json::json!({ "size": size, "sample": sample, "members": [] }))
        .collect();
    cohort_list.sort_by(|a, b| b["size"].as_u64().cmp(&a["size"].as_u64()));

    let _ = now_secs;
    serde_json::json!({
        "members": members,
        "cohorts": cohort_list,
        "suspects": suspects,
        "trusted": trusted,
        "protected": protected,
        "raid_detected": !cohort_list_is_empty(&cohort_list) && suspects > 0,
        "burst_size": burst.0,
        "burst_from_ms": burst.1,
        "burst_to_ms": burst.2,
        "inert_policies": inert,
    })
}

fn cohort_list_is_empty(v: &[serde_json::Value]) -> bool {
    v.is_empty()
}

/// One member's verdict from each side, for eyeballing where they differ.
#[derive(Debug, Clone, serde::Serialize)]
pub struct VerdictRow {
    pub npub: String,
    /// What `raid.rs` said.
    pub assessor: String,
    /// What the engine scored.
    pub confidence: u32,
    pub proven: u32,
    pub band: String,
    pub shield: String,
    pub rules: Vec<String>,
}

/// What the side-by-side run found.
#[derive(Debug, Clone, serde::Serialize)]
pub struct DiffReport {
    pub members: usize,
    pub corpus: usize,
    /// Members the engine convicted (any conviction).
    pub engine_convicted: usize,
    /// Members `raid.rs` calls Suspect.
    pub assessor_suspects: usize,
    /// Convicted by the engine, cleared by the assessor — and the reverse.
    pub engine_only: Vec<VerdictRow>,
    pub assessor_only: Vec<VerdictRow>,
    /// Both agree something is wrong.
    pub agreed: Vec<VerdictRow>,
    /// Shield distribution, so a mis-shielded roster is visible immediately.
    pub protected: usize,
    pub trusted: usize,
    pub indeterminate: usize,
    /// Rule-level states — a rule that could not evaluate says so.
    pub rule_states: Vec<(String, String)>,
    pub coverage_complete: bool,
    /// Wall-clock cost, split so a slow run says WHICH half is slow: reading
    /// and decrypting local state, versus the pure evaluation.
    pub signals_ms: u64,
    pub evaluate_ms: u64,
}

/// Assemble signals from local state and evaluate. Reads only; the engine is
/// pure, so this is safe to run against a live community at any time.
pub fn run_side_by_side(
    community_id_hex: &str,
    owner: &PublicKey,
    members: &[(PublicKey, Option<u64>, bool, Vec<String>)],
    assessments: &[(String, String)],
    now_ms: u64,
) -> Result<DiffReport, String> {
    let policy = default_policy();
    let bytes = serde_json::to_vec(&policy).map_err(|e| e.to_string())?;
    let lp = LoadedPolicy { hash: hash_policy_bytes(&bytes), policy, activated_at: None };

    let t0 = web_time::Instant::now();
    let rows = crate::db::community::community_policy_messages(community_id_hex, caps::WINDOW_MAX_MESSAGES)?;
    let corpus = rows.len();
    let messages: Vec<MessageSignal> = rows
        .into_iter()
        .filter_map(|m| {
            Some(MessageSignal {
                id: MessageId(crate::simd::hex::hex_to_bytes_32_checked(&m.id)?),
                author: subject_of(&m.npub)?,
                channel: Hash32(crate::simd::hex::hex_to_bytes_32_checked(&m.channel_id)?),
                at_ms: m.at_ms,
                text: m.text,
                mentions: m.mentions,
            })
        })
        .collect();

    let channels: BTreeSet<[u8; 32]> = messages.iter().map(|m| m.channel.0).collect();
    // Lifetime footprints: standing is historical, so a quiet week must not
    // cost a regular the standing they built over months.
    let footprints: std::collections::HashMap<String, (u64, u64)> =
        crate::db::community::community_author_footprints(community_id_hex)
            .unwrap_or_default()
            .into_iter()
            .map(|f| (f.npub, (f.messages, f.first_secs)))
            .collect();
    let member_signals: Vec<MemberSignal> = members
        .iter()
        .map(|(pk, joined, is_staff, roles)| MemberSignal {
            subject: SubjectId(pk.to_bytes()),
            joined_at_ms: *joined,
            roles: roles.iter().filter_map(|r| crate::simd::hex::hex_to_bytes_32_checked(r)).map(Hash32).collect(),
            is_staff: *is_staff,
            lifetime_messages: pk.to_bech32().ok().and_then(|b| footprints.get(&b).map(|f| f.0)).unwrap_or(0),
            first_post_ms: pk
                .to_bech32()
                .ok()
                .and_then(|b| footprints.get(&b).map(|f| f.1))
                .filter(|s| *s > 0)
                .map(|s| s.saturating_mul(1000)),
        })
        .collect();

    let signals = Signals {
        owner: SubjectId(owner.to_bytes()),
        members: member_signals,
        messages,
        channels: channels.into_iter().map(Hash32).collect(),
        // The harness reads local state, so it makes no coverage claim: the
        // caller has not proven an EOSE-confirmed range here.
        relays: vec![],
        requested_from: 0,
        requested_to: now_ms,
        confirmed_from: u64::MAX,
        confirmed_to: now_ms,
        roster_version: Hash32([0; 32]),
    };

    let signals_ms = t0.elapsed().as_millis() as u64;
    let t1 = web_time::Instant::now();
    let report = evaluate(&signals, &[lp], &[], now_ms);
    let evaluate_ms = t1.elapsed().as_millis() as u64;
    let pr = report.policies.first().ok_or("no policy report")?;

    let verdict_of = |npub: &str| -> String {
        assessments.iter().find(|(n, _)| n == npub).map(|(_, v)| v.clone()).unwrap_or_else(|| "unknown".into())
    };

    let mut engine_only = Vec::new();
    let mut assessor_only = Vec::new();
    let mut agreed = Vec::new();
    let (mut protected, mut trusted, mut indeterminate) = (0, 0, 0);
    let mut engine_convicted = 0usize;

    for s in &pr.subjects {
        match s.shield {
            Shield::Protected => protected += 1,
            Shield::Trusted => trusted += 1,
            Shield::Indeterminate => indeterminate += 1,
            Shield::None => {}
        }
        let npub = PublicKey::from_slice(&s.subject.0).ok().and_then(|p| p.to_bech32().ok()).unwrap_or_default();
        let assessor = verdict_of(&npub);
        let convicted = s.convictions.iter().any(|c| !c.suppressed);
        if convicted {
            engine_convicted += 1;
        }
        let row = VerdictRow {
            npub: npub.clone(),
            assessor: assessor.clone(),
            confidence: s.confidence,
            proven: s.proven,
            band: format!("{:?}", s.band).to_lowercase(),
            shield: format!("{:?}", s.shield).to_lowercase(),
            rules: s.convictions.iter().map(|c| format!("{}:{:?}", c.rule_id, c.scope)).collect(),
        };
        match (convicted, assessor == "suspect") {
            (true, true) => agreed.push(row),
            (true, false) => engine_only.push(row),
            (false, true) => assessor_only.push(row),
            (false, false) => {}
        }
    }
    // A member the assessor suspects but the engine never scored at all is
    // still a disagreement worth seeing.
    for (npub, verdict) in assessments.iter().filter(|(_, v)| v == "suspect") {
        if !pr.subjects.iter().any(|s| {
            PublicKey::from_slice(&s.subject.0).ok().and_then(|p| p.to_bech32().ok()).as_deref() == Some(npub.as_str())
        }) {
            assessor_only.push(VerdictRow {
                npub: npub.clone(),
                assessor: verdict.clone(),
                confidence: 0,
                proven: 0,
                band: "clear".into(),
                shield: "none".into(),
                rules: vec![],
            });
        }
    }

    Ok(DiffReport {
        members: members.len(),
        corpus,
        engine_convicted,
        assessor_suspects: assessments.iter().filter(|(_, v)| v == "suspect").count(),
        engine_only,
        assessor_only,
        agreed,
        protected,
        trusted,
        indeterminate,
        rule_states: pr
            .rule_status
            .iter()
            .map(|r| (r.rule_id.clone(), format!("{:?}", r.state).to_lowercase()))
            .collect(),
        coverage_complete: pr.coverage_complete,
        signals_ms,
        evaluate_ms,
    })
}

#[cfg(test)]
mod tests {
    use super::*;

    /// A screened message sits at `now_ms`, and `clamp_corpus` keeps
    /// `at_ms < now_ms` STRICTLY — so the one message being screened fell
    /// outside its own corpus and the live text lane convicted nobody, ever.
    #[test]
    fn the_message_being_screened_is_inside_its_own_corpus() {
        use nostr_sdk::prelude::Keys;

        let owner = Keys::generate();
        let author = Keys::generate();
        let now = 1_700_000_000_000u64;

        let policy = Policy {
            format: FORMAT,
            requires: vec![],
            name: "screen-test".into(),
            emoji_codes: vec![],
            shields: Shields::default(),
            window: Window { hours: 168, max_messages: 4000 },
            exempt: Exempt::default(),
            rules: vec![Rule {
                id: "words".into(),
                matcher: Match::Keyword { patterns: vec!["badword".into()], normalize: Normalize::Fold },
                tiers: Some(Tiers {
                    per_message: vec![Rung {
                        hits: 1,
                        severity: Severity::Severe,
                        weight: 70,
                        pierces_trusted: false,
                    }],
                    per_window: vec![],
                }),
                severity: None,
                weight: None,
                pierces_trusted: false,
                family: None,
                armed_by: None,
                exempt: Exempt::default(),
                enforcement: Enforcement::Advisory,
            }],
        };
        let loaded = vec![LoadedPolicy { hash: Hash32([9u8; 32]), policy, activated_at: None }];

        // Exactly the shape `screen_message` builds.
        let subject = SubjectId(author.public_key().to_bytes());
        let signals = Signals {
            owner: SubjectId(owner.public_key().to_bytes()),
            members: vec![MemberSignal {
                subject,
                joined_at_ms: None,
                roles: vec![],
                is_staff: false,
                lifetime_messages: 0,
                first_post_ms: None,
            }],
            messages: vec![MessageSignal {
                id: MessageId([0; 32]),
                author: subject,
                channel: Hash32([1u8; 32]),
                at_ms: now,
                text: "this has badword in it".into(),
                mentions: 0,
            }],
            channels: vec![Hash32([1u8; 32])],
            relays: vec![],
            requested_from: now,
            requested_to: now,
            confirmed_from: now,
            confirmed_to: now,
            roster_version: Hash32([0; 32]),
        };

        let report = evaluate_as(&signals, &loaded, &[], screen_at(now), EvalMode::Member);
        let convictions: usize = report.policies.iter().flat_map(|p| &p.subjects).map(|s| s.convictions.len()).sum();
        assert!(convictions > 0, "the screened message must be judged, not clamped out of its own corpus");
    }

    /// The console builds each member by hand, and it left `band` out. Every
    /// consumer that gates on it — the SDK's `actionable()`, `needs_human()`
    /// and the whole autopilot — read the default "clear" and acted on nobody,
    /// which looks exactly like a community where nothing happened.
    #[test]
    fn every_member_carries_the_band_its_confidence_earned() {
        use nostr_sdk::prelude::Keys;

        fn one(subjects: Vec<(u32, Band)>) -> serde_json::Value {
            let keys = Keys::generate();
            let npub = keys.public_key().to_bech32().expect("npub");
            let policies = subjects
                .into_iter()
                .map(|(confidence, band)| PolicyReport {
                    policy_hash: Hash32([1; 32]),
                    inert: None,
                    activated_at: None,
                    coverage_complete: true,
                    rule_status: vec![],
                    subjects: vec![SubjectReport {
                        subject: SubjectId(keys.public_key().to_bytes()),
                        shield: Shield::None,
                        confidence,
                        proven: confidence,
                        band,
                        convictions: vec![],
                    }],
                    subjects_truncated: 0,
                    citations: vec![],
                })
                .collect();
            let report = ModerationReport {
                engine_version: caps::ENGINE_VERSION,
                bundle_version: caps::BUNDLE_VERSION,
                roster_version: Hash32([0; 32]),
                override_hash: Hash32([0; 32]),
                evaluated_at: 0,
                window: WindowCoverage::default(),
                policies,
            };
            let facts = std::collections::BTreeMap::from([(npub, MemberFacts::default())]);
            console_report(&report, &facts, 0)["members"][0].clone()
        }

        for (confidence, band) in [(90u32, Band::Alert), (60, Band::Flagged), (30, Band::Watch), (0, Band::Clear)] {
            let row = one(vec![(confidence, band)]);
            let expected = format!("{band:?}").to_lowercase();
            assert_eq!(row["score"].as_u64(), Some(confidence as u64));
            assert_eq!(
                row["band"].as_str(),
                Some(expected.as_str()),
                "a member at confidence {confidence} must carry the band it earned, not a default"
            );
        }

        // Laws are scored independently and the console folds across them, so
        // the band has to travel with the confidence it belongs to.
        let row = one(vec![(30, Band::Watch), (90, Band::Alert)]);
        assert_eq!(row["score"].as_u64(), Some(90), "the worst law decides the score");
        assert_eq!(row["band"].as_str(), Some("alert"), "and the same law decides the band");
    }

    /// A Trusted member CAN carry a conviction: `pierces_trusted` exists exactly
    /// so a grave rule reaches them. The console then calls them "suspect",
    /// which answers what to SHOW and says nothing about what may be done —
    /// so their standing has to travel as its own field. A consumer inferring
    /// the shield from the word strips it at the one moment it matters.
    #[test]
    fn a_pierced_trusted_member_keeps_their_standing_in_the_report() {
        use nostr_sdk::prelude::Keys;

        let keys = Keys::generate();
        let npub = keys.public_key().to_bech32().expect("npub");
        let subject = SubjectId(keys.public_key().to_bytes());
        let conviction = Conviction {
            id: conviction_id(&Hash32([1; 32]), "slurs", Scope::PerMessage, 0, &subject),
            subject,
            rule_id: "slurs".into(),
            scope: Scope::PerMessage,
            rung: 0,
            hits: 1,
            severity: Severity::Severe,
            basis: Basis::Deterministic,
            tier_weight: 85,
            retroactive: Retroactive::Unknown,
            suppressed: false,
            folded: false,
            folded_into: None,
            combined: true,
            proven_combined: true,
            citations: vec![],
            citation_count: 0,
            earliest_citation_at: 0,
            latest_citation_at: 0,
            family: None,
            evidence: vec![],
        };
        let report = ModerationReport {
            engine_version: caps::ENGINE_VERSION,
            bundle_version: caps::BUNDLE_VERSION,
            roster_version: Hash32([0; 32]),
            override_hash: Hash32([0; 32]),
            evaluated_at: 0,
            window: WindowCoverage::default(),
            policies: vec![PolicyReport {
                policy_hash: Hash32([1; 32]),
                inert: None,
                activated_at: None,
                coverage_complete: true,
                rule_status: vec![],
                subjects: vec![SubjectReport {
                    subject,
                    shield: Shield::Trusted,
                    confidence: 85,
                    proven: 85,
                    band: Band::Alert,
                    convictions: vec![conviction],
                }],
                subjects_truncated: 0,
                citations: vec![],
            }],
        };
        let facts = std::collections::BTreeMap::from([(npub, MemberFacts::default())]);
        let row = &console_report(&report, &facts, 0)["members"][0];

        assert_eq!(row["verdict"].as_str(), Some("suspect"), "the panel opens on what needs deciding");
        assert_eq!(row["shield"].as_str(), Some("trusted"), "and their standing survives the projection");
    }

    /// `reasons` is prose for a person. A bot ramping its response — a warning
    /// for a swear, a ban for a scam link — has to branch on the RULE, and it
    /// must never do that by parsing English.
    #[test]
    fn a_conviction_reaches_a_bot_as_rule_identity_and_the_messages_it_cited() {
        use nostr_sdk::prelude::Keys;

        let keys = Keys::generate();
        let npub = keys.public_key().to_bech32().expect("npub");
        let subject = SubjectId(keys.public_key().to_bytes());
        let policy_hash = Hash32([7; 32]);
        let message = MessageId([0xb1; 32]);
        let target = CitationTarget::Message { message_id: message };
        let cid = citation_id(&policy_hash, "links", Scope::PerMessage, &subject, &target, None);

        let conviction = Conviction {
            id: conviction_id(&policy_hash, "links", Scope::PerMessage, 0, &subject),
            subject,
            rule_id: "links".into(),
            scope: Scope::PerMessage,
            rung: 0,
            hits: 2,
            severity: Severity::Severe,
            basis: Basis::Deterministic,
            tier_weight: 85,
            retroactive: Retroactive::Unknown,
            suppressed: false,
            folded: false,
            folded_into: None,
            combined: true,
            proven_combined: true,
            citations: vec![cid],
            citation_count: 2,
            earliest_citation_at: 10,
            latest_citation_at: 20,
            family: None,
            evidence: vec![],
        };
        let clean = Keys::generate();
        let clean_npub = clean.public_key().to_bech32().expect("npub");
        let report = ModerationReport {
            engine_version: caps::ENGINE_VERSION,
            bundle_version: caps::BUNDLE_VERSION,
            roster_version: Hash32([0; 32]),
            override_hash: Hash32([0; 32]),
            evaluated_at: 0,
            window: WindowCoverage::default(),
            policies: vec![PolicyReport {
                policy_hash,
                inert: None,
                activated_at: None,
                coverage_complete: true,
                rule_status: vec![],
                subjects: vec![
                    SubjectReport {
                        subject,
                        shield: Shield::None,
                        confidence: 85,
                        proven: 85,
                        band: Band::Alert,
                        convictions: vec![conviction],
                    },
                    SubjectReport {
                        subject: SubjectId(clean.public_key().to_bytes()),
                        shield: Shield::None,
                        confidence: 0,
                        proven: 0,
                        band: Band::Clear,
                        convictions: vec![],
                    },
                ],
                subjects_truncated: 0,
                citations: vec![Citation {
                    id: cid,
                    target,
                    at: 20,
                    span: None,
                    detail: Some("bit.ly".into()),
                    suppressed: false,
                }],
            }],
        };
        let facts = std::collections::BTreeMap::from([
            (npub.clone(), MemberFacts::default()),
            (clean_npub.clone(), MemberFacts::default()),
        ]);
        let console = console_report(&report, &facts, 0);
        let rows = console["members"].as_array().expect("members");
        let row = rows.iter().find(|m| m["npub"].as_str() == Some(npub.as_str())).expect("the convicted member");

        let f = &row["findings"][0];
        assert_eq!(f["rule_id"].as_str(), Some("links"), "the rule, so a bot can ramp on it");
        assert_eq!(f["severity"].as_str(), Some("severe"), "the author's gravity, snake_case like the wire");
        assert_eq!(f["basis"].as_str(), Some("deterministic"), "provable, so it may be acted on unattended");
        assert_eq!(f["scope"].as_str(), Some("per_message"));
        assert_eq!(f["hits"].as_u64(), Some(2));
        assert_eq!(f["weight"].as_u64(), Some(85));
        assert_eq!(f["policy_hash"].as_str(), Some(crate::simd::hex::bytes_to_hex_32(&policy_hash.0).as_str()));
        assert_eq!(f["detail"][0].as_str(), Some("bit.ly"), "what actually matched");
        assert_eq!(
            f["messages"][0].as_str(),
            Some(crate::simd::hex::bytes_to_hex_32(&message.0).as_str()),
            "the message to hide, resolved from the citation"
        );
        assert_eq!(
            f["conviction_id"].as_str(),
            Some(crate::simd::hex::bytes_to_hex_32(&conviction_id(&policy_hash, "links", Scope::PerMessage, 0, &subject).0).as_str()),
            "the dedup key, stable across polls"
        );
        assert!(!row["reasons"].as_array().unwrap().is_empty(), "and the prose the panel reads is untouched");

        let clean_row = rows.iter().find(|m| m["npub"].as_str() == Some(clean_npub.as_str())).unwrap();
        assert!(clean_row["findings"].is_null(), "a member nothing convicted carries no findings key at all");
    }

    /// A word filter answering on the next 90-second tick is not a word
    /// filter. The stateless rules settle per message; the windowed ones are
    /// ABSENT here rather than wrongly clean.
    #[test]
    fn screening_answers_the_stateless_rules_and_stays_quiet_about_the_rest() {
        use nostr_sdk::prelude::Keys;
        let owner = Keys::generate();
        let member = Keys::generate();
        let cid = "aa".repeat(32);
        let chan = "bb".repeat(32);

        // No stored policy: nothing to screen against, and no panic either.
        let none = screen_message(&cid, &owner.public_key(), &member.public_key(), &[], false, &chan, "hello", 0);
        assert!(none.is_empty(), "a community with no policies screens to nothing");

        // The stateless matchers are exactly the ones a single message can settle.
        for m in [
            Match::Keyword { patterns: vec!["x".into()], normalize: Normalize::Fold },
            Match::Link { patterns: vec!["bit.ly".into()] },
            Match::Mentions {},
        ] {
            assert!(m.is_stateless(), "{m:?} must answer per message");
        }
        for m in [
            Match::Rate { per_secs: 60 },
            Match::Repeat { normalize: Normalize::Skeleton, within_secs: None },
            Match::Cohort { min: 3, quiet_max: 2, short_factor: 3, thin_ratio: None },
            Match::JoinBurst { gap_secs: 300, min: 5 },
        ] {
            assert!(!m.is_stateless(), "{m:?} describes a window and must not answer from one message");
        }
    }

    /// A wave that posts straight into a community without ever filing a Join
    /// is a member by `stored_memberlist` and used to be zero arrivals to a
    /// join-flood rule. Both routes count now.
    #[test]
    fn arrival_counts_every_way_in_not_just_the_paperwork() {
        // The ordinary member: a Join, and posts after it.
        assert_eq!(arrival(Some(1_000), Some(5_000)), Some(1_000));
        // The cheat: no Join at all, straight to posting. Used to be None,
        // which the burst rule reads as "not evidence of a join".
        assert_eq!(arrival(None, Some(5_000)), Some(5_000), "posting IS arriving");
        // A member whose Join was lost but who was already talking: the earlier
        // trace wins, so they keep the tenure they earned.
        assert_eq!(arrival(Some(9_000), Some(2_000)), Some(2_000));
        // Nothing at all is still unknowable, and unknown is never a conviction.
        assert_eq!(arrival(None, None), None);
    }

    #[test]
    fn the_builtin_policy_validates() {
        assert!(default_policy().validate().is_ok(), "a shipped policy that cannot validate is a shipped outage");
    }

    fn stored(policy_id: &str, name: &str, enabled: bool) -> crate::db::community::StoredPolicy {
        let mut p = crate::community::policy::presets::all()
            .into_iter()
            .find(|x| x.id == "word_filter")
            .expect("word_filter preset")
            .policy;
        p.name = name.into();
        let bytes = serde_json::to_string(&p).unwrap();
        crate::db::community::StoredPolicy {
            policy_id: policy_id.into(),
            hash: crate::simd::hex::bytes_to_hex_32(&hash_policy_bytes(bytes.as_bytes()).0),
            bytes,
            enabled,
            updated_at: 0,
        }
    }

    fn names(loaded: &[LoadedPolicy]) -> Vec<String> {
        loaded.iter().map(|l| l.policy.name.to_string()).collect()
    }

    /// The bug this replaced: any stored policy returned early, so enabling a
    /// word filter for spoilers silently switched scam-link and raid cover off
    /// while the console still said "always on".
    #[test]
    fn a_custom_policy_runs_beside_the_defaults_not_instead_of_them() {
        let loaded = select_policies(vec![stored("word_filter", "Spoilers", true)]);
        let got = names(&loaded);
        assert!(got.contains(&"Spoilers".to_string()), "the community's own policy must run: {got:?}");
        assert!(
            got.contains(&default_policy().name.to_string()),
            "the shipped defaults must still run alongside it: {got:?}"
        );
    }

    #[test]
    fn nothing_stored_still_runs_the_defaults() {
        assert_eq!(names(&select_policies(vec![])), vec![default_policy().name.to_string()]);
    }

    /// Forking is the ONLY way to change the defaults, so the fork has to be
    /// what runs — two copies of the same rules would double every weight.
    #[test]
    fn a_fork_replaces_the_defaults_rather_than_stacking_on_them() {
        let loaded = select_policies(vec![stored(DEFAULTS_POLICY_ID, "My defaults", true)]);
        assert_eq!(names(&loaded), vec!["My defaults".to_string()]);
    }

    /// Turning the fork off is a deliberate act, and it has to stick: silently
    /// restoring the shipped defaults would make the switch a lie.
    #[test]
    fn a_disabled_fork_leaves_the_community_with_no_defaults() {
        let loaded = select_policies(vec![
            stored(DEFAULTS_POLICY_ID, "My defaults", false),
            stored("word_filter", "Spoilers", true),
        ]);
        assert_eq!(names(&loaded), vec!["Spoilers".to_string()]);
    }

    /// The shipped defaults must never decide what a community may say or link
    /// to. A denylist baked into the client makes that call for every community
    /// at once while looking like a rule of the protocol; the bundled shortener
    /// list belongs to the Scam Links template, where switching it on is
    /// somebody's decision.
    #[test]
    fn the_defaults_block_no_links_and_no_words() {
        for r in &default_policy().rules {
            match &r.matcher {
                Match::Link { .. } => panic!("the defaults ship a link blocker: rule {}", r.id),
                Match::Keyword { .. } | Match::Regex { .. } => {
                    panic!("the defaults ship a word filter: rule {}", r.id)
                }
                _ => {}
            }
        }
    }

    /// Spam, mass-tagging and word lists are a community's taste, switched on
    /// from a template when it wants them. Shipping any of them on by default
    /// decides that taste for every community at once.
    #[test]
    fn the_defaults_judge_nothing_but_the_swarm() {
        for r in &default_policy().rules {
            let allowed = matches!(
                r.matcher,
                Match::Cohort { .. } | Match::JoinBurst { .. } | Match::TenureLt { .. } | Match::MessagesLte { .. }
            );
            assert!(allowed, "the defaults ship a non-raid rule: {} ({})", r.id, r.matcher.type_name());
        }
    }

    /// Whatever else changes, the swarm shape is the thing a community cannot
    /// hand-configure before it is attacked, so it stays in the defaults.
    #[test]
    fn the_defaults_still_detect_a_raid() {
        let p = default_policy();
        assert!(
            p.rules.iter().any(|r| matches!(r.matcher, Match::Cohort { .. }) && r.armed_by.is_none()),
            "raid detection has to be able to convict on its own"
        );
        assert!(
            p.rules.iter().any(|r| matches!(r.matcher, Match::JoinBurst { .. })),
            "the join-flood signal went missing"
        );
    }

    /// The console's "always on" badge and the engine's loader must never
    /// disagree: one flag says cover is running, the other decides whether it
    /// actually does.
    #[test]
    fn the_builtin_badge_agrees_with_what_the_engine_loads() {
        let cases = vec![
            vec![],
            vec![stored("word_filter", "Spoilers", true)],
            vec![stored(DEFAULTS_POLICY_ID, "Mine", true)],
            vec![stored(DEFAULTS_POLICY_ID, "Mine", false)],
        ];
        for stored_rows in cases {
            let badge = !stored_rows.iter().any(|p| p.policy_id == DEFAULTS_POLICY_ID);
            let engine_runs_defaults = select_policies(stored_rows.clone())
                .iter()
                .any(|l| l.policy.name == default_policy().name);
            assert_eq!(badge, engine_runs_defaults, "badge and loader disagree for {stored_rows:?}");
        }
    }

    /// Every kind the from-scratch builder offers has to survive validation on
    /// its own, and none may be a weak signal that needs arming.
    #[test]
    fn every_buildable_rule_kind_stands_alone() {
        for k in crate::community::policy::presets::rule_kinds() {
            assert!(k.rule.armed_by.is_none(), "{} is an aggravator, not a rule you can build with", k.id);
            let mut p = base_for_test();
            p.rules = vec![k.rule.clone()];
            assert!(p.validate().is_ok(), "rule kind {} does not validate alone", k.id);
            assert!(!k.description.is_empty(), "rule kind {} needs a plain-language description", k.id);
        }
    }

    fn base_for_test() -> Policy {
        let mut p = default_policy();
        p.rules = vec![];
        p
    }

    /// The first live run convicted 147 of 155 members on "has posted at most
    /// twice" alone. A weak signal must never speak by itself — that includes
    /// a join burst, which is exactly what a freshly-posted invite link looks
    /// like.
    #[test]
    fn every_weak_signal_is_armed_by_a_real_conviction() {
        let p = default_policy();
        for rule in &p.rules {
            // "Joined recently" and "has barely posted" describe most of a
            // healthy community — the first live run convicted 147 of 155 on the
            // second one alone. These are only ever true ABOUT someone a real
            // detector already caught.
            let describes_the_innocent =
                matches!(rule.matcher, Match::TenureLt { .. } | Match::MessagesLte { .. });
            if describes_the_innocent {
                assert!(rule.armed_by.is_some(), "rule {} must never speak alone", rule.id);
            }
        }
    }

    /// The reason the second path exists: a raid whose accounts each say
    /// something DIFFERENT never forms a cohort cluster, and before this every
    /// downstream signal was armed by that one rule and stayed silent with it.
    #[test]
    fn the_aggravators_answer_to_either_detector() {
        let p = default_policy();
        for rule in &p.rules {
            if !matches!(rule.matcher, Match::TenureLt { .. } | Match::MessagesLte { .. }) {
                continue;
            }
            let arm = rule.armed_by.as_ref().expect("aggravators are armed");
            let names: Vec<&str> =
                std::iter::once(arm.rule.as_str()).chain(arm.also.iter().map(|s| s.as_str())).collect();
            assert!(
                names.contains(&"cohort") && names.contains(&"burst"),
                "aggravator {} hangs off {:?} — one detector is one point of failure",
                rule.id,
                names
            );
        }
    }

    /// A join flood is now a conviction path of its own, so that it can catch a
    /// raid whose accounts vary their text and `cohort` never clusters. The price
    /// is that a freshly posted invite link looks the same, so the rule must stay
    /// too weak to act on by itself: it takes an aggravator to lift it, and a
    /// wave of real people who then TALK never supplies one.
    #[test]
    fn a_join_flood_alone_asks_for_a_look_never_for_an_action() {
        let burst = default_policy()
            .rules
            .iter()
            .find(|r| matches!(r.matcher, Match::JoinBurst { .. }))
            .cloned()
            .expect("the defaults carry a join-flood rule");
        let weight = burst.weight.expect("an unarmed join flood needs a weight");
        let band = super::super::combine::band(super::super::combine::conf_pm(&[weight]));
        assert!(
            matches!(band, Band::Clear | Band::Noted | Band::Watch),
            "a join flood alone reached {band:?} — an invite link would be actioned as a raid"
        );
    }

    /// Round-tripping the bytes must not change them: the hash is over exactly
    /// what was stored, and one day exactly what a control-plane edition
    /// carries to every device.
    #[test]
    fn stored_bytes_are_what_the_engine_hashes() {
        let p = default_policy();
        let bytes = serde_json::to_string(&p).unwrap();
        let hash = hash_policy_bytes(bytes.as_bytes());
        // Parse and re-hash the ORIGINAL bytes, not the re-serialization —
        // reserialising is exactly the mistake the wire cannot tolerate.
        let parsed: Policy = serde_json::from_str(&bytes).unwrap();
        assert_eq!(parsed, p, "a policy survives its own round trip");
        assert_eq!(hash_policy_bytes(bytes.as_bytes()), hash);
        // Pretty-printing is semantically identical and hashes DIFFERENTLY.
        let pretty = serde_json::to_string_pretty(&p).unwrap();
        assert_ne!(hash_policy_bytes(pretty.as_bytes()), hash, "identity is the bytes, not the meaning");
    }

    #[test]
    fn the_policy_hash_is_over_the_bytes_it_arrived_as() {
        let p = default_policy();
        let a = serde_json::to_vec(&p).unwrap();
        // Same bytes, same hash; different bytes (even semantically equal
        // JSON), different hash — which is exactly why the wire hashes bytes
        // rather than a re-serialization.
        assert_eq!(hash_policy_bytes(&a), hash_policy_bytes(&a));
        let mut spaced = String::from_utf8(a.clone()).unwrap();
        spaced.push(' ');
        assert_ne!(hash_policy_bytes(&a), hash_policy_bytes(spaced.as_bytes()));
    }
}