cortiq_engine/

pipeline.rs

//! Full inference pipeline: tokenize → embed → layers → lm_head → sample → decode.
//!
//! Prefill/decode contract: every token is forwarded exactly once and
//! enters the KV cache exactly once. Logits for the next token are
//! computed from the hidden state of the LAST forwarded token — the
//! decode loop forwards the freshly sampled token, never re-embeds the
//! prompt tail (v1 duplicated the last prompt token in the cache).

use crate::attention::{self, QwenAttnCfg};
use crate::inference;

/// MiMo-V2 multi-token prediction (draft stack + speculative round). A
/// child module so it runs on the pipeline's own helpers.
#[path = "mimo_mtp.rs"]
pub mod mimo_mtp;
#[path = "clover.rs"]
pub mod clover;
/// d1's non-causal forward over a packed state and question set.
#[path = "pipeline_masked.rs"]
pub mod masked;
#[path = "pipeline_speech.rs"]
pub mod speech;
use crate::kv_cache::KvCache;
use crate::linear_core::{
    GdnCfg, GdnWeights, ShortConvCfg, ShortConvWeights, VmfPhaseCfg, VmfPhaseWeights, gdn_forward,
    gdn_pair, short_conv_forward, short_conv_forward_batch, short_conv_pair, vmf_phase_forward,
    vmf_phase_pair,
};
use crate::pool::Pool;
use crate::qtensor::QTensor;
use crate::sampler::{self, SamplerConfig, SamplerScratch, SplitMix64};
use crate::tokenizer::Tokenizer;
use cortiq_core::mask::TaskMask;
use cortiq_core::types::NormStyle;

pub static GLOBAL_USE_GPU: std::sync::atomic::AtomicBool =
    std::sync::atomic::AtomicBool::new(false);

/// One MoE layer's expert bank as the resident token graph reads it: the
/// `(gate, up, down)` tensor indices in routing order (the in-bank shared
/// expert last), the layer's uniform layout flags and activation, and the
/// file that holds them. A pure function of the layer's weights — walking
/// 257 experts × 3 matrices per layer per token was ~2 ms of host time a
/// token on a 40-layer 256-expert stack, so the walk runs once a layer.
#[derive(Clone)]
struct GraphMoeBank {
    experts: Vec<(usize, usize, usize)>,
    q4tp: Option<bool>,
    gu_q2: Option<bool>,
    q82: Option<bool>,
    act: Option<crate::gpu::GraphAct>,
    model: Option<std::sync::Arc<cortiq_core::CmfModel>>,
}

/// Identity of the weights a `GraphMoeBank` was built from: the physical
/// layer, the expert table's storage and length, the in-bank shared expert,
/// and the first and last expert tensors' (file, index) — so a table
/// rebuilt at a reused address (a skill, a grown expert) cannot alias an
/// old entry.
type GraphMoeKey = (usize, usize, usize, usize, usize, usize, usize);

// MTP compaction statistics must describe the dense draft that will be
// serialized, not an ambient serving experiment such as gate/oracle top-k.
// A thread-local nesting counter keeps the guard local to calibration and
// avoids mutating process-global environment variables mid-command.
thread_local! {
    static EXACT_MTP_CALIBRATION: std::cell::Cell<u32> = const { std::cell::Cell::new(0) };
}

struct ExactMtpCalibrationGuard;

impl ExactMtpCalibrationGuard {
    fn enter() -> Self {
        EXACT_MTP_CALIBRATION.with(|depth| depth.set(depth.get().saturating_add(1)));
        Self
    }
}

impl Drop for ExactMtpCalibrationGuard {
    fn drop(&mut self) {
        EXACT_MTP_CALIBRATION.with(|depth| {
            debug_assert!(depth.get() > 0, "unbalanced MTP calibration guard");
            depth.set(depth.get().saturating_sub(1));
        });
    }
}

fn exact_mtp_calibration_active() -> bool {
    EXACT_MTP_CALIBRATION.with(|depth| depth.get() != 0)
}

/// Extend an MTP draft-head shortlist to the model vocabulary.  Rows outside
/// the shortlist were deliberately not evaluated, so they must be impossible
/// draft candidates rather than neutral zero logits.
fn pad_mtp_draft_logits(logits: &mut Vec<f32>, vocab_size: usize) {
    logits.resize(vocab_size, f32::NEG_INFINITY);
}

/// Reusable per-pipeline forward scratch: the four norm outputs the
/// decode paths recompute every layer (single: n1/p1; pair: all four).
/// Plain buffers, resized once — steady-state decode reuses them.
struct ForwardScratch {
    n1: Vec<f32>,
    n2: Vec<f32>,
    p1: Vec<f32>,
    p2: Vec<f32>,
}

impl ForwardScratch {
    fn new(hidden: usize) -> Self {
        Self {
            n1: vec![0.0; hidden],
            n2: vec![0.0; hidden],
            p1: vec![0.0; hidden],
            p2: vec![0.0; hidden],
        }
    }
}

/// Complete inference pipeline state.
pub struct Pipeline {
    /// In-process layer split across local GPUs: (device, first layer,
    /// last layer) per segment, in execution order. `None` = one device.
    /// Arc so cloning the plan out of `&mut self` does not fight the
    /// borrow checker on the hot path.
    gpu_plan: Option<std::sync::Arc<Vec<(usize, usize, usize)>>>,
    /// Arc: the server shares one tokenizer handle across request
    /// handlers without borrowing a pipeline slot.
    pub tokenizer: std::sync::Arc<Tokenizer>,
    pub kv_cache: KvCache,
    pub sampler_config: SamplerConfig,
    pub weights: PipelineWeights,
    pub hidden_size: usize,
    pub intermediate_size: usize,
    pub num_heads: usize,
    pub num_kv_heads: usize,
    pub head_dim: usize,
    /// Total virtual layers (num_layers × num_loops for looped models).
    pub num_layers: usize,
    /// Physical layers in weights.layers (≤ num_layers for looped models).
    pub physical_layers: usize,
    /// Looped Transformer: apply final norm after each loop iteration.
    pub loop_final_norm: bool,
    /// SenseNova-Loop: virtual → physical layer order (None: `v %
    /// physical_layers`, the whole-stack loop of Nanbeige).
    pub layer_map: Option<Vec<usize>>,
    /// SenseNova-Loop: the mHC routers (`sensenova::Mhc`).
    pub mhc: Option<Box<crate::sensenova::Mhc>>,
    /// Unlimited-OCR: the DASH router and page state (`uocr::Dash`).
    pub dash: Option<Box<crate::uocr::Dash>>,
    /// Its prompt chunks ride the batch graph until that declines.
    dash_batch_on: bool,
    /// The decode token's mHC streams, `[streams · hidden]`.
    mhc_r: Vec<f32>,
    /// Interleaved-MRoPE sections and the prompt rows' (t, h, w) positions
    /// for the prefill of an image prompt (SenseNova-Loop); cleared when
    /// the prefill ends.
    pub mrope_sections: Option<[usize; 3]>,
    pub prompt_mrope: Option<Vec<[i64; 3]>>,
    pub vocab_size: usize,
    pub rms_eps: f64,
    pub rope_base: f32,
    pub norm_style: NormStyle,
    /// RoPE dims actually rotated (≤ head_dim; Qwen3.5 uses head_dim/4).
    pub rotary_dim: usize,
    /// Optional Q-head count override for each attention layer (Laguna).
    pub attention_heads_per_layer: Option<Vec<usize>>,
    /// Optional KV-head count of each PHYSICAL attention layer (MiMo-V2:
    /// 4 on full-attention layers, 8 on sliding ones). Set only through
    /// [`Pipeline::set_attn_geometry`], which also reshapes the layer
    /// caches. None = every layer has `num_kv_heads`.
    pub kv_heads_per_layer: Option<Vec<usize>>,
    /// Width of each V head when it is narrower than `head_dim` (MiMo-V2:
    /// 128 against 192). V is zero-padded to `head_dim` inside the cache
    /// and the attention output is compacted back to nh·v_head_dim before
    /// o_proj (see `QwenAttnCfg::v_head_dim`). None = `head_dim`.
    pub v_head_dim: Option<usize>,
    /// `CMF_LAYER_DUMP=<dir>` (read once at construction; tests set it
    /// directly): the hidden state after every layer, for every position,
    /// as raw little-endian f32 files `p{pos:06}_l{li:02}.f32` of
    /// `hidden_size` floats each. Written by the CPU layer walks — the
    /// batched prefill (`prefill_batch_span`) and the single-token forward
    /// (`forward_layers_span`) — so both prompt ingest and decode can be
    /// diffed layer by layer against an external oracle (tools/mimo_ref).
    /// Layers a device graph runs (wgpu token/batch graph, Metal chunk or
    /// block graphs) and the own-stack families (DeepSeek-V4/V4.1,
    /// Qwen3.8-Flash-Next, Gemma-3n) are not dumped: run with CMF_GPU=0
    /// for a complete set. `li` is the virtual layer index. Final logits:
    /// `CMF_LOGIT_DUMP=<file>` (hidden + logits of the first decode step).
    pub layer_dump: Option<std::path::PathBuf>,
    /// GPU-graph declines already logged for this pipeline, as (graph
    /// site, reason) — one line each, see `graph_attn_decline_reason`.
    graph_declines: std::cell::RefCell<Vec<(&'static str, &'static str)>>,
    /// MiMo-V2 expert placement (prefix / dynamic bank / hybrid), decided
    /// on the first forward — see `crate::mimo_moe`.
    pub(crate) mimo_moe: crate::mimo_moe::Slot,
    /// Opt-in MiniCPM q4tp expert cache for a graph-produced CPU tail.
    /// It is deliberately separate from MiMo's placement policy because it
    /// serves only the stock MiniCPM top-8 geometry and otherwise falls back
    /// to the ordinary exact host MoE path.
    pub(crate) minicpm_tail: crate::minicpm_tail::MiniCpmTail,
    /// Linear-core geometry (present when the model has linear layers).
    pub vmf_cfg: Option<VmfPhaseCfg>,
    /// GatedDeltaNet geometry (faithful vendor operator).
    pub gdn_cfg: Option<GdnCfg>,
    /// MiniCPM-class logit scale (tied lm_head → cannot fold into weights).
    pub logit_multiplier: Option<f32>,
    /// Cooperative cancel: set from any thread (FFI `cortiq_cancel`,
    /// a dropped server connection); the generate loop checks it at
    /// every prefill chunk and decode step and finishes with
    /// `finish_reason: "cancelled"`. Auto-cleared when honoured.
    pub cancel: std::sync::Arc<std::sync::atomic::AtomicBool>,
    /// A GPU graph failure is distinct from a user/request cancellation.
    /// Graph code sets this before raising the cooperative cancel flag so the
    /// generation API can return an error instead of reporting a successful
    /// `finish_reason: cancelled` result.
    graph_failed: std::sync::atomic::AtomicBool,
    /// Resident-graph MoE expert banks, built once per layer
    /// (`GraphMoeBank`). `CMF_GRAPH_MOE_BANK=0` rebuilds them every token.
    graph_moe_banks: std::sync::Mutex<std::collections::HashMap<GraphMoeKey, GraphMoeBank>>,
    /// Token ids currently materialized in the KV cache (the forwarded
    /// prompt + all generated tokens except the last, which is sampled
    /// but not yet forwarded). Lets the next generate call prefill only
    /// the suffix when a chat app resends the whole history.
    pub kv_history: Vec<u32>,
    /// Owner tag of `kv_history`: the resident device graph held that
    /// sequence (true) or the host did. Reuse continues only on the owner.
    pub kv_history_device: bool,
    /// KDA geometry (Kimi Linear / Kimi-K3) — shared by every Kda layer.
    pub kda_cfg: Option<crate::linear_core::KdaCfg>,
    /// Gemma-3n stack (AltUp/LAuReL/PLE/KV-sharing): its own forward —
    /// weights.layers stays empty, the KV caches are the shared ones.
    pub g3n: Option<Box<(crate::g3n::G3nGlobals, Vec<crate::g3n::G3nLayer>)>>,
    /// Gemma-4 E-series stack (dual-geometry gemma4 + PLE + shared KV):
    /// its own per-token forward, same contract as `g3n`.
    pub g4e: Option<Box<(crate::g4e::G4eGlobals, Vec<crate::g4e::G4eLayer>)>>,
    /// DeepSeek-V4 runs its own stack too: its hidden state is `hc_mult`
    /// copies of a vector, so no loop written for a single residual
    /// stream can carry it.
    pub dsv4: Option<
        Box<(
            crate::dsv4::Dsv4Globals,
            Vec<crate::dsv4::Dsv4Layer>,
            crate::dsv4::Dsv4Cfg,
            crate::dsv4::Dsv4State,
        )>,
    >,
    /// DeepSeek-V4.1 owns the shared CED/CSA2 attention state, raw Engram
    /// lookup and four-stream mHC handoff. It cannot use the V4 cache
    /// layout, so it has a dedicated executor and state tuple.
    /// Dory: a looped normalized GPT, its weights and KV state (`dory`).
    pub dory: Option<Box<(crate::dory::Dory, crate::dory::DoryState)>>,
    pub dsv41: Option<
        Box<(
            crate::dsv41::Dsv41Globals,
            Vec<crate::dsv41::Dsv41Layer>,
            crate::dsv41::Dsv41Cfg,
            crate::dsv41::Dsv41State,
        )>,
    >,
    /// Optional V4.1 vision tower. Text-only files leave this unset.
    pub dsv41_vision: Option<crate::dsv41_vision::VisionModel>,
    /// Prepared image rows consumed by the next V4.1 prefill.
    dsv41_prefill: Option<(Vec<Option<Vec<f32>>>, Vec<bool>)>,
    /// Qwen3.8-Flash-Next owns four residual streams plus QSA/PLE state;
    /// the generic single-residual layer loop cannot represent it.
    /// Block-diffusion generation (Clover): preview weights and the
    /// decoding controls; `None` on every causal model.
    pub(crate) clover: Option<std::sync::Arc<clover::Clover>>,
    clover_stats: clover::CloverStats,
    /// The causal decode's response penalties (`clover_causal_logits`).
    clover_pen: clover::Penalties,
    pub qwen4_exp: Option<
        Box<(
            crate::qwen4_exp::Globals,
            Vec<crate::qwen4_exp::Layer>,
            crate::qwen4_exp::Cfg,
            crate::qwen4_exp::State,
        )>,
    >,
    /// DeepSeek-V4's own speculation stack: three draft modules, each a full
    /// layer, plus a confidence head on the last. Empty when the file has
    /// none, which is the only signal the decode path needs.
    pub dsv4_mtp: Vec<crate::dsv4::Dsv4Mtp>,
    /// The draft's per-sequence state (KV rings, captured trunk hidden).
    pub dspark: Option<crate::dsv4::DsparkState>,
    /// Drafts awaiting their verdict: (position, proposals, still matching,
    /// accepted so far).
    pub dspark_pending: Vec<(usize, Vec<u32>, bool, usize)>,
    /// Accepted prefix length of every graded draft.
    pub dspark_hist: Vec<usize>,
    /// The real tokens the drafts were graded against — a degenerate,
    /// repeating output would make any acceptance number meaningless, and
    /// the cheapest guard against believing one is to count them.
    pub dspark_real: Vec<u32>,
    /// The trunk's expert picks for the last few tokens, per layer. The
    /// union over a window of them is what a batched verify would have to
    /// read, and the ratio to the pick count is all it could save.
    pub dspark_trunk_picks: Vec<Vec<(usize, Vec<usize>)>>,
    /// (unique, total) expert picks per draft, trunk side and draft side.
    pub dspark_exp: Vec<(usize, usize, usize, usize)>,
    /// Wall time spent in the deliberately out-of-core draft. Kept separate
    /// from trunk decode so block batching can be judged without conflating
    /// it with GPU chain variance.
    pub dspark_draft_ns: u128,
    /// Per-layer winners of the last pooled route — the admission predictor.
    m3_winners: Vec<Vec<u32>>,
    /// Route frequency per (layer, expert) — the bank's prewarm profile.
    m3_counts: Vec<u32>,
    m3_n_exp: usize,
    m3_tokens: u64,
    m3_prewarmed: bool,
    /// LFM2 short-convolution geometry (present when the model has
    /// `ShortConv` mixer layers).
    pub short_conv_cfg: Option<ShortConvCfg>,
    /// Multi-token-prediction head (None = absent).
    pub mtp: Option<MtpModule>,
    /// MiMo-V2's draft stack (three chained MTP layers from the
    /// `<stem>.mtp.cmf` sidecar); None = absent. Speculative greedy decode
    /// uses it unless `CMF_MTP=0` / `CMF_MIMO_MTP=0`.
    pub mimo_mtp: Option<mimo_mtp::MimoMtp>,
    /// Set while the MiMo speculative verify runs `prefill_batch`: its MoE
    /// layers take `moe_ffn_rows_exact` (each row bit-identical to decode).
    verify_exact_moe: bool,
    /// Speculative decode via MTP (greedy only; `CMF_MTP=0` disables).
    pub speculative: bool,
    /// Keep generating past end-of-sequence ids (the llama-bench contract
    /// for a timed run). A loop flag, deliberately NOT a sampler
    /// suppression: suppressed ids count as a penalty and switch the
    /// speculative round and the greedy burst off, so a benchmark that
    /// suppressed EOS never measured either.
    pub ignore_eos: bool,
    /// Draft-head shortlist guard: tokens left during which the draft
    /// uses the FULL head because a recently committed id lay past the
    /// `CMF_DRAFT_VOCAB` cut (Cyrillic and CJK ids sit above 131072 in
    /// Qwen's table, so a prefix shortlist would draft nothing usable
    /// there — measured on Russian prose: 2.9 → 1.6 accepted a round).
    pub draft_full_streak: u32,
    /// Adaptive draft depth for the speculative round (None until the
    /// first round): grows while nearly every draft is accepted, shrinks
    /// when fewer than half are. The verify's cost climbs with the rows on
    /// a discrete card (RTX PRO 4000: 52 ms at 2 rows, 74 at 5, 80 at 6),
    /// so prose wants k≈3 and code or the repetitive bench k≈5 — measured
    /// 33.6 vs 27.6 tok/s on an essay at k=3 vs 5, 45.6 vs 38 on code.
    /// `CMF_GRAPH_SPEC_K` pins it.
    pub spec_k_adapt: Option<usize>,
    /// EWMA of the accepted fraction that drives `spec_k_adapt`.
    pub spec_acc_ewma: f32,
    /// Native Metal over a q4tp trunk: how often draft `j` holds once the
    /// one before it held, a running average (see `metal_spec_depth`).
    pub spec_hold: [f32; 7],
    /// wgpu: what a round of k drafts costs on this device, a running
    /// average of its wall in ms (0 until a depth has run twice), the rounds
    /// each depth has run, and the rounds the depth still stays where the
    /// last change put it (`wgpu_spec_depth`).
    spec_wall: [f32; 7],
    spec_wall_n: [u8; 7],
    spec_k_dwell: u8,
    /// wgpu: a plain token's time as a speculation trial last measured it,
    /// and the position it was measured at. A later request's trial decides
    /// from it instead of decoding eight plain tokens again.
    spec_plain_ms: (f64, usize),
    /// The same for the DFlash drafter's rounds, and whether the last round
    /// was one of them.
    pub dflash_hold: [f32; 7],
    dflash_last: bool,
    /// Rounds the DFlash block still sits out, the wait its next lost turn
    /// costs, and the rounds of its turn so far.
    dflash_wait: u32,
    dflash_back: u32,
    dflash_turn: u32,
    /// The tokens the turn's rounds landed and what they cost, in plain tokens.
    dflash_turn_sum: (f32, f32),
    /// The sidecar's router: how far the target's last rows lean to the
    /// block's rounds (a running average of `Route::margin`).
    dflash_lean: f32,
    /// The depth of the block's rounds on a card whose verify grows with its
    /// rows, and the running share of drafts they keep (`spec_k_adapt`'s twin).
    dflash_k_adapt: Option<usize>,
    dflash_acc_ewma: f32,
    /// Prompt lookup on native Metal: the drafts it added to a round that
    /// held, a running average, and the rounds it sits out after that fell
    /// under `LOOKUP_PAYS`.
    pub spec_lookup_gain: f32,
    /// CUDA: the context lookup may fill a 16-row verify window (after a
    /// lookup round whose drafts all held), else 8 rows (one price there).
    pub spec_lookup_wide: bool,
    pub spec_lookup_rest: u32,
    rng: SplitMix64,
    sampler_scratch: SamplerScratch,
    /// Speculative SAMPLING state (graph_spec_step, temperature > 0): the
    /// correction token a rejected draft produced — committed by the loop
    /// top in place of a fresh draw — and the per-round draft
    /// distributions / target scratch, reused so a round allocates
    /// nothing at the vocab size.
    spec_forced: Option<u32>,
    spec_q: Vec<Vec<f32>>,
    spec_p: Vec<f32>,
    spec_res: Vec<f32>,
    /// The same three for the sparse chain (top-k configs).
    spec_qs: Vec<sampler::Sparse>,
    spec_ps: sampler::Sparse,
    spec_ress: sampler::Sparse,
    /// Which arm the MTP draft block runs on this generation: Some(true)
    /// = the whole-token graph (device attention, one submit a step),
    /// Some(false) = the per-op path; None = not decided yet. Decided
    /// on the first draft and held, because the two arms keep the MTP
    /// KV in different places (device mirror vs the CPU cache) and a
    /// mid-run switch would read the wrong one.
    mtp_graph_mode: Option<bool>,
    /// The DFlash block drafter of the model's sidecar (`CMF_DFLASH=1`): it
    /// drafts a round in one block from the trunk's tapped layer outputs.
    pub dflash: Option<Box<crate::dflash::Drafter>>,
    /// The tapped rows of the verify in flight, joined a row at a time, and
    /// their first position: the accepted ones become the drafter's context.
    dflash_rows: Option<(usize, Vec<f32>)>,
    /// Rows the wgpu graphs kept for the drafter, `(first position, rows as
    /// [row][layer][hidden])` in the order the graphs ran: a prompt's and a
    /// plain token's become context at the next round, a verify's are taken
    /// by the round that ran it.
    dflash_taps: std::sync::Mutex<Vec<(usize, Vec<f32>)>>,
    /// The sidecar's block is the trunk's only drafter (the model has no MTP
    /// block): the wgpu graphs keep its rows without being asked to.
    pub(crate) dflash_solo: bool,
    /// The first position whose tapped rows a DFlash drafter can still
    /// read once the prompt is in (its layers' widest window back from the
    /// prompt's end): the prompt's chunks before it keep none.
    dflash_tap_from: usize,
    /// The Metal verify graph of the round in flight, between its sync
    /// (logits read) and the commit that replays the accepted prefix.
    #[cfg(target_os = "macos")]
    metal_verify: Option<MetalVerifyPending>,
    /// Precomputed RoPE inverse frequencies [head_dim/2]. Arc: the
    /// forward path clones a handle to escape the &mut self borrow —
    /// cloning the table itself was a per-forward allocation.
    pub(crate) inv_freq: std::sync::Arc<Vec<f32>>,
    /// Reusable norm buffers for the decode hot path (roadmap §3 P0:
    /// steady-state forward should not heap-allocate). Disjoint field
    /// from `weights`/`kv_cache`, so split borrows keep working.
    ws: ForwardScratch,
    /// Persistent worker pool (None = serial; see CMF_THREADS).
    pool: Option<std::sync::Arc<Pool>>,
    // ── Dynamic per-token skill routing (spec §9, claim 14/16) ──
    /// Source model, retained so a skill switch can re-resolve the
    /// touched layers' FFN tensors (Mapped = mmap pointers, cheap).
    pub(crate) model: Option<std::sync::Arc<cortiq_core::CmfModel>>,
    /// Masks present → weights are dequantized f32 (rebuild path).
    pub(crate) dyn_force_f32: bool,
    /// Per-skill FFN layers actually replaced (derived from tensors, not
    /// the meta `layers` field — ru2 replaces down_proj in 0..23 while
    /// its meta says [20..23]). None = skill touches non-FFN tensors →
    /// ineligible for cheap dynamic switching (honest refusal).
    pub(crate) dyn_skill_layers: Vec<Option<Vec<usize>>>,
    /// Currently overlaid skill (index into model.header.skills); None =
    /// backbone. Set at load time to the statically-overlaid skill so
    /// `set_active_skill(None)` correctly reverts it (else a static
    /// skill would silently persist — the union-diff assumes dyn_active
    /// always mirrors the live overlay). Switched by `set_active_skill`.
    pub(crate) dyn_active: Option<usize>,
    /// Pipeline was loaded with a soft blend (materialized working
    /// tensors, not a single skill index) → dynamic routing refuses:
    /// there is no single index to revert the blend from.
    pub(crate) dyn_blend_loaded: bool,
    /// Layer whose post-residual hidden feeds the router φ (shared by
    /// swarm skills). None = φ capture off.
    pub(crate) dyn_phi_layer: Option<usize>,
    /// EMA of φ at `dyn_phi_layer` over the decode window (on-policy).
    dyn_phi_ema: Vec<f32>,
    dyn_phi_seen: usize,
    /// Hysteresis router driving per-token skill switches during decode
    /// (None = static/no dynamic routing). Taken out during generation.
    pub dyn_router: Option<crate::swarm::DynRouter>,
    /// O(1) Nyström attention setting (CLI/env/header-hint resolved by
    /// the caller; None = plain cache attention everywhere).
    o1_cfg: Option<crate::nystrom::O1Cfg>,
    /// A turbo file: the far field on long prompts only (`cortiq far-turbo`).
    pub(crate) o1_turbo: Option<O1Turbo>,
    /// Over a far field the draft head starts at this prompt row, and counts from it.
    mtp_pos_base: usize,
    /// A whole prompt's tail rows read by the far field's prefix (the draft
    /// head is warmed over them).
    o1_prefix_tail: Vec<f32>,
    /// The CUDA hybrid arm's chat snapshot: the prompt ids before the last
    /// turn's assistant header, whose GDN states the card keeps a copy of
    /// (`gpu::gdn_snapshot`). The next turn that starts with them goes back
    /// there and reads only what follows.
    gdn_snap: Option<Vec<u32>>,
    /// The draft head's base position when the last turn warmed it over
    /// its whole prompt on the batched path (None otherwise): its rows from
    /// there to that prompt's end are prompt rows a chat snapshot keeps.
    mtp_warm_base: Option<usize>,
    /// Bumped once per collecting→sealed transition — the GPU state mirror
    /// re-uploads when it sees a new epoch (each fresh sealed state).
    o1_epoch: u64,
    /// Per-layer o1 flags derived from `o1_cfg` (Full layers only).
    o1_flags: Vec<bool>,
    /// Emit a structured per-token trace (B4 telemetry channel). Off by
    /// default — the runtime is silent unless observation is requested.
    trace: bool,
    /// Confidence-calibration temperature (B1): reported probability is
    /// softmax(logits / calib_temp). 1.0 = raw. Set from header.calibration.
    calib_temp: f32,
    /// Process-unique id keying this pipeline's device KV mirrors.
    #[cfg_attr(not(target_os = "macos"), allow(dead_code))]
    graph_kv_id: u64,
    /// Decode asks the token graph to also run final-norm + lm_head on
    /// the device (drops the separate per-op lm_head round trip).
    #[cfg_attr(not(target_os = "macos"), allow(dead_code))]
    graph_want_logits: bool,
    /// NLL quality gates require the graph's fused head rather than silently
    /// accepting a CPU head fallback. Generation keeps the historical
    /// best-effort `graph_want_logits` behavior.
    #[cfg_attr(not(target_os = "macos"), allow(dead_code))]
    graph_head_required: bool,
    /// Logits the graph produced for the token just forwarded (taken by
    /// the decode loop; None = compute on the CPU path).
    graph_logits: Option<Vec<f32>>,
    /// Packed Embryo graph model, built lazily on the first eligible
    /// resident call so other architectures pay no packing cost.
    embryo_graph: Option<std::sync::Arc<crate::gpu::EmbryoGraphModel>>,
    /// The wide token path refused this file: a matrix is not exactly f16.
    embryo_wide_refused: bool,
    /// This pipeline's token graph refused for a STRUCTURAL reason (its
    /// own weights / layer kinds): not retried. Per pipeline, never
    /// process-wide: a skill lane whose pack does not build must not flip
    /// the backbone slot mid-sequence onto the host path (and a new lane
    /// must not clear the backbone's verdict) — R4/NF-2.
    graph_refused: std::sync::atomic::AtomicBool,
    /// Token embeddings are multiplied by this at input (Gemma: √hidden).
    pub embed_multiplier: f32,
    /// Attention score scale (1/√head_dim unless the arch overrides —
    /// Gemma's query_pre_attn_scalar).
    pub attn_scale: f32,
    /// Sliding-window attention: (window, every-Nth-layer-is-global
    /// pattern) — Gemma-3.
    pub swa: Option<(usize, usize)>,
    /// Sliding-window tail trimming, `(slack, align)` for
    /// `LayerKvCache::trim_window`: every layer with a window keeps only
    /// the rows its window can still read (Spark-X2.5: 576..639 rows per
    /// 512-window layer instead of the whole context — 27 of the 4B's 36
    /// layers). Set at load for Spark-X2.5 only (`CMF_SWA_TRIM=0` turns
    /// it off); None keeps every row, as every other model always has.
    pub swa_trim: Option<(usize, usize)>,
    /// Prompt end of the current turn: the tail trim keeps every row a
    /// rollback to it still reads (`LayerKvCache::trim_window_anchored`),
    /// so the next chat turn can drop this turn's answer.
    swa_trim_anchor: usize,
    /// Fewest prompt rows the Metal chunk prefill graph takes; a shorter
    /// chunk walks the layers on the host. 32 since the graph landed
    /// (measured on Qwen2.5-0.5B); Spark-X2.5/X2.6 take 8 (`loader`).
    pub chunk_min_rows: usize,
    /// A far field's exact prefix rides the Metal chunk graph, which then also
    /// keeps the collecting layers' queries (`o1_prefix_on_metal`).
    o1_chunk_prefix: bool,
    /// The batched wgpu graph declined this dense stack's prompt: later
    /// prompts read chunked on the host walk (`graph_prefill_preferred`).
    dense_batch_declined: std::sync::atomic::AtomicBool,
    /// Explicit local/global schedule for architectures that cannot be
    /// represented by Gemma's every-Nth-global convention.
    pub sliding_layers: Option<Vec<bool>>,
    /// Per-layer flag: this layer runs WITHOUT RoPE. Recursive Flint applies
    /// position encoding only on its sliding-window layers; its 14
    /// full-attention layers have none. The rotary dim of such a layer is 0,
    /// which is what the attention kernel reads.
    pub no_rope_layers: Option<Vec<bool>>,
    /// Ripple's value residual: per layer, the blend `sigmoid(value_res_lambda)` of the lerp
    /// that feeds V, `lerp(embedding, normed, blend)`. None = V reads the normed input.
    pub value_blend: Option<Vec<f32>>,
    /// The scaled embedding rows of the positions in flight (one, a pair's two, a chunk's).
    vres_e0: Vec<f32>,
    /// The rows V projects in the layer being run.
    vres_in: Vec<f32>,
    /// Natively bounded anchor record (`arch.anchor_core`): the file's
    /// operator, installed once at load. `Some` = the model is
    /// bounded-native — `--o1`/`CMF_O1*` are refused, prefix reuse and
    /// the penalty window are bounded, and no anchor layer stores
    /// anything per position.
    pub anchor_core: Option<cortiq_core::AnchorCoreConfig>,
    /// The `[W][rd/2]` relative-rotation table every bounded layer shares
    /// (built from `inv_freq` once the RoPE setup is final).
    bounded_rope: Option<std::sync::Arc<crate::bounded::BoundedRope>>,
    /// Bounded prefix-reuse key (length + rolling hash + tail) of a
    /// bounded-native model; `kv_history` stays empty there so nothing
    /// in the pipeline grows with the dialogue.
    pub kv_prefix: KvPrefix,
    /// Prompt positions the last `generate*` call actually forwarded
    /// (prefix reuse subtracts what the cache already held).
    pub last_prefill_tokens: usize,
    /// RoPE table of the sliding (local) layers, when they use their
    /// own base frequency (Gemma-3: 10k local vs 1M global).
    pub inv_freq_local: Option<std::sync::Arc<Vec<f32>>>,
    pub rotary_dim_local: Option<usize>,
    pub rope_scale: f32,
    pub rope_scale_local: f32,
    /// Gemma-4: global layers run their own geometry — (head_dim,
    /// num_kv_heads); sliding layers keep the base fields.
    pub global_attn: Option<(usize, usize)>,
    /// Gemma-4: the global layers' proportional RoPE table (len
    /// global_head_dim/2, zero-padded tail = identity rotation).
    pub inv_freq_global: Option<std::sync::Arc<Vec<f32>>>,
    /// Scale-less RMS normalization of V heads before caching (Gemma-4).
    pub attn_v_norm: bool,
    /// HunYuan dense: per-head q/k norm runs after RoPE (see the arch flag).
    pub qk_norm_after_rope: bool,
    /// The per-head `self_attn.g_proj` output gate uses sigmoid
    /// (Spark-X2.5) instead of softplus (Laguna).
    pub proj_gate_sigmoid: bool,
    /// Final-logit soft-capping C: logits = C·tanh(logits/C) (Gemma-4).
    pub final_softcap: Option<f32>,
    /// Cortiq Embryo hierarchical head: cluster matrix [C, hidden]. The
    /// flat logits h·Eᵀ are turned into the two-level log-probabilities
    /// log softmax_c(h·Cᵀ)[c(v)] + log softmax_{s∈c(v)}(h·E_c(v)ᵀ)[v].
    pub head_clusters: Option<std::sync::Arc<Vec<f32>>>,
    /// Gemma-2 attention-logit soft-capping (0.0 = off).
    pub attn_softcap: f32,
    /// Compute per-token confidence (a full-vocab softmax each
    /// token). On by default; `bench --core` turns it off to match
    /// llama-bench's core timing.
    confidence_on: bool,
    /// Test-only one-shot forward failure, scoped to this pipeline so
    /// parallel scoring tests cannot consume one another's injection.
    #[cfg(test)]
    nll_test_fail_at: Option<usize>,
    /// Test-only route override; avoids mutating the process-wide
    /// `CMF_PREFILL` environment variable while forcing the serial path.
    #[cfg(test)]
    nll_test_force_serial: bool,
}

#[cfg(target_os = "macos")]
impl Drop for Pipeline {
    fn drop(&mut self) {
        // the async replay writes into `kv_cache` Vecs about to be freed
        let _ = crate::gpu_metal::wait_replay();
        crate::gpu::kv_mirror_drop(self.graph_kv_id);
    }
}

#[cfg(not(target_os = "macos"))]
impl Drop for Pipeline {
    fn drop(&mut self) {
        // The wgpu resident Embryo graph owns recurrent/KV buffers keyed by
        // this pipeline's sequence id.  Release that sequence image when a
        // pooled pipeline is dropped; model weights stay cached for reuse.
        crate::gpu::graph_kv_reset(self.graph_kv_id);
    }
}

/// Model weights. Matrices are `QTensor` (owned f32 for small models
/// and tests — bit-identical to the historical paths — or quantized
/// bytes zero-copy from the CMF mmap for big models). 1-D norms are
/// always small and stay f32.
pub struct PipelineWeights {
    /// Embedding table: [vocab_size, hidden_size]
    pub embed_tokens: QTensor,
    /// Per-layer weights
    pub layers: Vec<LayerWeights>,
    /// LM head: [vocab_size, hidden_size]
    pub lm_head: QTensor,
    /// Final norm: [hidden_size]
    pub final_norm: Vec<f32>,
}

/// One transformer layer: shared norms + MLP, attention by kind.
pub struct LayerWeights {
    pub input_norm: Vec<f32>,
    /// The pre-FFN norm (`post_attention_layernorm` classically;
    /// `pre_feedforward_layernorm` on Gemma-2/3 sandwich layers).
    pub post_norm: Vec<f32>,
    /// Gemma-2/3 sandwich: norm applied to the ATTENTION OUTPUT before
    /// its residual add (`post_attention_layernorm` there).
    pub attn_out_norm: Option<Vec<f32>>,
    /// Gemma-4: the whole layer output is multiplied by this scalar.
    pub layer_scale: Option<f32>,
    /// Gemma-2/3 sandwich: norm applied to the FFN OUTPUT before its
    /// residual add (`post_feedforward_layernorm`).
    pub ffn_out_norm: Option<Vec<f32>>,
    pub ffn: FfnKind,
    pub attn: AttnKind,
}

/// FFN gate activation: SiLU (SwiGLU family), tanh-GELU (Gemma's GeGLU),
/// or a source-specific gated contract. A property of the model, carried on
/// every FFN triple.
#[derive(Clone, Copy, PartialEq, Debug, Default)]
pub enum Act {
    #[default]
    Silu,
    GeluTanh,
    /// Exact erf GELU (HF `hidden_act = "gelu"`: Spark-X2.5).
    Gelu,
    /// Kimi-K3 SituAndMul: BOTH halves transform —
    /// a = β·tanh(g/β)·σ(g), up' = linβ·tanh(u/linβ) (linβ>0), out = a·up'.
    Situ {
        beta: f32,
        linear_beta: f32,
    },
    /// MiniMax M3's SwiGLU-OAI: upper-clamped gate, symmetrically clamped
    /// up branch, `sigmoid(alpha * gate)`, and a `+1` up-branch offset.
    /// It deliberately has no generic GPU graph arm until a matching kernel
    /// exists; CPU uses the exact scalar reference in `inference`.
    SwiGluOai {
        alpha: f32,
        limit: f32,
    },
    /// Ripple's clamped SwiGLU (`ModelArch::ffn_clamp`): the gate is cut from above and the up
    /// branch on both sides at `limit`, then `silu(gate)·up`. The contract of the
    /// `swiglu_limit` kernels.
    SiluClamp {
        limit: f32,
    },
}

impl Act {
    pub fn from_arch(name: &str) -> Self {
        if name == "gelu_tanh" {
            Self::GeluTanh
        } else if name == "gelu" {
            Self::Gelu
        } else {
            Self::Silu
        }
    }

    /// Arch-driven constructor (activation name + situ betas).
    pub fn from_arch_full(arch: &cortiq_core::ModelArch) -> Self {
        match arch.hidden_act.as_str() {
            "situ" => Self::Situ {
                beta: arch.activation_situ_beta.unwrap_or(1.0) as f32,
                linear_beta: arch.activation_situ_linear_beta.unwrap_or(0.0) as f32,
            },
            // `swigluoai` alone is deliberately not a generic activation
            // alias.  Its alpha/limit are part of MiniMax M3's checked
            // source contract, and accepting that string on an unrelated
            // architecture would silently impose M3 math on its FFN.
            "swigluoai" if arch.arch_name == "minimax_m3_vl" => Self::SwiGluOai {
                alpha: 1.702,
                limit: 7.0,
            },
            "silu" if arch.ffn_clamp.is_some_and(|l| l > 0.0) => Self::SiluClamp {
                limit: arch.ffn_clamp.unwrap_or(0.0),
            },
            other => Self::from_arch(other),
        }
    }

    /// The clamp of a dense FFN's pre-activations (0 = none).
    #[inline]
    pub fn clamp_limit(self) -> f32 {
        match self {
            Self::SiluClamp { limit } => limit,
            _ => 0.0,
        }
    }

    /// The wgpu graphs' dense FFN: an arm and the clamp its kernels take beside it. Only the
    /// builders that hand the clamp on may ask; every other door reads `graph_act`, which has
    /// no arm for a clamped SiLU.
    pub(crate) fn dense_graph_contract(self) -> Option<(crate::gpu::GraphAct, f32)> {
        match self {
            Self::SiluClamp { limit } => Some((crate::gpu::GraphAct::Silu, limit)),
            // The M3 arm carries its frozen clamp inside its code.
            _ => self.wgpu_graph_act().map(|a| (a, 0.0)),
        }
    }

    /// Construct the MiniMax M3 SwiGLU-OAI activation from a checked model
    /// contract. This is intentionally explicit rather than recognizing an
    /// arbitrary `hidden_act` string: callers must validate `alpha` and
    /// `limit` against their source architecture before enabling it.
    #[inline]
    pub fn swiglu_oai(alpha: f32, limit: f32) -> Self {
        Self::SwiGluOai { alpha, limit }
    }

    #[inline]
    pub fn apply(self, x: f32) -> f32 {
        match self {
            Self::Silu => inference::silu(x),
            Self::GeluTanh => inference::gelu_tanh(x),
            Self::Gelu => inference::gelu_erf(x),
            Self::Situ { beta, .. } => beta * (x / beta).tanh() * (1.0 / (1.0 + (-x).exp())),
            Self::SwiGluOai { alpha, limit } => {
                let gate = x.min(limit);
                gate * (1.0 / (1.0 + (-alpha * gate).exp()))
            }
            Self::SiluClamp { limit } => inference::silu(x.min(limit)),
        }
    }

    /// Gated combine — the FFN contract. Situ transforms the UP half
    /// too, so callers must use this instead of apply(g)·u.
    #[inline]
    pub fn combine(self, g: f32, u: f32) -> f32 {
        match self {
            Self::Situ { linear_beta, .. } if linear_beta > 0.0 => {
                self.apply(g) * (linear_beta * (u / linear_beta).tanh())
            }
            Self::SwiGluOai { alpha, limit } => {
                inference::swiglu_oai(g, u, alpha, 1.0, Some(limit))
            }
            Self::SiluClamp { limit } => self.apply(g) * u.clamp(-limit, limit),
            _ => self.apply(g) * u,
        }
    }

    /// The wgpu graphs' arm for this activation; None = no device kernel
    /// computes it, and the graph builder must refuse the layer (the dense
    /// graph FFN once computed SiLU for whatever the model asked for).
    pub fn graph_act(self) -> Option<crate::gpu::GraphAct> {
        match self {
            Self::Silu => Some(crate::gpu::GraphAct::Silu),
            Self::Gelu => Some(crate::gpu::GraphAct::GeluErf),
            Self::GeluTanh => Some(crate::gpu::GraphAct::GeluTanh),
            Self::Situ { .. } | Self::SwiGluOai { .. } | Self::SiluClamp { .. } => None,
        }
    }

    /// The WGPU graph arm.  Keep this deliberately separate from
    /// `graph_act`: OAI needs its dedicated code rather than a generic SiLU
    /// fallback.  Only the frozen MiniMax-M3 source constants get a device
    /// code; a future OAI-like architecture with different constants must add
    /// and test its own kernel contract.
    pub(crate) fn wgpu_graph_act(self) -> Option<crate::gpu::GraphAct> {
        // A clamped SiLU is an arm AND a limit: a door that reads the arm alone would run it
        // unclamped, so it gets none here (`dense_graph_contract` hands both on).
        if matches!(self, Self::SiluClamp { .. }) {
            return None;
        }
        self.moe_job_graph_contract().map(|(act, _)| act)
    }

    /// The exact device contract for a gate/up/down MoE job.  OAI is not a
    /// generic "clamped SiLU": code 3 commits a backend to MiniMax M3's
    /// alpha, asymmetric up transform, and frozen clamp.  Keep the clamp
    /// alongside the marker so a backend cannot accidentally run code 3 with
    /// a nearby model's limit.
    pub(crate) fn moe_job_graph_contract(self) -> Option<(crate::gpu::GraphAct, f32)> {
        match self {
            Self::SwiGluOai { alpha, limit }
                if alpha.to_bits() == 1.702f32.to_bits()
                    && limit.to_bits() == 7.0f32.to_bits() =>
            {
                Some((crate::gpu::GraphAct::SwiGluOaiM3, 7.0))
            }
            // The `swiglu_limit` kernels' own contract: gate from above, up on both sides.
            Self::SiluClamp { limit } => Some((crate::gpu::GraphAct::Silu, limit)),
            _ => self.graph_act().map(|act| (act, 0.0)),
        }
    }
}

/// Dense gated triple — the FFN of a dense layer or of one expert.
pub struct DenseFfn {
    pub gate_proj: QTensor,
    pub up_proj: QTensor,
    pub down_proj: QTensor,
    /// Gate activation (SiLU default; Gemma: tanh-GELU).
    pub act: Act,
    /// `down_proj` stored transposed (`[inter, hidden]`), when the file
    /// carries it. Only the per-token sparse path reads it: a neuron's
    /// down weights are a contiguous ROW there, so the token's chosen
    /// neurons are the only bytes touched. `None` = the ordinary layout,
    /// and the sparse path stays off.
    pub down_t: Option<QTensor>,
    /// Task tubes (spec: defragged task-conditional width). The three
    /// matrices above are the CORE — the neurons every task computes;
    /// each tube is an independently quantized slice of the SAME layer
    /// holding the neurons only some tasks need. A tube is a normal
    /// tensor triple, so every kernel runs it unchanged, and the bytes
    /// of an inactive tube are never read. Empty = ordinary dense FFN.
    pub segs: Vec<FfnSeg>,
}

/// One task tube: a contiguous slice of a layer's FFN neurons, stored
/// as its own `[w, hidden]` / `[hidden, w]` triple. `start` is the
/// neuron's index in the layer's FULL space (core first, then tubes in
/// order) — the bit a task mask sets to switch this tube on.
pub struct FfnSeg {
    pub gate: QTensor,
    pub up: QTensor,
    pub down: QTensor,
    pub start: usize,
    pub width: usize,
}

/// FFN operator of a layer, decided by tensor presence at load time
/// (router `mlp.gate.weight` in the directory = MoE layer).
pub enum FfnKind {
    Dense(DenseFfn),
    /// Mixture-of-Experts (Qwen2-MoE / Qwen3-MoE): softmax over ALL
    /// expert logits → top-k, optional renorm; experts stay quantized
    /// in mmap — only the selected ones are touched per token.
    Moe(MoeFfn),
    /// Gemma-4 MoE: a dense MLP branch AND a routed-expert branch in
    /// the SAME layer, each with its own norm sandwich. The dense
    /// branch reads the pre-FFN-normed input; the expert branch (and
    /// the router) read the RAW residual through `pre_norm_2`:
    ///   d = post_norm_1(dense(x̂));  m = post_norm_2(Σwₑ·FFNₑ(pre_norm_2(h)))
    ///   ffn_out = d + m   (the caller's ffn_out_norm + residual follow)
    DenseMoe(Box<DenseMoeFfn>),
}

/// Gemma-4 dual-branch FFN (see `FfnKind::DenseMoe`).
pub struct DenseMoeFfn {
    pub dense: DenseFfn,
    pub moe: MoeFfn,
    /// post_feedforward_layernorm_1 — dense-branch output norm.
    pub post_norm_1: Vec<f32>,
    /// pre_feedforward_layernorm_2 — expert-branch input norm (applied
    /// to the RAW residual, not the pre-FFN-normed activation).
    pub pre_norm_2: Vec<f32>,
    /// post_feedforward_layernorm_2 — expert-branch output norm.
    pub post_norm_2: Vec<f32>,
}

pub struct MoeFfn {
    /// Router `mlp.gate.weight` [num_experts, hidden].
    pub router: QTensor,
    pub experts: Vec<DenseFfn>,
    pub top_k: usize,
    pub norm_topk_prob: bool,
    /// Router scores per-expert with a sigmoid (LFM2-MoE / DeepSeek-V3
    /// `noaux_tc`) instead of a softmax over all experts (Qwen).
    pub router_sigmoid: bool,
    /// Addend in the selected-score denominator of a sigmoid router.
    /// Most supported checkpoints use the historical `1e-6` floor; Flint's
    /// reference routing uses `1e-20`; MiniMax M3.1 preserves the same FP32
    /// `sum + 1e-20` law. This is per-MoE rather than a global family switch
    /// because the same sigmoid routing law has several contracts.
    pub sigmoid_denom_eps: f32,
    /// Per-expert selection bias `mlp.expert_bias` [num_experts]
    /// (LFM2-MoE): added to the sigmoid scores for the top-k CHOICE only;
    /// the gathered weights use the unbiased scores. None = no bias.
    pub expert_bias: Option<Vec<f32>>,
    /// Top-k weights are multiplied by this after the optional renorm
    /// (LFM2-MoE `routed_scaling_factor`; 1.0 = off).
    pub routed_scaling: f32,
    /// Adaptive routing (CMF_MOE_TAU, opt-in): keep the smallest
    /// prefix of the top-k whose renormalized mass reaches τ —
    /// confident tokens touch 1–2 experts, flat ones keep all k.
    /// MoE decode is memory-bound, so skipped experts are skipped
    /// weight traffic. None = classic fixed top-k (bit-identical).
    pub route_tau: Option<f32>,
    /// Always-on shared expert. Qwen2-MoE carries an additional sigmoid
    /// gate; Laguna adds the shared expert unconditionally (`None`).
    pub shared: Option<(DenseFfn, Option<QTensor>)>,
    /// Expert-selection counters (truncated Fisher B-field of claim 12:
    /// routing frequency during calibration). Filled by every forward,
    /// read by the CLI via CMF_MOE_STATS. RefCell: decode is single-threaded.
    pub stats: std::cell::RefCell<Vec<u64>>,
    /// Per-CHANNEL sum of squares of this FFN's input, accumulated over a
    /// calibration run (`CMF_RMS_TRACE`). These are the RMS activation
    /// traces AWNP needs: raw weight magnitude says every channel matters
    /// equally, and the question AWNP asks is whether the ACTIVATIONS
    /// disagree. Off unless the env var is set — an f64 add per channel
    /// per token is cheap, but not free.
    pub act_sq: std::cell::RefCell<Vec<f64>>,
    /// Raw FFN-input rows captured for the layers named by `CMF_ACT_DUMP`
    /// (`"9,19"`). AWNP is nullspace PROJECTION: after dropping channels the
    /// survivors are refitted to absorb what was removed, and how much they
    /// can absorb depends on the activation COVARIANCE, not on per-channel
    /// RMS. Per-channel numbers can only bound the cost from above.
    pub act_rows: std::cell::RefCell<Vec<f32>>,
    /// Task mask over routed experts (DTG-MA over MoE, claim-12 B-field
    /// applied): `false` experts are excluded from selection, the
    /// softmax renormalizes over the allowed set. Built by the loader
    /// from CMF_MOE_MASK=<stats.json> + CMF_MOE_MASK_COVER. None = all.
    pub mask: Option<Vec<bool>>,
    /// Gemma-4: per-expert weight scale applied AFTER the top-k renorm
    /// (`router.per_expert_scale`). None = 1.0 everywhere.
    pub per_expert_scale: Option<Vec<f32>>,
    /// Gemma-4: the router reads a SCALE-LESS rms-norm of its input
    /// (the constant gain router.scale·√hidden is folded into the
    /// router weights at convert time).
    pub router_input_norm: bool,
    /// Cortiq Embryo: resonance routing (P1) — the "logits" are
    /// bias_e − ‖(x−μ_e) − U_eᵀU_e(x−μ_e)‖², argmax = the expert whose
    /// descriptor reconstructs the input best. `router` is a placeholder.
    pub resonance: Option<Resonance>,
    /// Growth records (`kind = "expert_append"`, spec §9.5.1) mounted
    /// behind the trunk experts, one entry per grown expert IN THE ORDER
    /// they sit in `experts` (the tail `experts[experts.len() - grown.len()..]`).
    /// The trunk keeps `experts.len() - grown.len()` experts. Empty on a
    /// gated MoE, on a file without records and under `CMF_GROWTH=off`.
    pub grown: Vec<GrownExpert>,
}

/// One grown expert of an `expert_append` record as the loader mounted it.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct GrownExpert {
    /// The record's skill id.
    pub record: String,
    /// Position of the record in `header.skills`.
    pub record_index: usize,
    pub layer: usize,
    /// The index the tensor name declares (`experts.{e}` — the chain rule
    /// of the format); the executed position may be smaller when an
    /// earlier record of the layer is not mounted.
    pub expert: usize,
}

/// Per-expert resonance descriptors of one MoE layer (`mlp.desc.*`).
pub struct Resonance {
    /// [E, hidden]
    pub mu: Vec<f32>,
    /// [E, k, hidden] orthonormal directions (k may be 0)
    pub u: Vec<f32>,
    pub k: usize,
    /// [E] selection bias (loss-free balancing, trained online)
    pub bias: Vec<f32>,
    /// [E] reconstruction-error shell: an expert whose error
    /// `‖(x−μ)⊥U‖² = d² − proj` exceeds its shell scores `−∞` (it never
    /// wins). `+inf` = no shell — every trunk expert; a grown expert
    /// (`expert_append`) carries the finite `desc.shell` its record stores.
    /// Empty = no shell anywhere (legacy constructors).
    pub shell: Vec<f32>,
}

/// `CMF_GROWTH_SHELL` state: 0 = not yet read from the environment, 1 = on,
/// 2 = off. Process-wide, like the environment it mirrors.
static GROWTH_SHELL: std::sync::atomic::AtomicU8 = std::sync::atomic::AtomicU8::new(0);

/// Is the growth shell applied (`Resonance::scores` −∞ rule, the resident
/// graph's packed shell)? `CMF_GROWTH_SHELL=off` disables it for
/// measurement; [`set_growth_shell`] overrides the environment in-process
/// (`growth-eval --shell`). Default: on.
pub fn growth_shell_enabled() -> bool {
    use std::sync::atomic::Ordering;
    match GROWTH_SHELL.load(Ordering::Relaxed) {
        1 => true,
        2 => false,
        _ => {
            let off = std::env::var("CMF_GROWTH_SHELL")
                .map(|v| v.eq_ignore_ascii_case("off") || v == "0")
                .unwrap_or(false);
            GROWTH_SHELL.store(if off { 2 } else { 1 }, Ordering::Relaxed);
            !off
        }
    }
}

/// Switch the growth shell on/off for this process (`None` = re-read
/// `CMF_GROWTH_SHELL` on the next query). A pipeline packed into the
/// resident graph BEFORE the switch keeps the shell it was packed with —
/// build a new pipeline after switching.
pub fn set_growth_shell(on: Option<bool>) {
    GROWTH_SHELL.store(
        match on {
            Some(true) => 1,
            Some(false) => 2,
            None => 0,
        },
        std::sync::atomic::Ordering::Relaxed,
    );
}

impl Resonance {
    /// Does any expert carry a finite shell (a mounted growth record)?
    pub fn has_shell(&self) -> bool {
        self.shell.iter().any(|s| s.is_finite())
    }

    /// The shell the runtime applies right now: the stored one, or all
    /// `+inf` when the shell is switched off (`CMF_GROWTH_SHELL=off`).
    pub fn effective_shell(&self, ne: usize) -> Vec<f32> {
        let mut out = vec![f32::INFINITY; ne];
        if growth_shell_enabled() {
            for (o, s) in out.iter_mut().zip(&self.shell) {
                *o = *s;
            }
        }
        out
    }

    /// Routing scores for one input row (higher = better). A grown
    /// expert whose reconstruction error lies outside its shell gets
    /// `−∞` (unless the shell is switched off); trunk rows are the exact
    /// bit pattern they were before growth.
    pub fn scores(&self, x: &[f32], out: &mut [f32]) {
        let h = x.len();
        let ne = out.len();
        let shell_on = growth_shell_enabled() && !self.shell.is_empty();
        for e in 0..ne {
            let mu = &self.mu[e * h..(e + 1) * h];
            let mut d2 = 0.0f32;
            for j in 0..h {
                let d = x[j] - mu[j];
                d2 += d * d;
            }
            let mut proj = 0.0f32;
            for i in 0..self.k {
                let u = &self.u[(e * self.k + i) * h..(e * self.k + i + 1) * h];
                let mut p = 0.0f32;
                for j in 0..h {
                    p += (x[j] - mu[j]) * u[j];
                }
                proj += p * p;
            }
            let err = d2 - proj;
            out[e] = self.bias.get(e).copied().unwrap_or(0.0) - err;
            if shell_on && err > self.shell.get(e).copied().unwrap_or(f32::INFINITY) {
                out[e] = f32::NEG_INFINITY;
            }
        }
    }
}

/// Attention operator of a layer. Extension point: new operators are
/// new variants here + a forward in their own module.
pub enum AttnKind {
    /// GQA softmax attention (+ optional Qwen3.5 qk-norm / output gate).
    Full {
        wq: QTensor,
        wk: QTensor,
        wv: QTensor,
        wo: QTensor,
        q_norm: Option<Vec<f32>>,
        k_norm: Option<Vec<f32>>,
        output_gate: bool,
        /// Laguna: a separate softplus projection applied to the attention
        /// output before O. The bool means one scalar per head (broadcast
        /// across head_dim); false means one scalar per element.
        softplus_gate: Option<(QTensor, bool)>,
        /// Qwen2-family projection biases (q, k, v).
        bias: Option<(Vec<f32>, Vec<f32>, Vec<f32>)>,
    },
    /// Canonical linear core (VMF phase attention).
    Linear(VmfPhaseWeights),
    /// Faithful vendor linear operator (Qwen3.5 GatedDeltaNet).
    LinearGdn(GdnWeights),
    /// LFM2 gated short-convolution mixer (no KV cache; conv ring state
    /// lives in the layer's `linear_state`).
    ShortConv(ShortConvWeights),
    /// DeepSeek-V2 Multi-head Latent Attention. v1 executes it as
    /// expand-to-MHA: the latent is projected per token, K/V expand to
    /// every head and live in the ordinary cache (K head layout
    /// [rope | nope] so the standard partial rotary covers the shared
    /// rope key; V rows are zero-padded to the K head_dim and the pad
    /// is sliced off before O). Latent-resident cache is a later
    /// optimization, not a semantic change.
    Mla(Box<MlaWeights>),
    /// Kimi Delta Attention (Kimi Linear / Kimi-K3): per-channel decayed
    /// delta rule, separate q/k/v short convs, sigmoid-gated output norm.
    /// State lives in the layer's `linear_state` (no KV cache).
    Kda(Box<crate::linear_core::KdaWeights>),
    /// Natively bounded softmax anchor `swa_sink_v1` (Embryo-O1): ring of
    /// the last W raw keys with relative RoPE + trained NoPE sinks, one
    /// softmax. State is the fixed-size ring in `LayerKvCache::bounded`;
    /// nothing is stored per position (see `crate::bounded`).
    Bounded(Box<crate::bounded::BoundedWeights>),
}

/// DeepSeek-V2 MLA projections (see `AttnKind::Mla`).
pub struct MlaWeights {
    /// `[nh·(rope+nope), hidden]` (or `[…, q_lora]` when compressed) —
    /// the converter permutes each head rope-first so rotary_dim =
    /// qk_rope works unchanged.
    pub q_proj: QTensor,
    /// Compressed q (K3/V3 class): x → q_a `[q_lora, hidden]` →
    /// rms(q_a_norm) → q_proj (= q_b). None = direct q (V2-Lite).
    pub q_a: Option<QTensor>,
    pub q_a_norm: Option<Vec<f32>>,
    /// `kv_a_proj_with_mqa` `[lora + rope, hidden]` (latent first).
    pub kv_a: QTensor,
    /// RMS-norm weights over the latent (`kv_a_layernorm`, [lora]).
    pub kv_a_norm: Vec<f32>,
    /// `[nh·(nope+v), lora]` — per head [k_nope | v].
    pub kv_b: QTensor,
    /// `[hidden, nh·v]`.
    pub o_proj: QTensor,
    pub nh: usize,
    pub qk_rope: usize,
    pub qk_nope: usize,
    pub v_dim: usize,
    pub lora: usize,
    /// Softmax scale (1/√(rope+nope), YaRN-mscale-corrected at load).
    pub scale: f32,
    /// Kimi Linear NoPE: skip the rotary entirely (layout unchanged).
    pub nope: bool,
}

/// Multi-token-prediction head (DeepSeek/Qwen style, spec §2.1):
/// `x = eh_proj·[enorm(embed(next)); hnorm(hidden)]` → one transformer
/// block over its own KV → shared lm_head. Drafts the token after next;
/// the main model verifies, so output is exact — MTP only buys speed.
pub struct MtpModule {
    pub enorm: Vec<f32>,
    pub hnorm: Vec<f32>,
    /// [hidden, 2·hidden]
    pub eh_proj: QTensor,
    pub layer: LayerWeights,
    pub final_norm: Vec<f32>,
    pub kv: crate::kv_cache::LayerKvCache,
}

/// Teacher-forced activation statistics for one MTP draft FFN.
///
/// `mass[i]` is `Σ_rows |activation_i|`; `squared_mass[i]` is
/// `Σ_rows activation_i²`, where `activation = act(gate) · up` immediately
/// before the draft layer's down projection. `observed_positions` is the
/// number of teacher-forced rows that contributed to both arrays.
///
/// Rows of FFN input the canonical draft probe measures in one batch.
const MTP_PROBE_FFN_ROWS: usize = 128;

/// [`Pipeline::probe_mtp_ffn`] returns one of these for each actual draft
/// layer.  It intentionally has a separate type/API from
/// [`Pipeline::probe_ffn_mass`] so a compactor cannot accidentally substitute
/// trunk statistics for an MTP sidecar whose FFN has a different width.
#[derive(Clone, Debug, PartialEq)]
pub struct MtpFfnProbe {
    pub mass: Vec<f64>,
    pub squared_mass: Vec<f64>,
    pub observed_positions: usize,
}

/// A Metal verify graph after its sync: what the commit needs — the
/// graph (per-layer replay scratch), the GDN layers in encode order (their
/// CPU states receive the replay), and the attention layers with the CPU
/// row count they were encoded against (the accepted rows are pulled from
/// the mirror from there).
/// One item of the Metal rows-graph plan.
#[cfg(target_os = "macos")]
enum MetalRowsItem<'a> {
    Gdn {
        run: Vec<crate::gpu_metal::GdnGpuLayer<'a>>,
        first: usize,
    },
    Attn {
        l: crate::gpu_metal::AttnGpuLayer<'a>,
        li: usize,
        q_norm: Option<&'a [f32]>,
        k_norm: Option<&'a [f32]>,
        output_gate: bool,
        /// Spark-X2.6's per-head gate `[nh × hidden]`.
        head_gate: Option<&'a [f32]>,
    },
}

#[cfg(target_os = "macos")]
struct MetalVerifyPending {
    graph: crate::gpu_metal::VerifyGraph,
    gdn_layers: Vec<usize>,
    attn_layers: Vec<(usize, usize)>,
}

/// A round's batched MTP warm-up, submitted but not yet waited
/// (`mtp_warm_batch_submit` → `mtp_warm_batch_finish`): the trunk commit's
/// GDN replay is queued between the two.
#[cfg(target_os = "macos")]
struct MetalWarmPending {
    graph: crate::gpu_metal::VerifyGraph,
    cpu_stored: usize,
    b: usize,
}

#[cfg(target_os = "macos")]
enum MetalRowsRun {
    /// Capability/preflight refusal before a command buffer was committed.
    Declined,
    /// A graph was admitted and then failed; callers must clear the sequence
    /// rather than replaying it through CPU/serial state.
    Failed,
    Completed(MetalVerifyPending),
}

#[cfg(target_os = "macos")]
enum MetalPrefillOutcome {
    Declined,
    Failed,
    Completed(Vec<f32>),
}

#[cfg(target_os = "macos")]
enum MetalBatchNllOutcome {
    Declined,
    Failed(String),
    Completed(f64, usize),
}

/// The speculation trial's phases (see the decode loop): up to five timed
/// speculative rounds, eight timed plain tokens, then the faster arm until a
/// re-check. Two consecutive rounds with no accepted draft skip directly to
/// the plain measurement: another speculative round cannot pay when it emits
/// exactly the one token the plain loop would have produced.
#[derive(Clone, Copy)]
enum SpecTrial {
    Spec {
        t0: std::time::Instant,
        gen0: usize,
        rounds: usize,
    },
    Plain {
        t0: std::time::Instant,
        gen0: usize,
    },
    Decided {
        spec: bool,
        recheck_at: usize,
    },
}

/// `CMF_GRAPH_SPEC_TIME`: 0 = off, 1 = one line per speculative round
/// plus the host stamps of any OUTLIER round (wall > 1.4× the running
/// median), 2 = the host stamps of every round.
pub(crate) fn spec_time_level() -> u8 {
    static L: std::sync::OnceLock<u8> = std::sync::OnceLock::new();
    *L.get_or_init(|| match std::env::var("CMF_GRAPH_SPEC_TIME") {
        Ok(v) => v.trim().parse::<u8>().map(|n| n.max(1)).unwrap_or(1),
        Err(_) => 0,
    })
}

/// `GraphMoeBank` reuse across tokens (`CMF_GRAPH_MOE_BANK=0` rebuilds
/// every layer's bank on every token, the route before the cache).
fn graph_moe_bank_on() -> bool {
    static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    *ON.get_or_init(|| std::env::var("CMF_GRAPH_MOE_BANK").as_deref() != Ok("0"))
}

/// Decide whether the batched speculative verifier is admitted by the
/// user/backend policy, before capability checks.  Native Metal's row-batch
/// verifier is deliberately fail-closed by default: it has produced a
/// different *emitted* greedy token than the serial path on a real model.
/// It remains available only through the documented explicit experiment
/// spelling, `CMF_GRAPH_SPEC=1`; other backends retain their historical
/// nonzero override behaviour.
fn graph_spec_wanted_by_policy(
    spec_env: Option<&str>,
    spec_default_ok: bool,
    penalized: bool,
    metal_wgpu: bool,
    native_metal: bool,
) -> bool {
    match spec_env {
        Some("0") => false,
        Some("1") => true,
        // Off native Metal any other value still forces the drafts on, as it
        // always did; on native Metal it means the default below.
        Some(_) if !native_metal => true,
        // Native Metal shares the default since the batched verify passed the
        // exact-ID gate over q4tp trunks (`spec_default_ok`): MacBook Air M4,
        // Qwen3.8-27B Turbo and OrcaCyber-Nano-1.0, five prompts each, the
        // same token ids with drafts and without, 1.45-2.3x the plain decode.
        _ => spec_default_ok && !penalized && !metal_wgpu,
    }
}

/// The round's host stamps: `spec_stamp(name)` records the time since
/// the previous stamp (the section that just ended) — from anywhere on
/// the round's call chain (the Metal verify, the draft step, the commit),
/// no plumbing. Off (a single atomic load) unless `CMF_GRAPH_SPEC_TIME`
/// is set; one decode thread at a time is assumed (diagnostics).
struct SpecStampLog {
    t_last: std::time::Instant,
    items: Vec<(&'static str, f32)>,
}

static SPEC_STAMPS: std::sync::Mutex<Option<SpecStampLog>> = std::sync::Mutex::new(None);

pub(crate) fn spec_stamp(name: &'static str) {
    if spec_time_level() == 0 {
        return;
    }
    if let Ok(mut g) = SPEC_STAMPS.lock() {
        if let Some(log) = g.as_mut() {
            let now = std::time::Instant::now();
            log.items
                .push((name, (now - log.t_last).as_secs_f32() * 1e3));
            log.t_last = now;
        }
    }
}

fn spec_stamps_begin() {
    if spec_time_level() == 0 {
        return;
    }
    if let Ok(mut g) = SPEC_STAMPS.lock() {
        *g = Some(SpecStampLog {
            t_last: std::time::Instant::now(),
            items: Vec::with_capacity(64),
        });
    }
}

fn spec_stamps_take() -> Vec<(&'static str, f32)> {
    SPEC_STAMPS
        .lock()
        .ok()
        .and_then(|mut g| g.take())
        .map(|l| l.items)
        .unwrap_or_default()
}

/// One line: every stamp name in first-seen order with its total over the
/// round and, when it fired more than once (the draft steps), the count.
fn spec_stamps_format(items: &[(&'static str, f32)]) -> String {
    let mut agg: Vec<(&'static str, f32, u32)> = Vec::with_capacity(items.len());
    for &(n, ms) in items {
        match agg.iter_mut().find(|e| e.0 == n) {
            Some(e) => {
                e.1 += ms;
                e.2 += 1;
            }
            None => agg.push((n, ms, 1)),
        }
    }
    let mut s = String::with_capacity(agg.len() * 16);
    for (n, ms, k) in agg {
        if k > 1 {
            s.push_str(&format!("{n} {ms:.1}/{k} "));
        } else {
            s.push_str(&format!("{n} {ms:.1} "));
        }
    }
    s
}

/// The speculation monitor: exponential averages of a round's wall time
/// and of the tokens it produced, and the plain token's wall time — the
/// three numbers the keep/stop rule needs. A round pays when
/// `tokens_per_round · plain_ms > round_ms · 1.03`. The one-shot trial
/// (four rounds against eight tokens) mis-called prose: the first rounds
/// after a prompt are formulaic and accept well, the body does not (an
/// essay measured 39 against a plain 44.8 with the trial saying
/// "speculate"), so the rule now runs on EVERY round and stops after four
/// consecutive losing rounds; a stopped speculation is retried 128 tokens
/// later.
///
/// Native Metal (`metal: true`) does not pay the eight plain tokens up
/// front: on the 27B a plain token is ~150 ms, so the trial alone cost
/// ~1.2 s of every answer. There the plain phase is (a) skipped while the
/// rounds land at least `SPEC_PROXY_TOKENS` tokens each — a k=7 round on
/// Metal costs ~1.9 plain tokens (286 against 148 ms measured on the M4),
/// so 3.5 tokens/round cannot lose on any Metal round/plain ratio seen —
/// and (b) otherwise bounded to the fewest tokens that time it: two, or
/// as many as fit in `SPEC_PLAIN_MIN_MS` (a 150-ms token measures itself;
/// a 10-ms one needs the eight). The keep/stop rule itself is unchanged:
/// the moment a plain rate exists, it decides.
#[derive(Default, Clone, Copy)]
struct SpecMon {
    round_ms: f64,
    tokens: f64,
    plain_ms: f64,
    n: u32,
    fails: u32,
    /// Consecutive rounds that produced only their verifier-tip token (zero
    /// accepted MTP drafts). This is deliberately counted before the warm-up
    /// round is excluded from timing: `SPEC_ZERO_ROUNDS` real zero-acceptance
    /// rounds stop charging an obviously losing speculative arm.
    zero_accept_rounds: u8,
    metal: bool,
    /// The CUDA hybrid arm: a round costs about 1.25 plain tokens (a verify
    /// of five rows 1.1x a token, the drafts a tenth more), so rounds that
    /// land `SPEC_PROXY_TOKENS_CUDA` pay without timing plain tokens.
    cuda: bool,
}

/// What a speculative round of k drafts costs on native Metal over a q4tp
/// trunk, in plain tokens. One and two drafts verify on the small-batch
/// matvec (`q4tp_matvec_b2` / `_b3`), three and more on the narrow GEMM at
/// one flat price. MacBook Air M4, Qwen3.8-27B: a plain token 160 ms, a
/// round of one draft 176, of two 204, of three 246, of seven 281.
const METAL_ROUND_COST: [f32; 7] = [1.10, 1.275, 1.54, 1.59, 1.65, 1.70, 1.76];
/// The same on the CUDA hybrid arm, verify and commit of a round of k
/// drafts: RTX 3090, Qwen3.8-27B q4tp, a plain token 20.4 ms, a round of
/// four chain drafts 24.3 ms past its drafts, of seven block drafts 25.1.
const CUDA_ROUND_COST: [f32; 7] = [1.12, 1.15, 1.17, 1.19, 1.21, 1.22, 1.24];
/// A DFlash block on the CUDA arm with its context rows and head (3.9 ms),
/// and a step of the MTP chain (0.62 ms), in plain tokens.
const CUDA_BLOCK_DRAFT: f32 = 0.19;
const CUDA_DRAFT_STEP: f32 = 0.03;
/// How often a draft holds once the one before it held, before any round has
/// shown it: the 27B's chain on code and on prose holds its first draft in
/// four rounds of five, the second in three of four after that, the third in
/// one of two.
const SPEC_HOLD_PRIOR: [f32; 7] = [0.80, 0.75, 0.50, 0.67, 0.65, 0.69, 0.67];

/// The draft depth that lands the most tokens in a unit of time: a round of
/// k drafts gives its tip and every draft the chain held, for the cost of
/// that depth's verify.
fn metal_spec_depth(hold: &[f32; 7]) -> usize {
    metal_spec_plan(hold, 0.0).0
}

/// `metal_spec_depth` for a drafter whose drafts cost `draft` plain tokens a
/// round whatever the depth (a DFlash block; an MTP chain's steps are small
/// change beside the verify and count as nothing): the depth, and the tokens
/// it lands in the time of a plain one.
fn metal_spec_plan(hold: &[f32; 7], draft: f32) -> (usize, f32) {
    spec_plan_at(&METAL_ROUND_COST, hold, draft, 0.0)
}

/// `metal_spec_plan` over any device's price list: `cost[k - 1]` plain tokens
/// for a round of k drafts, `draft` a round and `step` a draft on top.
fn spec_plan_at(cost: &[f32; 7], hold: &[f32; 7], draft: f32, step: f32) -> (usize, f32) {
    let mut best = (1usize, 0f32);
    let (mut tokens, mut reach) = (1.0f32, 1.0f32);
    for k in 1..=7 {
        reach *= hold[k - 1];
        tokens += reach;
        let rate = tokens / (cost[k - 1] + draft + step * k as f32);
        // a longer chain has to win by more than the averages' noise
        if rate > best.1 * 1.04 {
            best = (k, rate);
        }
    }
    best
}

/// The depth of the MTP chain's rounds on wgpu, from what a round costs on
/// this device: `wall[k - 1]` is the measured wall of a round of k drafts in
/// ms (0: not timed yet), and a depth between or past the timed ones is
/// priced on the line through the two nearest. A verify's price climbs with
/// its rows by a card's own slope (Qwen3.8-27B Turbo, a round of 3 / 4 / 5
/// drafts: RTX 2000 Ada 111 / 126 / 145 ms against a plain token's 75), so
/// the acceptance alone does not say where a deeper round stops paying.
/// `None` until two depths are timed: the acceptance rule moves the depth
/// until then. The depth in turn stays unless another lands 4 % more tokens
/// in a unit of time.
fn wgpu_spec_depth(hold: &[f32; 7], wall: &[f32; 7], k_now: usize, k_min: usize, k_max: usize) -> Option<usize> {
    let mut timed = (1..=7usize).filter(|&k| wall[k - 1] > 0.0);
    let (first, second) = (timed.next()?, timed.next()?);
    let price = |k: usize| -> f32 {
        if wall[k - 1] > 0.0 {
            return wall[k - 1];
        }
        // the two timed depths nearest to k
        let (mut a, mut b) = (first, second);
        for j in (1..=7usize).filter(|&j| wall[j - 1] > 0.0 && j != first && j != second) {
            let far = if a.abs_diff(k) >= b.abs_diff(k) { &mut a } else { &mut b };
            if j.abs_diff(k) < far.abs_diff(k) {
                *far = j;
            }
        }
        let (a, b) = (a.min(b), a.max(b));
        let slope = ((wall[b - 1] - wall[a - 1]) / (b - a) as f32).max(0.0);
        (wall[a - 1] + slope * (k as f32 - a as f32)).max(wall[a - 1] * 0.5)
    };
    let (k_min, k_max) = (k_min.clamp(1, 7), k_max.clamp(1, 7));
    let (mut tokens, mut reach) = (1.0f32, 1.0f32);
    let mut rate = [0f32; 7];
    for k in 1..=7 {
        reach *= hold[k - 1];
        tokens += reach;
        rate[k - 1] = tokens / price(k);
    }
    let k_now = k_now.clamp(k_min, k_max);
    let best = (k_min..=k_max).max_by(|&a, &b| rate[a - 1].total_cmp(&rate[b - 1]))?;
    Some(if rate[best - 1] > rate[k_now - 1] * 1.04 { best } else { k_now })
}

/// A DFlash block with its head and selector on native Metal, in plain
/// tokens: one price a round, every draft of the block at once. MacBook Air
/// M4, the DFlash 2 drafter of Qwen3.8-27B as q4tp: 70 ms against a plain
/// token's 160.
const DFLASH_ROUND_DRAFT: f32 = 0.44;
/// How often a DFlash draft holds once the one before it held, before any
/// round has shown it: the 27B's drafter keeps 3.4 drafts of seven from every
/// start of mixed text.
const DFLASH_HOLD_PRIOR: [f32; 7] = [0.85, 0.82, 0.80, 0.80, 0.80, 0.80, 0.80];
/// Rounds the DFlash block sits out after a turn that the MTP chain took
/// back, and the most it ever sits out: a turn of fewer than `DFLASH_TURN`
/// rounds doubles the wait, a longer one starts it over. A turn that landed
/// more tokens over all its rounds than the chain was landing lost them to a
/// hard stretch (the block holds a whole round or none of it, so a few empty
/// rounds in a row say little): it sits out `DFLASH_WAIT_DIP` rounds only.
const DFLASH_WAIT: u32 = 48;
const DFLASH_WAIT_MOST: u32 = 768;
/// The router's margin of a round enters the running average with this
/// weight, and the drafter in turn keeps the rounds while the average is
/// inside this band (the margin is a difference of squared errors of unit
/// rows).
pub const DFLASH_LEAN_STEP: f32 = 0.5;
pub const DFLASH_LEAN_BAND: f32 = 0.0;
/// A stretch being copied from the context is the chain's whatever the router
/// says: this many of the last tokens repeating an earlier stretch (see
/// `tail_repeat`). Its short round and the lookup after it draft such text
/// for less than a block (edits and quotes: 8 keeps the code's rounds, where
/// three or four tokens repeat all the time).
pub const DFLASH_COPY_MIN: usize = 8;
/// The running gain of the chain's lookups (`spec_lookup_gain`) past which a
/// CUDA round stays the chain's: an edit of 512 tokens lost 15 % to the
/// block's rounds between its copies.
const DFLASH_LOOKUP_KEEPS: f32 = 5.0;
const DFLASH_WAIT_DIP: u32 = 8;
const DFLASH_TURN: u32 = 16;

/// One logged start of a sequence, for `dflash_round_values`.
pub struct DflashStart<'a> {
    /// The committed stream through the round's first token.
    pub seq: &'a [u32],
    /// What the trunk went on to say after it (seven tokens or more).
    pub after: &'a [u32],
    /// The block's seven drafts there.
    pub block: &'a [u32],
    /// The chain's seven.
    pub chain: &'a [u32],
}

/// For `cortiq dflash-route-fit`: what a round at each of a sequence's logged
/// starts lands and what it costs in plain tokens, `(tokens, cost)` under the
/// block and under the chain, each at the depth its own rule picks from the
/// starts before it, a prompt lookup going on after the drafts as it does in
/// a round (`METAL_ROUND_COST`, `DFLASH_ROUND_DRAFT`: the price of a round on
/// a MacBook Air M4).
pub fn dflash_round_values(starts: &[DflashStart<'_>]) -> Vec<((f32, f32), (f32, f32))> {
    dflash_round_values_at(starts, &METAL_ROUND_COST, DFLASH_ROUND_DRAFT, 0.0)
}

/// `dflash_round_values` at another device's prices: `cost[k - 1]` plain
/// tokens for the verify and commit of a round of k drafts, `block_draft`
/// for a block, `chain_step` for each draft of the chain.
pub fn dflash_round_values_at(
    starts: &[DflashStart<'_>],
    cost: &[f32; 7],
    block_draft: f32,
    chain_step: f32,
) -> Vec<((f32, f32), (f32, f32))> {
    // a drafter's account of what holds, and what its lookups have paid
    struct Side {
        hold: [f32; 7],
        gain: f32,
        rest: u32,
        draft: f32,
        step: f32,
    }
    let mut seq: Vec<u32> = Vec::new();
    let mut round = |side: &mut Side, s: &DflashStart<'_>, own: &[u32]| -> (f32, f32) {
        let k = spec_plan_at(cost, &side.hold, side.draft, side.step).0.min(own.len()).max(1);
        let mut drafts = own[..k.min(own.len())].to_vec();
        if k < 7 && drafts.len() == k {
            if side.rest > 0 {
                side.rest -= 1;
            } else {
                seq.clear();
                seq.extend_from_slice(s.seq);
                seq.extend_from_slice(&drafts);
                let more = lookup_continuation(&seq, k + LOOKUP_MIN_REAL, 7 - k).to_vec();
                drafts.extend(more);
            }
        }
        let kept = drafts.iter().zip(s.after).take_while(|(d, t)| d == t).count();
        if drafts.len() > k {
            side.gain += 0.2 * (kept.saturating_sub(k) as f32 - side.gain);
            if side.gain < LOOKUP_PAYS {
                (side.rest, side.gain) = (24, 1.6);
            }
        }
        spec_hold_update(&mut side.hold, k, kept.min(k));
        ((1 + kept) as f32, cost[drafts.len().clamp(1, 7) - 1] + side.draft + side.step * k as f32)
    };
    let mut block = Side { hold: DFLASH_HOLD_PRIOR, gain: 2.0, rest: 0, draft: block_draft, step: 0.0 };
    let mut chain = Side { hold: SPEC_HOLD_PRIOR, gain: 2.0, rest: 0, draft: 0.0, step: chain_step };
    starts.iter().map(|s| (round(&mut block, s, s.block), round(&mut chain, s, s.chain))).collect()
}

/// `CMF_DFLASH_ROWS=FILE`: every round of the DFlash block is written there
/// for `cortiq dflash-route-fit`, and the MTP chain drafts the same round
/// beside it, unverified. A record is 24 u32 and the target's row at the
/// tip (hidden f32), little-endian: the position of the round's first
/// token, that token, drafts verified, drafts accepted, the block's seven
/// drafts, the chain's seven, the lookup's count and its five after the
/// chain's first two (`u32::MAX` where there is none). `FILE.ids` holds the
/// stream through the first logged round's first token (u32).
fn dflash_rows_log() -> Option<&'static std::sync::Mutex<std::fs::File>> {
    static LOG: std::sync::OnceLock<Option<std::sync::Mutex<std::fs::File>>> = std::sync::OnceLock::new();
    LOG.get_or_init(|| {
        let path = std::env::var("CMF_DFLASH_ROWS").ok()?;
        match std::fs::OpenOptions::new().create(true).append(true).open(&path) {
            Ok(f) => Some(std::sync::Mutex::new(f)),
            Err(e) => {
                tracing::warn!("CMF_DFLASH_ROWS: {path}: {e}");
                None
            }
        }
    })
    .as_ref()
}

/// Rows of the trunk's tapped layers that may wait for the drafter
/// (`dflash_taps`): 100 KB a row on five layers of 5120.
const DFLASH_TAPS_ROWS: usize = 16384;

/// `CMF_SPEC_SCRIPT=FILE`: token ids (the whole sequence, prompt first) that a
/// round of a trunk without a draft block takes its drafts from, in place of
/// a drafter. For tests of the verify and the rewind: with the plain greedy
/// sequence in the file every draft holds, and an id changed there is a
/// draft that does not.
#[cfg(feature = "gpu")]
fn solo_script() -> Option<&'static [u32]> {
    static IDS: std::sync::OnceLock<Option<Vec<u32>>> = std::sync::OnceLock::new();
    IDS.get_or_init(|| {
        let path = std::env::var("CMF_SPEC_SCRIPT").ok()?;
        match std::fs::read_to_string(&path) {
            Ok(s) => Some(s.split_whitespace().filter_map(|t| t.parse().ok()).collect()),
            Err(e) => {
                tracing::warn!("CMF_SPEC_SCRIPT: {path}: {e}");
                None
            }
        }
    })
    .as_deref()
}

/// Little-endian bytes of f32 values (`Pipeline::dflash_dump`).
fn f32_bytes(v: &[f32]) -> Vec<u8> {
    v.iter().flat_map(|x| x.to_le_bytes()).collect()
}

/// What a round of a trunk without a draft block leaves the decode loop
/// (`Pipeline::solo_spec_round`): the drafts that held, the trunk's row and
/// logits after the last of them.
#[cfg(feature = "gpu")]
struct SoloRound {
    accepted: Vec<u32>,
    drafted: usize,
    hidden: Vec<f32>,
    logits: Vec<f32>,
}

/// The decode loop's account of those rounds: how deep the next one drafts,
/// and whether rounds land tokens faster than plain steps do.
#[cfg(feature = "gpu")]
struct SoloSpec {
    k: usize,
    /// Plain tokens to go before the next round, and the wait a losing
    /// stretch of rounds gets next time.
    rest: u32,
    back: u32,
    /// A plain token's time and a round's time per token it lands, ms
    /// (the first plain token of a sequence pays the warm-up: not a sample).
    plain_ms: f32,
    plain_n: u32,
    round_ms: f32,
    rounds: u32,
    /// The judging window: the rounds' summed wall and summed tokens (a
    /// ratio of sums — a mean of per-round ratios misrates a drafter).
    win_ms: f32,
    win_tok: u32,
    /// The step in flight: its start, and the tokens it lands (0: a plain one).
    last: Option<(std::time::Instant, usize)>,
    /// The sequence's first round is still to come: it pays the drafter's
    /// read of the prompt (and, on a device block, the kernels' warm-up),
    /// so like the first plain token it is not a sample. Before this the
    /// 700 ms of that round sat in the EWMA for a dozen rounds and sent a
    /// drafter that was winning 40 against 30 tok/s on code to rest.
    first: bool,
}

/// The deepest round of a trunk without a draft block (the tip and seven
/// drafts: the batch graph's narrow kernels take eight rows, and a ninth
/// row costs a plane-wide GEMM a layer — 660 ms a verify against 120 on
/// the A40), the rounds a stretch is judged over, and the waits of a
/// stretch that lost.
#[cfg(feature = "gpu")]
const SOLO_K_MOST: usize = 7;
/// The deepest round the pay-off monitor picks on its own. The verify's
/// int8 batch kernels grow with the rows (eight rows 108 ms, five 70 on
/// Ripple-65B / RTX PRO 6000), so seven drafts at 80 % kept gave 36 tok/s
/// where four gave 47; `CMF_GRAPH_SPEC_K` still pins any depth to 7.
#[cfg(feature = "gpu")]
const SOLO_K_AUTO: usize = 5;
#[cfg(feature = "gpu")]
const SOLO_TRIAL: u32 = 6;
/// The rounds a judging window holds before its first verdict.
#[cfg(feature = "gpu")]
const SOLO_JUDGE: u32 = 3;
#[cfg(feature = "gpu")]
const SOLO_REST: u32 = 32;
#[cfg(feature = "gpu")]
const SOLO_REST_MOST: u32 = 512;

/// Which drafter takes rounds when a DFlash sidecar sits beside the model's
/// own MTP block: `CMF_DFLASH_PICK=dflash` / `mtp` pins one, anything else
/// leaves it to what each of them holds.
fn dflash_pick() -> Option<bool> {
    static PICK: std::sync::OnceLock<Option<bool>> = std::sync::OnceLock::new();
    *PICK.get_or_init(|| match std::env::var("CMF_DFLASH_PICK").as_deref() {
        Ok("dflash") => Some(true),
        Ok("mtp") => Some(false),
        _ => None,
    })
}

/// A round of `k` drafts held its first `accepted`: move every depth the
/// round put to the test. Depths past `k` keep their last value, except
/// while the deepest one shown holds in nine rounds of ten: text that
/// predictable is worth a longer chain now and then, so they drift towards
/// it until a deeper round measures them.
fn spec_hold_update(hold: &mut [f32; 7], k: usize, accepted: usize) {
    let k = k.clamp(1, 7);
    for j in 1..=k {
        if accepted + 1 >= j {
            let hit = if accepted >= j { 1.0 } else { 0.0 };
            hold[j - 1] += 0.1 * (hit - hold[j - 1]);
        }
    }
    if k < 7 && hold[k - 1] >= 0.9 {
        for j in k + 1..=7 {
            hold[j - 1] += 0.005 * (hold[k - 1] - hold[j - 1]);
        }
    }
}

/// Real tokens before the head's drafts that have to repeat with them for a
/// lookup to continue the chain.
const LOOKUP_MIN_REAL: usize = 3;
/// Drafts a lookup has to add to a round on average to pay for the wider
/// verify (a round of two drafts against one of seven on the M4: 204 and
/// 281 ms).
const LOOKUP_PAYS: f32 = 1.0;

/// Prompt lookup: where the tail of `seq`, its last `min_len` tokens or
/// more, repeats an earlier stretch, the tokens that followed that stretch
/// there, at most `want` of them. The longest repeat wins, the latest of
/// equal ones.
fn lookup_continuation(seq: &[u32], min_len: usize, want: usize) -> &[u32] {
    const CAP: usize = 32;
    let n = seq.len();
    if want == 0 || min_len == 0 || n <= min_len {
        return &[];
    }
    let last = seq[n - 1];
    let mut best = (0usize, 0usize);
    for p in (0..n - 1).rev() {
        if seq[p] != last {
            continue;
        }
        let mut l = 1;
        while l < CAP && l <= p && seq[p - l] == seq[n - 1 - l] {
            l += 1;
        }
        if l > best.0 {
            best = (l, p);
            if l == CAP {
                break;
            }
        }
    }
    if best.0 < min_len {
        return &[];
    }
    let from = best.1 + 1;
    &seq[from..(from + want).min(n)]
}

/// How many of the last tokens of `seq` repeat an earlier stretch of it (the
/// longest such repeat, 32 at most): text that is being copied from the
/// context. A lookup drafts such a stretch for nothing after the chain's
/// short round, so a round there is not worth a DFlash block.
pub fn tail_repeat(seq: &[u32]) -> usize {
    const CAP: usize = 32;
    let n = seq.len();
    if n < 2 {
        return 0;
    }
    let last = seq[n - 1];
    let mut best = 0usize;
    for p in (0..n - 1).rev() {
        if seq[p] != last {
            continue;
        }
        let mut l = 1;
        while l < CAP && l <= p && seq[p - l] == seq[n - 1 - l] {
            l += 1;
        }
        if l > best {
            best = l;
            if l == CAP {
                break;
            }
        }
    }
    best
}

/// Zero-acceptance rounds in a row that end a speculation trial early. Two
/// was too few: a good head meets two empty rounds in a row now and then
/// (OrcaCyber-Nano-1.0 on an RTX 2000 Ada, 95 pinned rounds of code and a
/// review: four such pairs, no triple), and at the start of a chat turn a
/// pair sent the whole 200-token turn to plain decode, 13.4 tok/s against
/// 25.9 with the drafts. A head that never holds costs one more round.
const SPEC_ZERO_ROUNDS: u8 = 3;
/// Tokens a plain decision taken on thin evidence (fewer than five timed
/// rounds) stands before the rounds are tried again; one taken on a full
/// trial stands for `SPEC_RECHECK_PLAIN`.
const SPEC_RECHECK_THIN: usize = 32;
const SPEC_RECHECK_PLAIN: usize = 128;

/// Tokens per round at or above which a Metal round pays without a plain
/// measurement (see `SpecMon`).
const SPEC_PROXY_TOKENS: f64 = 3.5;
/// The CUDA hybrid arm's proxy (see `SpecMon::cuda`): RTX 3090, Qwen3.8-27B,
/// a round 24.5-26.8 ms against a plain token's 20.4.
const SPEC_PROXY_TOKENS_CUDA: f64 = 2.0;
/// The Metal plain phase: at least two tokens, and more until this much
/// wall time has been timed (up to the eight the other backends time).
const SPEC_PLAIN_MIN_MS: f64 = 200.0;

impl SpecMon {
    fn round(&mut self, dt_ms: f64, produced: usize) {
        if produced <= 1 {
            self.zero_accept_rounds = self.zero_accept_rounds.saturating_add(1);
        } else {
            self.zero_accept_rounds = 0;
        }
        self.n += 1;
        if self.n == 1 {
            return; // round 1 pays the batch scratch and the draft mirror
        }
        let a = if self.n == 2 { 1.0 } else { 0.3 };
        self.round_ms += a * (dt_ms - self.round_ms);
        self.tokens += a * (produced as f64 - self.tokens);
    }
    fn pays(&self) -> bool {
        if self.plain_ms > 0.0 {
            self.tokens * self.plain_ms > self.round_ms * 1.03
        } else {
            (self.metal && self.tokens >= SPEC_PROXY_TOKENS) || (self.cuda && self.tokens >= SPEC_PROXY_TOKENS_CUDA)
        }
    }
    fn repeated_zero_acceptance(&self) -> bool {
        self.zero_accept_rounds >= SPEC_ZERO_ROUNDS
    }
    /// When a plain decision is tried again: soon if the rounds behind it
    /// were few (round 1 is not timed, so `n` counts one more).
    fn recheck_plain_at(&self, generated: usize) -> usize {
        generated + if self.n < 6 { SPEC_RECHECK_THIN } else { SPEC_RECHECK_PLAIN }
    }
    /// Has the plain phase timed enough tokens to decide?
    fn plain_done(&self, t0: std::time::Instant, gen0: usize, generated: usize) -> bool {
        let n = generated.saturating_sub(gen0);
        if n >= 8 {
            return true;
        }
        self.metal && n >= 2 && t0.elapsed().as_secs_f64() * 1e3 >= SPEC_PLAIN_MIN_MS
    }
}

/// Ids of the consumed prefix the bounded reuse key remembers literally
/// (the rest is covered by the rolling hash).
pub const KV_PREFIX_TAIL: usize = 128;

/// Bounded prefix-reuse key: how many ids the cache holds, a rolling
/// hash of ALL of them and the last [`KV_PREFIX_TAIL`] ids literally.
/// Answers "does this prompt strictly extend what is cached" exactly
/// (hash over the whole consumed prefix + literal tail) without keeping
/// the dialogue — the record is a fixed size whatever the session length.
#[derive(Debug, Clone, Default)]
pub struct KvPrefix {
    len: usize,
    hash: u64,
    tail: Vec<u32>,
    /// Owner of the state this key describes: the resident device graph
    /// (true) or the host. A turn continues the prefix only on its owner
    /// (R4: a host continuation of a device sequence reads an empty host
    /// state; a device continuation of a host sequence has no image).
    device: bool,
}

impl KvPrefix {
    #[inline]
    fn fold(mut h: u64, ids: &[u32]) -> u64 {
        for &id in ids {
            h ^= id as u64;
            h = h.wrapping_mul(0x100000001b3);
            h ^= h >> 29;
        }
        h
    }

    pub fn clear(&mut self) {
        self.len = 0;
        self.hash = 0xcbf29ce484222325;
        self.tail.clear();
        self.device = false;
    }

    /// Was the prefix built on the resident device graph?
    pub fn on_device(&self) -> bool {
        self.device
    }

    /// Tag the owner of the recorded prefix.
    pub fn set_on_device(&mut self, device: bool) {
        self.device = device;
    }

    /// Ids the cache holds (the forwarded prefix).
    pub fn len(&self) -> usize {
        self.len
    }

    pub fn is_empty(&self) -> bool {
        self.len == 0
    }

    /// Literal tail currently kept (≤ `KV_PREFIX_TAIL`).
    pub fn tail_len(&self) -> usize {
        self.tail.len()
    }

    /// Replace the key with `ids` (a fresh sequence).
    pub fn set(&mut self, ids: &[u32]) {
        self.clear();
        self.extend(ids);
    }

    /// Append `more` to the consumed prefix (an extension-only turn).
    pub fn extend(&mut self, more: &[u32]) {
        if self.len == 0 && self.hash == 0 {
            self.hash = 0xcbf29ce484222325;
        }
        self.hash = Self::fold(self.hash, more);
        self.len += more.len();
        if more.len() >= KV_PREFIX_TAIL {
            self.tail.clear();
            self.tail
                .extend_from_slice(&more[more.len() - KV_PREFIX_TAIL..]);
        } else {
            let drop = (self.tail.len() + more.len()).saturating_sub(KV_PREFIX_TAIL);
            self.tail.drain(..drop);
            self.tail.extend_from_slice(more);
        }
    }

    /// Cached positions when `ids` strictly extends the consumed prefix,
    /// 0 otherwise. The tail is compared literally first (cheap), then
    /// the hash over the whole prefix must agree.
    pub fn extension(&self, ids: &[u32]) -> usize {
        if self.len == 0 || ids.len() <= self.len {
            return 0;
        }
        let t = self.tail.len();
        if ids[self.len - t..self.len] != self.tail[..] {
            return 0;
        }
        if Self::fold(0xcbf29ce484222325, &ids[..self.len]) != self.hash {
            return 0;
        }
        self.len
    }
}

/// Result of a generation call.
pub struct GenerateResult {
    pub text: String,
    pub token_ids: Vec<u32>,
    pub prompt_tokens: usize,
    pub tokens_generated: usize,
    pub finish_reason: String,
    /// Speculative-decode stats (0/0 when MTP is absent or inactive).
    pub mtp_drafted: usize,
    pub mtp_accepted: usize,
    /// Per-generated-token confidence = softmax probability of the token
    /// that was actually emitted (softmax probability on the chosen state). High =
    /// the model was sure; low = it was guessing. Same length as the
    /// generated slice of `token_ids`.
    pub token_confidence: Vec<f32>,
    /// Structured per-token telemetry (B4 channel). Empty unless
    /// `set_trace(true)`; otherwise same length as the generated slice.
    pub traces: Vec<TokenTrace>,
}

/// One row of the structured telemetry trace (B4): the model's internal
/// routing state at the moment a token was emitted. Every field is a
/// quantity the runtime already computes — nothing is inferred or
/// estimated (anti-principle: only measured bytes).
#[derive(Clone, Debug)]
pub struct TokenTrace {
    /// 0-based index within the generated slice.
    pub t: usize,
    /// The emitted token id.
    pub token_id: u32,
    /// Softmax probability on the emitted token — how sure the model was.
    pub confidence: f32,
    /// Skill in force while this token was generated (None = backbone).
    pub active_skill: Option<String>,
    /// Recon error E = ‖r−BBᵀr‖²/‖φ‖² at the last routing eval — coherence
    /// with the active skill's subspace (low = coherent). None = no router
    /// or not yet evaluated.
    pub recon: Option<f32>,
    /// The router changed the active skill right after this token (a
    /// domain boundary crossed under the hysteresis barrier).
    pub switched: bool,
}

/// Calibrated softmax probability of `id` under `logits` (the confidence on
/// the emitted token) — the confidence signal, cheap from logits already
/// computed for sampling. `temp` is the calibration temperature (B1):
/// softmax(logits / temp); 1.0 = raw.
#[cfg_attr(not(test), allow(dead_code))]
fn top1_prob_t(logits: &[f32], id: u32, temp: f32) -> f32 {
    let t = if temp > 1e-3 { temp } else { 1.0 };
    let max = logits.iter().fold(f32::NEG_INFINITY, |m, &v| m.max(v));
    let sum: f32 = logits.iter().map(|&v| ((v - max) / t).exp()).sum();
    if sum > 0.0 {
        (((logits[id as usize] - max) / t).exp()) / sum
    } else {
        0.0
    }
}

/// prefill-GEMM enabled? (CMF_PREFILL=seq — emergency fallback to the
/// sequential path.)
fn prefill_batched() -> bool {
    std::env::var("CMF_PREFILL")
        .map(|v| v != "seq")
        .unwrap_or(true)
}

/// Decide the graph NLL route without conflating graph quality with the
/// optional native-Metal fused head. A hidden-state graph remains a valid
/// quality route on Vulkan/Wgpu; only native Metal requires graph logits.
#[inline]
/// ‖a − b‖ / ‖b‖ (infinite when the lengths differ).
fn rel_l2(a: &[f32], b: &[f32]) -> f64 {
    if a.len() != b.len() {
        return f64::INFINITY;
    }
    let (mut d, mut r) = (0f64, 0f64);
    for (&x, &y) in a.iter().zip(b) {
        let e = (x - y) as f64;
        d += e * e;
        r += y as f64 * y as f64;
    }
    (d / r.max(1e-30)).sqrt()
}

fn nll_graph_policy(unmasked: bool, prefer_graph: bool, native_metal: bool) -> (bool, bool) {
    let graph_quality = unmasked && prefer_graph;
    let fused_head_quality = graph_quality && native_metal;
    (graph_quality, fused_head_quality)
}

/// Input to the layer-major batched span walk: token ids (embeds itself,
/// full-stack and coordinator prefill) or ready boundary hiddens (the
/// network worker's side of a split).
#[derive(Clone, Copy)]
enum PrefillIn<'a> {
    Ids(&'a [u32]),
    Hidden(&'a [f32]),
}

/// The batched prefill walks `weights.layers`. Architectures that load
/// their own stack (gemma-3n's AltUp replicas, DeepSeek-V4's hyper-
/// connections) leave that empty and must go position by position — asking
/// otherwise indexes an empty vector, which is a panic rather than a
/// fallback. Every call site goes through here so the next such
/// architecture is one line, not four.
/// What a turbo file's header asks for.
#[derive(Clone)]
pub(crate) struct O1Turbo {
    pub(crate) cfg: crate::nystrom::O1Cfg,
    /// A prompt this long goes over to the far field; a shorter one stays exact.
    pub(crate) seal: usize,
    pub(crate) exact: crate::dory::ExactRows,
}

/// Rows of a prompt read exactly on the card before the first seal, at most. Past them
/// the rows leave the card as they are read.
const O1_PREFIX_MAX: usize = 8192;

/// Where a turbo file seals on this card. Exact rows take about 190 KB each on Qwen3.8-27B,
/// and the state, the scratch and the draft head about 1.8 GB beside the weights: a 16 GB card
/// has no room for 8192 rows, and gives up a little prompt speed to keep the ceiling.
/// `CMF_O1_PREFIX_MAX` chooses by hand.
pub(crate) fn o1_seal_for_card(seal: usize, weight_bytes: u64) -> usize {
    o1_seal_for_card_rows(seal, weight_bytes, 190 << 10)
}

/// `o1_seal_for_card` for rows of `row_bytes` on the card (Dory's full layers: 54 KB).
pub(crate) fn o1_seal_for_card_rows(seal: usize, weight_bytes: u64, row_bytes: u64) -> usize {
    if let Some(s) = std::env::var("CMF_O1_PREFIX_MAX").ok().and_then(|v| v.parse().ok()) {
        return s;
    }
    let mut budget = crate::gpu::vram_budget();
    // Unified memory: what the system lets the GPU keep, and a row there lives twice, in the
    // host's cache and in the mirror.
    let mut row = row_bytes.max(1);
    #[cfg(target_os = "macos")]
    if budget == u64::MAX {
        budget = crate::gpu_metal::working_set_bytes();
        row *= 2;
    }
    if budget == 0 || budget == u64::MAX {
        return seal;
    }
    let room = budget.saturating_sub(weight_bytes + (1800 << 20));
    seal.min(((room / row) as usize).max(O1_PREFIX_MAX / 2))
}

/// Rows of an archive as they come in: in RAM, or in a file (`CMF_O1_SPILL=DIR`) when
/// RAM is short and a disk is not.
pub(crate) enum ArchStore {
    Ram(Vec<f32>),
    Disk { path: std::path::PathBuf, file: std::io::BufWriter<std::fs::File> },
}

impl ArchStore {
    pub(crate) fn new(dir: Option<&std::path::Path>, name: String) -> Result<Self, String> {
        let Some(dir) = dir else { return Ok(Self::Ram(Vec::new())) };
        std::fs::create_dir_all(dir).map_err(|e| format!("O(1) spill {}: {e}", dir.display()))?;
        let path = dir.join(format!("cortiq-o1-{}-{name}.rows", std::process::id()));
        let file = std::fs::File::create(&path).map_err(|e| format!("O(1) spill {}: {e}", path.display()))?;
        Ok(Self::Disk { path, file: std::io::BufWriter::with_capacity(1 << 22, file) })
    }

    pub(crate) fn push(&mut self, rows: &[f32]) -> Result<(), String> {
        match self {
            Self::Ram(v) => {
                v.extend_from_slice(rows);
                Ok(())
            }
            Self::Disk { path, file } => {
                use std::io::Write;
                // SAFETY: an `f32` slice is valid as bytes of four times its length.
                let bytes = unsafe { std::slice::from_raw_parts(rows.as_ptr().cast::<u8>(), rows.len() * 4) };
                file.write_all(bytes).map_err(|e| format!("O(1) spill {}: {e}", path.display()))
            }
        }
    }

    pub(crate) fn freeze(mut self) -> Result<ArchRows, String> {
        match self {
            Self::Ram(ref mut v) => Ok(ArchRows::Ram(std::mem::take(v))),
            Self::Disk { ref mut path, ref mut file } => {
                use std::io::Write;
                file.flush().map_err(|e| format!("O(1) spill {}: {e}", path.display()))?;
                let f = std::fs::File::open(&*path).map_err(|e| format!("O(1) spill {}: {e}", path.display()))?;
                // SAFETY: the file is this process's own and no one writes it any more.
                let map = unsafe { memmap2::Mmap::map(&f) }.map_err(|e| format!("O(1) spill {}: {e}", path.display()))?;
                Ok(ArchRows::Disk { map: Some(map), path: std::mem::take(path) })
            }
        }
    }
}

impl Drop for ArchStore {
    fn drop(&mut self) {
        if let Self::Disk { path, .. } = self {
            // A store that was frozen hands its file over; the file is gone only here if not.
            if !path.as_os_str().is_empty() {
                let _ = std::fs::remove_file(&*path);
            }
        }
    }
}

pub(crate) enum ArchRows {
    Ram(Vec<f32>),
    Disk { map: Option<memmap2::Mmap>, path: std::path::PathBuf },
}

impl ArchRows {
    pub(crate) fn as_slice(&self) -> &[f32] {
        match self {
            Self::Ram(v) => v,
            Self::Disk { map, .. } => {
                let b = map.as_ref().map_or(&[][..], |m| &m[..]);
                // SAFETY: a page-aligned map of what `push` wrote, whole `f32`s.
                unsafe { std::slice::from_raw_parts(b.as_ptr().cast::<f32>(), b.len() / 4) }
            }
        }
    }
}

impl Drop for ArchRows {
    fn drop(&mut self) {
        if let Self::Disk { map, path } = self {
            *map = None;
            let _ = std::fs::remove_file(&*path);
        }
    }
}

/// The rows of a prompt past its first seal, off the card until the far field is built
/// anew over all of them.
struct O1Archive {
    dir: Option<std::path::PathBuf>,
    layers: Vec<O1ArchLayer>,
    rows: usize,
    stride: usize,
    nh: usize,
    nk: usize,
    hd: usize,
}

impl O1Archive {
    fn new() -> Self {
        Self { dir: std::env::var_os("CMF_O1_SPILL").map(Into::into), layers: Vec::new(), rows: 0, stride: 1, nh: 0, nk: 0, hd: 0 }
    }
}

struct O1ArchLayer {
    li: usize,
    k: ArchStore,
    v: ArchStore,
    q: ArchStore,
}

impl Pipeline {
    pub(crate) fn can_prefill_batched(&self) -> bool {
        #[cfg(test)]
        let force_serial = self.nll_test_force_serial;
        #[cfg(not(test))]
        let force_serial = false;
        prefill_batched() && !force_serial && !self.weights.layers.is_empty()
    }

    /// The backend's automatic capacity split for a mapped transformer.
    /// Kept as a method so prefill and decode use the exact same boundary.
    fn automatic_gpu_prefix(&self) -> Option<usize> {
        let (model, _, _, _) = self.weights.embed_tokens.graph_weight()?;
        crate::gpu::automatic_layer_prefix(&model, self.num_layers, self.physical_layers)
    }

    /// Positions per batched pass of the layer-stack prefill for THIS
    /// model on THIS backend (see [`prefill_chunk_rule`]). Pub: the network
    /// split must chunk exactly like the local path to reproduce it.
    pub fn prefill_chunk(&self) -> usize {
        let env = env_prefill_chunk();
        if env.is_some() || ChunkHost::here() != ChunkHost::Other {
            return prefill_chunk_rule(env, ChunkHost::here(), false);
        }
        let facts = self.chunk_stack_facts();
        if facts.dense_on_cpu() {
            return CPU_DENSE_PREFILL_CHUNK;
        }
        prefill_chunk_rule(None, ChunkHost::Other, facts.dense_on_discrete())
    }

    /// Prompt lookup in a speculative round (`CMF_SPEC_LOOKUP=0` leaves the
    /// chain to the draft head alone).
    fn spec_lookup_on() -> bool {
        static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
        *ON.get_or_init(|| std::env::var("CMF_SPEC_LOOKUP").as_deref() != Ok("0"))
    }

    /// Whether a verify of two or three rows runs on the small-batch matvec:
    /// native Metal, a dense q4tp FFN in the trunk, the kernel not switched
    /// off (`CMF_METAL_MVS=0`).
    fn metal_small_batch_verify(&self) -> bool {
        #[cfg(target_os = "macos")]
        {
            crate::gpu::q1_force()
                && crate::gpu_metal::small_batch_mv()
                && self.weights.layers.first().is_some_and(|l| match &l.ffn {
                    FfnKind::Dense(d) => d.gate_proj.mapped_q4tp().is_some(),
                    _ => false,
                })
        }
        #[cfg(not(target_os = "macos"))]
        {
            false
        }
    }

    /// Architectures that run a dedicated per-token stack (gemma-3n's
    /// AltUp flow, the gemma-4 E-series PLE/shared-KV body): batched
    /// prefill and the graphs stay off for them.
    fn per_token_stack(&self) -> bool {
        self.g3n.is_some() || self.g4e.is_some()
    }

    fn chunk_stack_facts(&self) -> ChunkStackFacts {
        let plain_dense = !self.weights.layers.is_empty()
            && !self.per_token_stack()
            && self.dsv4.is_none()
            && self.dsv41.is_none()
            && self.dory.is_none()
            && self.qwen4_exp.is_none()
            && self.weights.layers.iter().all(|lw| {
                // LFM2/LFM3's short-conv mixer is two projection GEMMs and
                // an elementwise conv: the host-driven chunk walk starves
                // the card the same way (LFM3-1.7B q8_2f on an A40, 2048
                // positions: 137 tok/s at 48, 460-640 at 512).
                matches!(lw.attn, AttnKind::Full { .. } | AttnKind::ShortConv(_))
                    && matches!(lw.ffn, FfnKind::Dense(_))
            });
        let gpu_on = crate::gpu::enabled();
        ChunkStackFacts {
            plain_dense,
            discrete: gpu_on && crate::gpu::discrete(),
            gpu_on,
            // Only asked when the rest already qualifies: it opens the
            // backend's capacity plan.
            capacity_split: std::env::var_os("CMF_GPU_LAYERS").is_some()
                || (plain_dense && gpu_on && self.automatic_gpu_prefix().is_some()),
            multi_gpu: self.gpu_plan.is_some(),
            o1: self.o1_active(),
        }
    }
}

/// Prefill chunk (positions per batched pass), model-agnostic form. On
/// macOS the AMX GEMM path wants tall panels — M=48 starves the matrix
/// units (ggml uses ubatch 512); elsewhere the historical 48 stays.
/// CMF_PREFILL_CHUNK overrides. The architectures with their own stacks
/// (DeepSeek-V4/V4.1) chunk with this; the layer-stack prefill asks
/// [`Pipeline::prefill_chunk`], which also knows the model and the card.
/// A different chunk is a different (equally valid) generation: panel
/// width reorders float accumulation.
pub fn prefill_chunk() -> usize {
    prefill_chunk_rule(env_prefill_chunk(), ChunkHost::here(), false)
}

fn env_prefill_chunk() -> Option<usize> {
    std::env::var("CMF_PREFILL_CHUNK")
        .ok()
        .and_then(|v| v.parse::<usize>().ok())
}

/// The host classes the chunk width distinguishes.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
enum ChunkHost {
    Macos,
    /// Linux/Android aarch64 (phones, SBCs).
    Aarch64,
    /// Everything else: x86-64 Linux/Windows, CPU or Vulkan/DX12.
    Other,
}

impl ChunkHost {
    fn here() -> Self {
        if cfg!(target_os = "macos") {
            ChunkHost::Macos
        } else if cfg!(target_arch = "aarch64") {
            ChunkHost::Aarch64
        } else {
            ChunkHost::Other
        }
    }
}

/// Chunk for a plain dense stack whose every layer lives on a discrete
/// card. On x86 the layer-stack prefill is host-driven: each GEMM and the
/// chunk attention (which re-uploads the whole KV prefix per layer) is a
/// separate submit + readback, so 48 positions a pass left the card idle
/// between them. Measured in-process on an RTX 3090 (Vulkan), 2048-token
/// prompt — see CHANGELOG 0.7.6 for the table.
const DISCRETE_DENSE_PREFILL_CHUNK: usize = 512;

/// Chunk for a plain dense stack with no GPU at all on x86-64: the AVX2
/// q4tp batch kernel and the micro-GEMM chunk attend feed on wider
/// panels. Spark-X2.6-4B q4tp, 1000-token prompt on 8 Zen 2 cores: 20.7
/// tok/s at 48, 24.7 at 128, 25.0 at 256.
const CPU_DENSE_PREFILL_CHUNK: usize = 128;

/// The chunk-width rule. `dense_on_discrete` is true only for a plain
/// dense transformer (full attention, dense FFN, no special stack) that
/// is entirely resident on one discrete card — the one case measured
/// here. GDN hybrids, MoE, DeepSeek stacks, capacity-split and CPU-only
/// runs keep the width they were tuned with.
fn prefill_chunk_rule(env: Option<usize>, host: ChunkHost, dense_on_discrete: bool) -> usize {
    if let Some(n) = env {
        return n.max(1);
    }
    match host {
        ChunkHost::Macos => 512,
        // Mobile: big enough to feed the batched attend (gate b ≥ 32)
        // and the blocked SDOT GEMM without the memory of 512.
        ChunkHost::Aarch64 => 256,
        ChunkHost::Other if dense_on_discrete => DISCRETE_DENSE_PREFILL_CHUNK,
        ChunkHost::Other => 48,
    }
}

/// What the chunk rule needs to know about a loaded stack.
#[derive(Clone, Copy, Debug, Default)]
struct ChunkStackFacts {
    /// Every layer is `AttnKind::Full` or `AttnKind::ShortConv` +
    /// `FfnKind::Dense`, and no architecture-owned stack (g3n,
    /// DeepSeek-V4/V4.1, qwen4-exp) is set.
    plain_dense: bool,
    /// The active GPU backend is a discrete card.
    discrete: bool,
    /// The backend is up and not paused.
    gpu_on: bool,
    /// A capacity-derived device prefix: some layers run on the host.
    capacity_split: bool,
    /// An in-process multi-GPU plan is set.
    multi_gpu: bool,
    /// O(1) layers (their Q trace is recorded by the prefill).
    o1: bool,
}

impl ChunkStackFacts {
    /// A plain dense stack on an x86-64 host with no GPU backend up
    /// (O(1) stacks keep the width their trace was measured with).
    fn dense_on_cpu(self) -> bool {
        cfg!(target_arch = "x86_64")
            && self.plain_dense
            && !self.gpu_on
            && !self.multi_gpu
            && !self.o1
    }

    fn dense_on_discrete(self) -> bool {
        self.plain_dense
            && self.discrete
            && self.gpu_on
            && !self.capacity_split
            && !self.multi_gpu
            && !self.o1
    }
}

/// Number of prompt rows that have a real teacher-forced next-token pair in a
/// prefill span.  The final prompt row has no successor token, so it must not
/// be handed to the MTP warm-up.  Keeping this arithmetic in one helper makes
/// the full-chunk and tail-chunk boundaries explicit for both the graph and
/// CPU implementations.
#[inline]
fn mtp_prefill_pair_count(start: usize, end: usize, input_len: usize) -> usize {
    if end <= start || start >= input_len {
        return 0;
    }
    let rows = (end.min(input_len) - start).min(input_len - start);
    if end < input_len {
        rows
    } else {
        rows.saturating_sub(1)
    }
}

/// Callback for streaming tokens. Return `false` to cancel.
pub type TokenCallback = Box<dyn FnMut(&str) -> bool + Send>;

/// One layer's cache ownership at a cross-turn KV reuse boundary.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub(crate) struct ReuseLayer {
    /// Exact-attention layer (rows in `LayerKvCache`); otherwise a
    /// recurrent / latent mixer whose state cannot be rewound.
    pub full: bool,
    /// Positions the host owner cache reaches (`pos_len`: a trimmed
    /// sliding tail stores only the newest of them).
    pub host_rows: usize,
    /// Rows the wgpu token graph's device mirror holds (None: no mirror).
    pub device_rows: Option<usize>,
    /// A recurrent state lives on the device (advanced past the host copy).
    pub device_state: bool,
}

/// What a reused turn must do before its tail prefill runs on the HOST.
#[derive(Debug, Clone, PartialEq, Eq)]
pub(crate) enum ReusePlan {
    /// Host caches already hold exactly the reused prefix.
    Ready,
    /// Copy device mirror rows `[from..to)` into the host cache of each
    /// listed layer (the rows decode wrote on the device only).
    Pull(Vec<(usize, usize, usize)>),
    /// The prefix cannot be continued on the host exactly: start fresh.
    Fresh,
}

/// The wgpu whole-token graph decodes into a DEVICE K/V mirror and never
/// writes those rows back to the host cache, while the chunked prefill of a
/// pure-attention model reads (and appends to) the host cache. A reused turn
/// therefore found its host cache ending at the previous PROMPT, not at the
/// previous answer: the tail prefill attended without the model's own
/// answer and appended its rows at the wrong index (MiniCPM5 on Vulkan
/// repeated its tool call instead of reading the tool result). Every layer
/// must hold exactly `reuse_from` host rows before the host continues; rows
/// that exist only on the device are pulled back, anything else is fresh.
pub(crate) fn kv_reuse_plan(reuse_from: usize, layers: &[ReuseLayer]) -> ReusePlan {
    let mut pulls = Vec::new();
    for (li, l) in layers.iter().enumerate() {
        if !l.full {
            if l.device_state {
                return ReusePlan::Fresh;
            }
            continue;
        }
        if l.host_rows == reuse_from {
            continue;
        }
        if l.host_rows < reuse_from && l.device_rows.is_some_and(|d| d >= reuse_from) {
            pulls.push((li, l.host_rows, reuse_from));
            continue;
        }
        return ReusePlan::Fresh;
    }
    if pulls.is_empty() {
        ReusePlan::Ready
    } else {
        ReusePlan::Pull(pulls)
    }
}

impl Pipeline {
    /// Reset state whose meaning is local to a single MTP draft sequence.
    /// Unlike ordinary KV reuse, MTP is always rebuilt from the prompt.
    fn reset_fresh_mtp_draft_state(&mut self) {
        self.draft_full_streak = 0;
    }

    /// Clear all per-sequence state, including backend device mirrors.
    ///
    /// The host KV/history buffers are only half of the request lifecycle on
    /// wgpu: GDN/O(1) state and cached graph bind groups are keyed by the
    /// pipeline id and otherwise survive a pooled request.  Keep every fresh
    /// sequence entry point on this one reset path so a new request cannot
    /// inherit the prior request's device state.
    fn clear_sequence_state(&mut self) {
        // a replay still writing the GDN owners must land before they are
        // cleared or reallocated (the device holds raw pointers to them)
        #[cfg(target_os = "macos")]
        let _ = crate::gpu_metal::wait_replay();
        self.kv_cache.clear();
        // Both reuse keys (the legacy `kv_history` and the bounded
        // `kv_prefix`) describe the state being dropped here.
        self.clear_history();
        self.graph_logits = None;
        if let Some(d) = &mut self.dflash {
            d.reset();
        }
        self.dflash_rows = None;
        self.dflash_taps.lock().unwrap().clear();
        // a new sequence owes the DFlash block nothing of the last one's turns
        self.dflash_hold = DFLASH_HOLD_PRIOR;
        (self.dflash_last, self.dflash_wait, self.dflash_back, self.dflash_turn) = (false, 0, DFLASH_WAIT, 0);
        self.dflash_turn_sum = (0.0, 0.0);
        self.dflash_lean = 0.0;
        if let Some(b) = &mut self.dsv41 {
            b.3.clear();
        }
        if let Some(b) = &mut self.dory {
            b.1.clear();
            crate::gpu::dory_reset(self.graph_kv_id);
        }
        crate::gpu::graph_kv_reset(self.graph_kv_id);
        // the card's GDN snapshot went with the sequence's states
        self.gdn_snap = None;
        self.mtp_warm_base = None;
        // MTP is detached from `self` for the duration of generation, so its
        // device mirror is not covered by the trunk reset above.  Reset the
        // derived id as well: a failed/aborted warm-up must never leave a
        // mirror that a later request can mistake for a current MTP cache.
        crate::gpu::graph_kv_reset(self.mtp_kv_id());
    }

    /// Make the host caches own exactly the reused prefix `[0..reuse_from)`
    /// before a reused turn's tail prefill runs on the host (see
    /// [`kv_reuse_plan`]). Returns false when the prefix cannot be continued
    /// exactly — the caller then starts a fresh sequence. A model whose
    /// prefill runs through the token graph keeps its device state as the
    /// authority and is left untouched.
    fn prepare_kv_reuse(&mut self, reuse_from: usize) -> bool {
        if self.dory.is_some() || self.graph_prefill_preferred() {
            return true;
        }
        let kv_id = self.graph_kv_id;
        let layers: Vec<ReuseLayer> = (0..self.num_layers)
            .map(|li| {
                let full = matches!(
                    self.weights.layers[self.phys_layer(li)].attn,
                    AttnKind::Full { .. }
                );
                ReuseLayer {
                    full,
                    // Absolute depth: a trimmed sliding tail stores fewer
                    // rows than the positions it has seen.
                    host_rows: self.kv_cache.layers[li].pos_len(),
                    device_rows: crate::gpu::graph_kv_stored(kv_id, li),
                    device_state: crate::gpu::graph_state_resident(kv_id, li),
                }
            })
            .collect();
        // No wgpu device state at all (CPU, Metal — whose graph appends every
        // decoded row to the owner cache itself): the host is the owner and
        // the extension check already proved the prefix.
        if layers
            .iter()
            .all(|l| l.device_rows.is_none() && !l.device_state)
        {
            return true;
        }
        let plan = kv_reuse_plan(reuse_from, &layers);
        let (what, rows, n) = match &plan {
            ReusePlan::Ready => ("host ready", 0, 0),
            ReusePlan::Fresh => ("fresh", 0, 0),
            ReusePlan::Pull(p) => (
                "pull",
                p.iter().map(|&(_, a, b)| b - a).max().unwrap_or(0),
                p.len(),
            ),
        };
        let t0 = std::time::Instant::now();
        let ok = self.apply_kv_reuse_plan(reuse_from, plan, &layers);
        if std::env::var("CMF_PREFILL_PROF").is_ok() {
            eprintln!(
                "kv-reuse: {what}{}: {rows} device row(s) × {n} layer(s) to the host in {:.2} ms",
                if ok { "" } else { " (failed → fresh)" },
                t0.elapsed().as_secs_f64() * 1e3
            );
        }
        ok
    }

    fn apply_kv_reuse_plan(
        &mut self,
        reuse_from: usize,
        plan: ReusePlan,
        layers: &[ReuseLayer],
    ) -> bool {
        let kv_id = self.graph_kv_id;
        match plan {
            ReusePlan::Fresh => return false,
            ReusePlan::Ready => {}
            ReusePlan::Pull(pulls) => {
                // Mirrors of one uniform geometry: one batched read serves
                // every layer. Per-layer geometry (MiMo-V2: 4/8 KV heads,
                // narrow V, sliding rings) is read layer by layer in the
                // host layout instead.
                let (nkv, hd) = {
                    let c = &self.kv_cache.layers[pulls[0].0];
                    (c.num_kv_heads, c.head_dim)
                };
                let uniform = pulls.iter().all(|&(li, _, _)| {
                    let c = &self.kv_cache.layers[li];
                    (c.num_kv_heads, c.head_dim) == (nkv, hd)
                });
                let batched = if uniform {
                    crate::gpu::graph_kv_read_rows(kv_id, &pulls, nkv, hd)
                } else {
                    None
                };
                let rows: Vec<(Vec<f32>, Vec<f32>)> = match batched {
                    Some(rows) => rows,
                    None => {
                        let mut rows = Vec::with_capacity(pulls.len());
                        for &(li, from, to) in &pulls {
                            let (lnkv, lhd) = {
                                let c = &self.kv_cache.layers[li];
                                (c.num_kv_heads, c.head_dim)
                            };
                            let Some((k, v, first_valid)) =
                                crate::gpu::graph_kv_pull_host(kv_id, li, from, to, lnkv, lhd)
                            else {
                                return false;
                            };
                            // The host continues at `to`: a sliding layer
                            // reads back only its last window, a full one
                            // every row it lacks.
                            let need_from = match self.layer_window(li) {
                                Some(w) => from.max((to + 1).saturating_sub(w)),
                                None => from,
                            };
                            if first_valid > need_from {
                                return false;
                            }
                            rows.push((k, v));
                        }
                        rows
                    }
                };
                for ((li, from, to), (k, v)) in pulls.into_iter().zip(rows) {
                    let cache = &mut self.kv_cache.layers[li];
                    let row = cache.num_kv_heads * cache.head_dim;
                    for p in 0..to - from {
                        cache.append(&k[p * row..(p + 1) * row], &v[p * row..(p + 1) * row], &[]);
                    }
                    if cache.pos_len() != to {
                        return false;
                    }
                }
            }
        }
        // A mirror past the prefix (a greedy burst that ran beyond the stop)
        // holds rows of the OLD continuation: rewind it so the next graph
        // token re-syncs those positions from the host.
        for (li, l) in layers.iter().enumerate() {
            if l.full
                && l.device_rows.is_some_and(|d| d > reuse_from)
                && !crate::gpu::graph_kv_set_stored(kv_id, li, reuse_from)
            {
                return false;
            }
        }
        true
    }

    /// Finish a generation lifecycle after the MTP/router owners were
    /// detached.  Every terminal path must put those owners back before the
    /// pooled pipeline can serve another request.  Graph side channels and
    /// device mirrors are cleared on errors and cancellations; a successful
    /// generation keeps its decode-ready host cache for KV reuse.
    fn finish_generation(
        &mut self,
        mtp: &mut Option<MtpModule>,
        router: &mut Option<crate::swarm::DynRouter>,
        clear_sequence: bool,
    ) {
        // A dynamic route may have switched the overlay before the terminal
        // path. Restore the backbone while the detached router is still
        // available, because set_active_skill also owns the overlay reset.
        if router.is_some() {
            let _ = self.set_active_skill(None);
        }
        // The last speculative round's replay may still be in flight on
        // the second queue: whoever reads the host cache after generate()
        // returns (session export, the network split's KV wire, a KV
        // reuse) must see the final states.
        // A replay that failed leaves the GDN owners half-written: fail
        // closed and drop the sequence instead of handing the cache on.
        #[cfg(target_os = "macos")]
        let clear_sequence = clear_sequence || !crate::gpu_metal::wait_replay();
        if clear_sequence {
            self.clear_sequence_state();
            if let Some(m) = mtp.as_mut() {
                // The MTP owner is detached while generation runs, so the
                // trunk reset above cannot clear its host cache.  Drop its
                // partial rows before reattaching it to the pooled pipeline;
                // the next request must start from the same empty anchor on
                // CPU and on the device mirror.
                m.kv.clear();
            }
            if let Some(m) = self.mtp.as_mut() {
                // A non-speculative request leaves the configured MTP owner
                // attached.  Clear that dormant cache too when a shared
                // generation failure/cancellation resets the sequence.
                m.kv.clear();
            }
        }
        self.graph_want_logits = false;
        self.graph_head_required = false;
        self.graph_logits = None;
        self.graph_failed
            .store(false, std::sync::atomic::Ordering::Relaxed);
        self.cancel
            .store(false, std::sync::atomic::Ordering::Relaxed);
        self.dyn_router = router.take().or(self.dyn_router.take());
        self.mtp = mtp.take().or(self.mtp.take());
        self.mtp_graph_mode = None;
        self.spec_forced = None;
    }

    /// Consume a graph failure reported by a forward that returns only a
    /// hidden vector.  `forward_ids` is a public Result API, so it must not
    /// turn the graph's zero hidden sentinel into a valid lm_head result.
    fn check_forward_graph(&mut self, phase: &str, pos: usize) -> Result<(), String> {
        if self
            .graph_failed
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            self.cancel
                .store(false, std::sync::atomic::Ordering::Relaxed);
            self.clear_sequence_state();
            self.graph_logits = None;
            self.graph_want_logits = false;
            self.graph_head_required = false;
            return Err(format!("GPU graph failed during {phase} at position {pos}"));
        }
        Ok(())
    }

    #[cfg(target_os = "macos")]
    fn fail_metal_graph(&mut self, reason: &str) {
        crate::pipeline::METAL_GRAPH_ERRORS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        self.clear_sequence_state();
        self.graph_logits = None;
        self.graph_failed
            .store(true, std::sync::atomic::Ordering::Relaxed);
        self.cancel
            .store(true, std::sync::atomic::Ordering::Relaxed);
        tracing::error!("native Metal TokenGraph failed closed: {reason}");
    }

    /// Start an NLL/PPL request with all graph side channels in a known
    /// state.  A graph failure also raises the cooperative cancel bit; it is
    /// consumed here and that graph-induced bit is cleared so an independent
    /// request can be reused.  A caller-owned cancellation remains intact.
    fn nll_begin(&mut self) -> Result<(), String> {
        if self
            .graph_failed
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            self.cancel
                .store(false, std::sync::atomic::Ordering::Relaxed);
            self.clear_sequence_state();
            self.graph_logits = None;
            self.graph_want_logits = false;
            self.graph_head_required = false;
            return Err("GPU graph failed before NLL scoring".to_string());
        }
        self.clear_sequence_state();
        self.graph_logits = None;
        self.graph_want_logits = false;
        self.graph_head_required = false;
        Ok(())
    }

    /// End an NLL/PPL request, including the side channels that are not part
    /// of the host KV cache.  This is intentionally explicit instead of
    /// relying on a tuple/sentinel return: callers must see every failure.
    fn nll_end(&mut self) {
        self.clear_sequence_state();
        self.graph_logits = None;
        self.graph_want_logits = false;
        self.graph_head_required = false;
        self.graph_failed
            .store(false, std::sync::atomic::Ordering::Relaxed);
    }

    /// Check the graph failure channel at a scoring boundary and leave the
    /// pipeline reusable when the device path failed.
    fn nll_check_graph(&mut self, phase: &str, pos: usize) -> Result<(), String> {
        #[cfg(test)]
        if self.nll_test_fail_at == Some(pos) {
            self.nll_test_fail_at = None;
            self.graph_failed
                .store(true, std::sync::atomic::Ordering::Relaxed);
            self.cancel
                .store(true, std::sync::atomic::Ordering::Relaxed);
        }
        if self
            .graph_failed
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            self.cancel
                .store(false, std::sync::atomic::Ordering::Relaxed);
            self.clear_sequence_state();
            self.graph_logits = None;
            self.graph_want_logits = false;
            return Err(format!(
                "GPU graph failed during NLL {phase} at position {pos}"
            ));
        }
        Ok(())
    }

    /// Map a virtual layer index to its physical weight index.
    /// Looped Transformer (Nanbeige 4.2): 22 physical layers × 2 loops = 44 virtual;
    /// virtual layer 23 maps back to physical layer 1 (23 % 22 = 1).
    #[inline]
    pub fn phys_layer(&self, virtual_idx: usize) -> usize {
        match &self.layer_map {
            Some(m) => m[virtual_idx],
            None => virtual_idx % self.physical_layers,
        }
    }

    /// Mage-VL (`llava_onevision2`) and MiniCPM-OCR prompt ingest through the batched wgpu
    /// graph (`CMF_GRAPH_PREFILL=0` keeps the chunked host prefill).
    fn onevision2_prefill(&self) -> bool {
        self.model.as_ref().is_some_and(|m| matches!(m.header.arch.arch_name.as_str(), "llava_onevision2" | "minicpm_ocr"))
            && std::env::var("CMF_GRAPH_PREFILL").as_deref() != Ok("0")
    }

    /// SenseNova-Loop: whether virtual layer `li` runs inside the mHC
    /// streams (the device graphs decline such layers).
    #[inline]
    pub fn mhc_layer(&self, li: usize) -> bool {
        self.mhc.as_ref().is_some_and(|m| m.on(self.phys_layer(li)))
    }

    /// mHC before a sub-layer of the decode token: route its streams into
    /// `h` (entering the range copies `h` into every stream first).
    fn mhc_pre(&mut self, li: usize, ffn: bool, h: &mut [f32]) -> crate::sensenova::MhcCoef {
        let p = self.phys_layer(li);
        let m = self.mhc.as_deref().expect("mhc layer");
        let n = m.s.streams * m.dim;
        if self.mhc_r.len() != n {
            self.mhc_r.resize(n, 0.0);
        }
        if !ffn && m.enters(p) {
            m.enter(&mut self.mhc_r, h);
        }
        m.route(p, ffn, &self.mhc_r, h)
    }

    /// mHC after a sub-layer: fold its output `y` into the streams; after
    /// the range's last FFN, `h` becomes the streams' mean.
    fn mhc_post(&mut self, li: usize, ffn: bool, y: &[f32], c: &crate::sensenova::MhcCoef, h: &mut [f32]) {
        let p = self.phys_layer(li);
        let m = self.mhc.as_deref().expect("mhc layer");
        m.merge(&mut self.mhc_r, y, c);
        if ffn && m.leaves(p) {
            m.leave(&self.mhc_r, h);
        }
    }

    /// True when `virtual_idx` is the last layer of a loop iteration
    /// (used for loop_final_norm insertion).
    #[inline]
    pub fn is_loop_end(&self, virtual_idx: usize) -> bool {
        self.loop_final_norm && (virtual_idx + 1) % self.physical_layers == 0
    }

    /// Build a pipeline from parts (used by the loader and tests).
    #[allow(clippy::too_many_arguments)]

    /// Whole-block q1 token graph on the GPU (macOS/Metal): the run of
    /// consecutive q1 layers — GDN *and* full attention — starting at
    /// `start` executes as few command buffers as the CPU truly needs.
    /// Hidden stays device-resident across every layer; the only syncs
    /// are before each CPU attend (it needs q/k/v and owns the KV
    /// cache) and the final hidden readback. Recurrent states
    /// round-trip through shared memory (the CPU stays their owner, so
    /// every other path remains coherent). Returns the first layer
    /// index NOT covered (== `start` → refused, caller falls through
    /// to the per-layer CPU path).
    /// Should prefill run position-by-position through the GPU token
    /// graph instead of the batched CPU chunk-GEMM? True for q1 GDN
    /// hybrids on native Metal: their chunk prefill is walled by the
    /// sequential scalar recurrence, so the graph's decode rate wins.
    /// NOT for Looped Transformers, despite the per-chunk loop_final_norm
    /// sync: the chunk-GEMM amortizes each weight over the whole chunk,
    /// which the per-position graph cannot (Nanbeige 4.2 on M4, 512-token
    /// prompt: 85 tok/s chunked vs 14 through the graph).
    #[cfg(target_os = "macos")]
    fn graph_prefill_preferred(&self) -> bool {
        // The resident Embryo graph owns the phase state and the anchor KV on
        // the device: the prompt must seed them there (wgpu over Metal).
        if crate::gpu::enabled_here()
            && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode)
            && matches!(std::env::var("CMF_EMBRYO_RESIDENT").as_deref(), Ok("1") | Ok("parallel"))
            && self.embryo_resident_eligible()
        {
            return true;
        }
        let graph_force = crate::gpu::q1_force() || crate::gpu::q2tp_gpu_opt_in();
        if !crate::gpu::enabled_here()
            || !graph_force
            || std::env::var("CMF_GPU_BLOCK")
                .map(|v| v == "0")
                .unwrap_or(false)
            // CMF_PREFILL_GRAPH=0: the chunked prefill (GEMM projections,
            // CPU recurrence) instead of the per-position token graph.
            || std::env::var("CMF_PREFILL_GRAPH").as_deref() == Ok("0")
        {
            return false;
        }
        self.weights
            .layers
            .iter()
            .any(|lw| {
                matches!(&lw.attn, AttnKind::LinearGdn(w) if w.in_proj_qkv.metal_graph_parts().is_some())
            })
    }

    /// Prompt ingest through the batched wgpu graph in device-prefix mode:
    /// a MoE stack that does not fit the card runs each chunk's leading
    /// layers on the device (experts resident) and the rest on the host's
    /// batched walk. On by default for models with per-layer attention
    /// geometry (MiMo-V2 — its measured default); `CMF_BATCH_PREFIX=1`
    /// opts any other MoE model in, `=0` keeps the chunked host prefill.
    #[cfg(not(target_os = "macos"))]
    fn batch_prefix_prefill(&self) -> bool {
        let forced = match std::env::var("CMF_BATCH_PREFIX").as_deref() {
            Ok("0") => return false,
            Ok("1") => true,
            _ => false,
        };
        crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill)
            && crate::gpu::enabled_here()
            && !self.graph_refused()
            && (forced || self.graph_attn_decline_reason().is_some())
            && self.wgpu_graph_attn_decline().is_none()
            && self.attn_softcap == 0.0
            && self
                .weights
                .layers
                .iter()
                .any(|lw| matches!(&lw.ffn, FfnKind::Moe(_)))
            && self.automatic_gpu_prefix().is_some()
    }

    /// Gemma-4's prompt through the batched wgpu graph (`gemma_batch`): a
    /// dense stack wholly on a discrete card, whose token graph already
    /// decodes it. Not `graph_prefill_preferred` — the host stays the KV
    /// owner for reuse and scoring; only generation's ingest changes.
    /// `CMF_G4_BATCH=0` keeps the chunked host prefill.
    fn g4_batch_prefill(&self) -> bool {
        #[cfg(target_os = "macos")]
        {
            false
        }
        #[cfg(not(target_os = "macos"))]
        {
            // An EMPTY layer stack (`all()` is vacuously true) plus a
            // gemma4 geometry flag is exactly the gemma-4 E-series
            // per-token stack — it has no batch graph rows to ingest.
            !self.weights.layers.is_empty()
                && !self.per_token_stack()
                // Gemma-4, and Ripple: a dense stack with per-layer geometry
                // whose host walk attends 80 heads a row on the CPU.
                && (self.global_attn.is_some() || self.attn_v_norm || self.value_blend.is_some())
                && crate::gpu::g4_batch_on()
                && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill)
                && crate::gpu::enabled_here()
                && crate::gpu::discrete()
                && !self.graph_refused()
                && !self.o1_active()
                && self.attn_softcap == 0.0
                && self.wgpu_graph_attn_decline().is_none()
                && self.weights.layers.iter().all(|lw| {
                    matches!(lw.attn, AttnKind::Full { .. }) && matches!(lw.ffn, FfnKind::Dense(_))
                })
                && self.automatic_gpu_prefix().is_none()
        }
    }

    /// Gemma-4's batched prefill of `ids` at positions `pos0..`
    /// (`g4_batch_prefill`): chunks of `generation_batch_k` rows through the
    /// batch graph. Ok((n, rows)): `n` positions ingested; `rows` = the last
    /// one's hidden, or every row's (`keep_all`). A refusal stops early
    /// (n < ids.len()) after pulling the device rows the host walk needs.
    /// Err: a failure after admission — the device state is undefined.
    #[cfg(not(target_os = "macos"))]
    fn g4_batch_ingest(
        &mut self,
        ids: &[u32],
        pos0: usize,
        keep_all: bool,
    ) -> Result<(usize, Vec<f32>), String> {
        let hs = self.hidden_size;
        let chunk = self.generation_batch_k().max(1);
        let end_all = pos0 + ids.len();
        let mut pos = pos0;
        let mut out = Vec::new();
        while pos < end_all && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
            let end = (pos + chunk).min(end_all);
            let bk = end - pos;
            let mut hiddens = vec![0f32; bk * hs];
            for (j, &id) in ids[pos - pos0..end - pos0].iter().enumerate() {
                hiddens[j * hs..(j + 1) * hs].copy_from_slice(&self.embed_single(id));
            }
            let positions: Vec<usize> = (pos..end).collect();
            let t_chunk = std::time::Instant::now();
            let outcome = self.try_batch_graph_wgpu(&mut hiddens, &positions, bk, None);
            if std::env::var("CMF_GRAPH_PROF").is_ok() {
                let ms = t_chunk.elapsed().as_secs_f64() * 1000.0;
                eprintln!(
                    "batch-chunk: phase=prompt mode=gemma4 k={bk} outcome={outcome:?} {ms:.1} ms ({:.1} tok/s)",
                    bk as f64 / (ms / 1000.0)
                );
            }
            match outcome {
                crate::gpu::BatchGraphOutcome::Completed => {
                    if keep_all {
                        out.extend_from_slice(&hiddens);
                    } else {
                        out = hiddens[(bk - 1) * hs..].to_vec();
                    }
                    pos = end;
                }
                crate::gpu::BatchGraphOutcome::Failed => {
                    return Err("Gemma-4 batched prefill failed after admission".into());
                }
                crate::gpu::BatchGraphOutcome::Declined => {
                    #[cfg(feature = "gpu")]
                    if pos > pos0 {
                        self.pull_lagging_host_kv(0, self.num_layers, pos);
                    }
                    break;
                }
            }
        }
        Ok((pos - pos0, out))
    }

    /// Hidden rows of every position of `ids` through Gemma-4's batched
    /// prefill from a fresh sequence (the prefill's teacher-forced logits
    /// for parity gates: `logits_from_hidden` per row). None when the model
    /// or the card does not take that route, or it refused part way.
    pub fn g4_prefill_hidden_rows(&mut self, ids: &[u32]) -> Option<Vec<f32>> {
        #[cfg(not(target_os = "macos"))]
        {
            if ids.is_empty() || !self.g4_batch_prefill() {
                return None;
            }
            self.clear_sequence_state();
            match self.g4_batch_ingest(ids, 0, true) {
                Ok((n, rows)) if n == ids.len() => Some(rows),
                _ => {
                    self.clear_sequence_state();
                    None
                }
            }
        }
        #[cfg(target_os = "macos")]
        {
            let _ = ids;
            None
        }
    }

    #[cfg(not(target_os = "macos"))]
    fn graph_prefill_preferred(&self) -> bool {
        // Discrete-GPU wgpu whole-token graph: GDN layers carry recurrent state
        // (conv ring + delta-rule S) resident on the GPU. A batched CPU prefill
        // builds that state on the CPU only, leaving the GPU buffers zeroed at
        // decode → garbage. Route GDN-hybrid prefill through the graph one
        // position at a time so the resident state is seeded exactly as decode
        // will read it. Fully resident pure-attention models take the batched
        // graph as well (see the end of this function).
        let graph_on = crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill);
        if !graph_on || !crate::gpu::enabled_here() {
            return false;
        }
        // Embryo's phase state is device-owned by the resident graph during
        // prefill; the batched CPU path would leave decode seeing a zeroed
        // device recurrence.  Route the prompt position-by-position too.
        if self.embryo_resident_eligible() {
            // The resident graph owns the phase state and anchor KV on the
            // device.  A prefill-only graph would leave decode on the host
            // with no way to import that state, so keep the whole sequence
            // on one owner (or use the ordinary CPU prefill/decode pair).
            return crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode);
        }
        // The descriptor-aware Prism graph now carries both the FWHT/affine
        // transforms and resident GDN state, so it is also the exact prefill
        // path for this model.  Keeping it here (rather than falling through
        // to the CPU chunk walk) is required for a long prompt to seed the
        // same device state that decode consumes.
        // O(1) needs the CPU prefill: the q-trace that seals the Nyström
        // skeleton is recorded there and nowhere else. The GDN half of
        // the hybrid loses nothing — the graph's first decode creates
        // its (ring, S) entries seeded from `cpu_state`, the same
        // handoff every graph run relies on when the entry is fresh.
        // Without this line the two designs collide on hybrids and o1
        // never becomes graph-portable: prefill through the graph
        // records no trace, so views stay None forever.
        if self.o1_active() {
            return false;
        }
        // A model the wgpu graphs decline outright would walk its prompt
        // one position at a time through a graph that never runs: the
        // batched CPU chunk prefill is the right ingest for it.
        if self.wgpu_graph_attn_decline().is_some() {
            return false;
        }
        if self
            .weights
            .layers
            .iter()
            .any(|lw| matches!(&lw.attn, AttnKind::LinearGdn(_)))
            // Mage-VL: its screenshot prompts (~2k rows) go through the
            // batched graph, 4× the chunked host ingest on an A40 (2048
            // tokens: 806 tok/s at 128 rows, 893 at 256, against 196).
            || self.onevision2_prefill()
        {
            return true;
        }
        // MoE models too: the chunked CPU prefill runs every expert on the
        // host (Hy-MT2-30B-A3B on a Xeon: 8 tok/s of ingest against 53 of
        // graph decode), while the token graph — and the batched graph under
        // CMF_BATCH_K — keep the experts resident. Full attention in the
        // graph writes the KV mirror that decode reads, exactly as it does
        // for the hybrids' attention layers. Only when the whole stack is
        // resident: with a device prefix the per-position walk finishes
        // every token on the host, and the chunked prefill (GEMMs on the
        // card, the expert loop batched on the host) is the faster ingest
        // (the 8 GB ladder point: 7 tok/s chunked against ~1 walked).
        // Dense stacks too: the chunked walk paid a submit, a wait and a
        // readback per projection and per attend, so a resident 2B read its
        // prompt at the host's pace (CherryPit-1.2-2B on an RTX 5090, 2048
        // tokens: 10.6 s chunked, 1.2 s through the batched graph, the same
        // greedy text). `CMF_DENSE_GRAPH_PREFILL=0` keeps the chunked walk.
        // A dense stack the batched graph declined once (Spark-X2.6) keeps the
        // chunked walk: the per-position graph read its prompt at decode pace,
        // 65 tok/s against 350 on an RTX 2000 Ada.
        (self
            .weights
            .layers
            .iter()
            .any(|lw| matches!(&lw.ffn, FfnKind::Moe(_)))
            || (std::env::var("CMF_DENSE_GRAPH_PREFILL").as_deref() != Ok("0")
                && !self.dense_batch_declined.load(std::sync::atomic::Ordering::Relaxed)
                // Sliding-window stacks take the graph where its whole-run
                // attend is tiled: Spark-X2.6 q4tp on an RTX 2000 Ada,
                // 16 000 tokens, 182 tok/s chunked, 135 through the per-token
                // batched arm, 390+ tiled. `CMF_DENSE_GRAPH_PREFILL=1` sends
                // them through the graph regardless.
                && ((self.sliding_layers.is_none() && self.swa.is_none())
                    || crate::gpu::batched_attend_tiled()
                    || std::env::var("CMF_DENSE_GRAPH_PREFILL").as_deref() == Ok("1"))))
            && self.automatic_gpu_prefix().is_none()
    }

    #[cfg(target_os = "macos")]
    fn q1_graph_gpu(
        &mut self,
        start: usize,
        upto: Option<usize>,
        position: usize,
        h: &mut [f32],
    ) -> usize {
        let _mt0 = std::time::Instant::now(); // CMF_METAL_HOSTPROF
        use crate::gpu::{
            AttnGpuLayer, GdnGpuCfg, GdnGpuLayer, GraphDims, MetalFfn, SconvGpuLayer, TokenGraph,
        };
        const MOE_WORKING_SET_REASON: &str =
            "model weights exceed Metal working set for native MoE graph";
        // A prior admission check rejected this pipeline. Avoid rebuilding the
        // entire 40-layer graph plan at every individual host layer after the
        // fallback begins; the per-operation path below stays eligible.
        if self
            .graph_declines
            .borrow()
            .iter()
            .any(|&(site, reason)| site == "metal block graph" && reason == MOE_WORKING_SET_REASON)
        {
            return start;
        }
        let graph_force = crate::gpu::q1_force() || crate::gpu::q2tp_gpu_opt_in();
        if self.attn_softcap > 0.0 // capped scores: no graph kernel — CPU path
            // V with rows of its own (Ripple's value residual): no Metal kernel blends them.
            || self.value_blend.is_some()
            || !self.metal_rope_scale_ok()
            || !crate::gpu::enabled_here()
            || !graph_force
            || std::env::var("CMF_GPU_BLOCK")
                .map(|v| v == "0")
                .unwrap_or(false)
        {
            if std::env::var("CMF_GRAPH_DBG").is_ok() {
                eprintln!(
                    "block-graph: front gate (softcap={} enabled_here={} graph_force={})",
                    self.attn_softcap > 0.0,
                    crate::gpu::enabled_here(),
                    graph_force,
                );
            }
            if self.graph_head_required {
                self.fail_metal_graph("native graph front gate refused");
            }
            return start;
        }
        // The graph encodes SiLU or exact-GELU FFNs and attention with an
        // explicit model scale. Sliding-window layers with their own RoPE
        // table / rotary width ride it too (`metal_graph_swa`): both the
        // device attend and the sandwich's CPU attend read each layer's
        // window and table. Sandwich norms and other activations fall back
        // to the CPU path.
        // Gemma-4 (`metal_gemma4`): its sliding layers ride the same door,
        // its global layers, V norm, sandwich norms, layer scalar and
        // tanh-GELU the `gpu_metal::gemma4` kernels.
        let gemma4 = self.metal_gemma4();
        let swa_graph = self.metal_graph_swa() || gemma4;
        // The normal native GQA kernel carries a learned, value-less
        // softmax column.  It also takes the exact per-layer sliding
        // window, but its split-K twin has no sink column.  Thus a
        // sink-bearing model may use this door only when the ordinary
        // sliding geometry has passed `metal_graph_swa` (or when it has no
        // sliding layers at all).
        let graph_attn_reason = self.graph_attn_decline_reason();
        let native_sink_attend = graph_attn_reason == Some("learned attention sinks")
            && (swa_graph || (self.swa.is_none() && self.sliding_layers.is_none()));
        // Plain-weight (x̂·w) sandwich norms (LFM3) take the generic norm
        // kernels, as on the wgpu graph; Gemma-2/3's (1+w) norms and the
        // layer scalar stay Gemma-4's.
        let plain_norms = self.norm_style == cortiq_core::NormStyle::Qwen;
        if (self.swa.is_some() && !swa_graph)
            || (self.global_attn.is_some() && !gemma4)
            || self.attention_heads_per_layer.is_some()
            || (self.attn_v_norm && !gemma4)
            // Per-layer KV heads / narrow V stay outside this graph.  A
            // learned sink is admitted only through native_sink_attend.
            || (graph_attn_reason.is_some() && !swa_graph && !native_sink_attend)
            || self.weights.layers.iter().any(|lw| {
                ((lw.layer_scale.is_some()
                    || (!plain_norms && (lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some())))
                    && !gemma4)
                    || matches!(&lw.ffn, FfnKind::Dense(d)
                        if !(matches!(d.act, Act::Silu | Act::Gelu)
                            || (gemma4 && d.act == Act::GeluTanh)))
            })
        {
            // The Metal graphs' device attend has no per-layer attention
            // geometry (the wgpu graphs do): say so once, by name.
            if let Some(reason) = graph_attn_reason.filter(|_| !swa_graph && !native_sink_attend) {
                self.note_graph_decline("metal block graph", reason);
            }
            if std::env::var("CMF_GRAPH_DBG").is_ok() {
                eprintln!(
                    "block-graph: arch ineligible (swa={} gattn={} hpl={} vnorm={} scale_delta={:.2e})",
                    self.swa.is_some(),
                    self.global_attn.is_some(),
                    self.attention_heads_per_layer.is_some(),
                    self.attn_v_norm,
                    (self.attn_scale - 1.0 / (self.head_dim as f32).sqrt()).abs(),
                );
            }
            if self.graph_head_required {
                self.fail_metal_graph("native graph architecture gate refused");
            }
            return start;
        }
        // Looped Transformer: the graph covers ALL loop iterations;
        // encode_loop_norm is inserted on-device at each boundary.
        let limit = upto
            .map(|u| u + 1)
            .unwrap_or(self.num_layers)
            .min(self.num_layers);

        enum Item<'a> {
            Gdn {
                run: Vec<GdnGpuLayer<'a>>,
                first: usize,
            },
            /// A run of LFM2/LFM3 short-conv layers (conv ring on device).
            Sconv {
                run: Vec<SconvGpuLayer<'a>>,
                first: usize,
            },
            Attn {
                l: AttnGpuLayer<'a>,
                li: usize,
                q_norm: Option<&'a [f32]>,
                k_norm: Option<&'a [f32]>,
                output_gate: bool,
                /// `self_attn.g_proj` output gate (per-head flag): the
                /// sandwich projects the device-normed input on the host
                /// and gates the attend's output before O.
                proj_gate: Option<(&'a QTensor, bool)>,
                /// The same gate's f32 rows `[nh × hidden]` when the device
                /// attend can apply it (per-head sigmoid, f32 in RAM).
                head_gate_w: Option<&'a [f32]>,
                bias: Option<(&'a [f32], &'a [f32], &'a [f32])>,
                /// Attend on the device too (no sync): F32 KV, no
                /// o1/bias, dims inside the kernels' contract.
                full_gpu: bool,
            },
        }

        // Device-attend KERNEL contract, shared by every Full layer. The
        // hd>128 default-off POLICY is applied after the scan: it was
        // measured on dense models, and a MoE plan inverts it — with the
        // experts on device each CPU-attend sandwich costs a
        // commit+wait, ~30 submits/token (W2 on M4: 14.7 tok/s
        // sandwiched vs 27.1 device-attend vs 18.8 pure CPU).
        let attend_mode = std::env::var("CMF_GPU_ATTEND").unwrap_or_else(|_| "auto".into());
        let attend_contract = attend_mode != "0"
            && attend_mode != "off"
            && self.head_dim % 4 == 0
            && self.head_dim <= 256
            // Flint has explicit no-RoPE layers.  The device RoPE kernel
            // accepts rd=0 (zero rotation lanes) and binds a sentinel table;
            // retain the historical lane-pair requirement for nonzero rd.
            && (self.rotary_dim == 0
                || (self.rotary_dim >= 2
                    && self.rotary_dim <= self.head_dim
                    && (self.rotary_dim / 2) % 32 == 0))
            && self.num_kv_heads > 0
            && self.num_heads % self.num_kv_heads == 0;

        let mut plan: Vec<Item> = Vec::new();
        let mut model_ref: Option<std::sync::Arc<cortiq_core::CmfModel>> = None;
        // Break-reason diagnostics ride the same env as the plan summary.
        let block_diag = std::env::var("CMF_GRAPH_DBG").is_ok();
        let mut scan = start;
        while scan < limit {
            // SenseNova-Loop: MRoPE prompt rows rotate on the host; an mHC
            // layer rides the graph when its kernels compiled (two streams,
            // dense FFN, device attend — checked below).
            if self.prompt_mrope.is_some()
                || (self.mhc_layer(scan)
                    && (!crate::gpu_metal::mhc::available()
                        || std::env::var("CMF_MHC_GRAPH").as_deref() == Ok("0")
                        || self.mhc.as_ref().is_some_and(|m| m.s.streams != 2 || m.s.fixed_identity)
                        || !matches!(self.weights.layers[self.phys_layer(scan)].ffn, FfnKind::Dense(_))))
            {
                break;
            }
            let lw = &self.weights.layers[self.phys_layer(scan)];
            let ffn = match &lw.ffn {
                FfnKind::Dense(d) if d.segs.is_empty() => {
                    let (Some(g), Some(u), Some(dn)) = (
                        d.gate_proj.metal_graph_parts(),
                        d.up_proj.metal_graph_parts(),
                        d.down_proj.metal_graph_parts(),
                    ) else {
                        if block_diag {
                            eprintln!(
                                "block-graph: L{scan} FFN trio not graph-mappable — run ends"
                            );
                        }
                        break;
                    };
                    MetalFfn::Dense {
                        gate: g,
                        up: u,
                        down: dn,
                        // The front gate admitted SiLU, exact GELU and
                        // (Gemma-4) tanh-GELU only.
                        act: d.act.graph_act().map_or(0, |a| a.code() as u8),
                    }
                }
                FfnKind::Moe(m) => {
                    // Flint's detached Q4 shared expert is intentionally
                    // tried before the generic uniform-bank graph builder.
                    // The latter correctly refuses its ragged Q2/Q4 widths;
                    // this narrow descriptor keeps the router and selected
                    // routed experts device-resident inside a bounded page.
                    let ffn = if let Some(flint) = metal_flint_moe_graph_parts(m, self.hidden_size, scan)
                    {
                        MetalFfn::FlintMoe(flint)
                    } else if let Some(moe) = metal_moe_graph_parts(m, self.hidden_size) {
                        MetalFfn::Moe(moe)
                    } else {
                        if block_diag {
                            eprintln!(
                                "block-graph: L{scan} MoE outside the graph contract — run ends"
                            );
                        }
                        break;
                    };
                    if let QTensor::Mapped { model, .. } = &m.experts[0].gate_proj {
                        model_ref.get_or_insert_with(|| model.clone());
                    }
                    ffn
                }
                _ => {
                    if block_diag {
                        eprintln!("block-graph: L{scan} non-graph FFN — run ends");
                    }
                    break;
                }
            };
            match &lw.attn {
                AttnKind::LinearGdn(w) if self.gdn_cfg.is_some() => {
                    let parts = (
                        w.in_proj_qkv.metal_graph_parts(),
                        w.in_proj_z.metal_graph_parts(),
                        w.in_proj_a.f32_parts(),
                        w.in_proj_b.f32_parts(),
                        w.out_proj.metal_graph_parts(),
                    );
                    let (Some(qkv), Some(z), Some(a), Some(b), Some(out)) = parts else {
                        if block_diag {
                            eprintln!(
                                "block-graph: L{scan} GDN parts refused (qkv={} z={} a_f32={} b_f32={} out={})",
                                w.in_proj_qkv.metal_graph_parts().is_some(),
                                w.in_proj_z.metal_graph_parts().is_some(),
                                w.in_proj_a.f32_parts().is_some(),
                                w.in_proj_b.f32_parts().is_some(),
                                w.out_proj.metal_graph_parts().is_some(),
                            );
                        }
                        break;
                    };
                    if let QTensor::Mapped { model, .. } = &w.in_proj_qkv {
                        model_ref.get_or_insert_with(|| model.clone());
                    }
                    let gl = GdnGpuLayer {
                        mhc: crate::sensenova::graph_mhc(self.mhc.as_deref(), self.phys_layer(scan)),
                        attn_norm: &lw.input_norm,
                        post_norm: &lw.post_norm,
                        qkv,
                        z,
                        a,
                        b,
                        out,
                        ffn,
                        conv1d: &w.conv1d,
                        a_log: &w.a_log,
                        dt_bias: &w.dt_bias,
                        gnorm: &w.norm,
                    };
                    // a run ends at a layer a DFlash drafter reads: its output is kept there
                    let cut = scan > 0 && self.dflash.as_ref().is_some_and(|d| d.g.taps.contains(&(scan - 1)));
                    match plan.last_mut() {
                        Some(Item::Gdn { run, .. }) if !cut => run.push(gl),
                        _ => plan.push(Item::Gdn {
                            run: vec![gl],
                            first: scan,
                        }),
                    }
                }
                AttnKind::ShortConv(w) if self.short_conv_cfg.is_some() => {
                    let (Some(inp), Some(out)) =
                        (w.in_proj.metal_graph_parts(), w.out_proj.metal_graph_parts())
                    else {
                        if block_diag {
                            eprintln!("block-graph: L{scan} short-conv parts refused");
                        }
                        break;
                    };
                    if let QTensor::Mapped { model, .. } = &w.in_proj {
                        model_ref.get_or_insert_with(|| model.clone());
                    }
                    let sl = SconvGpuLayer {
                        attn_norm: &lw.input_norm,
                        post_norm: &lw.post_norm,
                        in_proj: inp,
                        taps: &w.conv,
                        out,
                        attn_out_norm: lw.attn_out_norm.as_deref(),
                        ffn_out_norm: lw.ffn_out_norm.as_deref(),
                        ffn,
                    };
                    match plan.last_mut() {
                        Some(Item::Sconv { run, .. }) => run.push(sl),
                        _ => plan.push(Item::Sconv {
                            run: vec![sl],
                            first: scan,
                        }),
                    }
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } if (!self.kv_cache.layers[scan].o1_sealed()
                    // Sealed o1 stays plannable when the Metal o1 port
                    // is on: full_gpu attends through the device state,
                    // and any refusal falls to the sandwich, whose CPU
                    // core routes sealed layers through the nystrom step.
                    || std::env::var("CMF_O1_METAL").as_deref() == Ok("1")
                    || self.o1_on_graph())
                    // A projected output gate: Spark-X2.5's per-head
                    // sigmoid form only (Laguna's softplus gate is
                    // unmeasured on these paths and keeps the CPU walk).
                    && softplus_gate
                        .as_ref()
                        .is_none_or(|(_, per_head)| *per_head && self.proj_gate_sigmoid) =>
                {
                    let parts = (
                        wq.metal_graph_parts(),
                        wk.metal_graph_parts(),
                        wv.metal_graph_parts(),
                        wo.metal_graph_parts(),
                    );
                    let (Some(pq), Some(pk), Some(pv), Some(po)) = parts else {
                        break;
                    };
                    if let QTensor::Mapped { model, .. } = wq {
                        model_ref.get_or_insert_with(|| model.clone());
                    }
                    let cache = &self.kv_cache.layers[scan];
                    // O(1) layer on Metal: the device attends through the
                    // sealed Nystrom state (opt-in while the port proves
                    // itself). Unsealed -> sandwich path = the CPU o1 step.
                    let o1_metal = cache.o1.is_some()
                        && (std::env::var("CMF_O1_METAL").as_deref() == Ok("1") || self.o1_on_graph())
                        && cache.o1_views().is_some();
                    // The device attend takes the layer's window and RoPE
                    // table, and the per-head gate from f32 rows; a gate
                    // held otherwise sandwiches.
                    let head_gate_w = softplus_gate
                        .as_ref()
                        .and_then(|(g, _)| g.f32_parts())
                        .filter(|&(_, r, c)| r == self.num_heads && c == self.hidden_size)
                        .map(|(d, _, _)| d);
                    // Gemma-4's global layers are 512 wide over one KV head
                    // (the `gemma4` 16-slot kernels, `CMF_METAL_GEMMA4_W16`).
                    let (nkv_g, hd_g) = if gemma4 {
                        let (a, b, _) = self.layer_geom(scan);
                        (a, b)
                    } else {
                        (self.num_kv_heads, self.head_dim)
                    };
                    let full_gpu = attend_contract
                        && softplus_gate.is_none() == head_gate_w.is_none()
                        && cache.mode == crate::kv_cache::KvMode::F32
                        && (cache.o1.is_none() || o1_metal)
                        && bias.is_none()
                        && (hd_g <= 256 || crate::gpu_metal::gemma4::w16_on())
                        && pq.1 == self.num_heads * hd_g * (1 + *output_gate as usize)
                        && pk.1 == nkv_g * hd_g
                        && pv.1 == nkv_g * hd_g
                        && po.2 == self.num_heads * hd_g;
                    // An mHC layer needs the device attend (the CPU-attend
                    // sandwich has no stream hand-off), and so does a DASH
                    // layer: its router state lives on the device.
                    if !full_gpu && (self.mhc_layer(scan) || self.dash.is_some()) {
                        break;
                    }
                    plan.push(Item::Attn {
                        l: AttnGpuLayer {
                            mhc: crate::sensenova::graph_mhc(self.mhc.as_deref(), self.phys_layer(scan)),
                            attn_norm: &lw.input_norm,
                            post_norm: &lw.post_norm,
                            wq: pq,
                            wk: pk,
                            wv: pv,
                            wo: po,
                            ffn,
                            attn_out_norm: lw.attn_out_norm.as_deref(),
                            ffn_out_norm: lw.ffn_out_norm.as_deref(),
                            layer_scale: lw.layer_scale,
                        },
                        li: scan,
                        q_norm: q_norm.as_deref(),
                        k_norm: k_norm.as_deref(),
                        output_gate: *output_gate,
                        proj_gate: softplus_gate.as_ref().map(|(g, per_head)| (g, *per_head)),
                        head_gate_w,
                        bias: bias
                            .as_ref()
                            .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                        full_gpu,
                    });
                }
                _ => break,
            }
            scan += 1;
        }
        // SenseNova-Loop: the mHC streams live on the device only inside one
        // graph, so a graph may neither enter a range midway nor stop
        // inside one (the host walks such a stretch with its own streams).
        if let Some(m) = self.mhc.as_deref() {
            let inside = |li: usize| m.on(self.phys_layer(li));
            let starts_mid = inside(start) && !m.enters(self.phys_layer(start));
            let stops_mid = scan > start && inside(scan - 1) && !m.leaves(self.phys_layer(scan - 1));
            if starts_mid || stops_mid {
                if std::env::var("CMF_GRAPH_DBG").is_ok() {
                    eprintln!("q1-graph: [{start}, {scan}) would split an mHC range — host path");
                }
                return start;
            }
        }
        // Unlimited-OCR: all of it or none of it, the host's router state and
        // the device's are not interchangeable (`CMF_GPU=wgpu` keeps the host's).
        if self.dash.is_some()
            && (start != 0 || scan != self.num_layers || crate::gpu::backend_name() != "metal")
        {
            return start;
        }
        let Some(model) = model_ref else {
            if std::env::var("CMF_GRAPH_DBG").is_ok() {
                eprintln!("q1-graph: no model ref (start {start}, scanned to {scan})");
            }
            if self.graph_head_required {
                self.fail_metal_graph("native graph has no mapped model reference");
            }
            return start;
        };
        if plan.is_empty() {
            if std::env::var("CMF_GRAPH_DBG").is_ok() {
                eprintln!("q1-graph: empty plan at layer {start}");
            }
            if self.graph_head_required {
                self.fail_metal_graph("native graph plan is empty");
            }
            return start;
        }
        let has_moe = plan.iter().any(|it| match it {
            Item::Gdn { run, .. } => run
                .iter()
                .any(|l| matches!(l.ffn, MetalFfn::Moe(_) | MetalFfn::FlintMoe(_))),
            Item::Sconv { run, .. } => run
                .iter()
                .any(|l| matches!(l.ffn, MetalFfn::Moe(_) | MetalFfn::FlintMoe(_))),
            Item::Attn { l, .. } => matches!(l.ffn, MetalFfn::Moe(_) | MetalFfn::FlintMoe(_)),
        });
        let has_flint_moe = plan.iter().any(|it| match it {
            Item::Gdn { run, .. } => run.iter().any(|l| matches!(l.ffn, MetalFfn::FlintMoe(_))),
            Item::Sconv { run, .. } => run.iter().any(|l| matches!(l.ffn, MetalFfn::FlintMoe(_))),
            Item::Attn { l, .. } => matches!(l.ffn, MetalFfn::FlintMoe(_)),
        });
        let metal_working_set = crate::gpu_metal::working_set_bytes();
        let metal_max_buffer = crate::gpu_metal::max_buffer_bytes();
        let model_bytes = model.primary_bytes().len() as u64;
        // Flint q2 can sit below recommendedMaxWorkingSetSize on a 24 GB
        // M4 yet still exceed maxBufferLength. In that case a normal graph
        // would manufacture overlapping whole-file WeightArena windows;
        // treat it as the same bounded-page requirement rather than letting
        // the generic graph reintroduce broad residency.
        let needs_bounded_pager = (metal_working_set != 0 && model_bytes > metal_working_set)
            || (metal_max_buffer != 0 && model_bytes > metal_max_buffer);
        // An oversized MoE mmap normally has to decline: the jobs kernels
        // bind all WeightArena windows.  The opt-in pager takes a different,
        // bounded route: a *complete sequence of logical layers* is put in
        // one transient no-copy page, graph-finished, dropped, then the outer
        // layer loop calls us again for the next page.  That preserves exact
        // hidden/GDN/KV handoff while replacing ~40 host-routed expert waits
        // with a few page-boundary syncs.  Never use it for a fused-head NLL
        // request: that contract explicitly requires a single whole graph.
        let pager_cap = if !has_moe {
            None
        } else if has_flint_moe {
            // Do not let generic `CMF_METAL_MOE_PAGER` turn the experimental
            // full-bank Flint graph on. Its direct selected-view pager stays
            // independently automatic; this path needs its own opt-in.
            crate::gpu_metal::flint_moe_pager_cap_bytes(&model)
        } else {
            crate::gpu_metal::moe_pager_cap_bytes()
        };
        let pager_eligible =
            pager_cap.is_some() && !self.graph_head_required && needs_bounded_pager;
        let mut pager_span: Option<(usize, usize)> = None;
        if pager_eligible {
            let cap = pager_cap.expect("checked above");
            // When this page reaches the true model end, include the fused
            // lm_head too.  Otherwise `lm_head_ok` would correctly refuse a
            // binding outside the page after the layers had already run.
            let tail_span = (self.graph_want_logits
                && upto.is_none()
                && scan == self.num_layers
                && std::env::var("CMF_GPU_LMHEAD")
                    .map(|v| v != "0")
                    .unwrap_or(true))
            .then(|| self.weights.lm_head.metal_graph_parts())
            .flatten()
            .and_then(|lm| crate::gpu_metal::model_tensor_span(&model, lm.0));
            let add_layer_span = |span: Option<(usize, usize)>, li: usize| {
                let (lo, hi) = crate::gpu_metal::model_layer_span(&model, self.phys_layer(li))?;
                Some(match span {
                    Some((cur_lo, cur_hi)) => (cur_lo.min(lo), cur_hi.max(hi)),
                    None => (lo, hi),
                })
            };
            let page_span = |span: (usize, usize), include_tail: bool| {
                let (mut lo, mut hi) = span;
                if include_tail {
                    if let Some((tail_lo, tail_hi)) = tail_span {
                        lo = lo.min(tail_lo);
                        hi = hi.max(tail_hi);
                    }
                }
                crate::gpu_metal::page_round_span(lo, hi)
            };
            let mut selected = 0usize;
            let mut selected_span: Option<(usize, usize)> = None;
            // `Item::Gdn` is built as a maximal run so the normal resident
            // graph can batch its recurrent state work.  A physical CMF can
            // nevertheless place that whole run across a page cap while each
            // logical layer fits.  Split *only the final admitted run* at a
            // layer boundary: the next outer-loop call rebuilds the remaining
            // suffix, preserving hidden/state handoff and keeping the normal
            // long-run batching within every page.
            let mut gdn_prefix: Option<(usize, usize)> = None;
            'items: for (i, item) in plan.iter().enumerate() {
                match item {
                    // Short-conv runs are not paged (no oversized
                    // short-conv MoE has been measured): the page ends.
                    Item::Sconv { .. } => break,
                    Item::Attn { li, .. } => {
                        let Some(span) = add_layer_span(selected_span, *li) else {
                            break;
                        };
                        let Some((page_lo, page_hi)) = page_span(span, i + 1 == plan.len()) else {
                            break;
                        };
                        if page_hi - page_lo > cap {
                            break;
                        }
                        selected = i + 1;
                        selected_span = Some((page_lo, page_hi));
                    }
                    Item::Gdn { first, run } => {
                        // Preserve a complete recurrent run whenever it can
                        // occupy a page on its own.  If the preceding items
                        // merely used the remaining cap, close that page and
                        // let the next q1 invocation retain the full run.
                        // Prefix-splitting is only for a run that genuinely
                        // cannot fit an empty page.
                        let mut whole = None;
                        for take in 1..=run.len() {
                            whole = add_layer_span(whole, *first + take - 1);
                            if whole.is_none() {
                                break;
                            }
                        }
                        let whole_fits_empty_page = whole
                            .and_then(|span| page_span(span, false))
                            .is_some_and(|(lo, hi)| hi - lo <= cap);
                        if whole_fits_empty_page {
                            let mut span = selected_span;
                            for take in 1..=run.len() {
                                let Some(next) = add_layer_span(span, *first + take - 1) else {
                                    break 'items;
                                };
                                span = Some(next);
                            }
                            let Some(span) = span else {
                                break;
                            };
                            let Some((page_lo, page_hi)) = page_span(span, i + 1 == plan.len())
                            else {
                                break;
                            };
                            if page_hi - page_lo > cap {
                                break;
                            }
                            selected = i + 1;
                            selected_span = Some((page_lo, page_hi));
                            continue;
                        }
                        if selected != 0 {
                            break;
                        }
                        let mut span = None;
                        let mut best: Option<(usize, (usize, usize))> = None;
                        for take in 1..=run.len() {
                            let Some(next) = add_layer_span(span, *first + take - 1) else {
                                break;
                            };
                            // A partial final run cannot encode the lm_head;
                            // only its complete form above may include it.
                            let Some((page_lo, page_hi)) = page_span(next, false) else {
                                break;
                            };
                            if page_hi - page_lo > cap {
                                break;
                            }
                            span = Some((page_lo, page_hi));
                            best = Some((take, (page_lo, page_hi)));
                        }
                        let Some((take, page)) = best else {
                            break;
                        };
                        selected = i + 1;
                        selected_span = Some(page);
                        if take != run.len() {
                            gdn_prefix = Some((i, take));
                            break 'items;
                        }
                    }
                }
            }
            if selected != 0 {
                if let Some((item, take)) = gdn_prefix {
                    match &mut plan[item] {
                        Item::Gdn { run, .. } => run.truncate(take),
                        Item::Sconv { .. } | Item::Attn { .. } => {
                            unreachable!("only a GDN run is splittable")
                        }
                    }
                }
                let (page_lo, page_hi) = selected_span.expect("selected page span");
                tracing::info!(
                    page_start = page_lo,
                    page_end = page_hi,
                    page_mb = (page_hi - page_lo) / (1024 * 1024),
                    cap_mb = cap / (1024 * 1024),
                    graph_items = selected,
                    "native Metal MoE graph uses transient bounded weight page"
                );
                plan.truncate(selected);
                pager_span = Some((page_lo, page_hi));
            } else {
                tracing::warn!(
                    cap_mb = cap / (1024 * 1024),
                    "native Metal MoE pager declined: one graph item does not fit its safe page cap"
                );
            }
        }
        // A native MoE graph binds every WeightArena window to its jobs
        // kernels. On UMA, an mmap that already exceeds the driver's
        // recommended working set will therefore fail after admission, when
        // some recurrent/KV scratch has already been touched. Decline before
        // allocating/encoding the graph instead; the ordinary per-operation
        // route remains available and only materializes the needed window.
        // Do not apply this to dense graphs: they bind one projection at a
        // time and do not have the MoE jobs' all-window lifetime.
        if has_moe && needs_bounded_pager && pager_span.is_none() {
            tracing::info!(
                model_bytes,
                metal_working_set,
                "native Metal MoE graph declined before allocation"
            );
            self.note_graph_decline("metal block graph", MOE_WORKING_SET_REASON);
            if self.graph_head_required {
                self.fail_metal_graph(MOE_WORKING_SET_REASON);
            }
            return start;
        }
        let has_gdn = plan.iter().any(|it| matches!(it, Item::Gdn { .. }));
        let dev_attend = attend_contract
            && (self.head_dim <= 128
                || has_moe
                // A GDN hybrid attends on a quarter of its layers: the
                // hd>128 caution was measured on pure-dense models where
                // gqa_attend dominates, and on Qwen3.8-27B (hd 256, 48
                // GDN + 16 attn) the sandwich costs 2x the whole decode
                // (1.2 vs 2.21 tok/s measured before the arena fix).
                || (self.head_dim <= 256 && has_gdn)
                // Sliding-window layers bound most attends by the window:
                // Spark-X2.5-1.7B q4tp on the M4 decodes 67 tok/s
                // device-attended against 23 sandwiched (28 syncs/token).
                || (self.head_dim <= 256 && swa_graph)
                || attend_mode == "force"
                || attend_mode == "256");
        if !dev_attend {
            for it in &mut plan {
                if let Item::Attn { li, full_gpu, .. } = it {
                    // The hd>128 policy is about gqa_attend; an o1 layer
                    // attends through its own kernel set.
                    let keep_o1 = self.kv_cache.layers[*li].o1.is_some()
                        && std::env::var("CMF_O1_METAL").as_deref() == Ok("1");
                    if !keep_o1 {
                        *full_gpu = false;
                    }
                }
            }
        }
        if std::env::var("CMF_GRAPH_DBG").is_ok() {
            use std::sync::atomic::{AtomicBool, Ordering};
            static SAID: AtomicBool = AtomicBool::new(false);
            if !SAID.swap(true, Ordering::Relaxed) {
                let fg = plan
                    .iter()
                    .filter(|it| matches!(it, Item::Attn { full_gpu: true, .. }))
                    .count();
                let att = plan
                    .iter()
                    .filter(|it| matches!(it, Item::Attn { .. }))
                    .count();
                eprintln!(
                    "q1-graph: plan of {} items from layer {start} to {scan} | dev_attend={dev_attend} full_gpu {fg}/{att} | hd={} rd={} nkv={} nh={}",
                    plan.len(),
                    self.head_dim,
                    self.rotary_dim,
                    self.num_kv_heads,
                    self.num_heads,
                );
            }
        }
        let dims = GraphDims {
            hidden: self.hidden_size,
            eps: self.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        };
        // The outer `forward_layers_span` scope is one logical token.  This
        // guard starts at q1_graph_gpu entry and ends after all page readback,
        // so a multi-page token cannot be reported as several whole tokens.
        let mut pager_profile_page = pager_span.map(|(page_lo, page_hi)| {
            crate::gpu_metal::MoePagerPageScope::new(
                _mt0,
                position,
                start,
                page_lo,
                page_hi,
                // `pager_span` is selected only after a cap was admitted;
                // keep the profiler observational if that invariant is ever
                // loosened rather than introducing a new inference panic.
                pager_cap.unwrap_or(0),
            )
        });
        let graph_new = match pager_span {
            Some((page_lo, page_hi)) => TokenGraph::new_paged(&model, dims, h, page_lo, page_hi),
            None => TokenGraph::new(&model, dims, h),
        };
        let Some(mut graph) = graph_new else {
            if self.graph_head_required {
                self.fail_metal_graph("native TokenGraph allocation refused");
            }
            return start;
        };
        if swa_graph && self.head_dim > 128 {
            // Spark-X2.5 (hd 256, 4 Q heads per KV head): the GQA-shared
            // split-K attend reads each K/V row once for the group instead
            // of once per head plus the importance re-read — at depth 1000
            // on the M4, 59.5 tok/s against 50.0 with the per-head kernel
            // up to the default 512 (every sliding layer sits at <= 512).
            // From the second position on and in 32-position blocks (more
            // threadgroups in flight for a latency-bound walk): Spark-X2.6
            // q4tp decode 0.86x the GPU time short and 0.88x at depth 1000,
            // q8_2f 0.91x / 0.92x (in-process A/B, M4).
            graph.set_attend_blk(1, 32);
        }
        let gcfg = self.gdn_cfg.map(|cfg| GdnGpuCfg {
            nv: cfg.num_v_heads,
            nk: cfg.num_k_heads,
            dk: cfg.key_head_dim,
            dv: cfg.value_head_dim,
            kk: cfg.conv_kernel,
            hidden: self.hidden_size,
            inter: self.intermediate_size,
            c_dim: cfg.conv_dim(),
            eps: cfg.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        });
        // Validate the whole plan BEFORE encoding anything: after the
        // first sync a refused layer would leave the token
        // half-executed, so truncate to the provably encodable prefix.
        let mut valid = 0usize;
        let mut end = start;
        crate::gpu::stageprof(1, _mt0.elapsed()); // конец планирования
        if std::env::var("CMF_PLAN_DUMP").is_ok() {
            static ONCE: std::sync::Once = std::sync::Once::new();
            ONCE.call_once(|| {
                for it in &plan {
                    match it {
                        Item::Gdn { first, run } => {
                            eprintln!("plan: Gdn first={first} len={}", run.len())
                        }
                        Item::Sconv { first, run } => {
                            eprintln!("plan: Sconv first={first} len={}", run.len())
                        }
                        Item::Attn { li, full_gpu, .. } => {
                            eprintln!("plan: Attn li={li} full_gpu={full_gpu}")
                        }
                    }
                }
            });
        }
        for item in &plan {
            let ok = match item {
                Item::Gdn { run, .. } => gcfg
                    .as_ref()
                    .map(|gc| run.iter().all(|l| graph.gdn_ok(l, gc)))
                    .unwrap_or(false),
                Item::Sconv { run, .. } => self
                    .short_conv_cfg
                    .is_some_and(|sc| run.iter().all(|l| graph.sconv_ok(l, sc.kernel))),
                Item::Attn { l, .. } => graph.attn_ok(l),
            };
            if !ok {
                if block_diag {
                    eprintln!(
                        "block-graph: plan item {} ({}) failed graph preflight",
                        valid,
                        match item {
                            Item::Gdn { run, first } => format!("GDN run L{first}+{}", run.len()),
                            Item::Sconv { run, first } => {
                                format!("short-conv run L{first}+{}", run.len())
                            }
                            Item::Attn { li, .. } => format!("Attn L{li}"),
                        }
                    );
                }
                break;
            }
            valid += 1;
            end += match item {
                Item::Gdn { run, .. } => run.len(),
                Item::Sconv { run, .. } => run.len(),
                Item::Attn { .. } => 1,
            };
        }
        plan.truncate(valid);
        if plan.is_empty() {
            if self.graph_head_required {
                self.fail_metal_graph("native graph preflight produced no valid items");
            }
            return start;
        }

        if self.graph_head_required && (upto.is_some() || end != self.num_layers) {
            self.fail_metal_graph("fused-head NLL requires a complete 64-layer graph");
            return start;
        }

        // Plain dense decode (every item a device-attended full-attention
        // layer with a dense FFN, no O(1) state): the only plan shape the
        // masked-nibble q4tp matvec and the concurrent layer encoder were
        // measured on (MiniCPM5-2B, Qwen3-0.6B on the M4). Hybrids, MoE and
        // o1 layers keep the historical serial path bit for bit.
        // Every projection must be ONE dispatch (q1t adds an overlay pass,
        // Prism q2tp a transform pass — dependent pairs a concurrent
        // encoder would race).
        let one_pass = |t: (usize, usize, usize)| {
            use cortiq_core::TensorDtype as D;
            matches!(
                model.tensors[t.0].dtype,
                D::Q4TiledP | D::Q4Tiled | D::Q4Block | D::Q8Row | D::Q8_2f | D::Q1 | D::Q1G
            )
        };
        let dense_fast = plan.iter().all(|it| match it {
            Item::Attn {
                l, li, full_gpu, ..
            } => {
                *full_gpu
                    && self.kv_cache.layers[*li].o1.is_none()
                    && [l.wq, l.wk, l.wv, l.wo].into_iter().all(one_pass)
                    && match l.ffn {
                        MetalFfn::Dense { gate, up, down, .. } => {
                            one_pass(gate) && one_pass(up) && one_pass(down)
                        }
                        _ => false,
                    }
            }
            // A short-conv run encodes serially in its own encoder: its
            // one-pass projections take the same matvec levers.
            Item::Sconv { run, .. } => run.iter().all(|l| {
                one_pass(l.in_proj)
                    && one_pass(l.out)
                    && match l.ffn {
                        MetalFfn::Dense { gate, up, down, .. } => {
                            one_pass(gate) && one_pass(up) && one_pass(down)
                        }
                        _ => false,
                    }
            }),
            Item::Gdn { .. } => false,
        });
        // MoE decode with every layer device-attended (Mellum2.1): the
        // routed experts' jobs ladder and the q8_2f attention projections
        // take their measured levers (`MOE_*`, `DENSE_Q8R4`).
        let moe_plan = !dense_fast
            && plan.iter().all(|it| match it {
                Item::Attn {
                    l, li, full_gpu, ..
                } => {
                    *full_gpu
                        && self.kv_cache.layers[*li].o1.is_none()
                        && (matches!(l.ffn, MetalFfn::Moe(_) | MetalFfn::FlintMoe(_))
                            || self.dash.is_some())
                }
                Item::Gdn { .. } | Item::Sconv { .. } => false,
            });
        let ab = crate::gpu_metal::dense_ab_arm().filter(|_| dense_fast || moe_plan);
        if block_diag {
            use std::sync::atomic::{AtomicBool, Ordering};
            static SAID_AB: AtomicBool = AtomicBool::new(false);
            if !SAID_AB.swap(true, Ordering::Relaxed) {
                eprintln!("q1-graph: dense_fast={dense_fast} moe_plan={moe_plan} ab={ab:?}");
            }
        }
        let _mv_fast = match ab {
            Some((bits, _)) => {
                graph.set_dense_concurrent_raw(bits & crate::gpu_metal::DENSE_CONC != 0);
                crate::gpu_metal::MvFastGuard::set_raw(bits)
            }
            None if moe_plan => {
                graph.set_dense_concurrent(
                    crate::gpu_metal::MOE_PLAN_BITS & crate::gpu_metal::DENSE_CONC != 0,
                );
                crate::gpu_metal::MvFastGuard::set_bits(crate::gpu_metal::MOE_PLAN_BITS)
            }
            None => {
                graph.set_dense_concurrent(dense_fast);
                // The four-row q8_2f matvec (same per-row sum order, text
                // unchanged): in-process A/B on the M4, token time 0.81x on
                // MiniCPM5-2B, 0.78x on Minico-M1, 0.85x on MNN-Pocket-0.3B;
                // Spark-X2.5 1.7B 40.5 against 27.7 tok/s. `CMF_Q8_R4=0` closes it.
                let _ = swa_graph;
                crate::gpu_metal::MvFastGuard::set_bits(if dense_fast {
                    crate::gpu_metal::DENSE_MV | crate::gpu_metal::DENSE_FUSE | crate::gpu_metal::DENSE_Q8R4
                } else {
                    0
                })
            }
        };

        // RoPE table and rotary width are per layer (`layer_inv_freq`,
        // `layer_geom`) inside the loop below.
        let pool = self.pool.clone();
        let (nh, nkv, hd, hs, eps) = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.hidden_size,
            self.rms_eps,
        );
        let norm_style = self.norm_style;
        let gemma = norm_style == cortiq_core::NormStyle::Gemma;
        let want = self.gdn_cfg.map(|c| c.state_len()).unwrap_or(0);
        let kv_id = self.graph_kv_id;
        // GDN runs whose states await readback after the next sync
        // (device-attended layers add no sync, so several may stack).
        let mut pending: Vec<(usize, usize)> = Vec::new();
        // Device-attended layers: their K/V/imp are pulled from the
        // mirror after the final sync.
        let mut dev_attn: Vec<(usize, usize, usize)> = Vec::new();
        // The layers a DFlash drafter reads, kept as the token passes them
        // (a whole token in one graph only).
        let taps: Vec<usize> = match &self.dflash {
            Some(d) if start == 0 && end == self.num_layers => d.g.taps.clone(),
            _ => Vec::new(),
        };
        let mut tapped = 0usize;
        for item in &plan {
            let _xt0 = std::time::Instant::now();
            let _xkind: u32 = match item {
                Item::Gdn { .. } | Item::Sconv { .. } => 2,
                Item::Attn { .. } => 3,
            };
            // Looped Transformer: insert on-device norm at loop boundaries.
            if self.loop_final_norm {
                let item_start = match item {
                    Item::Gdn { first, .. } | Item::Sconv { first, .. } => *first,
                    Item::Attn { li, .. } => *li,
                };
                if item_start > start && self.is_loop_end(item_start - 1) {
                    graph.encode_loop_norm(&self.weights.final_norm);
                }
            }
            match item {
                Item::Gdn { run, first } => {
                    for l in &mut self.kv_cache.layers[*first..*first + run.len()] {
                        if l.linear_state.len() != want {
                            l.linear_state = vec![0f32; want];
                        }
                    }
                    let ro: Vec<&[f32]> = self.kv_cache.layers[*first..*first + run.len()]
                        .iter()
                        .map(|l| l.linear_state.as_slice())
                        .collect();
                    let _ig = std::time::Instant::now();
                    if !graph.encode_gdn_run(run, &ro, gcfg.as_ref().unwrap()) {
                        // Unreachable: the plan was validated above.
                        tracing::error!("q1 graph: GDN run refused after validation");
                        return start;
                    }
                    if let Some(slot) = taps.iter().position(|t| *t + 1 == *first + run.len()) {
                        tapped += graph.tap(slot, taps.len()) as usize;
                    }
                    // Early commit: the GPU starts the run while the
                    // CPU encodes the next layer (nothing to wait on).
                    graph.commit_kind = 2;
                    graph.commit();
                    crate::gpu::stageprof(0, _ig.elapsed());
                    pending.push((*first, run.len()));
                }
                Item::Sconv { run, first } => {
                    let sc = self.short_conv_cfg.expect("validated short-conv run");
                    for l in &mut self.kv_cache.layers[*first..*first + run.len()] {
                        if l.linear_state.len() != sc.state_len() {
                            l.linear_state = vec![0f32; sc.state_len()];
                        }
                    }
                    let ro: Vec<&[f32]> = self.kv_cache.layers[*first..*first + run.len()]
                        .iter()
                        .map(|l| l.linear_state.as_slice())
                        .collect();
                    if !graph.encode_sconv_run(run, &ro, sc.kernel) {
                        tracing::error!("q1 graph: short-conv run refused after validation");
                        return start;
                    }
                    graph.commit_kind = 2;
                    graph.commit();
                    pending.push((*first, run.len()));
                }
                Item::Attn {
                    l,
                    li,
                    q_norm,
                    k_norm,
                    output_gate,
                    proj_gate,
                    head_gate_w,
                    bias,
                    full_gpu,
                } => {
                    let _ia = std::time::Instant::now();
                    // This layer's attention geometry: its window, RoPE
                    // table and rotary width (Spark-X2.5 interleaves
                    // 512-window layers rotating all dims at θ 1e4 with
                    // full layers rotating a quarter at θ 5e6). Every model
                    // without sliding layers reads the global ones here.
                    let inv_freq_l = self.layer_inv_freq(*li);
                    let rd_l = self.layer_geom(*li).2;
                    let window_l = self.layer_window(*li);
                    let head_gate_w = *head_gate_w;
                    // This layer's KV heads and head width: Gemma-4's global
                    // layers (one 512-wide KV head) differ from the base.
                    let (nkv, hd) = if gemma4 {
                        let (a, b, _) = self.layer_geom(*li);
                        (a, b)
                    } else {
                        (nkv, hd)
                    };
                    // ── Fully device-resident attention: no sync at all.
                    if *full_gpu {
                        let cache = &self.kv_cache.layers[*li];
                        let o1p = if cache.o1.is_some() {
                            match cache.o1_views() {
                                Some(views) => Some(crate::gpu::O1AttnParams {
                                    views,
                                    epoch: self.o1_epoch,
                                }),
                                // Sealed state gone mid-run: sandwich.
                                None => None,
                            }
                        } else {
                            None
                        };
                        let o1_layer = cache.o1.is_some();
                        if o1_layer && o1p.is_none() {
                            // fall to the sandwich (CPU o1 step)
                        }
                        let cpu_k: Vec<&[f32]> = (0..nkv).map(|g| cache.head_keys(g)).collect();
                        let cpu_v: Vec<&[f32]> = (0..nkv).map(|g| cache.head_values(g)).collect();
                        let cpu_stored = if o1_layer { 0 } else { cpu_k[0].len() / hd };
                        // A trimmed tail always holds the window the
                        // device attend reads (`first = rows + 1 − w`).
                        debug_assert!(
                            cache.base() == 0 || window_l.is_some_and(|w| cpu_stored + 1 >= w)
                        );
                        let dash_l = self.graph_dash(*li);
                        // A DASH row carries its own angles: position 1 over
                        // them is the rotation (`uocr::rope_angles`).
                        let (rope_at, rope_invf, rope_sc): (usize, &[f32], f32) = match self.dash.as_deref() {
                            Some(d) => (1, &d.angles, 1.0),
                            None => (position, &inv_freq_l, self.layer_rope_scale(*li)),
                        };
                        let p = crate::gpu::AttnDeviceParams {
                            kv_id,
                            layer: *li,
                            nh,
                            nkv,
                            hd,
                            rd: rd_l,
                            position: rope_at,
                            scale: self.attn_scale,
                            eps: eps as f32,
                            gemma,
                            late_qk_norm: self.qk_norm_after_rope,
                            output_gate: *output_gate,
                            q_norm: *q_norm,
                            k_norm: *k_norm,
                            inv_freq: rope_invf,
                            rope_scale: rope_sc,
                            cpu_k,
                            cpu_v,
                            cpu_stored,
                            cpu_gen: cache.generation(),
                            o1: o1p,
                            window: window_l,
                            softmax_sink: cache.sinks.as_deref(),
                            head_gate: head_gate_w,
                            v_norm: self.attn_v_norm,
                            dash: dash_l.as_ref(),
                        };
                        let o1_bad = o1_layer && p.o1.is_none();
                        if !o1_bad && graph.attn_device_ok(l, &p) && graph.encode_attn_device(l, &p)
                        {
                            // o1 layers leave no mirror row to pull.
                            if p.o1.is_none() {
                                dev_attn.push((*li, nkv, hd));
                            }
                            if let Some(slot) = taps.iter().position(|t| t == li) {
                                tapped += graph.tap(slot, taps.len()) as usize;
                            }
                            graph.commit_kind = 3;
                            graph.commit();
                            // The footer below is skipped by `continue`:
                            // account the device-attn item here or its
                            // cost hides from the stage profile entirely.
                            crate::gpu::stageprof(_xkind, _xt0.elapsed());
                            continue;
                        }
                        // Mirror refused (nothing encoded) → sandwich.
                    }
                    graph.encode_attn_prefix(l);
                    if let Err(err) = graph.sync_checked() {
                        self.fail_metal_graph(&err);
                        return start;
                    }
                    if !pending.is_empty() {
                        let idxs: Vec<usize> =
                            pending.drain(..).flat_map(|(f, n)| f..f + n).collect();
                        let mut outs: Vec<&mut [f32]> = self
                            .kv_cache
                            .layers
                            .iter_mut()
                            .enumerate()
                            .filter(|(i, _)| idxs.binary_search(i).is_ok())
                            .map(|(_, s)| s.linear_state.as_mut_slice())
                            .collect();
                        graph.read_states(&mut outs);
                    }
                    let mut q_raw = attention::take_buf(l.wq.1);
                    let mut k = attention::take_buf(l.wk.1);
                    let mut v = attention::take_buf(l.wv.1);
                    graph.read_qkv(&mut q_raw, &mut k, &mut v);
                    // Projected output gate: g = G·norm(h) on the host, off
                    // the normed input the prefix left on the device.
                    let mut gate_raw = proj_gate.map(|(gp, _)| {
                        let mut normed = attention::take_buf(hs);
                        graph.read_normed(&mut normed);
                        let mut raw = attention::take_buf(gp.rows());
                        gp.matvec(&normed, &mut raw, pool.as_deref());
                        attention::recycle_buf(&mut normed);
                        raw
                    });
                    let cfg = QwenAttnCfg {
                        mrope: None,
                        num_heads: nh,
                        num_kv_heads: nkv,
                        head_dim: hd,
                        hidden_size: hs,
                        position,
                        inv_freq: &inv_freq_l,
                        rotary_dim: rd_l,
                        scale: self.attn_scale,
                        softcap: self.attn_softcap,
                        window: window_l,
                        // Gemma-4 only (the front gate refuses V norm
                        // otherwise).
                        v_norm: self.attn_v_norm,
                        qk_norm_after_rope: self.qk_norm_after_rope,
                        gate_sigmoid: self.proj_gate_sigmoid,
                        q_norm: *q_norm,
                        k_norm: *k_norm,
                        output_gate: *output_gate,
                        softplus_gate: None,
                        rope_scale: self.layer_rope_scale(*li),
                        bias: *bias,
                        rms_eps: eps,
                        norm_style,
                        pool: pool.as_deref(),
                        v_head_dim: hd,
                        value_in: None,
                    };
                    // CMF_ATTN_ORACLE=1: diff the device attend against
                    // this CPU attend on identical inputs (bring-up).
                    let oracle = std::env::var("CMF_ATTN_ORACLE").as_deref() == Ok("1")
                        || std::env::var("CMF_ATTN_DUMP").is_ok();
                    let _ = full_gpu;
                    let oracle_in = oracle.then(|| (q_raw.clone(), k.clone(), v.clone()));
                    let mut ao = attention::qwen_attention_core(
                        q_raw,
                        k,
                        v,
                        &mut self.kv_cache.layers[*li],
                        &cfg,
                    );
                    // CMF_ATTN_DUMP=<dir>: this token's rope'd Q and the layer's whole
                    // K/V cache as raw f32 (offline attention-statistics probes:
                    // block bounds, mass concentration). Needs CMF_GPU_ATTEND=0.
                    if let Ok(dir) = std::env::var("CMF_ATTN_DUMP") {
                        if let Some((qr0, k0, v0)) = oracle_in.clone() {
                            let (cq, _cg, _ck, _cv) =
                                attention::finish_projection_debug(qr0, k0, v0, &cfg, position);
                            let cache = &self.kv_cache.layers[*li];
                            let n = cache.head_keys(0).len() / hd;
                            let mut bytes: Vec<u8> = Vec::new();
                            for v in [nh as u32, nkv as u32, hd as u32, n as u32, position as u32] {
                                bytes.extend_from_slice(&v.to_le_bytes());
                            }
                            for v in &cq {
                                bytes.extend_from_slice(&v.to_le_bytes());
                            }
                            for g in 0..nkv {
                                for v in cache.head_keys(g) {
                                    bytes.extend_from_slice(&v.to_le_bytes());
                                }
                            }
                            for g in 0..nkv {
                                for v in cache.head_values(g) {
                                    bytes.extend_from_slice(&v.to_le_bytes());
                                }
                            }
                            let _ =
                                std::fs::write(format!("{dir}/L{li}_pos{position}.bin"), &bytes);
                        }
                    }
                    if let Some((qr0, k0, v0)) =
                        oracle_in.filter(|_| std::env::var("CMF_ATTN_ORACLE").as_deref() == Ok("1"))
                    {
                        let (cq, _cg, ck, cv) =
                            attention::finish_projection_debug(qr0, k0, v0, &cfg, position);
                        let mut h_now = vec![0f32; hs];
                        graph.read_h(&mut h_now);
                        let cache = &self.kv_cache.layers[*li];
                        let n_after = cache.head_keys(0).len() / hd;
                        // A sealed O(1) cache may have no dense current-row
                        // entry. The oracle is a debug probe, so let it see
                        // zero stored exact rows instead of underflowing.
                        let stored = n_after.saturating_sub(1);
                        let cpu_k: Vec<&[f32]> = (0..nkv)
                            .map(|g| &cache.head_keys(g)[..stored * hd])
                            .collect();
                        let cpu_v: Vec<&[f32]> = (0..nkv)
                            .map(|g| &cache.head_values(g)[..stored * hd])
                            .collect();
                        let p = crate::gpu::AttnDeviceParams {
                            kv_id,
                            layer: *li,
                            nh,
                            nkv,
                            hd,
                            // The layer's own geometry, as the CPU attend
                            // above used it (the projected gate is applied
                            // after this probe on both sides).
                            rd: rd_l,
                            position,
                            scale: self.attn_scale,
                            eps: eps as f32,
                            gemma,
                            late_qk_norm: self.qk_norm_after_rope,
                            output_gate: *output_gate,
                            q_norm: *q_norm,
                            k_norm: *k_norm,
                            inv_freq: &inv_freq_l,
                            rope_scale: self.layer_rope_scale(*li),
                            cpu_k,
                            cpu_v,
                            cpu_stored: stored,
                            cpu_gen: cache.generation(),
                            o1: None,
                            window: window_l,
                            softmax_sink: cache.sinks.as_deref(),
                            head_gate: None,
                            v_norm: self.attn_v_norm,
                            dash: None,
                        };
                        if let Some((dq, dk, dv, dao)) = graph.debug_attn_device(l, &p, &h_now) {
                            let md = |a: &[f32], b: &[f32]| {
                                a.iter().zip(b).fold(0f32, |m, (x, y)| m.max((x - y).abs()))
                            };
                            let nn = |a: &[f32]| a.iter().map(|x| x * x).sum::<f32>().sqrt();
                            eprintln!(
                                "attn-oracle L{li} pos {position}: |q| {:.2} max|dq| {:.4} | |k| {:.2} max|dk| {:.4} | |v| {:.2} max|dv| {:.4} | |ao| {:.2} max|dao| {:.4}",
                                nn(&cq),
                                md(&cq, &dq),
                                nn(&ck),
                                md(&ck, &dk),
                                nn(&cv),
                                md(&cv, &dv),
                                nn(&ao),
                                md(&ao, &dao)
                            );
                        } else {
                            eprintln!("attn-oracle L{li}: device probe declined");
                        }
                    }
                    if let (Some(raw), Some((_, per_head))) = (gate_raw.as_deref(), *proj_gate) {
                        // V is as wide as the head (the front gate), so ao
                        // is nh·hd here, as in `qwen_attention`.
                        attention::apply_projected_gate(
                            &mut ao,
                            raw,
                            per_head,
                            hd,
                            self.proj_gate_sigmoid,
                        );
                    }
                    if let Some(mut raw) = gate_raw.take() {
                        attention::recycle_buf(&mut raw);
                    }
                    graph.encode_attn_suffix(l, &ao);
                    if let Some(slot) = taps.iter().position(|t| t == li) {
                        tapped += graph.tap(slot, taps.len()) as usize;
                    }
                    // Early commit: the GPU starts O+FFN while the CPU
                    // encodes the following GDN run / attention prefix.
                    graph.commit();
                    attention::recycle_buf(&mut ao);
                }
            }

            crate::gpu::stageprof(_xkind, _xt0.elapsed());
        }
        // Ride the final norm + lm_head in the same command buffer when
        // this run reaches the model's end and the caller wants logits:
        // the separate per-op lm_head submit (a full round trip) folds
        // into the sync that already happens here.
        let mut lm_rows = None;
        if self.graph_want_logits
            && upto.is_none()
            && end == self.num_layers
            && std::env::var("CMF_GPU_LMHEAD")
                .map(|v| v != "0")
                .unwrap_or(true)
        {
            if let Some(lm) = self.weights.lm_head.metal_graph_parts() {
                if graph.lm_head_ok(lm) {
                    graph.encode_lm_head(&self.weights.final_norm, lm);
                    lm_rows = Some(lm.1);
                }
            }
        }
        if self.graph_head_required && lm_rows.is_none() {
            METAL_GRAPH_HEAD_MISS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
            self.fail_metal_graph("fused graph head was requested but not encodable");
            return start;
        }
        let _sy0 = std::time::Instant::now();
        if let Err(err) = graph.sync_checked() {
            if let Some(profile) = pager_profile_page.as_mut() {
                profile.finish(start, graph.pager_page_stats(), "sync-error");
            }
            self.fail_metal_graph(&err);
            return start;
        }
        let _rs0 = std::time::Instant::now();
        if !pending.is_empty() {
            let idxs: Vec<usize> = pending.drain(..).flat_map(|(f, n)| f..f + n).collect();
            let mut outs: Vec<&mut [f32]> = self
                .kv_cache
                .layers
                .iter_mut()
                .enumerate()
                .filter(|(i, _)| idxs.binary_search(i).is_ok())
                .map(|(_, s)| s.linear_state.as_mut_slice())
                .collect();
            graph.read_states(&mut outs);
        }
        if std::env::var("CMF_GRAPH_HOSTPROF").as_deref() == Ok("1") {
            use std::sync::atomic::{AtomicU64, Ordering};
            static SY: AtomicU64 = AtomicU64::new(0);
            static RS: AtomicU64 = AtomicU64::new(0);
            static N: AtomicU64 = AtomicU64::new(0);
            SY.fetch_add((_rs0 - _sy0).as_nanos() as u64, Ordering::Relaxed);
            RS.fetch_add(_rs0.elapsed().as_nanos() as u64, Ordering::Relaxed);
            let n = N.fetch_add(1, Ordering::Relaxed) + 1;
            if n % 100 == 0 {
                eprintln!(
                    "postprof: sync-wait {:.1} ms/tok | read_states {:.1} ms/tok ({n})",
                    SY.load(Ordering::Relaxed) as f64 / n as f64 / 1e6,
                    RS.load(Ordering::Relaxed) as f64 / n as f64 / 1e6
                );
            }
        }
        if let Some(rows) = lm_rows {
            crate::gpu::hostprof_encode_done(_mt0);
            let mut lg = attention::take_buf(rows.min(self.vocab_size));
            graph.read_logits(&mut lg);
            crate::gpu::hostprof_total(_mt0);
            lg.resize(self.vocab_size, 0.0);
            if let Some(c) = self.final_softcap {
                softcap_in_place(&mut lg, c, self.pool.as_deref());
            }
            self.graph_logits = Some(lg);
        }
        graph.read_h(h);
        // the token's row of the drafter's context
        if !taps.is_empty() && tapped == taps.len() {
            let mut row = vec![0f32; taps.len() * self.hidden_size];
            if graph.read_taps(&mut row) {
                if let Some(d) = self.dflash.as_mut() {
                    d.queue_context(position, &row, self.pool.as_deref());
                }
            }
        }
        if self.graph_head_required && self.graph_logits.is_none() {
            METAL_GRAPH_HEAD_MISS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
            self.fail_metal_graph("fused graph head completed without logits readback");
            return start;
        }
        METAL_GRAPH_TOK_OK.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        METAL_GRAPH_LAYERS.fetch_add(
            end.saturating_sub(start) as u64,
            std::sync::atomic::Ordering::Relaxed,
        );
        if self.graph_head_required {
            METAL_GRAPH_HEAD_OK.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        }
        // Device-attended layers: replay the CPU bookkeeping — append
        // the mirror's new K/V row (rope'd on the GPU) into the owner
        // cache, then bank this token's attention-importance mass.
        for (li, nkv, hd) in dev_attn {
            let mut krow = attention::take_buf(nkv * hd);
            let mut vrow = attention::take_buf(nkv * hd);
            if crate::gpu::kv_mirror_read_last(kv_id, li, nkv, hd, &mut krow, &mut vrow) {
                let cache = &mut self.kv_cache.layers[li];
                cache.append(&krow, &vrow, &[]);
                let n = cache.seq_len;
                let mut imp = attention::take_buf(n);
                crate::gpu::kv_mirror_take_imp(kv_id, li, &mut imp);
                cache.accumulate_imp(&imp);
                attention::recycle_buf(&mut imp);
            }
            attention::recycle_buf(&mut krow);
            attention::recycle_buf(&mut vrow);
        }
        if let Some(profile) = pager_profile_page.as_mut() {
            profile.finish(end, graph.pager_page_stats(), "page-complete");
        }
        if let Some((_, arm)) = ab {
            crate::gpu_metal::dense_ab_record(arm, _mt0.elapsed());
        }
        end
    }

    pub fn new(
        tokenizer: Tokenizer,
        weights: PipelineWeights,
        hidden_size: usize,
        intermediate_size: usize,
        num_heads: usize,
        num_kv_heads: usize,
        head_dim: usize,
        num_layers: usize,
        physical_layers: usize,
        loop_final_norm: bool,
        vocab_size: usize,
        rms_eps: f64,
        rope_base: f32,
        norm_style: NormStyle,
        max_seq_len: usize,
        sampler_config: SamplerConfig,
    ) -> Self {
        let rng = match sampler_config.seed {
            Some(s) => SplitMix64::new(s),
            None => SplitMix64::from_entropy(),
        };
        let inv_freq = std::sync::Arc::new(attention::rope_inv_freq(head_dim, rope_base));
        let pool = Pool::from_env();
        if let Some(p) = &pool {
            tracing::info!("worker pool: {} threads", p.n_workers());
            // Keep the workers on the socket that holds the weights.
            if let Some(model) = weights
                .lm_head
                .model_arc()
                .or_else(|| weights.embed_tokens.model_arc())
            {
                let regions: Vec<&[u8]> =
                    model.tensors.iter().map(|t| model.entry_bytes(t)).collect();
                p.bind_numa(&regions);
            }
        }
        Self {
            gpu_plan: None,
            tokenizer: std::sync::Arc::new(tokenizer),
            kv_cache: KvCache::new(num_layers, num_kv_heads, head_dim, max_seq_len),
            sampler_config,
            weights,
            hidden_size,
            intermediate_size,
            num_heads,
            num_kv_heads,
            head_dim,
            num_layers,
            physical_layers,
            loop_final_norm,
            layer_map: None,
            dash: None,
            dash_batch_on: true,
            mhc: None,
            mhc_r: Vec::new(),
            mrope_sections: None,
            prompt_mrope: None,
            vocab_size,
            rms_eps,
            rope_base,
            norm_style,
            rotary_dim: head_dim,
            attention_heads_per_layer: None,
            kv_heads_per_layer: None,
            v_head_dim: None,
            layer_dump: std::env::var_os("CMF_LAYER_DUMP")
                .filter(|v| !v.is_empty())
                .map(std::path::PathBuf::from),
            graph_declines: std::cell::RefCell::new(Vec::new()),
            mimo_moe: Default::default(),
            minicpm_tail: Default::default(),
            vmf_cfg: None,
            gdn_cfg: None,
            kda_cfg: None,
            g3n: None,
            g4e: None,
            dsv4: None,
            dory: None,
            dsv41: None,
            dsv41_vision: None,
            dsv41_prefill: None,
            qwen4_exp: None,
            clover: None,
            clover_stats: clover::CloverStats::default(),
            clover_pen: Default::default(),
            dsv4_mtp: Vec::new(),
            dspark: None,
            dspark_pending: Vec::new(),
            dspark_hist: Vec::new(),
            dspark_real: Vec::new(),
            dspark_trunk_picks: Vec::new(),
            dspark_exp: Vec::new(),
            dspark_draft_ns: 0,
            m3_winners: Vec::new(),
            m3_counts: Vec::new(),
            m3_n_exp: 0,
            m3_tokens: 0,
            m3_prewarmed: false,
            logit_multiplier: None,
            cancel: std::sync::Arc::new(std::sync::atomic::AtomicBool::new(false)),
            graph_failed: std::sync::atomic::AtomicBool::new(false),
            graph_moe_banks: std::sync::Mutex::new(std::collections::HashMap::new()),
            kv_history: Vec::new(),
            kv_history_device: false,
            short_conv_cfg: None,
            mtp: None,
            mimo_mtp: None,
            verify_exact_moe: false,
            speculative: std::env::var("CMF_MTP").map(|v| v != "0").unwrap_or(true),
            ignore_eos: false,
            draft_full_streak: 0,
            spec_k_adapt: None,
            spec_acc_ewma: 0.7,
            spec_hold: SPEC_HOLD_PRIOR,
            spec_wall: [0.0; 7],
            spec_wall_n: [0; 7],
            spec_k_dwell: 0,
            spec_plain_ms: (0.0, 0),
            dflash_hold: DFLASH_HOLD_PRIOR,
            dflash_last: false,
            dflash_wait: 0,
            dflash_back: DFLASH_WAIT,
            dflash_turn: 0,
            dflash_turn_sum: (0.0, 0.0),
            dflash_lean: 0.0,
            dflash_k_adapt: None,
            dflash_acc_ewma: 0.6,
            spec_lookup_gain: 2.0,
            spec_lookup_wide: false,
            spec_lookup_rest: 0,
            rng,
            sampler_scratch: SamplerScratch::default(),
            spec_forced: None,
            spec_q: Vec::new(),
            spec_p: Vec::new(),
            spec_res: Vec::new(),
            spec_qs: Vec::new(),
            spec_ps: Vec::new(),
            spec_ress: Vec::new(),
            mtp_graph_mode: None,
            dflash: None,
            dflash_rows: None,
            dflash_taps: std::sync::Mutex::new(Vec::new()),
            dflash_solo: false,
            dflash_tap_from: 0,
            #[cfg(target_os = "macos")]
            metal_verify: None,
            inv_freq,
            ws: ForwardScratch::new(hidden_size),
            pool,
            model: None,
            dyn_force_f32: false,
            dyn_skill_layers: Vec::new(),
            dyn_active: None,
            dyn_blend_loaded: false,
            dyn_phi_layer: None,
            dyn_phi_ema: Vec::new(),
            dyn_phi_seen: 0,
            dyn_router: None,
            o1_cfg: None,
            o1_turbo: None,
            mtp_pos_base: 0,
            o1_prefix_tail: Vec::new(),
            gdn_snap: None,
            mtp_warm_base: None,
            o1_epoch: 0,
            o1_flags: Vec::new(),
            trace: false,
            calib_temp: 1.0,
            confidence_on: true,
            embed_multiplier: 1.0,
            attn_scale: 1.0 / (head_dim as f32).sqrt(),
            swa: None,
            swa_trim: None,
            swa_trim_anchor: usize::MAX,
            chunk_min_rows: 32,
            o1_chunk_prefix: false,
            dense_batch_declined: std::sync::atomic::AtomicBool::new(false),
            sliding_layers: None,
            no_rope_layers: None,
            value_blend: None,
            vres_e0: Vec::new(),
            vres_in: Vec::new(),
            anchor_core: None,
            bounded_rope: None,
            kv_prefix: KvPrefix::default(),
            last_prefill_tokens: 0,
            inv_freq_local: None,
            rotary_dim_local: None,
            rope_scale: 1.0,
            rope_scale_local: 1.0,
            global_attn: None,
            inv_freq_global: None,
            attn_v_norm: false,
            qk_norm_after_rope: false,
            proj_gate_sigmoid: false,
            final_softcap: None,
            head_clusters: None,
            attn_softcap: 0.0,
            graph_want_logits: false,
            graph_head_required: false,
            graph_logits: None,
            embryo_graph: None,
            embryo_wide_refused: false,
            graph_refused: std::sync::atomic::AtomicBool::new(false),
            graph_kv_id: {
                static NEXT: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(1);
                NEXT.fetch_add(1, std::sync::atomic::Ordering::Relaxed)
            },
            #[cfg(test)]
            nll_test_fail_at: None,
            #[cfg(test)]
            nll_test_force_serial: false,
        }
    }

    /// Enable/disable per-layer O(1) Nyström attention. Only Full
    /// layers are eligible (a linear layer keeps its own operator).
    /// Applies to generation (`generate*`/`forward_ids`): the prompt
    /// pass stays exact, then the state seals after prefill or at the
    /// deferred skeleton-safe boundary for short prompts; decode runs on
    /// the O(1) state. Teacher-forced scoring (`ppl_ids`) intentionally
    /// stays exact.
    pub fn set_o1(&mut self, cfg: Option<crate::nystrom::O1Cfg>) {
        if let Err(e) = self.try_set_o1(cfg) {
            tracing::error!("{e}");
        }
    }

    /// True when the file carries a native bounded anchor
    /// (`arch.anchor_core`): its state is a fixed record the header
    /// fixes, and the post-hoc O(1) override is meaningless on it.
    pub fn bounded_native(&self) -> bool {
        self.anchor_core.is_some()
    }

    /// Bytes the resident device graph holds for this pipeline's sequence:
    /// `(recurrent state, anchor KV/ring)`; None on the host path.
    pub fn device_state_bytes(&self) -> Option<(u64, u64)> {
        if self.dory.is_some() {
            return crate::gpu::dory_kv_bytes(self.graph_kv_id).map(|b| (0, b));
        }
        crate::gpu::embryo_device_state_bytes(self.graph_kv_id)
    }

    /// Why an O(1) override is refused on this pipeline, if it is.
    pub fn o1_refusal(&self) -> Option<String> {
        self.anchor_core.as_ref().map(|ac| {
            format!(
                "--o1 / CMF_O1 refused: the anchor is native bounded \
                 (anchor_core kind={} window={} sink={}); the file's operator \
                 is executed as-is and no post-hoc Nyström overlay applies",
                ac.kind, ac.window, ac.sink
            )
        })
    }

    /// `set_o1` that reports the refusal instead of logging it.
    pub fn try_set_o1(&mut self, cfg: Option<crate::nystrom::O1Cfg>) -> Result<(), String> {
        // Dory runs its own stack: the far field goes on its full layers.
        if let Some(b) = &mut self.dory {
            b.0.o1 = cfg.map(|c| crate::dory::DoryO1 { m: c.m, w: c.w, sink: c.sink, seal: (c.w + c.sink + 16).max(8192) });
            return Ok(());
        }
        if let Some(c) = &cfg {
            if let Some(why) = self.o1_refusal() {
                self.o1_flags = Vec::new();
                self.o1_cfg = None;
                return Err(why);
            }
            if crate::nystrom::o1_deferred_boundary(c.w, c.sink).is_none() {
                self.o1_flags.clear();
                self.o1_cfg = None;
                return Err(format!(
                    "o1 disabled: w + sink + slack + 1 overflows usize (w={}, sink={})",
                    c.w, c.sink
                ));
            }
        }
        self.o1_flags = match &cfg {
            Some(c) => {
                let mut flags = c.layer_flags(self.num_layers);
                for (li, f) in flags.iter_mut().enumerate() {
                    // The Nyström state replaces a full-context plain
                    // softmax: a sliding window or a learned sink is not
                    // something it can represent, and a V narrower than
                    // the head is not what its streaming state stores.
                    // Those layers keep exact cache attention.
                    if *f
                        && (!matches!(
                            self.weights.layers[self.phys_layer(li)].attn,
                            AttnKind::Full { .. }
                        ) || self.layer_window(li).is_some()
                            || self.kv_cache.layers[li].sinks.is_some()
                            || self.layer_v_dim(li) != self.layer_geom(li).1)
                    {
                        *f = false;
                    }
                }
                flags
            }
            None => Vec::new(),
        };
        if let Some(c) = &cfg {
            let n = self.o1_flags.iter().filter(|&&f| f).count();
            tracing::info!(
                "o1 nystrom attention: {n}/{} layer(s), m={} w={} sink={} rect={:?}",
                self.num_layers,
                c.m,
                c.w,
                c.sink,
                c.rect
            );
        }
        self.o1_cfg = cfg;
        Ok(())
    }

    /// Install the file's bounded anchor: one fixed-size ring per
    /// `AttnKind::Bounded` layer (from the header, not per prompt) and
    /// the shared relative-rotation table. Must run after the RoPE setup
    /// (`set_rotary`, YaRN) so the table is built from the final
    /// `inv_freq`.
    pub fn install_bounded(&mut self, cfg: &cortiq_core::AnchorCoreConfig) -> Result<(), String> {
        if !cortiq_core::AnchorCoreConfig::KINDS.contains(&cfg.kind.as_str()) {
            return Err(format!(
                "anchor_core kind '{}' is not executable by this runtime",
                cfg.kind
            ));
        }
        if cfg.window == 0 {
            return Err("anchor_core.window must be >= 1".into());
        }
        let mut n = 0usize;
        for li in 0..self.num_layers {
            let pl = self.phys_layer(li);
            if let AttnKind::Bounded(w) = &self.weights.layers[pl].attn {
                if w.window != cfg.window
                    || w.sink != cfg.sink
                    || w.group_windows != cfg.group_windows
                {
                    return Err(format!(
                        "layer {li}: bounded weights (window {} sink {} groups {:?}) disagree \
                         with anchor_core (window {} sink {} groups {:?})",
                        w.window, w.sink, w.group_windows, cfg.window, cfg.sink, cfg.group_windows
                    ));
                }
                self.kv_cache.layers[li].install_bounded(cfg.window);
                n += 1;
            }
        }
        if n == 0 {
            return Err("anchor_core is present but no layer executes it".into());
        }
        let rope = crate::bounded::BoundedRope::new(cfg.window, &self.inv_freq, self.rope_scale);
        self.bounded_rope = Some(std::sync::Arc::new(rope));
        self.anchor_core = Some(cfg.clone());
        self.embryo_graph = None;
        tracing::info!(
            "bounded anchor {}: {n} layer(s), window {} sink {} — {} B of ring per layer",
            cfg.kind,
            cfg.window,
            cfg.sink,
            self.kv_cache
                .layers
                .iter()
                .map(|l| l.bounded_state_bytes())
                .max()
                .unwrap_or(0)
        );
        Ok(())
    }

    /// Tag every layer's cache with its wire record kind and the model's
    /// operator identity (hash64 of `linear_core_identity` JSON) so the
    /// versioned state wire refuses a peer holding another operator.
    pub fn install_wire_identity(&mut self, identity: u64) {
        for li in 0..self.kv_cache.layers.len() {
            let pl = self.phys_layer(li);
            let kind = match self.weights.layers.get(pl).map(|l| &l.attn) {
                Some(AttnKind::Bounded(_)) => crate::kv_cache::WireKind::Bounded,
                Some(AttnKind::Linear(_))
                | Some(AttnKind::LinearGdn(_))
                | Some(AttnKind::ShortConv(_))
                | Some(AttnKind::Kda(_)) => crate::kv_cache::WireKind::Linear,
                _ => crate::kv_cache::WireKind::Full,
            };
            let l = &mut self.kv_cache.layers[li];
            l.wire_kind = kind;
            l.wire_identity = identity;
            // A per-layer geometry (`set_attn_geometry`, Gemma's global
            // heads) rebuilds a layer cache with index 0: re-tag it.
            l.wire_layer = li as u32;
        }
    }

    /// Forget the reuse keys (legacy `kv_history` and the bounded prefix).
    pub fn clear_history(&mut self) {
        self.kv_history.clear();
        self.kv_history_device = false;
        self.kv_prefix.clear();
    }

    /// Did THIS pipeline's token graph refuse for a structural reason?
    /// (Per pipeline: another lane's refusal, or a new pipeline of the
    /// same model, never changes it.)
    pub fn graph_refused(&self) -> bool {
        self.graph_refused
            .load(std::sync::atomic::Ordering::Relaxed)
    }

    /// Remember a structural refusal of this pipeline's token graph.
    pub fn mark_graph_refused(&self) {
        if !self
            .graph_refused
            .swap(true, std::sync::atomic::Ordering::Relaxed)
        {
            tracing::info!(
                "token graph: unsupported for this pipeline (seq {}) — not retrying",
                self.graph_kv_id
            );
        }
    }

    /// Position the resident Embryo graph holds for this pipeline's
    /// sequence (`Some(next position)`), `None` when the device holds no
    /// image of it (host-owned sequence, or none started).
    pub fn device_sequence_position(&self) -> Option<usize> {
        crate::gpu::embryo_device_next_position(self.graph_kv_id)
    }

    /// Is the sequence this pipeline's reuse key describes owned by the
    /// device path it would take now? A prefix recorded on the resident
    /// graph continues only there (at exactly `n`), a host prefix only on
    /// the host; any mismatch means the next turn re-prefills from zero.
    fn prefix_owner_matches(&self, n: usize, recorded_on_device: bool) -> bool {
        let dev = self.device_sequence_position();
        if recorded_on_device {
            dev == Some(n) && self.embryo_resident_wanted()
        } else {
            dev.is_none()
        }
    }

    /// The weights under the sequence changed (a real skill switch): every
    /// cached state was computed by other weights. Clear the host KV /
    /// ring / recurrent state AND the reuse keys — a surviving `kv_prefix`
    /// would let the next turn "extend" a prefix the new weights never
    /// saw — drop the packed resident graph (it holds the old FFN
    /// tensors; the next build packs the live ones under a fresh id) and
    /// reset its device sequence.
    pub(crate) fn invalidate_for_weight_change(&mut self) {
        self.clear_sequence_state();
        self.embryo_graph = None;
    }

    /// The CUDA hybrid arm keeps a chat snapshot (GDN states copied on the
    /// card): a GDN stack with exact attention, no far field, reuse on.
    fn gdn_snap_ok(&self) -> bool {
        crate::gpu::cuda_active()
            && self.gdn_cfg.is_some()
            && self.o1_cfg.is_none()
            && self.dory.is_none()
            && self.dsv41.is_none()
            && self.qwen4_exp.is_none()
            && std::env::var("CMF_KV_REUSE").as_deref() != Ok("0")
    }

    /// Where this prompt's snapshot goes: its last `<|im_start|>`, the
    /// assistant header the next turn renders differently (a previous
    /// answer loses its think block there), past `from` and before the
    /// prompt's last row.
    fn gdn_snap_target(&self, input_ids: &[u32], from: usize) -> Option<usize> {
        if !self.gdn_snap_ok() {
            return None;
        }
        let id = self.tokenizer.token_to_id("<|im_start|>")?;
        let s = input_ids.iter().rposition(|&t| t == id)?;
        (s > from && s + 1 < input_ids.len()).then_some(s)
    }

    /// Positions a turn takes back from the chat snapshot (0: none). The
    /// card's states go back to it here, all layers or none.
    fn gdn_snap_reuse(&mut self, input_ids: &[u32]) -> usize {
        let n = match &self.gdn_snap {
            Some(s) if !s.is_empty() && s.len() < input_ids.len() && input_ids[..s.len()] == s[..] => s.len(),
            _ => return 0,
        };
        if !self.gdn_snap_ok() || !crate::gpu::gdn_snapshot_restore(self.graph_kv_id, n) {
            self.gdn_snap = None;
            return 0;
        }
        n
    }

    /// Prompt positions the cache already holds when `input_ids`
    /// strictly EXTENDS the consumed prefix (0 otherwise). Bounded-native
    /// models answer from the fixed-size `kv_prefix` record; everything
    /// else from the legacy `kv_history` vector (which the network split
    /// also reads and writes).
    fn cached_prefix_len(&self, input_ids: &[u32]) -> usize {
        let (n, on_device) = if self.bounded_native() {
            (
                self.kv_prefix.extension(input_ids),
                self.kv_prefix.on_device(),
            )
        } else {
            let h = &self.kv_history;
            if !h.is_empty() && h.len() < input_ids.len() && input_ids[..h.len()] == h[..] {
                (h.len(), self.kv_history_device)
            } else if !h.is_empty() && !self.kv_history_device {
                (self.rollback_prefix_len(input_ids), false)
            } else {
                (0, false)
            }
        };
        // The owner tag: the state the key describes must live where this
        // turn will continue it (R4) — else a fresh sequence.
        if n > 0 && !self.prefix_owner_matches(n, on_device) {
            tracing::warn!(
                "kv-reuse refused: the cached prefix ({n} positions) was built on the {} path, \
                 the device now holds {:?} — re-prefilling from zero",
                if on_device { "resident device" } else { "host" },
                self.device_sequence_position()
            );
            return 0;
        }
        n
    }

    /// Positions a turn whose ids DIVERGE from the consumed prefix keeps:
    /// their longest common prefix, when every layer can drop its rows past
    /// it exactly — full attention whose f32 rows the host owns (no wgpu
    /// mirror ahead of the host, no recurrent, O(1) or bounded state) and
    /// every trimmed sliding tail still holding the window the query at the
    /// cut reads. A chat app re-renders the previous answer through the
    /// template (a thinking model's history drops its `<think>` block), so a
    /// conversation almost never extends token for token: extension-only
    /// reuse re-prefilled the whole history every turn. One id at least is
    /// left to prefill. `CMF_KV_ROLLBACK=0` keeps extension-only reuse.
    fn rollback_prefix_len(&self, input_ids: &[u32]) -> usize {
        if std::env::var("CMF_KV_ROLLBACK").as_deref() == Ok("0")
            || self.device_sequence_position().is_some()
        {
            return 0;
        }
        let h = &self.kv_history;
        let lcp = h.iter().zip(input_ids).take_while(|(a, b)| a == b).count();
        let n = lcp.min(input_ids.len().saturating_sub(1));
        // Stacks that keep their own layers (qwen4, DSV4) leave the generic
        // ones empty: nothing here can roll back, the prompt is read again.
        if n == 0
            || self.kv_cache.layers.len() < self.num_layers
            || self.weights.layers.len() < self.num_layers
        {
            return 0;
        }
        let kv_id = self.graph_kv_id;
        for li in 0..self.num_layers {
            let l = &self.kv_cache.layers[li];
            let tail_ok = l.base() == 0
                || self
                    .layer_window(li)
                    .is_some_and(|w| l.base() + w <= n + 1);
            if !matches!(self.weights.layers[self.phys_layer(li)].attn, AttnKind::Full { .. })
                || l.o1.is_some()
                || l.bounded.is_some()
                || !l.linear_state.is_empty()
                || l.mode != crate::kv_cache::KvMode::F32
                || l.pos_len() != h.len()
                || !tail_ok
                || crate::gpu::graph_kv_stored(kv_id, li).is_some()
                || crate::gpu::graph_state_resident(kv_id, li)
            {
                return 0;
            }
        }
        n
    }

    /// Public view of the prefix-reuse decision for `input_ids` (positions
    /// the next `generate*` would take from the cache; 0 = fresh sequence).
    pub fn reusable_prefix_len(&self, input_ids: &[u32]) -> usize {
        self.cached_prefix_len(input_ids)
    }

    /// Record the forwarded prefix as the next turn's reuse key. A
    /// bounded-native model extends the rolling record (`reused` = the
    /// positions this turn found cached); others keep the literal vector.
    /// Either way the key carries its OWNER: the resident device graph
    /// (it holds an image of this sequence) or the host.
    fn record_consumed_prefix(&mut self, consumed: &[u32], reused: usize) {
        let on_device = self.device_sequence_position().is_some();
        if self.bounded_native() {
            let keep = reused > 0 && reused == self.kv_prefix.len() && reused <= consumed.len();
            let prev_device = self.kv_prefix.on_device();
            self.kv_history.clear();
            self.kv_history_device = false;
            if keep && prev_device == on_device {
                self.kv_prefix.extend(&consumed[reused..]);
            } else {
                self.kv_prefix.set(consumed);
            }
            self.kv_prefix.set_on_device(on_device);
        } else {
            self.kv_history = consumed.to_vec();
            self.kv_history_device = on_device;
        }
    }

    /// True when at least one layer runs the O(1) kernel.
    pub fn o1_active(&self) -> bool {
        self.o1_cfg.is_some() && self.o1_flags.iter().any(|&f| f)
    }

    /// Whether generation's prompt ingest is routed through the whole-token
    /// graph.  The bench uses this to label the measured generation prefill
    /// honestly; keep the predicate in Pipeline so CLI labels cannot drift
    /// from the production route.
    /// Positions per batched-graph submit for the prompt: `CMF_BATCH_K`
    /// when set (0 = one position at a time through the token graph),
    /// otherwise 128 (32 for a MoE stack) on a discrete card whose prompt
    /// takes the graph route.
    /// The batched graph read a 2048-token prompt at 53 tok/s against 28.5
    /// one position at a time on an RTX PRO 4000 (Qwen3.8-27B q4tp: TTFT
    /// 39 s against 72), and its states are the speculative verify's,
    /// measured identical to the plain path. macOS keeps its own arm.
    /// 128, not 32: the q4tp prefill GEMM tiles 64 batch rows, so a
    /// 32-row chunk left half of every tile idle. Qwen3.8-27B q4tp on an
    /// RTX 3090, 1000-token prompt: 51 tok/s at 32, 82 at 64, 95 at 128,
    /// 97 at 256; greedy output byte-identical to the 32-row chunks
    /// (every GEMM row and the k-looped recurrences are per position).
    /// A dense sliding-window stack whose batched prefill attends with the
    /// query-tiled kernels (the Spark-X2.6 class on a discrete wgpu card).
    #[cfg(not(target_os = "macos"))]
    fn tiled_sliding_batch(&self) -> bool {
        (self.sliding_layers.is_some() || self.swa.is_some())
            && !self.weights.layers.iter().any(|lw| matches!(&lw.ffn, FfnKind::Moe(_)))
            && crate::gpu::batched_attend_tiled()
    }

    pub fn generation_batch_k(&self) -> usize {
        if let Some(k) = std::env::var("CMF_BATCH_K")
            .ok()
            .and_then(|v| v.parse::<usize>().ok())
        {
            return k;
        }
        // Gemma-4 (`g4_batch_prefill`): 128-row chunks, the GEMM tile's
        // two 64-row halves full.
        if self.g4_batch_prefill() {
            return 128;
        }
        #[cfg(target_os = "macos")]
        if self.o1_active() && self.o1_on_graph() && crate::gpu::q1_force() && crate::gpu::enabled_here() {
            return if crate::gpu_metal::ane::wanted() { 512 } else { 128 };
        }
        // The sealed O(1) suffix of a bounded prompt (`CMF_O1_PREFILL`) on
        // the device route rides the batch graph, whose O(1) kernels take
        // the chunk in 64-row sub-chunks (`o1_batch`); 128 as the exact
        // prompt below. Without it the suffix went one position at a time.
        #[cfg(not(target_os = "macos"))]
        if self.o1_active()
            && self.o1_on_graph()
            && crate::gpu::enabled_here()
            && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill)
        {
            if let Some(k) = crate::gpu::cuda_batch_rows() {
                return k;
            }
            return if self.tiled_sliding_batch() { 512 } else { 128 };
        }
        #[cfg(not(target_os = "macos"))]
        if self.graph_prefill_preferred() && !self.o1_active() {
            // The CUDA batch graph expands each weight once a chunk and
            // multiplies with cuBLAS: its own, larger chunk (`CMF_CUDA_BATCH`).
            if let Some(k) = crate::gpu::cuda_batch_rows() {
                return k;
            }
            // A dense sliding-window stack on the tiled whole-run attend:
            // 512 rows a submit (Spark-X2.6 q4tp on an RTX 2000 Ada, 4096
            // tokens: 288 tok/s at 128, 317 at 512, the same greedy text;
            // the tile holds 16 tokens, and a chunk is read against its K/V
            // once per sub-run of whole tiles).
            if self.tiled_sliding_batch() {
                return 512;
            }
            // 128 is measured on the dense hybrids; MoE stacks other than
            // the two expert codecs below keep the 32 their expert-grouped
            // prefill was measured at.
            let moe = self
                .weights
                .layers
                .iter()
                .any(|lw| matches!(&lw.ffn, FfnKind::Moe(_)));
            // The dense GDN hybrids (Qwen3.5 / 3.6 / 3.8) on the tiled
            // attend: 512 rows a submit, each weight unpacked to its f16
            // plane once a chunk. Qwen3.5-4B q4tp on an RTX A5000, prompt
            // tok/s at 4 000 / 16 000 / 32 000 tokens: 1223 / 1122 / 977
            // at 128 rows, 1669 / 1550 / - at 256, 1833 / 1897 / 1539 at 512.
            if !moe && self.graph_gdn_layer_count() > 0 && crate::gpu::batched_attend_tiled() {
                return 512;
            }
            // q8_2f experts (moe_q82's grouped prefill) read each expert
            // once per group of up to 16 of its entries, so the chunk that
            // fills those groups is the faster ingest: Mellum2.1 q8_2f on an
            // RTX 3090, 4000-token prompt, 503 tok/s at 64 rows, 542 at 128
            // (and 542 at 256).
            let q82 = crate::gpu::moe_q82_graph_on()
                && self.weights.layers.iter().any(|lw| {
                    matches!(&lw.ffn, FfnKind::Moe(m)
                        if m.experts.first().is_some_and(|e| e.gate_proj.mapped_q8_2f().is_some()))
                });
            // q4tp experts: the grouped GEMM reads every routed expert once
            // per chunk, and 32 rows (256 entries over 256 experts, about
            // one row each) re-read nearly the whole expert set every 32
            // tokens. Apex-35B q4tp on an A40, 4096-token prompt, MTP off:
            // 295 tok/s at 32 rows, 357 at 64, 385 at 128, 401 at 256,
            // 396 at 512.
            let q4tp_moe = self.weights.layers.iter().any(|lw| {
                matches!(&lw.ffn, FfnKind::Moe(m)
                    if m.experts.first().is_some_and(|e| e.gate_proj.mapped_q4tp().is_some()))
            });
            return if q82 {
                128
            } else if q4tp_moe || self.onevision2_prefill() {
                256
            } else if moe {
                32
            } else {
                128
            };
        }
        0
    }

    pub fn generation_graph_prefill(&self) -> bool {
        let graph = self.graph_prefill_preferred();
        // On wgpu, an active MTP head now consumes the trunk's graph batches
        // and warms its own block from those returned rows.  The selected
        // generation measurement is therefore the batched path, even though
        // the underlying GDN model still satisfies the graph-prefill
        // predicate.  Keep the CLI label tied to the actual route.  Native
        // Metal has a separate prefill-batch arm and retains its historical
        // label here.
        // A batched prompt (`generation_batch_k` > 0) is the batched graph
        // for every model on the graph route, not only those with an MTP
        // head — the label follows the route.
        #[cfg(not(target_os = "macos"))]
        if graph && self.generation_batch_k() > 0 && std::env::var("CMF_MTP_CHAIN_PROBE").is_err() {
            return false;
        }
        graph
    }

    /// Device-side O(1) mirrors currently uploaded for this pipeline's
    /// sequence.  The count/bytes are zero before seal or after a fresh
    /// reset; callers use this to distinguish logical host state from the
    /// GPU allocation that actually serves decode.
    pub fn o1_device_stats(&self) -> (usize, u64) {
        crate::gpu::o1_device_stats(self.graph_kv_id)
    }

    /// Arm query collection on the o1 layers (fresh prompt pass).
    /// Reset the o1 layers to Collecting for a fresh sequence. Pub for the
    /// network split: each side runs the o1 lifecycle over ITS OWN layers
    /// (begin before prefill, seal at the prefill barrier).
    pub fn o1_begin(&mut self) {
        self.o1_begin_with_prefix(None);
    }

    /// Arm collection and optionally request a positive calibration prefix.
    /// The effective barrier is always at least the skeleton-safe floor, so
    /// a short requested prefix cannot create an exact-only runtime state.
    pub fn o1_begin_with_prefix(&mut self, requested_prefix: Option<usize>) {
        if let Some(c) = &self.o1_cfg {
            let (m, w, sink, rect) = (c.m, c.w, c.sink, c.rect);
            let boundary = requested_prefix.map(|p| {
                p.max(
                    crate::nystrom::o1_deferred_boundary(w, sink)
                        .expect("o1 config boundary validated in set_o1"),
                )
            });
            // Exact rows are chosen across every far-field layer at the boundary:
            // a layer that reached it first must not seal without them.
            let await_keep = boundary.is_some() && self.o1_exact_cfg().is_some();
            for (li, &f) in self.o1_flags.iter().enumerate() {
                if f {
                    let cache = &mut self.kv_cache.layers[li];
                    cache.o1_begin_with_boundary(m, w, sink, rect, boundary);
                    cache.o1_await_keep = await_keep;
                }
            }
        }
    }

    /// Effective deferred boundary for a positive prefix request.
    fn o1_effective_boundary(&self, requested_prefix: usize) -> Option<usize> {
        self.o1_cfg.as_ref().and_then(|c| {
            crate::nystrom::o1_deferred_boundary(c.w, c.sink)
                .map(|floor| requested_prefix.max(floor))
        })
    }

    fn o1_note_transition(&mut self) {
        // Drain every layer's one-shot bit before publishing one pipeline
        // epoch. `any()` would short-circuit on the first layer and leak the
        // remaining bits into later forwards, causing one epoch per layer.
        let mut transitioned = false;
        for (li, &flagged) in self.o1_flags.iter().enumerate() {
            if flagged {
                transitioned |= self.kv_cache.layers[li].take_o1_transition();
            }
        }
        if transitioned {
            self.o1_epoch = self.o1_epoch.wrapping_add(1);
        }
    }

    fn o1_pending(&self) -> bool {
        self.o1_flags.iter().enumerate().any(|(li, &f)| {
            f && self.kv_cache.layers[li].seq_len > 0
                && self.kv_cache.layers[li].o1_pending_boundary().is_some()
        })
    }

    fn o1_fail(&mut self, err: String) {
        tracing::error!("o1 deferred seal failed; terminating sequence: {err}");
        self.clear_sequence_state();
        self.graph_failed
            .store(true, std::sync::atomic::Ordering::Relaxed);
        self.cancel
            .store(true, std::sync::atomic::Ordering::Relaxed);
    }

    /// Seal participating layers while retaining the exact state when the
    /// prompt is below the deferred boundary. A split worker may have
    /// collecting layers outside its owned span; zero-depth layers remain
    /// armed and are intentionally skipped until their peer runs them.
    pub fn o1_seal_checked(&mut self) -> Result<bool, String> {
        if self.o1_cfg.is_none() {
            return Ok(false);
        }
        self.o1_choose_exact_rows();
        let (t_seal, mut sealed_now, epoch) = (std::time::Instant::now(), 0usize, self.o1_epoch);
        let mut todo: Vec<(usize, usize)> = Vec::new();
        for li in 0..self.num_layers {
            if !self.o1_flags.get(li).copied().unwrap_or(false) {
                continue;
            }
            if let Some(err) = self.kv_cache.layers[li].take_o1_error() {
                return Err(err);
            }
            if self.kv_cache.layers[li].seq_len == 0 {
                continue;
            }
            todo.push((li, self.layer_num_heads(li)));
        }
        let participating = !todo.is_empty();
        // A layer's seal depends on that layer's rows alone, and its groups
        // already seal on their own threads: a few layers go at a time, as
        // many as the cores carry (`CMF_O1_SEAL_PAR=N` sets the number). Each
        // holds its queries per group while it seals, so not all at once —
        // and one after another on a Mac, where that memory is the model's
        // too.
        let par = std::env::var("CMF_O1_SEAL_PAR")
            .ok()
            .and_then(|v| v.parse::<usize>().ok())
            .unwrap_or_else(|| {
                if cfg!(target_os = "macos") {
                    return 1;
                }
                let cores = std::thread::available_parallelism().map_or(1, |n| n.get());
                let groups = todo.first().map_or(1, |&(li, _)| self.kv_cache.layers[li].num_kv_heads.max(1));
                cores.div_ceil(groups).clamp(1, 3)
            })
            .max(1);
        let mut slots: Vec<Option<&mut crate::kv_cache::LayerKvCache>> = self.kv_cache.layers.iter_mut().map(Some).collect();
        let mut jobs: Vec<(&mut crate::kv_cache::LayerKvCache, usize)> =
            todo.iter().filter_map(|&(li, nh)| slots[li].take().map(|c| (c, nh))).collect();
        for run in jobs.chunks_mut(par) {
            let done: Vec<Result<bool, String>> = if run.len() == 1 {
                let (c, nh) = &mut run[0];
                let was = c.o1_sealed();
                vec![c.o1_seal_checked(*nh).map(|ok| ok && !was)]
            } else {
                std::thread::scope(|s| {
                    let hs: Vec<_> = run
                        .iter_mut()
                        .map(|(c, nh)| {
                            let nh = *nh;
                            s.spawn(move || {
                                let was = c.o1_sealed();
                                c.o1_seal_checked(nh).map(|ok| ok && !was)
                            })
                        })
                        .collect();
                    hs.into_iter()
                        .map(|h| h.join().unwrap_or_else(|_| Err("o1 seal: a layer's thread panicked".into())))
                        .collect()
                })
            };
            for r in done {
                sealed_now += r? as usize;
            }
        }
        drop(jobs);
        drop(slots);
        self.o1_note_transition();
        if self.o1_epoch != epoch && sealed_now > 0 {
            tracing::info!("o1: {sealed_now} layer(s) sealed in {:.2} s", t_seal.elapsed().as_secs_f64());
        }
        for li in 0..self.num_layers {
            if self.o1_flags.get(li).copied().unwrap_or(false) {
                if let Some(err) = self.kv_cache.layers[li].take_o1_error() {
                    return Err(err);
                }
            }
        }
        Ok(participating
            && (0..self.num_layers).all(|li| {
                !self.o1_flags.get(li).copied().unwrap_or(false)
                    || self.kv_cache.layers[li].seq_len == 0
                    || self.kv_cache.layers[li].o1_sealed()
            }))
    }

    /// A sealed chunk's rows join the archive.
    fn o1_archive_chunk(&self, a: &mut O1Archive, pos: usize, bk: usize) -> Result<(), String> {
        let got = crate::gpu::o1_acap_take().ok_or("O(1) archive: readback failed")?;
        let qrow = a.nh * a.hd;
        let stride = a.stride;
        // a backend may hand back the kept query rows alone (CUDA)
        let kept = (pos..pos + bk).filter(|p| p % stride == 0).count();
        for (gl, q, k, v) in got {
            let Some(l) = a.layers.iter_mut().find(|l| l.li == gl) else { continue };
            l.k.push(&k)?;
            l.v.push(&v)?;
            if q.len() == kept * qrow && kept != bk {
                l.q.push(&q)?;
                continue;
            }
            if q.len() != bk * qrow {
                return Err(format!("O(1) archive: layer {gl} handed back {} query values", q.len()));
            }
            for p in pos..pos + bk {
                if p % stride == 0 {
                    l.q.push(&q[(p - pos) * qrow..(p - pos + 1) * qrow])?;
                }
            }
        }
        a.rows = pos + bk;
        Ok(())
    }

    /// The far field built anew over all the rows read so far, the chosen ones out of it.
    /// One layer at a time, so RAM holds one layer's rows.
    fn o1_seal_archive(&mut self, a: O1Archive) -> Result<bool, String> {
        let t0 = std::time::Instant::now();
        let (rows, stride, nk, hd) = (a.rows, a.stride, a.nk, a.hd);
        let mut layers = Vec::with_capacity(a.layers.len());
        for l in a.layers {
            layers.push((l.li, l.k.freeze()?, l.v.freeze()?, l.q.freeze()?));
        }
        let keep = match (self.o1_exact_cfg().cloned(), self.o1_cfg.clone()) {
            (Some(x), Some(c)) => {
                let views: Vec<crate::dory::FlatRows> = layers.iter().map(|l| crate::dory::FlatRows { k: l.1.as_slice(), v: l.2.as_slice(), nk, hd }).collect();
                let refs: Vec<&dyn crate::dory::LayerRows> = views.iter().map(|v| v as &dyn crate::dory::LayerRows).collect();
                crate::dory::pick_exact_rows(&x, &refs, rows, nk, hd, c.m, c.sink, rows.saturating_sub(c.w))
            }
            _ => Vec::new(),
        };
        let t_pick = t0.elapsed().as_secs_f64();
        let mut all = !layers.is_empty();
        let prof = std::env::var("CMF_PREFILL_PROF").is_ok();
        let t_layers = std::time::Instant::now();
        // a few layers at a time (`CMF_O1_SEAL_PAR`), each on its own thread: a
        // layer's rows into its cache, then its seal (its groups on threads of
        // their own); RAM holds those layers' rows twice meanwhile
        let par = std::env::var("CMF_O1_SEAL_PAR")
            .ok()
            .and_then(|v| v.parse::<usize>().ok())
            .unwrap_or_else(|| std::thread::available_parallelism().map_or(1, |p| p.get()).div_ceil(8).clamp(1, 4));
        let heads: Vec<usize> = (0..self.kv_cache.layers.len()).map(|li| self.layer_num_heads(li)).collect();
        let mut by_li: Vec<Option<_>> = (0..self.kv_cache.layers.len()).map(|_| None).collect();
        for (li, k, v, q) in layers {
            if li < by_li.len() {
                by_li[li] = Some((k, v, q));
            }
        }
        let mut jobs: Vec<(usize, &mut crate::kv_cache::LayerKvCache, _)> = Vec::new();
        for (li, cache) in self.kv_cache.layers.iter_mut().enumerate() {
            if let Some(d) = by_li[li].take() {
                jobs.push((li, cache, d));
            }
        }
        let keep_ref = &keep;
        let heads = &heads;
        let results: Vec<Result<bool, String>> = std::thread::scope(|sc| {
            let mut out = Vec::new();
            let mut jobs = jobs.into_iter();
            loop {
                let wave: Vec<_> = jobs.by_ref().take(par.max(1)).collect();
                if wave.is_empty() {
                    break;
                }
                let hs: Vec<_> = wave
                    .into_iter()
                    .map(|(li, cache, (k, v, q))| {
                        sc.spawn(move || -> Result<bool, String> {
                            if !cache.o1_recollect(k.as_slice(), v.as_slice(), q.as_slice().to_vec(), stride, rows) {
                                return Err(format!("O(1) archive: layer {li} is not sealed"));
                            }
                            drop((k, v, q));
                            cache.o1_keep = keep_ref.clone();
                            cache.o1_seal_checked(heads[li])
                        })
                    })
                    .collect();
                for h in hs {
                    out.push(h.join().unwrap_or_else(|_| Err("O(1) archive: a layer's seal panicked".into())));
                }
            }
            out
        });
        for r in results {
            all &= r?;
        }
        if prof {
            eprintln!("o1 archive seal: {} layers {par} at a time in {:.2} s", by_li.len(), t_layers.elapsed().as_secs_f64());
        }
        self.o1_note_transition();
        tracing::info!(
            "o1: far field rebuilt over {rows} rows, {} kept exact, chosen in {t_pick:.2} s, {:.2} s in all",
            keep.len(),
            t0.elapsed().as_secs_f64()
        );
        Ok(all)
    }

    /// A sealed prompt chunk on the device: wgpu's batch graph, or Metal's rows graph.
    fn o1_prompt_chunk(&mut self, hiddens: &mut Vec<f32>, positions: &[usize], bk: usize) -> crate::gpu::BatchGraphOutcome {
        #[cfg(target_os = "macos")]
        if crate::gpu::q1_force() && self.o1_active() {
            return match self.prefill_hiddens_metal(hiddens.clone(), positions[0], None) {
                MetalPrefillOutcome::Completed(h) => {
                    *hiddens = h;
                    crate::gpu::BatchGraphOutcome::Completed
                }
                MetalPrefillOutcome::Declined => crate::gpu::BatchGraphOutcome::Declined,
                MetalPrefillOutcome::Failed => crate::gpu::BatchGraphOutcome::Failed,
            };
        }
        self.try_batch_graph_wgpu(hiddens, positions, bk, None)
    }

    /// `o1_prefix_on_graph` on Metal: the prompt's exact part on the rows graph, which leaves its
    /// rows in the host cache and the mirror. Queries come from the graph, one row in `QT_STRIDE`.
    #[cfg(target_os = "macos")]
    fn o1_prefix_on_metal(
        &mut self,
        ids: &[u32],
        chunk: usize,
        mut arch: Option<&mut O1Archive>,
    ) -> Result<Option<Vec<f32>>, String> {
        const QT_STRIDE: usize = 8;
        let o1_layers: Vec<usize> = (0..self.num_layers)
            .filter(|&li| self.o1_flags.get(li).copied().unwrap_or(false))
            .collect();
        let Some(&first) = o1_layers.first() else {
            return Ok(None);
        };
        let (nkv, hd) = {
            let c = &self.kv_cache.layers[first];
            (c.num_kv_heads, c.head_dim)
        };
        let nh = self.num_heads;
        if chunk == 0
            || o1_layers.iter().any(|&li| {
                let c = &self.kv_cache.layers[li];
                self.layer_num_heads(li) != nh
                    || (c.num_kv_heads, c.head_dim) != (nkv, hd)
                    || c.seq_len != 0
                    || c.o1_pending_boundary().is_none()
            })
        {
            return Ok(None);
        }
        let hs = self.hidden_size;
        let n = ids.len();
        let mut last = vec![0f32; hs];
        let qrow = nh * hd;
        let mut qs: Vec<Vec<f32>> = vec![Vec::new(); o1_layers.len()];
        crate::gpu_metal::o1c::qcap_begin(&o1_layers);
        for &li in &o1_layers {
            self.kv_cache.layers[li].o1_set_q_stride(QT_STRIDE);
        }
        let mut pos = 0;
        // Layers the rows graph does not hold (Spark-X2.6: GELU, per-head
        // gates, sliding windows) read the prefix on the chunk graph, which
        // keeps the collecting layers' queries too. Without it the prefix
        // went to the host walk: 14 000 tokens in 155 s against 53 s exact.
        let mut on_chunks = false;
        let mut step = chunk;
        while pos < n {
            let end = (pos + step).min(n);
            let bk = end - pos;
            let mut hiddens = vec![0f32; bk * hs];
            for (j, &id) in ids[pos..end].iter().enumerate() {
                hiddens[j * hs..(j + 1) * hs].copy_from_slice(&self.embed_single(id));
            }
            let rows = if on_chunks {
                MetalPrefillOutcome::Declined
            } else {
                self.prefill_hiddens_metal(hiddens.clone(), pos, None)
            };
            match rows {
                MetalPrefillOutcome::Completed(h) => last.copy_from_slice(&h[(bk - 1) * hs..]),
                MetalPrefillOutcome::Declined if pos == 0 || on_chunks => {
                    if !on_chunks {
                        on_chunks = true;
                        // The chunk graph's own prompt chunk.
                        let want = self.prefill_chunk().max(chunk);
                        if want != step {
                            step = want;
                            continue;
                        }
                    }
                    self.o1_chunk_prefix = true;
                    let got = self.chunk_run_gpu(0, &mut hiddens, bk, pos, None, self.num_layers);
                    self.o1_chunk_prefix = false;
                    if got != self.num_layers {
                        crate::gpu_metal::o1c::cap_end();
                        if pos == 0 && got == 0 {
                            for &li in &o1_layers {
                                self.kv_cache.layers[li].o1_set_q_stride(1);
                            }
                            return Ok(None);
                        }
                        return Err("O(1) prefix: the Metal chunk graph stopped after admission".into());
                    }
                    // Every layer appended the chunk: sliding layers keep their tails only.
                    self.swa_trim_tails();
                    last.copy_from_slice(&hiddens[(bk - 1) * hs..]);
                }
                _ => {
                    crate::gpu_metal::o1c::cap_end();
                    return Err("O(1) prefix: the Metal rows graph stopped after admission".into());
                }
            }
            for (li, q, _, _) in crate::gpu_metal::o1c::cap_take() {
                let Some(i) = o1_layers.iter().position(|&l| l == li) else { continue };
                if q.len() != bk * qrow {
                    crate::gpu_metal::o1c::cap_end();
                    return Err(format!("O(1) prefix: {} query values, expected {}", q.len(), bk * qrow));
                }
                for p in pos..end {
                    if p % QT_STRIDE == 0 {
                        qs[i].extend_from_slice(&q[(p - pos) * qrow..(p - pos + 1) * qrow]);
                    }
                }
            }
            pos = end;
        }
        crate::gpu_metal::o1c::cap_end();
        let row = nkv * hd;
        for (&li, q) in o1_layers.iter().zip(qs) {
            if q.len() != n.div_ceil(QT_STRIDE) * qrow {
                return Err(format!("O(1) prefix: layer {li} kept {} query values", q.len()));
            }
            if let Some(a) = arch.as_deref_mut() {
                let (mut k, mut v) = (vec![0f32; n * row], vec![0f32; n * row]);
                if !crate::gpu_metal::kv_mirror_read_rows(self.graph_kv_id, li, nkv, hd, 0, n, &mut k, &mut v) {
                    return Err("O(1) prefix: K/V readback failed".into());
                }
                let dir = a.dir.clone();
                let mut layer = O1ArchLayer {
                    li,
                    k: ArchStore::new(dir.as_deref(), format!("{li}-k"))?,
                    v: ArchStore::new(dir.as_deref(), format!("{li}-v"))?,
                    q: ArchStore::new(dir.as_deref(), format!("{li}-q"))?,
                };
                layer.k.push(&k)?;
                layer.v.push(&v)?;
                layer.q.push(&q)?;
                a.layers.push(layer);
                a.rows = n;
                a.stride = QT_STRIDE;
                a.nh = nh;
                a.nk = nkv;
                a.hd = hd;
            }
            self.kv_cache.layers[li].o1_set_q_trace(q);
        }
        Ok(Some(last))
    }

    fn o1_exact_cfg(&self) -> Option<&crate::dory::ExactRows> {
        static EXACT: std::sync::OnceLock<Option<crate::dory::ExactRows>> = std::sync::OnceLock::new();
        EXACT
            .get_or_init(|| crate::dory::exact_from_var("CMF_O1_EXACT"))
            .as_ref()
            .or(self.o1_turbo.as_ref().map(|t| &t.exact))
    }

    pub fn is_far_turbo(&self) -> bool {
        self.o1_turbo.is_some() && self.o1_graph_backend()
    }

    /// A backend with the far field's prompt path and stages.
    fn o1_graph_backend(&self) -> bool {
        crate::gpu::wgpu_active() || crate::gpu::cuda_active() || crate::gpu::backend_name() == "metal"
    }

    /// The whole prompt is read exact on the card, and one seal after it
    /// chooses among all of its rows, with the question's queries in the
    /// trace. The CUDA graph's way where it has no sealed-chunk kernels (the
    /// dense arm); its hybrid arm reads a prompt past the first seal in chunks
    /// as the wgpu graph does, so memory stays at the seal's
    /// (`CMF_O1_CHUNKS=0` reads it whole there too). `CMF_O1_WHOLE=1` takes
    /// either graph the whole way, so the two can be compared row for row.
    #[cfg(not(target_os = "macos"))]
    fn o1_whole_prompt(&self) -> bool {
        if std::env::var("CMF_O1_WHOLE").as_deref() == Ok("1") {
            return true;
        }
        crate::gpu::cuda_active() && (self.graph_gdn_layer_count() == 0 || std::env::var("CMF_O1_CHUNKS").as_deref() == Ok("0"))
    }

    pub fn far_turbo_seal(&self) -> usize {
        self.o1_turbo.as_ref().map_or(usize::MAX, |t| t.seal)
    }

    /// The draft head on top of a far field: a verify's rows attend, and the state moves
    /// over the accepted ones only. On the wgpu graph; `CMF_O1_SPEC=0` turns it off.
    fn o1_spec(&self) -> bool {
        self.o1_active()
            && self.o1_on_graph()
            && self.o1_graph_backend()
            && (self.o1_turbo.is_some() || std::env::var("CMF_O1_SPEC").as_deref() == Ok("1"))
            && std::env::var("CMF_O1_SPEC").as_deref() != Ok("0")
    }

    /// The far field rides the device graph: asked for, or a turbo file's way.
    fn o1_on_graph(&self) -> bool {
        self.o1_turbo.is_some() || std::env::var("CMF_O1_GPU").as_deref() == Ok("1")
    }

    /// A turbo file takes the far field for a long prompt and leaves it for a short one,
    /// where exact attention and speculation are the faster way.
    fn o1_turbo_gate(&mut self, prompt_rows: usize) {
        // Off the wgpu and Metal graphs the far field would run on the host, so a turbo file
        // runs as the plain file it holds.
        if !self.is_far_turbo() {
            return;
        }
        let Some(t) = self.o1_turbo.clone() else { return };
        let want = prompt_rows >= t.seal;
        if want != self.o1_active() {
            self.clear_sequence_state();
            if let Err(e) = self.try_set_o1(want.then(|| t.cfg.clone())) {
                tracing::warn!("turbo file: the far field is off: {e}");
                self.o1_turbo = None;
            }
        }
    }

    /// The rows this seal keeps exact (`CMF_O1_EXACT=FILE:rows`), the same in every layer.
    fn o1_choose_exact_rows(&mut self) {
        let Some(x) = self.o1_exact_cfg().cloned() else { return };
        let Some(c) = self.o1_cfg.clone() else { return };
        let layers: Vec<usize> = (0..self.num_layers)
            .filter(|&li| self.o1_flags.get(li).copied().unwrap_or(false) && self.kv_cache.layers[li].seq_len > 0 && self.kv_cache.layers[li].o1_is_collecting())
            .collect();
        let Some(&first) = layers.first() else { return };
        let rows = self.kv_cache.layers[first].seq_len;
        let floor = crate::nystrom::o1_deferred_boundary(c.w, c.sink).unwrap_or(usize::MAX);
        let target = self.kv_cache.layers[first].o1_pending_boundary().unwrap_or(floor).max(floor);
        if rows < target || layers.iter().any(|&li| self.kv_cache.layers[li].seq_len != rows) {
            return;
        }
        let t0 = std::time::Instant::now();
        let (nk, hd) = (self.kv_cache.layers[first].num_kv_heads, self.kv_cache.layers[first].head_dim);
        let keep = {
            let views: Vec<_> = layers.iter().map(|&li| self.kv_cache.layers[li].group_rows()).collect();
            let refs: Vec<&dyn crate::dory::LayerRows> = views.iter().map(|v| v as &dyn crate::dory::LayerRows).collect();
            crate::dory::pick_exact_rows(&x, &refs, rows, nk, hd, c.m, c.sink, rows.saturating_sub(c.w))
        };
        tracing::info!("o1: {} exact rows of {rows} chosen in {:.2} s", keep.len(), t0.elapsed().as_secs_f64());
        for &li in &layers {
            self.kv_cache.layers[li].o1_keep = keep.clone();
        }
    }

    /// Complete a deferred boundary after a full position/span forward.
    /// This is the pipeline owner for epoch publication and failure cleanup.
    fn o1_progress(&mut self) {
        if !self.o1_active() {
            return;
        }
        for li in 0..self.num_layers {
            if self.o1_flags.get(li).copied().unwrap_or(false) {
                if let Some(err) = self.kv_cache.layers[li].take_o1_error() {
                    self.o1_fail(err);
                    return;
                }
            }
        }
        // A qwen_attention row can seal in the middle of a complete layer
        // walk. Consume its transition even though the pending boundary has
        // already disappeared from the cache.
        self.o1_note_transition();
        if !self.o1_pending() {
            return;
        }
        if let Err(err) = self.o1_seal_checked() {
            self.o1_fail(err);
        }
    }

    /// Turn a deferred O(1) failure raised by a hidden-only forward into the
    /// Result error its public batch/span caller must return. The failure
    /// path already cleared host/device sequence state; consume only the
    /// side-channel marker here and leave the pipeline reusable.
    fn check_o1_progress_failure(&mut self, phase: &str) -> Result<(), String> {
        if self
            .graph_failed
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            self.cancel
                .store(false, std::sync::atomic::Ordering::Relaxed);
            self.clear_sequence_state();
            return Err(format!("{phase}: deferred O(1) transition failed"));
        }
        Ok(())
    }

    /// Freeze landmarks + skeleton state after the prompt pass and drop
    /// the o1 layers' full KV; decode then runs `step()` per token.
    /// Pub for the network split (see `o1_begin`).
    pub fn o1_seal(&mut self) {
        if let Err(err) = self.o1_seal_checked() {
            self.o1_fail(err);
        }
    }

    /// Run a bounded O(1) prefix (`ids`, positions 0..) through the batch
    /// graph instead of the host prefill: the same exact attention, with the
    /// O(1) layers' rotated queries captured on the device and their K/V rows
    /// read back from the mirror, so each layer's collector holds what the
    /// host walk would have given its seal. The recurrent and exact layers'
    /// state stays on the device for the sealed suffix batches.
    /// `Ok(None)`: declined before any device state moved — the caller runs
    /// the host prefill. `Ok(Some(h))`: the last prefix row's hidden.
    fn o1_prefix_on_graph(
        &mut self,
        ids: &[u32],
        chunk: usize,
        mut arch: Option<&mut O1Archive>,
    ) -> Result<Option<Vec<f32>>, String> {
        let o1_layers: Vec<usize> = (0..self.num_layers)
            .filter(|&li| self.o1_flags.get(li).copied().unwrap_or(false))
            .collect();
        let Some(&first) = o1_layers.first() else {
            return Ok(None);
        };
        let (nkv, hd) = {
            let c = &self.kv_cache.layers[first];
            (c.num_kv_heads, c.head_dim)
        };
        let nh = self.num_heads;
        if chunk == 0
            || o1_layers.iter().any(|&li| {
                let c = &self.kv_cache.layers[li];
                self.layer_num_heads(li) != nh
                    || (c.num_kv_heads, c.head_dim) != (nkv, hd)
                    || c.seq_len != 0
                    || c.o1_pending_boundary().is_none()
            })
            || !crate::gpu::o1_qcap_begin(&o1_layers)
        {
            return Ok(None);
        }
        let hs = self.hidden_size;
        let n = ids.len();
        let mut last = vec![0f32; hs];
        let mut pos = 0;
        self.o1_prefix_tail.clear();
        // `CMF_PREFILL_PROF`: where the prefix's time goes (the chunks, the
        // queries off the card, the K/V rows off the card, their way into the cache).
        let prof = std::env::var("CMF_PREFILL_PROF").is_ok();
        let (mut t_chunks, mut t_q) = (0f64, 0f64);
        // The seal's queries leave the card chunk by chunk, one row in `QT_STRIDE`: its
        // landmarks are means over long segments.
        const QT_STRIDE: usize = 8;
        let qrow = nh * hd;
        // A backend may hand back the kept rows alone (CUDA gathers them on the card).
        let strided = crate::gpu::o1_qcap_stride(QT_STRIDE);
        let mut qs: Vec<Vec<f32>> = vec![Vec::new(); o1_layers.len()];
        while pos < n {
            let end = (pos + chunk).min(n);
            let bk = end - pos;
            let mut hiddens = vec![0f32; bk * hs];
            for (j, &id) in ids[pos..end].iter().enumerate() {
                hiddens[j * hs..(j + 1) * hs].copy_from_slice(&self.embed_single(id));
            }
            let positions: Vec<usize> = (pos..end).collect();
            let t_c = std::time::Instant::now();
            let outcome = self.try_batch_graph_wgpu(&mut hiddens, &positions, bk, None);
            t_chunks += t_c.elapsed().as_secs_f64();
            let t_d = std::time::Instant::now();
            match outcome {
                crate::gpu::BatchGraphOutcome::Completed => {
                    last.copy_from_slice(&hiddens[(bk - 1) * hs..]);
                    // the prompt's tail for the draft head over the far field
                    let tail_from = n.saturating_sub(crate::dory::EXACT_TAIL);
                    if end > tail_from {
                        let from = pos.max(tail_from);
                        self.o1_prefix_tail.extend_from_slice(&hiddens[(from - pos) * hs..]);
                    }
                }
                crate::gpu::BatchGraphOutcome::Declined if pos == 0 => {
                    let _ = crate::gpu::o1_qcap_take();
                    return Ok(None);
                }
                _ => {
                    let _ = crate::gpu::o1_qcap_take();
                    return Err("O(1) prefix batch graph stopped after admission".into());
                }
            }
            let Some(drained) = crate::gpu::o1_qcap_drain() else {
                let _ = crate::gpu::o1_qcap_take();
                return Err("O(1) prefix: query readback failed".into());
            };
            for (i, (_, rows)) in drained.iter().enumerate() {
                if strided {
                    let kept = (pos..end).filter(|p| p % QT_STRIDE == 0).count();
                    if rows.len() != kept * qrow {
                        let _ = crate::gpu::o1_qcap_take();
                        return Err(format!("O(1) prefix: {} query values, expected {}", rows.len(), kept * qrow));
                    }
                    qs[i].extend_from_slice(rows);
                    continue;
                }
                if rows.len() != bk * qrow {
                    let _ = crate::gpu::o1_qcap_take();
                    return Err(format!("O(1) prefix: {} query values, expected {}", rows.len(), bk * qrow));
                }
                for p in pos..end {
                    if p % QT_STRIDE == 0 {
                        qs[i].extend_from_slice(&rows[(p - pos) * qrow..(p - pos + 1) * qrow]);
                    }
                }
            }
            t_q += t_d.elapsed().as_secs_f64();
            pos = end;
        }
        let _ = crate::gpu::o1_qcap_take();
        let t_kv = std::time::Instant::now();
        let pulls: Vec<(usize, usize, usize)> = o1_layers.iter().map(|&li| (li, 0, n)).collect();
        let kv = crate::gpu::graph_kv_read_rows(self.graph_kv_id, &pulls, nkv, hd)
            .ok_or("O(1) prefix: K/V readback failed")?;
        let (t_kv, t_app) = (t_kv.elapsed().as_secs_f64(), std::time::Instant::now());
        let row = nkv * hd;
        if arch.is_none() {
            // without an archive each layer's rows go into its own cache: the
            // layers side by side
            for ((&li, q), (k, v)) in o1_layers.iter().zip(&qs).zip(&kv) {
                if k.len() != n * row || v.len() != n * row || q.len() != n.div_ceil(QT_STRIDE) * qrow {
                    return Err(format!(
                        "O(1) prefix: layer {li} read back {}/{}/{} values, expected {}/{}/{}",
                        k.len(),
                        v.len(),
                        q.len(),
                        n * row,
                        n * row,
                        n.div_ceil(QT_STRIDE) * qrow
                    ));
                }
            }
            let mut work: Vec<(&mut crate::kv_cache::LayerKvCache, Vec<f32>, (Vec<f32>, Vec<f32>))> = Vec::new();
            let mut by_layer: Vec<Option<(Vec<f32>, (Vec<f32>, Vec<f32>))>> = (0..self.kv_cache.layers.len()).map(|_| None).collect();
            for ((&li, q), kvp) in o1_layers.iter().zip(qs).zip(kv) {
                by_layer[li] = Some((q, kvp));
            }
            for (cache, slot) in self.kv_cache.layers.iter_mut().zip(by_layer) {
                if let Some((q, kvp)) = slot {
                    work.push((cache, q, kvp));
                }
            }
            let par = std::thread::available_parallelism().map_or(1, |p| p.get()).clamp(1, 8);
            let per = work.len().div_ceil(par).max(1);
            std::thread::scope(|sc| {
                for part in work.chunks_mut(per) {
                    sc.spawn(move || {
                        for (cache, q, (k, v)) in part.iter_mut() {
                            cache.o1_set_q_stride(QT_STRIDE);
                            cache.reserve_rows(n);
                            for p in 0..n {
                                cache.append(&k[p * row..(p + 1) * row], &v[p * row..(p + 1) * row], &[]);
                            }
                            cache.o1_set_q_trace(std::mem::take(q));
                        }
                    });
                }
            });
            if prof {
                eprintln!(
                    "o1 prefix: {n} rows, chunks {t_chunks:.2} s, queries off the card {t_q:.2} s, K/V off the card {t_kv:.2} s, into the cache {:.2} s",
                    t_app.elapsed().as_secs_f64()
                );
            }
            return Ok(Some(last));
        }
        for ((&li, q), (k, v)) in o1_layers.iter().zip(qs).zip(kv) {
            if k.len() != n * row || v.len() != n * row || q.len() != n.div_ceil(QT_STRIDE) * qrow {
                return Err(format!(
                    "O(1) prefix: layer {li} read back {}/{}/{} values, expected {}/{}/{}",
                    k.len(),
                    v.len(),
                    q.len(),
                    n * row,
                    n * row,
                    n.div_ceil(QT_STRIDE) * qrow
                ));
            }
            let cache = &mut self.kv_cache.layers[li];
            cache.o1_set_q_stride(QT_STRIDE);
            cache.reserve_rows(n);
            for p in 0..n {
                cache.append(&k[p * row..(p + 1) * row], &v[p * row..(p + 1) * row], &[]);
            }
            if let Some(a) = arch.as_deref_mut() {
                let dir = a.dir.clone();
                let mut layer = O1ArchLayer {
                    li,
                    k: ArchStore::new(dir.as_deref(), format!("{li}-k"))?,
                    v: ArchStore::new(dir.as_deref(), format!("{li}-v"))?,
                    q: ArchStore::new(dir.as_deref(), format!("{li}-q"))?,
                };
                layer.k.push(&k)?;
                layer.v.push(&v)?;
                layer.q.push(&q)?;
                a.layers.push(layer);
                a.rows = n;
                a.stride = QT_STRIDE;
                a.nh = nh;
                a.nk = nkv;
                a.hd = hd;
            }
            cache.o1_set_q_trace(q);
        }
        if prof {
            eprintln!(
                "o1 prefix: {n} rows, chunks {t_chunks:.2} s, queries off the card {t_q:.2} s, K/V off the card {t_kv:.2} s, into the cache {:.2} s",
                t_app.elapsed().as_secs_f64()
            );
        }
        Ok(Some(last))
    }

    /// Enable/disable the structured per-token telemetry trace (B4).
    pub fn set_trace(&mut self, on: bool) {
        self.trace = on;
    }

    /// Replace all request-scoped sampler options and reset the random stream.
    /// This is required for deterministic `seed` semantics in pooled servers.
    pub fn set_sampler_config(&mut self, config: SamplerConfig) {
        self.rng = match config.seed {
            Some(seed) => SplitMix64::new(seed),
            None => SplitMix64::from_entropy(),
        };
        self.sampler_config = config;
    }

    /// Toggle the per-token confidence reduction (a full-vocab
    /// softmax each token). `bench --core` turns it off so the timed
    /// loop matches llama-bench's core contract; the result's
    /// `confidence` vec is empty while off.
    pub fn set_confidence(&mut self, on: bool) {
        self.confidence_on = on;
    }

    /// Set the confidence-calibration temperature (B1). Values ≤0 are
    /// clamped to raw (1.0).
    pub fn set_calib_temp(&mut self, t: f32) {
        self.calib_temp = if t > 1e-3 { t } else { 1.0 };
    }

    /// The active calibration temperature (1.0 = raw probability).
    pub fn calib_temp(&self) -> f32 {
        self.calib_temp
    }

    /// The primary (full-attention) RoPE inverse-frequency table selected
    /// from the CMF architecture.  This is read-only diagnostic state for
    /// parity checks; local sliding layers may use `inv_freq_local` instead.
    pub fn rope_inv_freq(&self) -> &[f32] {
        self.inv_freq.as_slice()
    }

    /// Partial rotary (Qwen3.5): rotate only the first `rotary_dim` dims;
    /// the frequency table is rebuilt over the rotary dims.
    pub fn set_rotary(&mut self, rotary_dim: usize, base: f32) {
        self.rotary_dim = rotary_dim.min(self.head_dim);
        self.inv_freq = std::sync::Arc::new(attention::rope_inv_freq(self.rotary_dim, base));
        // The packed resident graph owns its own inverse-frequency plane;
        // changing RoPE after it was built must not leave a stale device
        // model behind the exact host configuration.
        self.embryo_graph = None;
    }

    fn attn_cfg(&self, position: usize) -> QwenAttnCfg<'_> {
        QwenAttnCfg {
            mrope: None,
            num_heads: self.num_heads,
            num_kv_heads: self.num_kv_heads,
            head_dim: self.head_dim,
            hidden_size: self.hidden_size,
            position,
            inv_freq: &self.inv_freq,
            rotary_dim: self.rotary_dim,
            scale: self.attn_scale,
            softcap: self.attn_softcap,
            window: None,
            v_norm: false,
            qk_norm_after_rope: self.qk_norm_after_rope,
            gate_sigmoid: self.proj_gate_sigmoid,
            q_norm: None,
            k_norm: None,
            output_gate: false,
            softplus_gate: None,
            rope_scale: self.rope_scale,
            bias: None,
            rms_eps: self.rms_eps,
            norm_style: self.norm_style,
            pool: self.pool.as_deref(),
            v_head_dim: self.v_head_dim.unwrap_or(self.head_dim),
            value_in: None,
        }
    }

    /// Generate text from a plain-text prompt. Streams tokens via `on_token`.
    pub fn generate(
        &mut self,
        prompt: &str,
        max_tokens: usize,
        task_mask: Option<&TaskMask>,
        on_token: Option<TokenCallback>,
    ) -> Result<GenerateResult, String> {
        let input_ids = self.tokenizer.with_bos(self.tokenizer.encode(prompt));
        self.generate_from_ids(&input_ids, max_tokens, task_mask, on_token)
    }

    /// Generate from a V4.1 multimodal prompt prepared by the vision module.
    /// Vision rows are encoded once and fed through the same bounded token walk as text.
    pub fn generate_from_vl(
        &mut self,
        input: &crate::dsv41_vision::PreparedVlInputs,
        max_tokens: usize,
        task_mask: Option<&TaskMask>,
        on_token: Option<TokenCallback>,
    ) -> Result<GenerateResult, String> {
        let Some(dsv41) = &self.dsv41 else {
            return Err("V4.1 multimodal input requires a DeepSeek-V4.1 pipeline".into());
        };
        if input.token_ids.is_empty() {
            return Err("empty V4.1 multimodal prompt".into());
        }
        if input.token_types.len() != input.token_ids.len() {
            return Err(format!(
                "V4.1 token type count {} != token count {}",
                input.token_types.len(),
                input.token_ids.len()
            ));
        }
        let dim = dsv41.2.dim;
        let mut embeddings = vec![None; input.token_ids.len()];
        let mut participates = vec![true; input.token_ids.len()];
        if !input.images.is_empty() {
            let vision = self
                .dsv41_vision
                .as_ref()
                .ok_or_else(|| "V4.1 image prompt has no loaded vision tower".to_string())?;
            for image in &input.images {
                let end = image.start.saturating_add(image.types.len());
                if end > input.token_ids.len() {
                    return Err(format!(
                        "V4.1 image span {}..{} exceeds prompt length {}",
                        image.start,
                        end,
                        input.token_ids.len()
                    ));
                }
                let mut span = vec![0.0f32; image.types.len() * dim];
                vision.fill_image_span(image, &mut span, self.pool.as_deref())?;
                for (offset, &kind) in image.types.iter().enumerate() {
                    let pos = image.start + offset;
                    if input.token_types[pos] != kind {
                        return Err(format!(
                            "V4.1 image type mismatch at position {pos}: {} != {kind}",
                            input.token_types[pos]
                        ));
                    }
                    embeddings[pos] = Some(span[offset * dim..(offset + 1) * dim].to_vec());
                    participates[pos] = false;
                }
            }
        }
        for (pos, &kind) in input.token_types.iter().enumerate() {
            if kind == crate::dsv41_vision::TEXT && embeddings[pos].is_some() {
                return Err(format!("V4.1 text position {pos} has an image embedding"));
            }
            if kind != crate::dsv41_vision::TEXT && embeddings[pos].is_none() {
                return Err(format!("V4.1 image position {pos} has no image embedding"));
            }
        }
        self.dsv41_prefill = Some((embeddings, participates));
        let result = self.generate_from_ids(&input.token_ids, max_tokens, task_mask, on_token);
        self.dsv41_prefill = None;
        result
    }

    /// `None` when the mask forbids nothing (see `TaskMask::fully_open`).
    fn drop_open_mask<'m>(&self, m: Option<&'m TaskMask>) -> Option<&'m TaskMask> {
        m.filter(|m| !m.fully_open(self.intermediate_size, self.num_heads))
    }

    /// Generate from prepared token ids (e.g. a chat template).
    ///
    /// With an MTP head, greedy generation without a task mask takes the
    /// speculative path: the MTP module drafts the token after next and
    /// the main model verifies both in one fused two-position forward
    /// (weights streamed once). The output is EXACTLY the vanilla greedy
    /// sequence — a rejected draft is rolled back — MTP only buys speed.
    pub fn generate_from_ids(
        &mut self,
        input_ids: &[u32],
        max_tokens: usize,
        task_mask: Option<&TaskMask>,
        on_token: Option<TokenCallback>,
    ) -> Result<GenerateResult, String> {
        self.generate_with_prompt_rows(input_ids, None, max_tokens, task_mask, on_token)
    }

    /// Generate from complete prompt embeddings [token_count, hidden_size].
    /// Text rows can be obtained with `embed_id`; media rows replace only
    /// their expanded placeholder positions. Rows are already scaled and
    /// enter `PrefillIn::Hidden`, so a device graph must not re-embed them.
    /// Token-only KV reuse is disabled both into and out of this request.
    pub fn generate_from_embeds(
        &mut self,
        input_ids: &[u32],
        prompt_rows: &[f32],
        max_tokens: usize,
        task_mask: Option<&TaskMask>,
        on_token: Option<TokenCallback>,
    ) -> Result<GenerateResult, String> {
        if input_ids.is_empty()
            || input_ids.len().checked_mul(self.hidden_size) != Some(prompt_rows.len())
        {
            return Err("embedded prompt dimensions must be [tokens, hidden_size]".into());
        }
        if prompt_rows.iter().any(|x| !x.is_finite()) {
            return Err("embedded prompt contains non-finite values".into());
        }
        if !self.can_prefill_batched()
            || self.dyn_router.is_some()
            || self.o1_active()
            || self.mtp.is_some()
            || self.gpu_plan.is_some()
        {
            return Err("embedded prompts require the ordinary transformer path without O(1), dynamic routing, GPU splitting or a generic MTP head".into());
        }
        self.generate_with_prompt_rows(
            input_ids,
            Some(prompt_rows),
            max_tokens,
            task_mask,
            on_token,
        )
    }

    fn generate_with_prompt_rows(
        &mut self,
        input_ids: &[u32],
        prompt_rows: Option<&[f32]>,
        max_tokens: usize,
        task_mask: Option<&TaskMask>,
        mut on_token: Option<TokenCallback>,
    ) -> Result<GenerateResult, String> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        if std::env::var("CMF_TRACE_H").is_ok() {
            eprintln!("input_ids: {input_ids:?}");
        }
        if input_ids.is_empty() {
            return Err("empty prompt: nothing to generate from".to_string());
        }
        // A prior graph failure is terminal for that sequence but must not
        // poison the next independent request.  Keep this flag separate from
        // the externally-owned cooperative cancel bit.
        self.graph_failed
            .store(false, std::sync::atomic::Ordering::Relaxed);
        // A mask that forbids nothing still costs every fused path and
        // whole-token graph, all of which are gated on `is_none()`. A
        // narrowed file whose one segment is always on carries exactly
        // such a mask — drop it here rather than pay 5x for a no-op.
        self.o1_turbo_gate(input_ids.len());
        self.mtp_pos_base = 0;
        let prev_mtp_warm = self.mtp_warm_base.take();
        // the draft head's rows a chat snapshot keeps (counted from its base)
        let mut mtp_keep: Option<usize> = None;
        let task_mask = self.drop_open_mask(task_mask);
        // Unlimited-OCR: the page coordinates of this prompt.
        if self.dash.is_some() {
            if prompt_rows.is_none() {
                return Err("Unlimited-OCR reads images: pass at least one".into());
            }
            let eos = self.tokenizer.eos_token_id.unwrap_or(1);
            if let Some(d) = self.dash.as_mut() {
                d.begin(input_ids, eos)?;
            }
        }
        // A block-diffusion model generates whole blocks by denoising
        // previews, unless the request asks for the causal decode.
        if self.clover.is_some() && !self.clover_causal_request() {
            if prompt_rows.is_some() || task_mask.is_some() {
                return Err("block-diffusion generation takes token prompts without task masks".into());
            }
            return self.clover_generate(input_ids, max_tokens, on_token);
        }

        // Cross-turn KV reuse: a chat app resends the whole history
        // every turn; when the new ids strictly EXTEND what the cache
        // already holds, prefill only the tail — turn latency stays
        // proportional to the new text instead of the whole session.
        // Extension-only (no rollback), so it is exact for every layer
        // kind including recurrent state; MTP/o1/task-mask runs keep
        // the fresh-sequence path. CMF_KV_REUSE=0 disables.
        let mut reuse_from = if self.dory.is_some() {
            self.dory_cached_prefix(input_ids)
        } else {
            let on = !std::env::var("CMF_KV_REUSE").is_ok_and(|v| v == "0");
            if on
                && prompt_rows.is_none()
                && task_mask.is_none()
                && self.mtp.is_none()
                && !(self.mimo_mtp.is_some() && self.speculative)
                && self.o1_cfg.is_none()
                && self.dsv41.is_none()
            {
                self.cached_prefix_len(input_ids)
            } else {
                0
            }
        };
        // The device may own rows the host tail prefill needs (wgpu decode
        // writes only its mirror): hand them to the host, or start fresh.
        if reuse_from > 0 && !self.prepare_kv_reuse(reuse_from) {
            reuse_from = 0;
        }
        // The CUDA hybrid arm: a chat turn that starts with the ids before
        // the last turn's assistant header goes back to the GDN snapshot the
        // card took there; the attention mirrors rewind with it. The rows
        // before it are prompt rows no decode wrote, so this is exact after
        // any speculative round, and the draft head reads from there on.
        if reuse_from == 0 && prompt_rows.is_none() && task_mask.is_none() {
            let n = self.gdn_snap_reuse(input_ids);
            if n > 0 {
                reuse_from = n;
                self.kv_history.truncate(n);
                for l in &mut self.kv_cache.layers {
                    let d = l.pos_len().saturating_sub(n);
                    if d > 0 {
                        l.truncate_last(d);
                    }
                }
                self.graph_logits = None;
                // The draft head's rows before `n` are the last prompt's
                // rows when it was warmed over that whole prompt: they stay,
                // and it reads the conversation, not just the new turn.
                if self.mtp.is_some() {
                    match prev_mtp_warm {
                        Some(b) if b <= n => {
                            self.mtp_pos_base = b;
                            mtp_keep = Some(n - b);
                        }
                        _ => self.mtp_pos_base = n,
                    }
                }
                if std::env::var("CMF_PREFILL_PROF").is_ok() {
                    eprintln!("kv-reuse: GDN snapshot at {n} of {} prompt positions", input_ids.len());
                }
            }
        }
        // A diverging turn (`rollback_prefix_len`): drop every row past the
        // common prefix, so the tail prefill appends at `reuse_from`.
        if reuse_from > 0 && self.dory.is_some() && reuse_from < self.kv_history.len() {
            // The device's rings are addressed by position, so going back there
            // is only this: the next rows overwrite the rolled-back ones.
            if let Some(b) = &mut self.dory {
                let kv_row = b.0.cfg.nk * b.0.cfg.hd;
                b.1.rollback(reuse_from, kv_row);
            }
            self.kv_history.truncate(reuse_from);
            self.graph_logits = None;
        }
        if reuse_from > 0 && self.dory.is_none() && !self.bounded_native() && reuse_from < self.kv_history.len() {
            for l in &mut self.kv_cache.layers {
                let d = l.pos_len() - reuse_from;
                l.truncate_last(d);
            }
            if std::env::var("CMF_PREFILL_PROF").is_ok() {
                eprintln!(
                    "kv-reuse: rolled back {} answer position(s) to the common prefix",
                    self.kv_history.len() - reuse_from
                );
            }
            self.kv_history.truncate(reuse_from);
            self.graph_logits = None;
        }
        self.swa_trim_anchor = input_ids.len();
        self.dflash_tap_from = match &self.dflash {
            Some(d) if (0..d.g.layers).all(|l| d.g.window_of(l) > 0) => {
                let w = (0..d.g.layers).map(|l| d.g.window_of(l)).max().unwrap_or(0);
                input_ids.len().saturating_sub(w + crate::dflash::BLOCK_SLACK)
            }
            _ => 0,
        };
        self.last_prefill_tokens = input_ids.len() - reuse_from;
        let bounded_native = self.bounded_native();
        if reuse_from == 0 {
            // Fresh sequence — the cache holds absolute positions.
            // MTP never participates in cross-turn KV reuse, so a
            // high-vocabulary token from the previous request must not keep
            // this request on its expensive full draft head.
            self.reset_fresh_mtp_draft_state();
            self.clear_sequence_state();
        } else if std::env::var("CMF_PREFILL_PROF").is_ok() {
            eprintln!(
                "kv-reuse: {} of {} prompt positions already cached",
                reuse_from,
                input_ids.len()
            );
        }
        crate::gpu::graph_race_begin_generation();
        // Optional bounded calibration prefix. Keep the requested value
        // even when it is longer than the prompt; the collecting layer will
        // defer at the effective boundary and remain exact for short input.
        let o1_prefill = if self.o1_active() && task_mask.is_none() {
            std::env::var("CMF_O1_PREFILL")
                .ok()
                .and_then(|v| v.parse::<usize>().ok())
                .filter(|&p| p > 0)
                // Exact rows are chosen before the prompt's last rows, which then read them.
                .or_else(|| {
                    self.o1_exact_cfg()
                        .map(|_| {
                            let max = std::env::var("CMF_O1_PREFIX_MAX")
                                .ok()
                                .and_then(|v| v.parse().ok())
                                .or(self.o1_turbo.as_ref().map(|t| t.seal))
                                .unwrap_or(O1_PREFIX_MAX);
                            input_ids.len().saturating_sub(crate::dory::EXACT_TAIL).min(max)
                        })
                        .filter(|&p| p > 0)
                })
        } else {
            None
        };
        if task_mask.is_none() {
            self.o1_begin_with_prefix(o1_prefill);
        }
        if let Ok(f) = std::env::var("CMF_O1_TOKENS_DUMP") {
            let b: Vec<u8> = input_ids.iter().flat_map(|v| v.to_le_bytes()).collect();
            let _ = std::fs::write(f, b);
        }

        // Speculative decode is off under o1: a rejected draft can't be
        // rolled back out of the far accumulators / ring window (the
        // Nyström insertion is irreversible by design).
        // The wgpu token graph owns a device K/V mirror that speculative
        // rollback would desync — the two are mutually exclusive.
        let graph_on = crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode);
        // Graph speculative decode (`CMF_GRAPH_SPEC=1`): the MTP head
        // drafts, ONE batched graph submit verifies the whole chain.
        //
        // It now PAYS on Qwen3.6-27B / RTX 5090 — 51.1 tok/s against a
        // plain 49.4 at k=3, medians of three, 89% of drafts accepted,
        // and the greedy continuation is byte-identical to the plain
        // path. That took the batch matvec sharing its nibble unpack
        // across the batch (`CMF_MV_BK=2`); before it, the same round
        // measured 43.6, an 11% LOSS, which is what the earlier note
        // here described.
        //
        // Still opt-in. One model's win is not a default: the verify
        // rides `gdn_spec_restore` and a batched frame whose numerics
        // are the batch kernels', and that has to be shown on more than
        // one architecture before every greedy decode takes it.
        // Greedy (with or without penalties) verifies by argmax equality.
        // Sampling (temperature > 0) can go through speculative SAMPLING —
        // draft from the MTP head's own post-chain distribution, accept
        // with min(1, p/q), correct from max(0, p − q); the emitted stream
        // is distributed exactly as the plain sampler's — but it is
        // OPT-IN (`CMF_GRAPH_SPEC_SAMPLE=1`): measured on Qwen3.8-27B /
        // RTX 5090 at the instruct row (0.7 / 0.80 / 20 / presence 1.5)
        // it decoded 19-22 tok/s against a plain 40 — nine post-chain
        // distributions a round plus a lower acceptance than greedy's,
        // against a verify that costs 2.7 single tokens. The greedy arms
        // pay +10%; the sampling arm needs a cheaper verify first.
        // Native Metal has a fast row-batch verify, but it is NOT admitted
        // by default: a real-model exactness check found an emitted greedy
        // divergence from the serial path.  Every native-Metal speculative
        // arm therefore requires the explicit `CMF_GRAPH_SPEC=1` experiment
        // gate until the batch kernels are numerically qualified.  If it is
        // explicitly enabled, its sampling arm is useful only for a config
        // the SPARSE chain serves (a top-k within `sparse_ok`): without it a
        // round builds nine 248k-float distributions on the host, which is
        // the 5090's measured loss and not a cost the round-token proxy
        // below can see. A top-k-less sampling config keeps the plain path
        // unless asked for by name.
        #[cfg(target_os = "macos")]
        let metal_graph = crate::gpu::q1_force()
            && crate::gpu::enabled_here()
            && std::env::var("CMF_GPU_BLOCK")
                .map(|v| v != "0")
                .unwrap_or(true);
        // `CMF_GPU_BLOCK=0` declines the ordinary native block route but
        // does not change the backend identity: a separately requested wgpu
        // graph can still reach `graph_spec_step`, whose native branch uses
        // VerifyGraph. Keep the quality policy tied to that identity, not to
        // the particular block-route admission above.
        #[cfg(target_os = "macos")]
        let native_metal_backend = crate::gpu::q1_force();
        #[cfg(not(target_os = "macos"))]
        let metal_graph = false;
        #[cfg(not(target_os = "macos"))]
        let native_metal_backend = false;
        let spec_sample_env = std::env::var("CMF_GRAPH_SPEC_SAMPLE").ok();
        // A round whose cost is the MEASURED one: greedy (argmax rows), or
        // sampling through the sparse chain. Anything else pays the dense
        // chain's host time, which no proxy can price.
        let spec_cheap_round =
            self.sampler_config.temperature < 1e-6 || sampler::sparse_ok(&self.sampler_config);
        let spec_sampling_ok = self.sampler_config.temperature < 1e-6
            || match spec_sample_env.as_deref() {
                Some("1") => true,
                Some(_) => false,
                None => metal_graph && spec_cheap_round,
            };
        // ON by default for greedy on the wgpu graph: with the draft on
        // the graph and the verify bit-exact, it measured 58.7 tok/s
        // against a plain 48.1 on Qwen3.8-27B q4tp / RTX 5090 (k=4) and
        // 51.1 against 49.4 on Qwen3.6-27B, and a round that stops
        // paying turns itself off below (acceptance watchdog).
        // `CMF_GRAPH_SPEC=0` disables; `=1` is the explicit opt-in spelling.
        // …but only where the batched verify has its register-blocked
        // kernel: q4tp dense FFNs (graph kind 6). q4t and q8_2f verify
        // through tile GEMMs today and measured a LOSS (q8_2f 22 against
        // 29 tok/s), the 2-bit plane the same; those stay opt-in
        // (`CMF_GRAPH_SPEC=1`).
        // …at least in nine dense FFNs of ten: a healed file carries its
        // last two layers at q8_2f, and two tile-GEMM verifies among 64 do
        // not change the arithmetic (measured: the healed q4tp file
        // decodes at the plain file's rate and would otherwise sit out).
        let (mut dense_n, mut dense_q4tp) = (0usize, 0usize);
        for lw in &self.weights.layers {
            if let FfnKind::Dense(d) = &lw.ffn {
                dense_n += 1;
                if matches!(d.gate_proj.graph_weight(), Some((_, _, 6, _)))
                    && matches!(d.up_proj.graph_weight(), Some((_, _, 6, _)))
                    && matches!(d.down_proj.graph_weight(), Some((_, _, 6, _)))
                {
                    dense_q4tp += 1;
                }
            }
        }
        // …and only where the MTP block itself runs on the graph. A MoE
        // draft block (Qwen3.6-35B-A3B, Apex-35B: 256 experts in the MTP
        // layer) fails `mtp_graph_ok`, so it drafts — and warms its cache
        // over the whole prompt — op by op on the host. Apex-35B q4tp on an
        // A40 + Xeon Gold 6342: greedy 51.8 against 65.6 tok/s plain (300
        // tokens, 57 % accepted), and 2.5 ms per prompt position (a
        // 4096-token ingest 171 against 295 tok/s); the published
        // Qwen3.6-35B-A3B 79.7 against 86.6. `CMF_GRAPH_SPEC=1` opts in.
        // Native Metal has no wgpu graph: its draft step is `mtp_step_metal`,
        // which takes the same block shape.
        #[cfg(feature = "gpu")]
        let mtp_on_graph = self.mtp.as_ref().is_none_or(|m| {
            if native_metal_backend {
                self.mtp_block_shape_ok(m)
            } else {
                self.mtp_graph_ok(m)
            }
        });
        #[cfg(not(feature = "gpu"))]
        let mtp_on_graph = self.mtp.as_ref().is_none_or(|m| !native_metal_backend || self.mtp_block_shape_ok(m));
        let spec_default_ok = (dense_n == 0 || dense_q4tp * 10 >= dense_n * 9) && mtp_on_graph;
        // Penalties break the draft head's agreement with the trunk (a
        // 1.1 repetition penalty measured 2 of 16 accepted): not by
        // default there either — off Metal that rule is untouched, and
        // suppressed ids keep counting as a penalty there, because no
        // measurement on a discrete card says otherwise.
        //
        // On native Metal the penalized arms DO pay: the draft applies
        // the same penalty and the verify scores the penalized rows
        // exactly (`greedy_pen`, the plain loop's arithmetic), so the
        // text is the plain path's and only the round's shape changes.
        // Measured on this M4 — see the report for the interleaved run.
        //
        // On the CUDA hybrid arm a suppress list alone (a no-think chat
        // masks `<think>`) does not count: it reads no history, the draft
        // and the verify rows mask the same ids, and the verify rows are
        // the plain rows bit for bit, so the round (`greedy_pen`) keeps the
        // plain text. Qwen3.8-27B q4tp, RTX 3090, a no-think chat over
        // `cortiq serve`: 44.8 tok/s plain before this.
        let suppress_only_ok = crate::gpu::cuda_active()
            && self.sampler_config.repetition_penalty == 1.0
            && self.sampler_config.presence_penalty == 0.0;
        let penalized = !metal_graph
            && (self.sampler_config.repetition_penalty != 1.0
                || self.sampler_config.presence_penalty != 0.0
                || (!self.sampler_config.suppress_tokens.is_empty() && !suppress_only_ok));
        // …and not on wgpu-over-Metal: the batched verify graph there
        // returned 0 accepted drafts and garbage text on a GDN hybrid
        // (16.08, Qwen3.5-0.8B) while Vulkan is bit-exact; the Mac's
        // default backend is native Metal without a batch graph anyway.
        #[cfg(feature = "gpu")]
        let metal_wgpu = graph_on && crate::gpu_wgpu::wgpu_backend_is_metal();
        #[cfg(not(feature = "gpu"))]
        let metal_wgpu = false;
        let spec_env = std::env::var("CMF_GRAPH_SPEC").ok();
        let spec_wanted = graph_spec_wanted_by_policy(
            spec_env.as_deref(),
            spec_default_ok,
            penalized,
            metal_wgpu,
            native_metal_backend,
        );
        if spec_wanted && metal_wgpu {
            tracing::warn!(
                "CMF_GRAPH_SPEC forced on wgpu/Metal: the batched verify graph is not \
                 verified on this backend (garbage measured on Qwen3.5-0.8B)"
            );
        }
        // Native Metal: the b-row verify graph (`try_batch_graph_metal`)
        // stands where the wgpu batch graph stands on discrete cards
        // (`metal_graph`, above).
        let graph_spec = self.speculative
            && (graph_on || metal_graph)
            && self.mtp.is_some()
            && task_mask.is_none()
            && (!self.o1_active() || self.o1_spec())
            && spec_sampling_ok
            && spec_wanted;
        // A trunk without a draft block of its own (Ripple): a DFlash sidecar
        // drafts a round in one block and the batch graph verifies it, the
        // rows of drafts that did not hold let go. Plain greedy only, so the
        // text is the plain path's. `CMF_GRAPH_SPEC=0` keeps plain tokens.
        #[cfg(feature = "gpu")]
        let solo_spec = self.speculative
            && graph_on
            && !metal_wgpu
            && self.mtp.is_none()
            && task_mask.is_none()
            && (!self.o1_active() || self.o1_spec())
            && self.sampler_config.temperature < 1e-6
            && !penalized
            && spec_env.as_deref() != Some("0")
            && (self.dflash.is_some() || solo_script().is_some());
        #[cfg(feature = "gpu")]
        let solo_pin: Option<usize> =
            std::env::var("CMF_GRAPH_SPEC_K").ok().and_then(|v| v.parse().ok()).filter(|k| (1..=SOLO_K_MOST).contains(k));
        #[cfg(feature = "gpu")]
        let mut solo =
            SoloSpec { k: solo_pin.unwrap_or(4), rest: 3, back: SOLO_REST, plain_ms: 0.0, plain_n: 0, round_ms: 0.0, rounds: 0, win_ms: 0.0, win_tok: 0, last: None, first: true };
        // The host fused pair is an optimization, not a verifier. On real
        // q4tp Qwen3.5 a near-tied row produced a different greedy argmax
        // from two serial target forwards. That makes a seemingly accepted
        // draft change text, which is worse than losing speculative speed.
        // Keep it explicitly experimental until a model/backend has passed
        // a long exact-ID gate; the native Metal batch verifier has its own
        // separate graph admission and is not controlled by this switch.
        //
        // GDN hybrids are also excluded by default: their recurrence is
        // sequential, so the pair lane cannot parallelize and measured 2x
        // slower on the 35B. `CMF_MTP_PAIR=1` is deliberately the only
        // opt-in for the host fused-pair experiment (not `CMF_MTP=1`).
        let host_pair_opt_in = std::env::var("CMF_MTP_PAIR").as_deref() == Ok("1");
        let pair_pays = host_pair_opt_in
            && (self.gdn_cfg.is_none() || std::env::var("CMF_MTP").as_deref() == Ok("1"));
        // Native Metal: say the route ONCE (RUST_LOG=info), including why
        // the drafts are off when they are (`graph_spec_wanted_by_policy`).
        #[cfg(target_os = "macos")]
        if metal_graph {
            static SAID: std::sync::Once = std::sync::Once::new();
            SAID.call_once(|| {
                let spec = if graph_spec {
                    let k = std::env::var("CMF_GRAPH_SPEC_K")
                        .ok()
                        .and_then(|v| v.parse::<usize>().ok())
                        .filter(|&v| (1..=8).contains(&v))
                        .map(|v| v.to_string())
                        .unwrap_or_else(|| {
                            if self.metal_small_batch_verify() {
                                "auto".to_string()
                            } else {
                                "7".to_string()
                            }
                        });
                    let arm = if self.sampler_config.temperature < 1e-6 {
                        "greedy"
                    } else {
                        "sampling"
                    };
                    format!(
                        "spec k={k} {arm} (batched verify, draft shortlist {}, trial: proxy)",
                        Self::draft_vocab_rows(usize::MAX)
                    )
                } else if !self.speculative {
                    "spec off (CMF_MTP=0)".to_string()
                } else if self.mtp.is_none() {
                    "spec off (no MTP head)".to_string()
                } else if !spec_sampling_ok {
                    if spec_cheap_round {
                        "spec off (CMF_GRAPH_SPEC_SAMPLE=0)".to_string()
                    } else {
                        "spec off (sampling without a top-k: the dense chain \
                         costs more than it saves)"
                            .to_string()
                    }
                } else if !spec_wanted {
                    if spec_env.as_deref() == Some("0") {
                        "spec off (CMF_GRAPH_SPEC=0)".to_string()
                    } else {
                        "spec off (drafts by default only over a q4tp trunk; CMF_GRAPH_SPEC=1 asks for them)".to_string()
                    }
                } else if task_mask.is_some() {
                    "spec off (task mask)".to_string()
                } else if !graph_spec && !pair_pays {
                    "spec off (host fused pair requires CMF_MTP_PAIR=1 after exact-ID validation)"
                        .to_string()
                } else {
                    "spec off (O(1) attention)".to_string()
                };
                let on = |var: &str| {
                    if std::env::var(var).as_deref() == Ok("0") {
                        "off"
                    } else {
                        "on"
                    }
                };
                tracing::info!(
                    "metal native: {spec}, state4 {}, async replay {}, prefill graph {}, \
                     MTP graph {}, attend {}, probe {}",
                    if crate::gpu_metal::state4_on() {
                        "on"
                    } else {
                        "off"
                    },
                    if crate::gpu_metal::async_replay_on() {
                        "on"
                    } else {
                        "off"
                    },
                    on("CMF_METAL_PREFILL"),
                    on("CMF_MTP_GRAPH"),
                    std::env::var("CMF_GPU_ATTEND").unwrap_or_else(|_| "auto".into()),
                    if crate::gpu::probe_enabled() {
                        "bypassed (q1 force)"
                    } else {
                        "off"
                    },
                );
            });
        }
        let spec_active = self.speculative
            && self.mtp.is_some()
            && task_mask.is_none()
            && (!self.o1_active() || self.o1_spec())
            && ((!graph_on && pair_pays && self.sampler_config.temperature < 1e-6) || graph_spec);
        // The MTP module is detached during generation so its mutable
        // state does not fight the borrow on `self`.
        let mut mtp = if spec_active { self.mtp.take() } else { None };
        if std::env::var("CMF_MTP_CHAIN_PROBE").is_ok() {
            eprintln!(
                "mtp-probe gate: spec_active={spec_active} mtp={} speculative={} graph_on={graph_on} temp_ok={}",
                mtp.is_some(),
                self.speculative,
                self.sampler_config.temperature < 1e-6,
            );
        }
        if let Some(m) = &mut mtp {
            let kept = mtp_keep.is_some_and(|rows| {
                crate::gpu::graph_kv_set_stored(self.mtp_kv_id(), Self::MTP_LAYER_BASE, rows)
            });
            if kept {
                let rows = mtp_keep.unwrap_or(0);
                let d = m.kv.pos_len().saturating_sub(rows);
                if d > 0 {
                    m.kv.truncate_last(d);
                }
            } else {
                m.kv.clear();
                // The MTP block's own device mirror starts over with its cache.
                crate::gpu::graph_kv_reset(self.mtp_kv_id());
                if mtp_keep.is_some() {
                    // nothing kept: the head reads from the snapshot on
                    self.mtp_pos_base = reuse_from;
                }
            }
            self.mtp_graph_mode = None;
        }
        // MiMo-V2's draft stack: greedy rounds (draft K with the chained
        // MTP layers, verify K+1 rows in one batched forward). Sampling
        // decodes plain; `CMF_MTP=0` / `CMF_MIMO_MTP=0` turn it off.
        let mimo_spec = self.speculative
            && self.mimo_mtp.is_some()
            && task_mask.is_none()
            && !self.o1_active()
            && self.dyn_router.is_none()
            && self.sampler_config.temperature < 1e-6
            && std::env::var("CMF_MIMO_MTP").as_deref() != Ok("0");
        if let Some(st) = self.mimo_mtp.as_mut() {
            st.reset();
            if mimo_spec && std::env::var_os("CMF_MIMO_MTP_PROBE").is_some() {
                Self::mimo_mtp_hist_cap(st, input_ids.len());
            }
        }
        // Dynamic router detached during decode (same borrow trick as MTP).
        // Speculative decode and dynamic routing are mutually exclusive
        // for now — the fused-pair path doesn't carry per-token φ.
        let mut router = if mtp.is_none() {
            self.dyn_router.take()
        } else {
            None
        };
        let mut reuse_from = reuse_from;
        if let Some(r) = &mut router {
            r.reset(); // active=backbone, matching a fresh overlay
            self.dyn_phi_seen = 0; // fresh φ EMA per generation
            if self.dyn_active.is_some() {
                // A real switch back to the backbone invalidates the
                // cache the reuse key was computed against.
                let _ = self.set_active_skill(None);
                reuse_from = 0;
                self.last_prefill_tokens = input_ids.len();
            }
        }

        let mut all_ids = input_ids.to_vec();
        // A block-diffusion model's response penalties count the response
        // only (`CloverPenaltyState`), never the prompt.
        let penalty_from = if self.clover.is_some() { input_ids.len() } else { 0 };
        let mut generated = 0usize;
        let mut finish_reason = "max_tokens".to_string();
        let mut drafted = 0usize;
        let mut accepted = 0usize;
        // DeepSeek-V4's draft quality is strongly content-dependent.  Two
        // consecutive paid rounds with no extra token put it on a bounded
        // cooldown; predictable text keeps batching, ordinary prose falls
        // back to the exact walk instead of paying a slow draft forever.
        // Local to one generation so one difficult request cannot poison the
        // next one, and deliberately automatic — this is not a user knob.
        let mut dsv4_spec_bad = 0usize;
        let mut dsv4_spec_retry_at = 0usize;
        let mut confidence: Vec<f32> = Vec::new();
        let trace_on = self.trace;
        let calib_temp = self.calib_temp;
        let mut traces: Vec<TokenTrace> = Vec::new();

        // ── Prefill: forward each prompt token once, KEEP the last hidden.
        //    Dense prefill runs in fused pairs (weights streamed once per
        //    two positions — bit-identical to sequential, proven by the
        //    pair tests). With MTP: warm the draft head on
        //    (hidden_p, token_{p+1}) pairs.
        let mut hidden = vec![0.0f32; self.hidden_size];
        let mut pos = reuse_from;
        // lm_head-in-graph is only sound when the very next logits
        // consumer is this loop's own (MTP and skill routing interleave
        // other forwards / can swap lm_head between forward and sample).
        // CMF_GPU_LMHEAD=0 keeps lm_head off the graph: the token reads back
        // the 8 KB hidden instead of ~1 MB of logits, and the head runs on
        // the host. A probe for how much of the graph's fixed per-token cost
        // is the logits readback (the layer sweep puts that fixed part at
        // 3.88 ms of an 18.5 ms frame).
        let fuse_lm = mtp.is_none()
            && router.is_none()
            && std::env::var("CMF_GPU_LMHEAD").as_deref() != Ok("0");
        self.graph_logits = None;
        self.graph_want_logits = false;
        let _tpf = std::time::Instant::now();
        let batch_k = self.generation_batch_k();
        if let Some(rows) = prompt_rows {
            let hs = self.hidden_size;
            // The batched graph's row count when the prompt rides it.
            let chunk = if batch_k > 0 { batch_k } else { self.prefill_chunk().max(1) };
            while pos < input_ids.len() && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                let end = (pos + chunk).min(input_ids.len());
                let hb = match self.prefill_input_rows(
                    PrefillIn::Hidden(&rows[pos * hs..end * hs]),
                    pos,
                    task_mask,
                ) {
                    Ok(hb) => hb,
                    Err(err) => {
                        self.prompt_mrope = None;
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err(err);
                    }
                };
                if mimo_spec {
                    self.mimo_note_rows(&hb, pos);
                }
                hidden.copy_from_slice(&hb[hb.len() - hs..]);
                pos = end;
            }
        }
        // The prompt's MRoPE rows are in the cache; decode positions are
        // plain (`sensenova::mrope_positions` shifted them so).
        self.prompt_mrope = None;
        // DeepSeek-V4 owns a separate hyper-connection stack. Route it
        // before the generic prefill choices: those correctly reject an
        // empty `weights.layers`, but their final per-position fallback used
        // to consume the whole prompt before `dsv4::forward_chunk` could see
        // it. The batch implementation therefore existed without a live
        // production entry point.
        //
        // Bounded chunks preserve cancellation responsiveness. Only the
        // prompt's final chunk asks for logits; every earlier head projection
        // would produce 129 280 values that no caller reads.
        while self.qwen4_exp.is_some()
            && mtp.is_none()
            && pos < input_ids.len()
            && !self.cancel.load(std::sync::atomic::Ordering::Relaxed)
        {
            // The device path takes several prompt tokens per layer frame;
            // the host path runs them one by one inside the same call.
            let end = (pos + crate::qwen4_exp::prefill_chunk()).min(input_ids.len());
            let want_logits = end == input_ids.len();
            let mut lg = Vec::new();
            if let Some(b) = &mut self.qwen4_exp {
                crate::qwen4_exp::forward_tokens(
                    &b.0,
                    &b.1,
                    &b.2,
                    &mut b.3,
                    &input_ids[pos..end],
                    pos,
                    &self.inv_freq,
                    self.pool.as_deref(),
                    &mut lg,
                    want_logits,
                );
            }
            if want_logits {
                self.graph_logits = Some(lg);
            }
            pos = end;
            hidden.fill(0.0);
        }
        while self.dsv4.is_some()
            && mtp.is_none()
            && pos < input_ids.len()
            && !self.cancel.load(std::sync::atomic::Ordering::Relaxed)
        {
            let end = (pos + prefill_chunk()).min(input_ids.len());
            let ids: Vec<u32> = input_ids[pos..end].to_vec();
            let mut lg = Vec::new();
            if let Some(b) = &mut self.dsv4 {
                let (g, layers, cfg, st) = (&b.0, &b.1, b.2, &mut b.3);
                crate::dsv4::forward_chunk(
                    g,
                    layers,
                    &cfg,
                    st,
                    &ids,
                    pos,
                    &self.inv_freq,
                    self.pool.as_deref(),
                    &mut lg,
                    end == input_ids.len(),
                );
            }
            if end == input_ids.len() {
                self.graph_logits = Some(lg);
            }
            pos = end;
            hidden = vec![0.0; self.hidden_size];
        }
        if self.dory.is_some() && mtp.is_none() && pos < input_ids.len() {
            let lg = self.dory_forward(&input_ids[pos..], pos, crate::dory::Want::Last);
            self.graph_logits = Some(lg);
            pos = input_ids.len();
            hidden = vec![0.0; self.hidden_size];
        }
        let dsv41_prefill = self.dsv41_prefill.take();
        while self.dsv41.is_some()
            && mtp.is_none()
            && pos < input_ids.len()
            && !self.cancel.load(std::sync::atomic::Ordering::Relaxed)
        {
            let end = (pos + prefill_chunk()).min(input_ids.len());
            let ids: Vec<u32> = input_ids[pos..end].to_vec();
            let mut lg = Vec::new();
            if let Some(b) = &mut self.dsv41 {
                let (g, layers, cfg, st) = (&b.0, &b.1, &b.2, &mut b.3);
                if let Some((embeddings, participates)) = dsv41_prefill.as_ref() {
                    crate::dsv41::forward_chunk_masked_with_embeddings(
                        g,
                        layers,
                        cfg,
                        st,
                        &ids,
                        pos,
                        &embeddings[pos..end],
                        &participates[pos..end],
                        self.pool.as_deref(),
                        &mut lg,
                    );
                } else {
                    crate::dsv41::forward_chunk(
                        g,
                        layers,
                        cfg,
                        st,
                        &ids,
                        pos,
                        self.pool.as_deref(),
                        &mut lg,
                    );
                }
            }
            if end == input_ids.len() {
                self.graph_logits = Some(lg);
            }
            pos = end;
            hidden = vec![0.0; self.hidden_size];
        }
        // With dynamic routing, prefill sequentially so the φ hook fires
        // over the PROMPT — the router enters decode with a warm φ (the
        // fused-pair path skips the per-layer φ capture). o1 layers
        // collect their query trace in both the single and pair paths.
        let dyn_prefill = router.is_some();
        // Optional bounded calibration prefix for generation.  The normal
        // O(1) path seals after the full prompt; this explicit knob instead
        // runs only the requested prefix through exact attention, seals the
        // Nyström state, and streams the rest of the prompt through the same
        // O(1) step used by decode.  It keeps the O(1) layers' Q trace and
        // temporary full KV bounded by the prefix while leaving the default
        // full-prompt quality profile untouched.
        let o1_prefill_limit = o1_prefill
            .and_then(|requested| self.o1_effective_boundary(requested))
            .map(|boundary| boundary.min(input_ids.len()));
        let mut o1_sealed = false;
        let mut o1_arch: Option<O1Archive> = None;
        if let Some(limit) = o1_prefill_limit {
            // On the device route the prefix takes the batch graph and its
            // sealed suffix the O(1) batches after it (`o1_prefix_on_graph`):
            // the host walk read it at 16 tok/s on Qwen3.8-27B / A40, 33 s
            // of a 72 s TTFT at 4k. Only when a suffix follows — a prompt
            // inside the boundary stays exact on the host as before.
            // `CMF_O1_PREFIX_GPU=0` keeps the host prefill.
            if pos == 0
                && limit < input_ids.len()
                && batch_k > 0
                && task_mask.is_none()
                && (mtp.is_none() || self.o1_spec())
                && !dyn_prefill
                && self.o1_on_graph()
                && std::env::var("CMF_O1_PREFIX_GPU").as_deref() != Ok("0")
                && (0..self.num_layers).all(|li| self.phys_layer(li) == li)
            {
                let t_px = std::time::Instant::now();
                // More of the prompt than the first seal covers: its rows stay in host
                // memory, and the far field is built anew before the prompt's last rows.
                let tail_from = input_ids.len().saturating_sub(crate::dory::EXACT_TAIL);
                if limit < tail_from && self.o1_exact_cfg().is_some() {
                    o1_arch = Some(O1Archive::new());
                }
                // Without a Metal rows graph (Spark-X2.6: GELU, per-head gates, sliding
                // windows) the sealed rows would go one position at a time: 14 000 tokens
                // on the M4 took 219 s. The chunk graph reads the whole prompt exact
                // instead, and the seal after it chooses among all of its rows, with the
                // question's queries in the trace.
                #[cfg(target_os = "macos")]
                let px_len = if crate::gpu::q1_force() && o1_arch.is_some() && self.metal_rows_plan().is_none() {
                    o1_arch = None;
                    let n = input_ids.len();
                    for li in 0..self.num_layers {
                        if self.o1_flags.get(li).copied().unwrap_or(false) {
                            self.kv_cache.layers[li].o1_set_boundary(n);
                        }
                    }
                    n
                } else {
                    limit
                };
                #[cfg(not(target_os = "macos"))]
                let px_len = if self.o1_whole_prompt() {
                    o1_arch = None;
                    let n = input_ids.len();
                    for li in 0..self.num_layers {
                        if self.o1_flags.get(li).copied().unwrap_or(false) {
                            self.kv_cache.layers[li].o1_set_boundary(n);
                        }
                    }
                    n
                } else {
                    limit
                };
                #[cfg(target_os = "macos")]
                let prefix = if crate::gpu::q1_force() {
                    self.o1_prefix_on_metal(&input_ids[..px_len], batch_k, o1_arch.as_mut())
                } else {
                    self.o1_prefix_on_graph(&input_ids[..px_len], batch_k, o1_arch.as_mut())
                };
                #[cfg(not(target_os = "macos"))]
                let prefix = {
                    // the CUDA mirrors take the whole prompt at the first chunk
                    let hint = crate::gpu::cuda_active();
                    if hint {
                        crate::gpu::set_batch_kv_hint(px_len + 1);
                    }
                    let r = self.o1_prefix_on_graph(&input_ids[..px_len], batch_k, o1_arch.as_mut());
                    if hint {
                        crate::gpu::set_batch_kv_hint(0);
                    }
                    r
                };
                match prefix {
                    Ok(Some(last)) => {
                        hidden.copy_from_slice(&last);
                        pos = px_len;
                        // the whole prompt went by the prefix (CUDA): the draft head
                        // reads its tail, as over the wgpu path's far field
                        let tail = std::mem::take(&mut self.o1_prefix_tail);
                        if px_len == input_ids.len() && mtp.is_some() && !tail.is_empty() {
                            let hs = self.hidden_size;
                            let from = px_len - tail.len() / hs;
                            self.mtp_pos_base = from;
                            let n_pairs = mtp_prefill_pair_count(from, px_len, input_ids.len());
                            let pairs: Vec<(&[f32], u32)> = (0..n_pairs).map(|j| (&tail[j * hs..(j + 1) * hs], input_ids[from + j + 1])).collect();
                            let warm_error = if let Some(m) = mtp.as_mut() { self.mtp_warm_prefill_pairs(m, &pairs, from).err() } else { None };
                            if let Some(err) = warm_error {
                                self.finish_generation(&mut mtp, &mut router, true);
                                return Err(err.to_string());
                            }
                            self.mtp_warm_base = Some(from);
                        }
                        if std::env::var("CMF_PREFILL_PROF").is_ok() {
                            eprintln!(
                                "o1 prefix on the batch graph: {px_len} rows in {:.1} ms",
                                t_px.elapsed().as_secs_f64() * 1e3
                            );
                        }
                    }
                    Ok(None) => {}
                    Err(err) => {
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err(err);
                    }
                }
            }
            // Without the device route (LFM2's short convolutions on Metal) the rows
            // past the first seal would stream into the far field unchosen. With exact
            // rows wanted, the host keeps the prompt exact up to its last rows and
            // chooses among all of them there, as the archive does on the device.
            let tail_from = input_ids.len().saturating_sub(crate::dory::EXACT_TAIL);
            let limit = if pos == 0 && limit < tail_from && self.o1_exact_cfg().is_some() {
                o1_arch = None;
                for li in 0..self.num_layers {
                    if self.o1_flags.get(li).copied().unwrap_or(false) {
                        self.kv_cache.layers[li].o1_set_boundary(tail_from);
                    }
                }
                tracing::info!("o1: no device prefix; exact on the host up to row {tail_from}, then the seal");
                tail_from
            } else {
                limit
            };
            // Reuse the exact batched prefix machinery when available; it
            // records the same per-position Q trace as the full prefill.
            if pos < limit && self.can_prefill_batched() && limit > 2 {
                let chunk = self.prefill_chunk();
                let hs = self.hidden_size;
                while pos < limit && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                    let end = (pos + chunk).min(limit);
                    let hb = self.prefill_batch(&input_ids[pos..end], pos);
                    hidden.copy_from_slice(&hb[(end - pos - 1) * hs..]);
                    pos = end;
                }
            } else {
                while pos < limit && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                    hidden = self.forward_layers(&self.embed_single(input_ids[pos]), pos, None);
                    pos += 1;
                }
            }
            if pos >= limit {
                o1_sealed = match self.o1_seal_checked() {
                    Ok(sealed) => sealed,
                    Err(err) => {
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err(err);
                    }
                };
                // Sealed layers read no mirror again: their rows leave the memory they share
                // with everything else on a Mac.
                #[cfg(target_os = "macos")]
                if o1_sealed && crate::gpu::q1_force() {
                    crate::gpu_metal::kv_mirror_drop(self.graph_kv_id);
                }
                tracing::info!(
                    "o1 bounded prompt prefix: requested={} effective={} processed={} of {} token(s)",
                    o1_prefill.unwrap_or(0),
                    self.o1_effective_boundary(o1_prefill.unwrap_or(0))
                        .unwrap_or(limit),
                    limit,
                    input_ids.len()
                );
            }
        }
        // q1 hybrids on Metal: the per-position GPU token graph beats
        // the CPU chunk-GEMM (whose wall is the sequential scalar GDN
        // recurrence), so prefill goes position-by-position through the
        // same graph as decode. Pure-attention models keep the batched
        // path — there the chunk-GEMM amortization wins.
        let graph_prefill = self.graph_prefill_preferred();
        // Native Metal, q4tp GDN hybrids: the prompt through the b-row
        // rows graph — projections as GEMMs over up to 512 positions, the
        // GDN recurrence in registers on the device, K/V rows appended by
        // the chunk — instead of one token-graph submit per position (the
        // 27B: 8 tok/s → GEMM-bound). The MTP warm-up rows come out of one
        // batched run of the block per chunk. Any refusal leaves the rest
        // of the prompt to the sequential paths below. Pure-attention
        // models take it too (the plan admits their layers): CherryPit-1.2-2B
        // read an 8 192-token prompt on the M4 in 31 s instead of the host
        // walk's 58 s (q4tp; q8_2f 34 s against 55), at the same WikiText-2
        // ppl. `CMF_METAL_PREFILL=0` keeps the host walk.
        #[cfg(target_os = "macos")]
        if task_mask.is_none()
            && !dyn_prefill
            && !o1_sealed
            && (crate::gpu::q1_force() || crate::gpu::q2tp_gpu_opt_in())
            && crate::gpu::enabled_here()
            && !self.per_token_stack()
            && input_ids.len() > 8
            && std::env::var("CMF_MTP_CHAIN_PROBE").is_err()
            && std::env::var("CMF_METAL_PREFILL").as_deref() != Ok("0")
        {
            let chunk: usize = std::env::var("CMF_METAL_PREFILL_CHUNK")
                .ok()
                .and_then(|v| v.parse().ok())
                .filter(|&v| (16..=512).contains(&v))
                // The ANE's weights go once a chunk: a larger one pays them over more rows.
                .unwrap_or(if crate::gpu_metal::ane::wanted() { 512 } else { 256 });
            let hs = self.hidden_size;
            let _tp = std::time::Instant::now();
            while pos < input_ids.len() && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                let end = (pos + chunk).min(input_ids.len());
                let hb = match self.prefill_batch_metal(&input_ids[pos..end], pos) {
                    MetalPrefillOutcome::Completed(hb) => hb,
                    MetalPrefillOutcome::Declined => break,
                    MetalPrefillOutcome::Failed => {
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err("ordinary Metal prefill failed after admission".into());
                    }
                };
                if let Some(m) = &mut mtp {
                    let n_pairs = if end < input_ids.len() {
                        end - pos
                    } else {
                        end - pos - 1
                    };
                    if n_pairs > 0 {
                        let pairs: Vec<(&[f32], u32)> = (0..n_pairs)
                            .map(|j| (&hb[j * hs..(j + 1) * hs], input_ids[pos + j + 1]))
                            .collect();
                        if !self.mtp_warm_batch_metal(m, &pairs, pos) {
                            for (j, (h, t)) in pairs.iter().enumerate() {
                                let h = h.to_vec();
                                let _ = self.mtp_step(m, &h, *t, pos + j);
                            }
                        }
                    }
                }
                hidden.copy_from_slice(&hb[(end - pos - 1) * hs..]);
                pos = end;
            }
            if std::env::var("CMF_PREFILL_PROF").is_ok() {
                eprintln!(
                    "metal-prefill: {} of {} tokens in {:.1} ms",
                    pos,
                    input_ids.len(),
                    _tp.elapsed().as_secs_f64() * 1e3
                );
                // Per-stage GPU time of the rows graph (`CMF_VERIFY_CUT=1`).
                crate::gpu_metal::cut_report();
            }
        }
        // Gemma-4 on a discrete card: the prompt through the batched wgpu
        // graph (`g4_batch_ingest`); its K/V land in the device mirrors
        // decode reads. A refusal leaves the rest of the prompt to the
        // chunked host prefill below.
        #[cfg(not(target_os = "macos"))]
        if task_mask.is_none()
            && !dyn_prefill
            && mtp.is_none()
            && o1_prefill.is_none()
            && batch_k > 0
            && pos + 1 < input_ids.len()
            && self.g4_batch_prefill()
        {
            let t_g4 = std::time::Instant::now();
            match self.g4_batch_ingest(&input_ids[pos..], pos, false) {
                Ok((n, last)) => {
                    if n > 0 {
                        hidden.copy_from_slice(&last);
                    }
                    if std::env::var("CMF_PREFILL_PROF").is_ok() {
                        eprintln!(
                            "gemma4 batch prefill: {n} of {} tokens in {:.1} ms",
                            input_ids.len() - pos,
                            t_g4.elapsed().as_secs_f64() * 1e3
                        );
                    }
                    pos += n;
                }
                Err(e) => {
                    self.finish_generation(&mut mtp, &mut router, true);
                    return Err(e);
                }
            }
        }
        self.mimo_moe_prepare();
        // A MoE stack larger than the card (MiMo-V2 q4tp on 96 GB): the
        // batched wgpu graph runs the device prefix of every chunk — its
        // experts resident — and the host's batched layer walk finishes
        // the chunk. Any refusal leaves the rest of the prompt to the
        // chunked prefill below.
        #[cfg(not(target_os = "macos"))]
        if task_mask.is_none()
            && !dyn_prefill
            && !graph_prefill
            && mtp.is_none()
            && o1_prefill.is_none()
            && !self.o1_active()
            && input_ids.len() > 2
            && self.batch_prefix_prefill()
        {
            let chunk = self.prefill_chunk().max(1);
            let hs = self.hidden_size;
            let t_bp = std::time::Instant::now();
            let pos0 = pos;
            while pos < input_ids.len() && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                let end = (pos + chunk).min(input_ids.len());
                let bk = end - pos;
                let mut hiddens = vec![0f32; bk * hs];
                for (j, &id) in input_ids[pos..end].iter().enumerate() {
                    hiddens[j * hs..(j + 1) * hs].copy_from_slice(&self.embed_single(id));
                }
                let positions: Vec<usize> = (pos..end).collect();
                let mut run = 0usize;
                let outcome = self.try_batch_graph_wgpu_prefix(
                    &mut hiddens,
                    &positions,
                    bk,
                    None,
                    Some(&mut run),
                );
                match outcome {
                    crate::gpu::BatchGraphOutcome::Completed => {
                        let hb = if run < self.num_layers {
                            self.prefill_batch_span(
                                PrefillIn::Hidden(&hiddens),
                                pos,
                                None,
                                run,
                                self.num_layers,
                            )
                        } else {
                            hiddens
                        };
                        if mimo_spec {
                            self.mimo_note_rows(&hb, pos);
                        }
                        hidden.copy_from_slice(&hb[(bk - 1) * hs..]);
                        pos = end;
                    }
                    crate::gpu::BatchGraphOutcome::Failed => {
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err("batched prefix prefill failed after admission".into());
                    }
                    crate::gpu::BatchGraphOutcome::Declined => {
                        // Earlier chunks left their prefix rows on the
                        // device only: the host walk below needs them.
                        #[cfg(feature = "gpu")]
                        if pos > pos0 {
                            self.pull_lagging_host_kv(0, self.num_layers, pos);
                        }
                        break;
                    }
                }
            }
            if std::env::var("CMF_PREFILL_PROF").is_ok() {
                eprintln!(
                    "batch-prefix prefill: {} of {} tokens in {:.1} ms",
                    pos - pos0,
                    input_ids.len(),
                    t_bp.elapsed().as_secs_f64() * 1e3
                );
            }
        }
        if task_mask.is_none()
            && !dyn_prefill
            && !graph_prefill
            && self.can_prefill_batched()
            && !self.per_token_stack()
            && o1_prefill.is_none()
            && input_ids.len() > 2
        {
            // Production prefill = the same chunked prefill-GEMM that
            // bench/PPL measure (roadmap §3 P0: generation used to warm
            // the prompt with the slower pair path — the published
            // prefill number didn't match real TTFT). MTP warm-up reads
            // each position's hidden straight from the chunk result.
            let chunk = self.prefill_chunk();
            let hs = self.hidden_size;
            while pos < input_ids.len() && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                let end = (pos + chunk).min(input_ids.len());
                let hb = self.prefill_batch(&input_ids[pos..end], pos);
                if mimo_spec {
                    self.mimo_note_rows(&hb, pos);
                }
                if let Some(m) = &mut mtp {
                    let probe: usize = std::env::var("CMF_MTP_CHAIN_PROBE")
                        .ok()
                        .and_then(|v| v.parse().ok())
                        .unwrap_or(0);
                    for p in pos..end {
                        if p + 1 < input_ids.len() {
                            if probe >= 1 && p + 2 < input_ids.len() {
                                // Teacher-forced chain acceptance (see the
                                // tail loop's twin): the warm-up row stays,
                                // the chain's rows roll back.
                                let (d1, mut hx) = self.mtp_step_h(
                                    m,
                                    &hb[(p - pos) * hs..(p - pos + 1) * hs],
                                    input_ids[p + 1],
                                    p,
                                );
                                let mut ok = d1 == input_ids[p + 2];
                                Self::chain_probe_note(0, ok);
                                let mut d_prev = d1;
                                let mut extra = 0usize;
                                for j in 1..probe {
                                    if p + 2 + j >= input_ids.len() {
                                        break;
                                    }
                                    let (dj, hj) = self.mtp_step_h(m, &hx, d_prev, p + 1 + j);
                                    extra += 1;
                                    ok = ok && dj == input_ids[p + 2 + j];
                                    Self::chain_probe_note(j, ok);
                                    d_prev = dj;
                                    hx = hj;
                                }
                                m.kv.truncate_last(extra);
                            } else {
                                let _ = self.mtp_step(
                                    m,
                                    &hb[(p - pos) * hs..(p - pos + 1) * hs],
                                    input_ids[p + 1],
                                    p,
                                );
                            }
                        }
                    }
                }
                hidden.copy_from_slice(&hb[(end - pos - 1) * hs..]);
                pos = end;
            }
        }
        let pair_off = std::env::var("CMF_PAIR").is_ok_and(|v| v == "0");
        if task_mask.is_none()
            && !dyn_prefill
            && !graph_prefill
            && !pair_off
            && self.pair_supported()
            && o1_prefill.is_none()
        {
            while pos + 1 < input_ids.len()
                && !self.cancel.load(std::sync::atomic::Ordering::Relaxed)
            {
                let e1 = self.embed_single(input_ids[pos]);
                let e2 = self.embed_single(input_ids[pos + 1]);
                let (h1, h2) = self.forward_pair(&e1, &e2, pos);
                if mimo_spec {
                    self.mimo_note_rows(&h1, pos);
                    self.mimo_note_rows(&h2, pos + 1);
                }
                // Both prefill tokens are real → commit lane-2 states.
                self.commit_linear_scratch();
                if let Some(m) = &mut mtp {
                    let _ = self.mtp_step(m, &h1, input_ids[pos + 1], pos);
                    if pos + 2 < input_ids.len() {
                        let probe: usize = std::env::var("CMF_MTP_CHAIN_PROBE")
                            .ok()
                            .and_then(|v| v.parse().ok())
                            .unwrap_or(0);
                        if probe >= 1 && pos + 3 < input_ids.len() {
                            // Same teacher-forced chain table as the tail
                            // loop below, fed from the pair path that owns
                            // most prefill positions.
                            let (d1, mut hx) = self.mtp_step_h(m, &h2, input_ids[pos + 2], pos + 1);
                            let mut ok = d1 == input_ids[pos + 3];
                            Self::chain_probe_note(0, ok);
                            let mut d_prev = d1;
                            let mut extra = 0usize;
                            for j in 1..probe {
                                if pos + 3 + j >= input_ids.len() {
                                    break;
                                }
                                let (dj, hj) = self.mtp_step_h(m, &hx, d_prev, pos + 2 + j);
                                extra += 1;
                                ok = ok && dj == input_ids[pos + 3 + j];
                                Self::chain_probe_note(j, ok);
                                d_prev = dj;
                                hx = hj;
                            }
                            m.kv.truncate_last(extra);
                        } else {
                            let _ = self.mtp_step(m, &h2, input_ids[pos + 2], pos + 1);
                        }
                    }
                }
                hidden = h2;
                pos += 2;
            }
        }
        // Batched GPU prefill for the wgpu decode graph (GDN hybrids): K prompt
        // positions per submit — projections/FFN as GEMMs (weight once per K),
        // attention/GDN looped inside — instead of one whole-graph submit per
        // position. Falls through to the per-position graph on any refusal.
        // Batched prefill is opt-in (CMF_BATCH_K>0). Default 0 = per-position
        // graph prefill. (Steady-state decode is provably identical either way —
        // token-graph submit and lm_head both unchanged — so this only trades
        // prefill wall.)
        // A bounded O(1) prefix is the one post-seal prompt interval: only
        // admit its batch when the device O(1) route is explicitly enabled and
        // every sealed layer exposes a portable view. The same batch size and
        // refusal behavior remain the ordinary controls/comparator.
        let o1_batch_ready = o1_sealed
            && o1_prefill.is_some()
            && (mtp.is_none() || self.o1_spec())
            && self.o1_on_graph()
            && (0..self.num_layers).all(|li| {
                let cache = &self.kv_cache.layers[self.phys_layer(li)];
                cache.o1.is_none() || cache.o1_views().is_some()
            });
        // The ordinary graph-prefill route can share each completed trunk
        // chunk with an attached MTP head.  Keep chain probing on its
        // established per-position path: the probe deliberately needs every
        // teacher-forced draft row and its rollback table.
        let mtp_batch_prefill = mtp.is_some()
            && graph_prefill
            && task_mask.is_none()
            && !dyn_prefill
            && !self.o1_active()
            && std::env::var("CMF_MTP_CHAIN_PROBE").is_err();
        // A hint a failed earlier prompt left behind must not size this one.
        #[cfg(not(target_os = "macos"))]
        crate::gpu::set_batch_kv_hint(0);
        if batch_k > 0
            && (graph_prefill || o1_batch_ready)
            && task_mask.is_none()
            && (!self.o1_active() || o1_batch_ready)
            && (mtp.is_none() || mtp_batch_prefill || o1_batch_ready)
            && !dyn_prefill
            && pos + 1 < input_ids.len()
        {
            let hs = self.hidden_size;
            let chunk = batch_k;
            let pos_start = pos;
            let tail_from = input_ids.len().saturating_sub(crate::dory::EXACT_TAIL);
            // The K/V mirrors take the whole prompt (and its first token) at
            // the first chunk instead of growing on the way; cleared below.
            // Not under O(1): its exact mirror must stay the tail it keeps.
            #[cfg(not(target_os = "macos"))]
            if !self.o1_active() && o1_arch.is_none() && !o1_batch_ready {
                crate::gpu::set_batch_kv_hint(input_ids.len() + 1);
            }
            if let Some(a) = o1_arch.as_ref() {
                crate::gpu::o1_acap_begin(a.stride);
            }
            if o1_batch_ready && mtp.is_some() {
                self.mtp_pos_base = tail_from.max(pos);
            }
            // a chunk ends at the chat snapshot's row, the card copies the
            // GDN states there before the next chunk runs
            let snap_at = if o1_arch.is_none() && !o1_batch_ready { self.gdn_snap_target(input_ids, pos) } else { None };
            while pos < input_ids.len() {
                // The prompt's last rows read the rows chosen just before them.
                if pos >= tail_from {
                    if let Some(a) = o1_arch.take() {
                        crate::gpu::o1_acap_end();
                        if let Err(err) = self.o1_seal_archive(a) {
                            self.finish_generation(&mut mtp, &mut router, true);
                            return Err(err);
                        }
                    }
                }
                let stop = if o1_arch.is_some() { tail_from } else { input_ids.len() };
                let end = match snap_at {
                    Some(s) if pos < s => (pos + chunk).min(stop).min(s),
                    _ => (pos + chunk).min(stop),
                };
                let bk = end - pos;
                let mut hiddens = vec![0f32; bk * hs];
                for (j, &id) in input_ids[pos..end].iter().enumerate() {
                    hiddens[j * hs..(j + 1) * hs].copy_from_slice(&self.embed_single(id));
                }
                let positions: Vec<usize> = (pos..end).collect();
                let t_chunk = std::time::Instant::now();
                // A chunk before the last whose rows nothing reads: the
                // graph submits it and returns, and this loop encodes the
                // next chunk while the card runs it.
                #[cfg(not(target_os = "macos"))]
                crate::gpu::set_batch_defer(
                    end < input_ids.len()
                        && o1_arch.is_none()
                        && !o1_batch_ready
                        && !mimo_spec
                        && !mtp_batch_prefill,
                );
                let outcome = self.o1_prompt_chunk(&mut hiddens, &positions, bk);
                #[cfg(not(target_os = "macos"))]
                crate::gpu::set_batch_defer(false);
                if let (Some(a), crate::gpu::BatchGraphOutcome::Completed) = (o1_arch.as_mut(), outcome) {
                    if let Err(err) = self.o1_archive_chunk(a, pos, bk) {
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err(err);
                    }
                }
                let ok_b = outcome == crate::gpu::BatchGraphOutcome::Completed;
                // The draft head over a far field reads the prompt's tail only.
                if ok_b && o1_batch_ready && end > self.mtp_pos_base && mtp.is_some() {
                    let first = pos.max(self.mtp_pos_base);
                    let n_pairs = mtp_prefill_pair_count(first, end, input_ids.len());
                    if n_pairs > 0 {
                        let rows: Vec<Vec<f32>> = (0..n_pairs).map(|j| hiddens[(first - pos + j) * hs..(first - pos + j + 1) * hs].to_vec()).collect();
                        let pairs: Vec<(&[f32], u32)> = rows.iter().enumerate().map(|(j, row)| (row.as_slice(), input_ids[first + j + 1])).collect();
                        #[cfg(target_os = "macos")]
                        let warmed = crate::gpu::q1_force() && {
                            if let Some(m) = mtp.as_mut() {
                                if !self.mtp_warm_batch_metal(m, &pairs, first) {
                                    for (j, (h, t)) in pairs.iter().enumerate() {
                                        let h = h.to_vec();
                                        let _ = self.mtp_step(m, &h, *t, first + j);
                                    }
                                }
                            }
                            true
                        };
                        #[cfg(not(target_os = "macos"))]
                        let warmed = false;
                        let warm_error = if warmed {
                            None
                        } else if let Some(m) = mtp.as_mut() {
                            self.mtp_warm_prefill_pairs(m, &pairs, first).err()
                        } else {
                            None
                        };
                        if let Some(err) = warm_error {
                            self.finish_generation(&mut mtp, &mut router, true);
                            return Err(err.to_string());
                        }
                    }
                }
                if std::env::var("CMF_GRAPH_PROF").is_ok() {
                    let ms = t_chunk.elapsed().as_secs_f64() * 1000.0;
                    eprintln!(
                        "batch-chunk: phase=prompt mode={} k={bk} outcome={outcome:?} {ms:.1} ms ({:.1} tok/s)",
                        if o1_batch_ready {
                            "o1"
                        } else if mtp_batch_prefill {
                            "ordinary_mtp"
                        } else {
                            "ordinary"
                        },
                        bk as f64 / (ms / 1000.0)
                    );
                }
                {
                    use std::sync::atomic::{AtomicBool, Ordering};
                    static SAID: AtomicBool = AtomicBool::new(false);
                    if !SAID.swap(true, Ordering::Relaxed) {
                        if ok_b {
                            tracing::info!(
                                "batched prefill: ACTIVE mode={} (k={bk})",
                                if o1_batch_ready {
                                    "o1"
                                } else if mtp_batch_prefill {
                                    "ordinary_mtp"
                                } else {
                                    "ordinary"
                                }
                            );
                        } else {
                            tracing::warn!("batched prefill {:?} — per-position graph", outcome);
                        }
                    }
                }
                if ok_b {
                    if mimo_spec {
                        self.mimo_note_rows(&hiddens, pos);
                    }
                    if mtp_batch_prefill {
                        let n_pairs = mtp_prefill_pair_count(pos, end, input_ids.len());
                        if n_pairs > 0 {
                            // `hiddens` is owned by this chunk, so materialize
                            // row slices before borrowing the detached MTP
                            // module.  The last prompt row has no successor;
                            // the helper above is the single source of that
                            // boundary rule.
                            let rows: Vec<Vec<f32>> = (0..n_pairs)
                                .map(|j| hiddens[j * hs..(j + 1) * hs].to_vec())
                                .collect();
                            let pairs: Vec<(&[f32], u32)> = rows
                                .iter()
                                .enumerate()
                                .map(|(j, row)| (row.as_slice(), input_ids[pos + j + 1]))
                                .collect();
                            if std::env::var("CMF_GRAPH_PROF").is_ok() {
                                eprintln!(
                                    "mtp-warm: phase=prompt mode=ordinary_mtp first_pos={} pairs={} last_pos={}",
                                    pos,
                                    n_pairs,
                                    pos + n_pairs - 1,
                                );
                            }
                            let warm_error = if let Some(m) = mtp.as_mut() {
                                self.mtp_warm_prefill_pairs(m, &pairs, pos).err()
                            } else {
                                None
                            };
                            if let Some(err) = warm_error {
                                // The trunk batch was already admitted.  A
                                // failed MTP warm-up therefore clears both
                                // mirrors and exits; continuing would pair a
                                // current trunk state with a stale MTP cache.
                                self.finish_generation(&mut mtp, &mut router, true);
                                return Err(err.to_string());
                            }
                        }
                    }
                    hidden.copy_from_slice(&hiddens[(bk - 1) * hs..]);
                    pos = end;
                    if snap_at == Some(end) {
                        self.gdn_snap = crate::gpu::gdn_snapshot(self.graph_kv_id, end).then(|| input_ids[..end].to_vec());
                    }
                } else if outcome == crate::gpu::BatchGraphOutcome::Failed {
                    // A failed batch may have advanced a device recurrent
                    // state (ordinary GDN or sealed O(1)). A CPU fallback
                    // would then observe stale accumulators, so clear the
                    // request state and make the failure explicit.
                    self.finish_generation(&mut mtp, &mut router, true);
                    return Err(if o1_batch_ready {
                        "sealed O(1) batch graph failed after admission".to_string()
                    } else {
                        "ordinary recurrent batch graph failed after admission".to_string()
                    });
                } else {
                    break; // unsupported → per-position graph handles the rest
                }
            }
            if mtp_batch_prefill && mtp.is_some() && pos == input_ids.len() {
                self.mtp_warm_base = Some(self.mtp_pos_base);
            }
            // the CUDA DFlash block is built once the trunk's kernels are, so
            // its first round does not pay it
            #[cfg(feature = "cuda")]
            if crate::gpu::cuda_active() {
                if let Some(d) = &self.dflash {
                    let _ = d.dev_ready();
                }
            }
            #[cfg(target_os = "macos")]
            if std::env::var("CMF_PREFILL_PROF").is_ok() {
                crate::gpu_metal::cut_report();
            }
            // A dense stack the batched graph does not take reads the prompt chunked
            // on the host walk (its GEMMs on the card), as before the graph took dense
            // prompts, instead of one position at a time.
            if pos == pos_start
                && graph_prefill
                && !o1_batch_ready
                && mtp.is_none()
                && !mimo_spec
                && self.can_prefill_batched()
                && !self.per_token_stack()
                && self.weights.layers.iter().all(|lw| {
                    !matches!(&lw.attn, AttnKind::LinearGdn(_)) && !matches!(&lw.ffn, FfnKind::Moe(_))
                })
            {
                self.dense_batch_declined.store(true, std::sync::atomic::Ordering::Relaxed);
                let chunk = self.prefill_chunk();
                while pos < input_ids.len() && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
                    let end = (pos + chunk).min(input_ids.len());
                    let hb = self.prefill_batch(&input_ids[pos..end], pos);
                    hidden.copy_from_slice(&hb[(end - pos - 1) * hs..]);
                    pos = end;
                }
            }
        }
        // Resident Embryo graph: the prompt in chunks of one submit each
        // instead of one whole-graph submit per position; the last chunk
        // carries the logits exactly as the per-position walk would.
        if graph_prefill
            && task_mask.is_none()
            && mtp.is_none()
            && !dyn_prefill
            && pos == 0
            && input_ids.len() > 1
            && !self.cancel.load(std::sync::atomic::Ordering::Relaxed)
        {
            if let Some(lg) = self.embryo_prefill_chunked(input_ids, 0) {
                self.graph_logits = Some(lg);
                hidden = vec![0.0; self.hidden_size];
                pos = input_ids.len();
            }
        }
        while pos < input_ids.len() && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
            self.graph_want_logits = fuse_lm && pos + 1 == input_ids.len();
            hidden = self.forward_layers(&self.embed_single(input_ids[pos]), pos, task_mask);
            if mimo_spec {
                self.mimo_note_rows(&hidden, pos);
            }
            if let Some(m) = &mut mtp {
                if pos + 1 < input_ids.len() {
                    // `CMF_MTP_CHAIN_PROBE=k`: teacher-forced acceptance of a
                    // CHAINED draft — iterate the head on its own hidden k
                    // deep and score every depth against the prompt's real
                    // continuation. The economics of a k-token speculative
                    // round stand or fall on this table.
                    let probe: usize = std::env::var("CMF_MTP_CHAIN_PROBE")
                        .ok()
                        .and_then(|v| v.parse().ok())
                        .unwrap_or(0);
                    if probe >= 1 && pos + 2 < input_ids.len() {
                        let (d1, mut hx) = self.mtp_step_h(m, &hidden, input_ids[pos + 1], pos);
                        let mut ok = d1 == input_ids[pos + 2];
                        Self::chain_probe_note(0, ok);
                        let mut d_prev = d1;
                        let mut extra = 0usize;
                        for j in 1..probe {
                            if pos + 2 + j >= input_ids.len() {
                                break;
                            }
                            let (dj, hj) = self.mtp_step_h(m, &hx, d_prev, pos + 1 + j);
                            extra += 1;
                            ok = ok && dj == input_ids[pos + 2 + j];
                            Self::chain_probe_note(j, ok);
                            d_prev = dj;
                            hx = hj;
                        }
                        // The chain's rows are speculation, not the prompt —
                        // keep only the warmup row the plain path would add.
                        m.kv.truncate_last(extra);
                    } else {
                        let _ = self.mtp_step(m, &hidden, input_ids[pos + 1], pos);
                    }
                }
            }
            pos += 1;
        }
        #[cfg(not(target_os = "macos"))]
        crate::gpu::set_batch_kv_hint(0);
        if std::env::var("CMF_PREFILL_PROF").is_ok() {
            eprintln!(
                "prefill: {} tokens in {:.1} ms (batch_k={batch_k})",
                input_ids.len(),
                _tpf.elapsed().as_secs_f64() * 1000.0
            );
        }
        // The Neural Engine read the prompt; decode runs on the GPU, so its surfaces go back
        // to the weight map (`ane::release_idle`).
        #[cfg(target_os = "macos")]
        crate::gpu_metal::ane::release_idle();
        if self
            .graph_failed
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            // MTP is detached for speculative generation.  Restore the
            // module before returning the terminal graph error; otherwise a
            // failed request would silently remove the head from a pooled
            // pipeline and the next request would lose its configured route.
            self.finish_generation(&mut mtp, &mut router, true);
            return Err("GPU token graph failed during prefill".to_string());
        }
        // Cancelled mid-prefill: the cache holds a partial prompt —
        // drop the reuse history and return an empty generation.
        if self
            .cancel
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            // A cancelled prefill can already have advanced the device
            // mirror. Drop the whole partial sequence so a pooled pipeline
            // cannot carry that state into its next request.
            self.finish_generation(&mut mtp, &mut router, true);
            return Ok(GenerateResult {
                text: String::new(),
                token_ids: Vec::new(),
                prompt_tokens: input_ids.len(),
                tokens_generated: 0,
                finish_reason: "cancelled".to_string(),
                mtp_drafted: 0,
                mtp_accepted: 0,
                token_confidence: Vec::new(),
                traces: Vec::new(),
            });
        }

        // Prompt absorbed → freeze the o1 layers' skeletons; from here
        // every decode step on those layers is O(W + m·dv + m²).
        if !o1_sealed {
            match self.o1_seal_checked() {
                Ok(_) => {}
                Err(err) => {
                    self.finish_generation(&mut mtp, &mut router, true);
                    return Err(err);
                }
            }
        }

        // Bytes of a character the last streamed token left unfinished.
        let mut utf8_pending: Vec<u8> = Vec::new();
        // Commit one token: push, check EOS, stream. Returns false = stop.
        macro_rules! commit {
            ($id:expr) => {{
                all_ids.push($id);
                generated += 1;
                self.note_draft_id($id);
                if self.tokenizer.is_eos($id) && !self.ignore_eos {
                    finish_reason = "stop".to_string();
                    false
                } else {
                    let token_text = self.tokenizer.decode_token_stream($id, &mut utf8_pending);
                    let mut go = true;
                    if let Some(ref mut cb) = on_token {
                        if !cb(&token_text) {
                            finish_reason = "cancelled".to_string();
                            go = false;
                        }
                    }
                    if go
                        && self.sampler_config.loop_stop
                        && crate::sampler::tail_repeats(&all_ids[all_ids.len() - generated..])
                    {
                        finish_reason = "loop".to_string();
                        go = false;
                    }
                    go
                }
            }};
        }

        // Speculation is decided by MEASUREMENT, not by an acceptance
        // model. A k=4 round costs ~3.8 plain tokens on the 5090 (draft
        // 6.6 + verify 66.6 + commit 4.8 ms against a 20.6 ms token), so it
        // pays only when the head lands ~2.8 of 4 — predictable text (code,
        // structured output) does, free prose often does not, and the
        // ratio at which the two cross depends on the card and the context
        // depth. So: four speculative rounds timed, then eight plain
        // tokens timed, and the faster arm runs until a re-check 256
        // tokens later (context growth moves the balance). The trial
        // costs at most a few tokens of the slower arm per 256.
        let mut spec_trial = SpecTrial::Spec {
            t0: std::time::Instant::now(),
            gen0: generated,
            rounds: 0,
        };
        // The token-count proxy prices a round at ~1.9 plain tokens. That
        // holds for the Metal rounds whose cost was measured — greedy and
        // the sparse sampling chain — so an expensive round (the dense
        // chain, reachable only by `CMF_GRAPH_SPEC_SAMPLE=1`) still times
        // the plain path before it decides.
        let mut spec_mon = SpecMon {
            metal: graph_spec && crate::gpu::q1_force() && spec_cheap_round,
            cuda: graph_spec && crate::gpu::cuda_active() && self.sampler_config.temperature < 1e-6,
            ..SpecMon::default()
        };
        // wgpu: a plain token an earlier request's trial timed stands while
        // the context is of the same order (the trunk's weights are most of
        // a token's time), and this trial decides after its rounds.
        if !spec_mon.metal && self.spec_plain_ms.0 > 0.0 && input_ids.len() <= self.spec_plain_ms.1 * 2 + 1024 {
            spec_mon.plain_ms = self.spec_plain_ms.0;
        }
        let mut spec_watchdog_off = false;
        // CMF_GRAPH_SPEC_TIME: the round walls so far (round 1 excluded —
        // it pays the scratch), for the outlier test on each new one
        let mut spec_walls: Vec<f32> = Vec::new();
        // ... and the end of the last round: the host time between rounds
        // (token commits, streaming, the loop top) is printed at level 2
        let mut spec_round_end: Option<std::time::Instant> = None;
        if mimo_spec {
            if let Ok(path) = std::env::var("CMF_MIMO_MTP_PROBE") {
                if let Some(mut st) = self.mimo_mtp.take() {
                    self.mimo_mtp_probe(&mut st, input_ids, &path);
                    self.mimo_mtp = Some(st);
                }
            }
        }
        // ── Decode ──
        let mut next_pos = input_ids.len();
        'decode: while generated < max_tokens {
            if self
                .graph_failed
                .swap(false, std::sync::atomic::Ordering::Relaxed)
            {
                // Keep the detached MTP module attached after a terminal
                // graph error so the pipeline can be reused for a fresh
                // sequence.  `clear_sequence_state` only clears mirrors and
                // host KV; it cannot recover a module dropped here.
                self.finish_generation(&mut mtp, &mut router, true);
                return Err("GPU token graph failed during decode".to_string());
            }
            if self
                .cancel
                .swap(false, std::sync::atomic::Ordering::Relaxed)
            {
                finish_reason = "cancelled".to_string();
                break 'decode;
            }
            // A rejected speculative draft already drew this position's
            // token from the residual distribution (graph_spec_step); it
            // is committed as-is — sampling again from the row's logits
            // would bias the stream toward the target's mode.
            if mimo_spec && next_pos > 0 {
                // Every path leaves `hidden` = the backbone output at
                // next_pos-1; the draft layers read it (idempotent).
                self.mimo_note_rows(&hidden, next_pos - 1);
            }
            let forced = self.spec_forced.take();
            let mut logits = match (forced, self.graph_logits.take()) {
                (Some(_), _) => Vec::new(),
                (None, Some(lg)) => lg,
                (None, None) => {
                    let _prof = crate::cpuprof::time(crate::cpuprof::Slot::Head);
                    // Pooled-tail mode: the head as one layer-less device
                    // pass (final-norm + matvec + readback). Any decline —
                    // no pool, unresolvable weight, backend off — keeps the
                    // host head exactly as before.
                    #[cfg(feature = "gpu")]
                    let logits_out = if let Some(lg) = self.m3_device_logits(&hidden) {
                        lg
                    } else {
                        inference::rms_norm_into(
                            &hidden,
                            &self.weights.final_norm,
                            self.rms_eps,
                            self.norm_style,
                            &mut self.ws.n1,
                        );
                        self.lm_head_forward(&self.ws.n1)
                    };
                    #[cfg(not(feature = "gpu"))]
                    let logits_out = {
                        inference::rms_norm_into(
                            &hidden,
                            &self.weights.final_norm,
                            self.rms_eps,
                            self.norm_style,
                            &mut self.ws.n1,
                        );
                        self.lm_head_forward(&self.ws.n1)
                    };
                    logits_out
                }
            };
            // CMF_LOGIT_DUMP=<path>: the first decode step's hidden + logits
            // as raw f32 (hidden first) — cross-backend numerics diffing.
            if generated
                == std::env::var("CMF_LOGIT_DUMP_STEP")
                    .ok()
                    .and_then(|v| v.parse().ok())
                    .unwrap_or(0)
            {
                if let Ok(path) = std::env::var("CMF_LOGIT_DUMP") {
                    let mut bytes: Vec<u8> = Vec::with_capacity((hidden.len() + logits.len()) * 4);
                    for v in hidden.iter().chain(logits.iter()) {
                        bytes.extend_from_slice(&v.to_le_bytes());
                    }
                    if let Err(e) = std::fs::write(&path, &bytes) {
                        eprintln!("logit dump: failed to write {path}: {e}");
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err(format!("logit dump write failed: {e}"));
                    }
                }
            }
            // CMF_LOGIT_DUMP_ALL=<dir>: every decode step's logits as raw
            // f32, `<dir>/step{n:05}.f32` — step-by-step backend diffing
            // (a greedy run on two backends compares until they diverge).
            if let Ok(dir) = std::env::var("CMF_LOGIT_DUMP_ALL") {
                if !logits.is_empty() {
                    let path = std::path::Path::new(&dir).join(format!("step{generated:05}.f32"));
                    let bytes: Vec<u8> = logits.iter().flat_map(|v| v.to_le_bytes()).collect();
                    if let Err(e) =
                        std::fs::create_dir_all(&dir).and_then(|_| std::fs::write(&path, &bytes))
                    {
                        eprintln!("logit dump: failed to write {}: {e}", path.display());
                    }
                }
            }
            self.clover_causal_logits(&mut logits, generated, &all_ids[penalty_from..]);
            if let Some(g) = self.dash.as_mut().and_then(|d| d.guard.as_mut()) {
                g.apply(&mut logits, &all_ids[input_ids.len()..]);
            }
            let t_next = match forced.or_else(|| forced_ids_at(generated)) {
                Some(c) => c,
                None => {
                    let _prof = crate::cpuprof::time(crate::cpuprof::Slot::Sampler);
                    sampler::sample_with_scratch_pool(
                        &logits,
                        &self.sampler_config,
                        self.sampler_config.penalty_past(&all_ids[penalty_from..], bounded_native),
                        &mut self.rng,
                        &mut self.sampler_scratch,
                        self.pool.as_deref(),
                    )
                }
            };
            if self.confidence_on {
                confidence.push(if logits.is_empty() {
                    0.0
                } else {
                    sampler::top1_prob_pool(
                        self.pool.as_deref(),
                        &mut self.sampler_scratch,
                        &logits,
                        t_next,
                        calib_temp,
                    )
                });
            }
            if !logits.is_empty() {
                attention::recycle_buf(&mut logits);
            }
            if trace_on {
                // active_skill = the overlay in force while this token was
                // generated; recon/switched are filled after the post-emit
                // routing eval below (freshest coherence for this token).
                let skill = router.as_ref().and_then(|r| r.active_id());
                traces.push(TokenTrace {
                    t: generated,
                    token_id: t_next,
                    confidence: confidence.last().copied().unwrap_or(0.0),
                    active_skill: skill,
                    recon: None,
                    switched: false,
                });
            }
            if !commit!(t_next) {
                break 'decode;
            }
            if generated >= max_tokens {
                break 'decode;
            }

            // Catch-all for decode paths that bypass the walks' own trim
            // (a graph step, a speculative round).
            self.swa_trim_tails();
            if self.dsv41.is_none() && self.dory.is_none() && self.kv_cache.needs_eviction() {
                // Say it ONCE, loudly: past this point the model keeps
                // talking but has lost half its context, and on a GDN
                // hybrid the graph's device state goes stale on top. The
                // Qwen3.8 bring-up spent a day reading this cliff as
                // three different model bugs.
                static SAID: std::sync::Once = std::sync::Once::new();
                SAID.call_once(|| {
                    tracing::warn!(
                        "KV cache full at {} positions — evicting half; quality \
                         will degrade. Raise CMF_MAX_SEQ.",
                        self.kv_cache.max_seq_len,
                    );
                });
                let keep = (self.kv_cache.max_seq_len / 2).max(1);
                self.kv_cache.evict(keep);
            }

            // Advance the speculation trial: plain-phase accounting and
            // the periodic re-check happen here, on every token.
            if graph_spec {
                match spec_trial {
                    SpecTrial::Plain { t0, gen0 } if spec_mon.plain_done(t0, gen0, generated) => {
                        spec_mon.plain_ms =
                            t0.elapsed().as_secs_f64() * 1e3 / (generated - gen0) as f64;
                        if !spec_mon.metal {
                            self.spec_plain_ms = (spec_mon.plain_ms, next_pos);
                        }
                        let keep = spec_mon.pays();
                        tracing::info!(
                            "speculation trial: {:.2} tok/round in {:.1} ms vs plain {:.1} ms/tok — {}",
                            spec_mon.tokens,
                            spec_mon.round_ms,
                            spec_mon.plain_ms,
                            if keep { "speculating" } else { "plain" }
                        );
                        spec_mon.fails = 0;
                        spec_trial = SpecTrial::Decided {
                            spec: keep,
                            recheck_at: if keep { usize::MAX } else { spec_mon.recheck_plain_at(generated) },
                        };
                    }
                    SpecTrial::Decided { recheck_at, .. } if generated >= recheck_at => {
                        spec_mon.n = 0;
                        spec_mon.zero_accept_rounds = 0;
                        spec_trial = SpecTrial::Spec {
                            t0: std::time::Instant::now(),
                            gen0: generated,
                            rounds: 0,
                        };
                    }
                    _ => {}
                }
                spec_watchdog_off = matches!(
                    spec_trial,
                    SpecTrial::Plain { .. } | SpecTrial::Decided { spec: false, .. }
                );
            }
            // ── MiMo-V2 draft stack: draft K, verify K+1 rows in one batch ──
            if mimo_spec && generated + 1 < max_tokens && next_pos > 0 {
                let budget = max_tokens - generated - 1;
                if let Some(mut st) = self.mimo_mtp.take() {
                    let k = st.depth.min(budget);
                    let r = self.mimo_spec_round(&mut st, next_pos, &all_ids, k);
                    self.mimo_mtp = Some(st);
                    let r = match r {
                        Ok(r) => r,
                        Err(err) => {
                            self.finish_generation(&mut mtp, &mut router, true);
                            return Err(err);
                        }
                    };
                    if let Some(r) = r {
                        drafted += r.drafted;
                        accepted += r.accepted.len();
                        let mut stopped = false;
                        for &id in &r.accepted {
                            if self.confidence_on {
                                confidence.push(0.0);
                            }
                            if !commit!(id) {
                                stopped = true;
                                break;
                            }
                        }
                        if stopped {
                            break 'decode;
                        }
                        next_pos += r.accepted.len() + 1;
                        hidden = r.hidden;
                        // The loop top chooses the round's own token from
                        // these logits — the same sampler, same history.
                        self.graph_logits = Some(r.logits);
                        continue 'decode;
                    }
                }
            }
            // ── A trunk without a draft block: the sidecar's block drafts, the batch graph verifies ──
            #[cfg(feature = "gpu")]
            if solo_spec && next_pos > 0 {
                let now = std::time::Instant::now();
                // the step that just ended, on the account of its kind
                if let Some((t, tokens)) = solo.last.take() {
                    let ms = (now - t).as_secs_f32() * 1e3;
                    if tokens == 0 {
                        if solo.plain_n > 0 {
                            solo.plain_ms = if solo.plain_ms == 0.0 { ms } else { 0.7 * solo.plain_ms + 0.3 * ms };
                        }
                        solo.plain_n += 1;
                    } else if solo.first {
                        solo.first = false;
                        if spec_time_level() > 0 {
                            eprintln!("solo-round wall {ms:.1} ms → {tokens} tokens (the first round: not a sample)");
                        }
                    } else {
                        let per = ms / tokens as f32;
                        // a tenth a round: one round that kept nothing (85 ms for its
                        // one token against 20 a token before it) must not send a
                        // drafter keeping 80 % to rest — at a fifth it did, 36 against
                        // 47 tok/s on code
                        solo.round_ms = if solo.rounds == 0 { per } else { 0.9 * solo.round_ms + 0.1 * per };
                        solo.rounds += 1;
                        if spec_time_level() > 0 {
                            eprintln!(
                                "solo-round wall {ms:.1} ms → {tokens} tokens ({:.1} ms a token, plain {:.1})",
                                solo.round_ms, solo.plain_ms
                            );
                        }
                        // Rounds that land tokens no faster than plain steps sit out, longer
                        // each time. Judged on the window's summed wall over its summed
                        // tokens from its SOLO_JUDGE-th round on: a short answer was over
                        // before six rounds at a third kept had sent the drafter to rest
                        // (MNN-Pocket-0.3B chat: 237 against 303 tok/s plain), and one
                        // round that kept nothing weighs only its share of the sum.
                        solo.win_ms += ms;
                        solo.win_tok += tokens as u32;
                        if solo_pin.is_none() && solo.plain_ms > 0.0 && solo.rounds >= SOLO_JUDGE {
                            if solo.win_ms / solo.win_tok.max(1) as f32 > solo.plain_ms {
                                solo.rest = solo.back;
                                solo.back = (solo.back * 2).min(SOLO_REST_MOST);
                                solo.rounds = 0;
                                solo.win_ms = 0.0;
                                solo.win_tok = 0;
                            } else if solo.rounds >= SOLO_TRIAL {
                                // a winning window starts over, so the verdict follows the text
                                solo.rounds = 0;
                                solo.win_ms = 0.0;
                                solo.win_tok = 0;
                            }
                        }
                    }
                }
                if solo.rest == 0 && generated + 1 < max_tokens {
                    let k = solo.k.min(max_tokens - generated);
                    match self.solo_spec_round(t_next, next_pos, &all_ids, k) {
                        Some(r) => {
                            drafted += r.drafted;
                            accepted += r.accepted.len();
                            if solo_pin.is_none() {
                                // two past what held: a round that held all of its drafts goes deeper
                                solo.k = (r.accepted.len() + 2).clamp(2, SOLO_K_AUTO);
                            }
                            solo.last = Some((now, r.accepted.len() + 1));
                            let mut stopped = false;
                            for &id in &r.accepted {
                                if self.confidence_on {
                                    confidence.push(0.0);
                                }
                                if trace_on {
                                    traces.push(TokenTrace {
                                        t: generated,
                                        token_id: id,
                                        confidence: confidence.last().copied().unwrap_or(0.0),
                                        active_skill: None,
                                        recon: None,
                                        switched: false,
                                    });
                                }
                                if !commit!(id) {
                                    stopped = true;
                                    break;
                                }
                            }
                            if stopped {
                                break 'decode;
                            }
                            next_pos += r.accepted.len() + 1;
                            hidden = r.hidden;
                            self.graph_logits = Some(r.logits);
                            continue 'decode;
                        }
                        None => {
                            if self.graph_failed.swap(false, std::sync::atomic::Ordering::Relaxed) {
                                self.finish_generation(&mut mtp, &mut router, true);
                                return Err("GPU batch graph failed during a speculative round".to_string());
                            }
                            // no round here (the drafter's context is not at the tip, the batch graph declined)
                            solo.rest = 8;
                        }
                    }
                }
                solo.rest = solo.rest.saturating_sub(1);
                solo.last = Some((now, 0));
            }
            // ── Qwen3.8-Flash-Next draft head: k greedy drafts from the MTP
            //    sidecar, one batched verify window on the device ──
            #[cfg(feature = "gpu")]
            if self.speculative
                && self.qwen4_exp.is_some()
                && task_mask.is_none()
                && self.sampler_config.temperature < 1e-6
                && generated + 1 < max_tokens
                && next_pos > 0
                && std::env::var("CMF_QWEN_MTP").as_deref() != Ok("0")
            {
                let r = match &mut self.qwen4_exp {
                    Some(b) => {
                        // a copy frame drafts no further than the request goes
                        b.3.set_draft_budget(max_tokens - generated - 1);
                        crate::qwen4_exp::spec_round(
                            &b.0,
                            &b.1,
                            &b.2,
                            &mut b.3,
                            next_pos,
                            &all_ids,
                            &self.inv_freq,
                            self.pool.as_deref(),
                        )
                    }
                    None => None,
                };
                if let Some(r) = r {
                    drafted += r.drafted;
                    accepted += r.accepted.len();
                    let mut stopped = false;
                    for &id in &r.accepted {
                        if self.confidence_on {
                            confidence.push(0.0);
                        }
                        if !commit!(id) {
                            stopped = true;
                            break;
                        }
                    }
                    if stopped {
                        break 'decode;
                    }
                    next_pos += r.accepted.len() + 1;
                    hidden.fill(0.0);
                    self.graph_logits = Some(r.logits);
                    continue 'decode;
                }
            }
            match &mut mtp {
                // ── Graph speculation: chain-draft, batch-verify on device ──
                #[cfg(feature = "gpu")]
                Some(m)
                    if graph_spec
                        && !spec_watchdog_off
                        && generated + 1 < max_tokens
                        && next_pos > 0 =>
                {
                    let t_round = std::time::Instant::now();
                    if spec_time_level() >= 2 {
                        if let Some(t) = spec_round_end.take() {
                            eprintln!(
                                "spec-gap {:.2} ms (host between rounds)",
                                t.elapsed().as_secs_f64() * 1e3
                            );
                        }
                    }
                    spec_stamps_begin();
                    // device buffers allocated during this round: a
                    // first-touch Shared allocation is zero-filled inside
                    // the command buffer that uses it, which is what the
                    // long outlier rounds were
                    #[cfg(target_os = "macos")]
                    let allocs0 =
                        crate::gpu_metal::IO_BUF_ALLOCS.load(std::sync::atomic::Ordering::Relaxed);
                    #[cfg(not(target_os = "macos"))]
                    let allocs0 = 0u64;
                    if let Some((extra, n_pos, new_h)) = self.graph_spec_step(
                        m,
                        &hidden,
                        t_next,
                        next_pos,
                        &mut drafted,
                        &mut accepted,
                        &mut all_ids,
                        max_tokens - generated,
                    ) {
                        next_pos = n_pos;
                        hidden = new_h;
                        let level = spec_time_level();
                        if level > 0 {
                            let wall = t_round.elapsed().as_secs_f32() * 1e3;
                            let stamps = spec_stamps_take();
                            // the running median of the rounds before this
                            // one (round 1 pays the scratch: not a sample)
                            let median = if spec_walls.len() >= 3 {
                                let mut s = spec_walls.clone();
                                s.sort_by(|a, b| a.partial_cmp(b).unwrap());
                                Some(s[s.len() / 2])
                            } else {
                                None
                            };
                            let outlier = median.is_some_and(|m| wall > 1.4 * m);
                            #[cfg(target_os = "macos")]
                            let allocs = crate::gpu_metal::IO_BUF_ALLOCS
                                .load(std::sync::atomic::Ordering::Relaxed)
                                - allocs0;
                            #[cfg(not(target_os = "macos"))]
                            let allocs = allocs0;
                            eprintln!(
                                "spec-round wall {wall:.1} ms → {} tokens{}{}",
                                extra.len() + 1,
                                if allocs > 0 {
                                    format!(" [{allocs} new device buffers]")
                                } else {
                                    String::new()
                                },
                                match (outlier, median) {
                                    (true, Some(m)) => format!(" OUTLIER (median {m:.1})"),
                                    _ => String::new(),
                                }
                            );
                            if level >= 2 || outlier {
                                let sum: f32 = stamps.iter().map(|s| s.1).sum();
                                eprintln!(
                                    "spec-stamps: {}| untracked {:.1}",
                                    spec_stamps_format(&stamps),
                                    wall - sum
                                );
                            }
                            if spec_mon.n >= 1 {
                                spec_walls.push(wall);
                            }
                        }
                        // One speculative round done: the monitor counts it
                        // (round 1 untimed — it pays the batch scratch and
                        // the draft mirror), and the trial advances.
                        spec_mon.round(t_round.elapsed().as_secs_f64() * 1e3, extra.len() + 1);
                        // the round's tokens land in `generated` below; the
                        // plain phase must start counting AFTER them
                        spec_trial = Self::spec_trial_round(
                            spec_trial,
                            &mut spec_mon,
                            generated + extra.len() + 1,
                        );
                        let mut stopped = false;
                        for &id in &extra {
                            if self.confidence_on {
                                confidence.push(0.0);
                            }
                            // `graph_spec_step` commits the accepted MTP
                            // drafts as a batch.  They do not pass through
                            // the ordinary loop-top sampling block below,
                            // which is normally where the telemetry row is
                            // created.  Keep the public trace contract
                            // (one row per emitted token) here as well.
                            //
                            // The graph-spec path does not surface a
                            // per-row probability for accepted extras.  It
                            // deliberately matches the zero placed in the
                            // confidence channel above instead of inventing
                            // one or adding a separate probability pass.
                            if trace_on {
                                traces.push(TokenTrace {
                                    t: generated,
                                    token_id: id,
                                    confidence: confidence.last().copied().unwrap_or(0.0),
                                    active_skill: None,
                                    recon: None,
                                    switched: false,
                                });
                            }
                            if !commit!(id) {
                                stopped = true;
                                break;
                            }
                        }
                        if stopped {
                            break 'decode;
                        }
                        if spec_time_level() >= 2 {
                            spec_round_end = Some(std::time::Instant::now());
                        }
                        continue 'decode;
                    }
                    if self
                        .graph_failed
                        .swap(false, std::sync::atomic::Ordering::Relaxed)
                    {
                        // `graph_spec_step` may have detached MTP while a
                        // warm-up was in flight.  Do not reinterpret its
                        // terminal device failure as a plain decode step;
                        // restore the head, clear both mirrors, and surface
                        // one explicit error to the caller.
                        self.finish_generation(&mut mtp, &mut router, true);
                        return Err("GPU MTP graph failed during speculative decode".to_string());
                    }
                    // Declined (batch graph refused): plain forward below —
                    // and a round that produced one token for the trial's
                    // ledger, so a graph that keeps refusing is measured out
                    // like a head that keeps missing (it was spinning
                    // forever on a file whose batch graph declines).
                    // A declined round is not a cheap one-token round — it
                    // is a verify that does not exist for this file (a
                    // healed q8_2f tail measured 760 drafts, 0 accepted, 33
                    // against 48.8 tok/s while the monitor called the draft
                    // alone "paying"). Count it as the losing streak in one.
                    spec_mon.round(t_round.elapsed().as_secs_f64() * 1e3, 1);
                    spec_mon.tokens = 0.0;
                    spec_mon.fails = 3;
                    spec_trial = Self::spec_trial_round(spec_trial, &mut spec_mon, generated + 1);
                    hidden = self.forward_layers(&self.embed_single(t_next), next_pos, task_mask);
                    next_pos += 1;
                    continue 'decode;
                }
                // ── Speculative: draft t+2, verify in a fused pair ──
                Some(m) if !graph_spec && generated + 1 < max_tokens => {
                    let draft = self.mtp_step(m, &hidden, t_next, next_pos - 1);
                    drafted += 1;
                    let emb1 = self.embed_single(t_next);
                    let emb2 = self.embed_single(draft);
                    let (h1, h2) = self.forward_pair(&emb1, &emb2, next_pos);

                    inference::rms_norm_into(
                        &h1,
                        &self.weights.final_norm,
                        self.rms_eps,
                        self.norm_style,
                        &mut self.ws.n1,
                    );
                    let mut logits1 = self.lm_head_forward(&self.ws.n1);
                    let t_after = sampler::sample_with_scratch_pool(
                        &logits1,
                        &self.sampler_config,
                        self.sampler_config.penalty_past(&all_ids, bounded_native),
                        &mut self.rng,
                        &mut self.sampler_scratch,
                        self.pool.as_deref(),
                    );
                    if self.confidence_on {
                        confidence.push(sampler::top1_prob_pool(
                            self.pool.as_deref(),
                            &mut self.sampler_scratch,
                            &logits1,
                            t_after,
                            calib_temp,
                        ));
                    }
                    attention::recycle_buf(&mut logits1);
                    if trace_on {
                        // Speculative decode is mutually exclusive with
                        // dynamic routing (router is None here) — no skill.
                        traces.push(TokenTrace {
                            t: generated,
                            token_id: t_after,
                            confidence: confidence.last().copied().unwrap_or(0.0),
                            active_skill: None,
                            recon: None,
                            switched: false,
                        });
                    }
                    let stop = !commit!(t_after);

                    if t_after == draft {
                        accepted += 1;
                        self.commit_linear_scratch();
                        let _ = self.mtp_step(m, &h1, t_after, next_pos);
                        hidden = h2;
                        next_pos += 2;
                    } else {
                        // The draft lane is wrong: roll its KV entry back.
                        for layer in &mut self.kv_cache.layers {
                            layer.truncate_last(1);
                        }
                        if !stop {
                            let _ = self.mtp_step(m, &h1, t_after, next_pos);
                            hidden = self.forward_layers(
                                &self.embed_single(t_after),
                                next_pos + 1,
                                None,
                            );
                        }
                        next_pos += 2;
                    }
                    if stop {
                        break 'decode;
                    }
                }
                // ── Vanilla: forward the sampled token ──
                _ => {
                    // ── DeepSeek-V4 speculative decode (CMF_DSV4_SPEC=1):
                    // draft five on the card, verify batched, commit the
                    // accepted prefix. Greedy only; a rejected token's state
                    // is restored and replayed, so output equals the walk. ──
                    #[cfg(feature = "gpu")]
                    if Self::dsv4_spec_on() && self.dsv4.is_some() {
                        static SAID: std::sync::Once = std::sync::Once::new();
                        SAID.call_once(|| {
                            eprintln!(
                                "dsv4-spec gate: mtp={} mask={} router={} trace={} temp={} rep={} ",
                                !self.dsv4_mtp.is_empty(),
                                task_mask.is_none(),
                                router.is_none(),
                                !trace_on,
                                self.sampler_config.temperature < 1e-6,
                                self.sampler_config.repetition_penalty == 1.0,
                            );
                        });
                    }
                    #[cfg(feature = "gpu")]
                    if Self::dsv4_spec_on()
                        && self.dsv4.is_some()
                        && !self.dsv4_mtp.is_empty()
                        && task_mask.is_none()
                        && router.is_none()
                        && !trace_on
                        && self.sampler_config.temperature < 1e-6
                        && self.sampler_config.repetition_penalty == 1.0
                        && generated + 1 < max_tokens
                        && all_ids.len() >= 2
                        && generated >= dsv4_spec_retry_at
                    {
                        let tip_token = all_ids[all_ids.len() - 2];
                        let drafted0 = drafted;
                        let round = self.dsv4_spec_step(
                            tip_token,
                            t_next,
                            next_pos,
                            max_tokens.saturating_sub(generated),
                            &mut drafted,
                            &mut accepted,
                        );
                        if drafted > drafted0 {
                            let useful = round.as_ref().is_some_and(|(extra, _)| !extra.is_empty());
                            if useful {
                                dsv4_spec_bad = 0;
                            } else {
                                dsv4_spec_bad += 1;
                                if dsv4_spec_bad >= 2 {
                                    dsv4_spec_bad = 0;
                                    dsv4_spec_retry_at = generated.saturating_add(32);
                                    tracing::info!(
                                        "dsv4: the draft did not pay off twice — exact walk for 32 tokens"
                                    );
                                }
                            }
                        }
                        if let Some((extra, n_pos)) = round {
                            next_pos = n_pos;
                            let mut stopped = false;
                            for &id in &extra {
                                if self.confidence_on {
                                    confidence.push(0.0);
                                }
                                if !commit!(id) {
                                    stopped = true;
                                    break;
                                }
                            }
                            if stopped {
                                break 'decode;
                            }
                            continue 'decode;
                        }
                    }
                    self.graph_want_logits = fuse_lm;
                    // Greedy burst (CMF_MULTISTEP, off unless explicitly set): while
                    // nothing observes per-token state — pure argmax sampling,
                    // no router/trace/confidence/mask — decode k tokens per
                    // submit and commit them wholesale. The trailing normal
                    // forward leaves logits for the loop top, as always.
                    let mut t_fwd = t_next;
                    let pure_greedy = self.sampler_config.temperature < 1e-6
                        && self.sampler_config.repetition_penalty == 1.0
                        && self.sampler_config.presence_penalty == 0.0
                        && self.sampler_config.suppress_tokens.is_empty();
                    // Off by default: at every k the burst measured at or
                    // below the plain path on this graph shape (k=1 loses
                    // the argmax dispatches vs a 1 MB readback, k>=8 loses
                    // inter-step drains vs the saved sync). Experimental.
                    let burst_k = std::env::var("CMF_MULTISTEP")
                        .ok()
                        .and_then(|v| v.parse::<usize>().ok())
                        .unwrap_or(0);
                    if pure_greedy
                        && burst_k >= 1
                        && fuse_lm
                        && task_mask.is_none()
                        && router.is_none()
                        && !trace_on
                        && !self.confidence_on
                        // Diagnostics and teacher forcing observe every
                        // individual logit row.  A device-only burst returns
                        // only ids, so decline it rather than silently
                        // skipping requested evidence or forced ids.
                        && std::env::var_os("CMF_FORCE_IDS").is_none()
                        && std::env::var_os("CMF_LOGIT_DUMP").is_none()
                        && std::env::var_os("CMF_LOGIT_DUMP_ALL").is_none()
                    {
                        let mut stopped = false;
                        loop {
                            // The outer loop checks cancellation too, but a
                            // long run can stay in this burst loop for many
                            // submits.  Bound cancellation latency to one
                            // exact k-token frame.
                            if self
                                .cancel
                                .swap(false, std::sync::atomic::Ordering::Relaxed)
                            {
                                finish_reason = "cancelled".to_string();
                                stopped = true;
                                break;
                            }
                            let room = max_tokens.saturating_sub(generated);
                            if room <= 2 {
                                break;
                            }
                            let k = burst_k.min(room - 1);
                            if k < 1 {
                                break;
                            }
                            let Some(ids) = self.try_multi_burst(t_fwd, next_pos, k) else {
                                if self
                                    .graph_failed
                                    .swap(false, std::sync::atomic::Ordering::Relaxed)
                                {
                                    self.finish_generation(&mut mtp, &mut router, true);
                                    return Err(
                                        "GPU token graph failed during greedy burst".to_string()
                                    );
                                }
                                break;
                            };
                            next_pos += k;
                            for &id in &ids {
                                if !commit!(id) {
                                    stopped = true;
                                    break;
                                }
                            }
                            if stopped {
                                break;
                            }
                            t_fwd = *ids.last().unwrap();
                        }
                        if stopped {
                            break 'decode;
                        }
                    }
                    // Metal: keep the draft head's cache in step through
                    // the trial's plain phase and a paused speculation —
                    // the pair (hidden, t_fwd) at next_pos−1, the step the
                    // round's draft 0 would take. Without it the head's
                    // cache lagged the trunk by every plain token for the
                    // rest of the generation: the batched warm-up declined
                    // every later round and its rows went one by one (a
                    // whole MTP step per accepted token), and the drafts
                    // attended a context with those tokens missing.
                    #[cfg(target_os = "macos")]
                    if graph_spec
                        && spec_watchdog_off
                        && next_pos > 0
                        && self.mtp_graph_mode == Some(true)
                        && crate::gpu::q1_force()
                    {
                        if let Some(m) = mtp.as_mut() {
                            let _ = self.mtp_step_metal(m, &hidden, t_fwd, next_pos - 1, false);
                        }
                    }
                    if let Some(d) = self.dash.as_mut() {
                        d.at_decode(t_fwd, next_pos);
                    }
                    hidden = self.forward_layers(&self.embed_single(t_fwd), next_pos, task_mask);
                    next_pos += 1;
                    // Dynamic routing: the forward updated φ; ask the
                    // router whether to switch skills before the next token.
                    if let Some(r) = &mut router {
                        let phi = self.dyn_phi_ema.clone();
                        let decision = r.step(&phi, generated);
                        if let Some(new_active) = decision {
                            let _ = self.set_active_skill(new_active);
                        }
                        // Backfill this token's coherence + switch flag from
                        // the just-run eval (freshest measured values).
                        if trace_on {
                            if let Some(last) = traces.last_mut() {
                                let e = r.last_best_e();
                                last.recon = e.is_finite().then_some(e);
                                last.switched = decision.is_some();
                            }
                        }
                    }
                }
            }
        }

        let cancelled = finish_reason == "cancelled";
        // A generation during which the router switched weights holds no
        // state any single overlay would produce (each switch cleared the
        // cache mid-sequence), so it leaves no reuse key behind either.
        let dyn_switched = router.as_ref().is_some_and(|r| !r.switches.is_empty());
        if mimo_spec {
            if let Some(st) = self.mimo_mtp.as_ref() {
                let line = st.stats.line();
                tracing::info!("{line}");
                if std::env::var_os("CMF_MIMO_MTP_STATS").is_some() {
                    eprintln!("{line}");
                }
            }
        }
        self.finish_generation(&mut mtp, &mut router, cancelled);

        if self.dflash_solo && spec_time_level() > 0 {
            if let Some(line) = crate::dflash::stage_report() {
                eprintln!("solo-draft: {line}");
            }
        }
        // `CMF_GEN_IDS_OUT=FILE`: the sequence as ids, prompt first (what
        // `CMF_SPEC_SCRIPT` reads back).
        if let Ok(path) = std::env::var("CMF_GEN_IDS_OUT") {
            let text = all_ids.iter().map(|t| t.to_string()).collect::<Vec<_>>().join(" ");
            if let Err(e) = std::fs::write(&path, text) {
                tracing::warn!("CMF_GEN_IDS_OUT: {path}: {e}");
            }
        }
        let output_ids = &all_ids[input_ids.len()..];
        // Forwarded = prompt + all generated but the LAST sampled token
        // (emitted without being fed back). Exact only without MTP —
        // reuse is gated off when MTP is active.
        let forwarded = input_ids.len() + output_ids.len().saturating_sub(1);
        // A MiMo speculative round that stopped on an accepted draft (EOS,
        // cancel) leaves verify rows past the committed stream in the cache:
        // never offer that cache for reuse. Neither does a router that
        // switched weights mid-sequence (no single overlay produced it).
        let consumed = std::mem::take(&mut all_ids);
        if dyn_switched {
            self.clear_sequence_state();
        } else if cancelled || mimo_spec || prompt_rows.is_some() {
            self.clear_history();
        } else {
            self.record_consumed_prefix(&consumed[..forwarded.min(consumed.len())], reuse_from);
        }
        all_ids = consumed;
        let output_ids = &all_ids[input_ids.len()..];
        confidence.truncate(output_ids.len()); // guard against any overshoot
        traces.truncate(output_ids.len());
        // The loop monitor stopped the answer: it says the repeated block once.
        let output_ids = match finish_reason.as_str() {
            "loop" => {
                let excess = crate::sampler::tail_repeat_excess(output_ids).unwrap_or(0);
                &output_ids[..output_ids.len() - excess]
            }
            _ => output_ids,
        };
        Ok(GenerateResult {
            text: self.tokenizer.decode(output_ids),
            token_ids: output_ids.to_vec(),
            prompt_tokens: input_ids.len(),
            tokens_generated: generated,
            finish_reason,
            mtp_drafted: drafted,
            mtp_accepted: accepted,
            token_confidence: confidence,
            traces,
        })
    }

    /// One MTP step: feed `(hidden_p, token_{p+1})` into the draft head,
    /// advance its KV cache at position `p`, return the drafted token
    /// for position `p+2`.
    fn mtp_step(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        next_token: u32,
        position: usize,
    ) -> u32 {
        self.mtp_step_h(m, hidden, next_token, position).0
    }

    /// Tally for `CMF_MTP_CHAIN_PROBE`: per depth, how often the CHAIN is
    /// still an exact prefix of the real continuation. Printed every 128
    /// depth-0 samples so a killed run still shows its table.
    fn chain_probe_note(depth: usize, prefix_ok: bool) {
        use std::sync::Mutex;
        static T: Mutex<Vec<(u64, u64)>> = Mutex::new(Vec::new());
        let mut t = T.lock().unwrap();
        if t.len() <= depth {
            t.resize(depth + 1, (0, 0));
        }
        t[depth].0 += 1;
        t[depth].1 += prefix_ok as u64;
        if depth == 0 && t[0].0 % 128 == 0 {
            let line: Vec<String> = t
                .iter()
                .enumerate()
                .map(|(d, (n, k))| {
                    format!(
                        "d{}={:.0}%({n})",
                        d + 1,
                        100.0 * *k as f64 / (*n).max(1) as f64
                    )
                })
                .collect();
            eprintln!("mtp-chain: {}", line.join(" "));
        }
    }

    /// `mtp_step` that also hands back the block's own output hidden — the
    /// state a CHAINED draft feeds the next step, the way a multi-token
    /// speculative round iterates the head on itself.
    /// One MTP block step from (trunk hidden, token): the head's LOGITS
    /// and the block's own hidden for chaining. The draft is argmax of the
    /// logits on the greedy path and a draw from their post-chain
    /// distribution on the sampling path.
    fn mtp_step_hl(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        next_token: u32,
        position: usize,
    ) -> (Vec<f32>, Vec<f32>) {
        let position = position.saturating_sub(self.mtp_pos_base);
        // The graph arm: the MTP block as a one-layer token graph with the
        // head fused — device attention over the block's own KV mirror,
        // one submit for block + head, hidden and logits back together.
        // Decided once per generation (see `mtp_graph_mode`).
        #[cfg(target_os = "macos")]
        if self.mtp_graph_mode != Some(false) && crate::gpu::q1_force() {
            if let Some(r) = self.mtp_step_metal(m, hidden, next_token, position, true) {
                self.mtp_graph_mode = Some(true);
                return r;
            }
            if self.mtp_graph_mode == Some(true) {
                tracing::error!("mtp Metal graph failed after admission");
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                return (Vec::new(), Vec::new());
            }
            self.mtp_graph_mode = Some(false);
        }
        #[cfg(feature = "gpu")]
        if self.mtp_graph_mode != Some(false) {
            if !self.mtp_graph_ok(m) {
                if self.mtp_graph_mode == Some(true) {
                    // A mirror was already admitted, so a capability change
                    // cannot safely switch this request to the stale CPU
                    // cache.  Keep the same terminal contract as a failed
                    // token graph.
                    tracing::error!("mtp graph became unavailable after admission");
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    return (Vec::new(), Vec::new());
                }
                self.mtp_graph_mode = Some(false);
            } else {
                if let Some(r) = self.mtp_step_graph(m, hidden, next_token, position) {
                    self.mtp_graph_mode = Some(true);
                    return r;
                }
                if self.graph_failed.load(std::sync::atomic::Ordering::Relaxed) {
                    // A token graph can have admitted a persistent MTP/GDN
                    // mirror before its readback failed.  The CPU MTP cache
                    // is not a valid continuation in that state; leave the
                    // flag set so the generation caller returns through its
                    // terminal error path instead of silently switching
                    // arithmetic.
                    return (Vec::new(), Vec::new());
                }
                // `mtp_graph_ok` was true, so a None here means a refusal or
                // failure after graph admission.  Do not fall through to a
                // CPU cache whose rows may lag the device mirror.
                tracing::error!("mtp graph failed or declined after admission");
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                return (Vec::new(), Vec::new());
            }
        }
        // fc concat order is [enorm(embed); hnorm(hidden)] — EMBEDDING
        // FIRST. Verified by the oracle (converter/mtp_oracle.py):
        // [emb;hid] → 45.8% acceptance, [hid;emb] → 0.00%.
        let e = self.embed_single(next_token);
        let mut cat = vec![0.0f32; 2 * self.hidden_size];
        let (cat_e, cat_h) = cat.split_at_mut(self.hidden_size);
        inference::rms_norm_into(&e, &m.enorm, self.rms_eps, self.norm_style, cat_e);
        inference::rms_norm_into(hidden, &m.hnorm, self.rms_eps, self.norm_style, cat_h);
        let mut x = vec![0.0f32; self.hidden_size];
        m.eh_proj.matvec(&cat, &mut x, self.pool.as_deref());

        // One standard transformer block over the MTP's own cache.
        let lw = &m.layer;
        inference::rms_norm_into(
            &x,
            &lw.input_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.n1,
        );
        let attn = match &lw.attn {
            // MLA models carry no MTP head; this path cannot see them.
            AttnKind::Mla(_) => unreachable!("MLA has no MTP/pair path"),
            AttnKind::Kda(_) => unreachable!("KDA has no MTP/pair path"),
            AttnKind::Full {
                wq,
                wk,
                wv,
                wo,
                q_norm,
                k_norm,
                output_gate,
                softplus_gate,
                bias,
            } => {
                let mut cfg = self.attn_cfg(position);
                cfg.q_norm = q_norm.as_deref();
                cfg.k_norm = k_norm.as_deref();
                cfg.output_gate = *output_gate;
                cfg.softplus_gate = softplus_gate
                    .as_ref()
                    .map(|(gate, per_head)| (gate, *per_head));
                cfg.bias = bias
                    .as_ref()
                    .map(|(q, k, v)| (q.as_slice(), k.as_slice(), v.as_slice()));
                attention::qwen_attention(&self.ws.n1, wq, wk, wv, wo, &mut m.kv, &cfg)
            }
            AttnKind::Linear(_)
            | AttnKind::LinearGdn(_)
            | AttnKind::ShortConv(_)
            | AttnKind::Bounded(_) => {
                unreachable!("MTP block is full attention")
            }
        };
        for (i, &a) in attn.iter().enumerate() {
            x[i] += a;
        }
        inference::rms_norm_into(
            &x,
            &lw.post_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.p1,
        );
        let ffn = ffn_forward(&lw.ffn, &self.ws.p1, self.pool.as_deref(), None);
        for (i, &f) in ffn.iter().enumerate() {
            x[i] += f;
        }

        inference::rms_norm_into(
            &x,
            &m.final_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.n1,
        );
        let lg = self.lm_head_forward(&self.ws.n1);
        (lg, x)
    }

    /// `mtp_step_hl` reduced to the greedy draft: argmax of the head.
    fn mtp_step_h(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        next_token: u32,
        position: usize,
    ) -> (u32, Vec<f32>) {
        let (mut lg, x) = self.mtp_step_hl(m, hidden, next_token, position);
        let draft = sampler::argmax(&lg);
        attention::recycle_buf(&mut lg);
        (draft, x)
    }

    /// One speculative round for the trial: rounds 1..5 of a `Spec` phase
    /// advance it (the monitor already averaged this round); after five,
    /// the plain phase runs (once — a known plain rate decides at once);
    /// a decided speculation keeps re-checking the rule every round and
    /// stops after four losing rounds in a row.
    fn spec_trial_round(trial: SpecTrial, mon: &mut SpecMon, generated: usize) -> SpecTrial {
        // CMF_GRAPH_SPEC_PIN=1 keeps the rounds on whatever they cost: a
        // count of how a draft head holds has to include the stretches a
        // trial would decode plain.
        static PIN: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
        if *PIN.get_or_init(|| std::env::var("CMF_GRAPH_SPEC_PIN").as_deref() == Ok("1")) {
            return SpecTrial::Decided {
                spec: true,
                recheck_at: usize::MAX,
            };
        }
        match trial {
            SpecTrial::Spec { t0, gen0, rounds } => {
                let rounds = rounds + 1;
                // A round that accepts no draft still has to run the MTP
                // chain and a K+1 verifier, but emits only its verifier tip.
                // After `SPEC_ZERO_ROUNDS` such real rounds the speculative
                // arm cannot win on any backend; time plain immediately
                // rather than spend the remaining exploratory rounds on the
                // same one-token result. A re-check soon after (the evidence
                // is a few rounds) gives the text a chance to re-admit it.
                if mon.repeated_zero_acceptance() {
                    tracing::info!(
                        "speculation trial: no accepted drafts in two rounds — timing plain"
                    );
                    return SpecTrial::Plain {
                        t0: std::time::Instant::now(),
                        gen0: generated,
                    };
                }
                if rounds >= 5 {
                    if mon.plain_ms > 0.0 {
                        let keep = mon.pays();
                        mon.fails = 0;
                        tracing::info!(
                            "speculation re-check: {:.2} tok/round in {:.1} ms vs plain {:.1} ms/tok — {}",
                            mon.tokens,
                            mon.round_ms,
                            mon.plain_ms,
                            if keep { "speculating" } else { "plain" }
                        );
                        SpecTrial::Decided {
                            spec: keep,
                            recheck_at: if keep { usize::MAX } else { mon.recheck_plain_at(generated) },
                        }
                    } else if mon.pays() {
                        // Metal: the rounds land enough tokens each that no
                        // plain measurement is needed — keep speculating,
                        // and re-check every round (a losing streak sends
                        // the loop to the plain phase, below).
                        mon.fails = 0;
                        tracing::info!(
                            "speculation trial: {:.2} tok/round in {:.1} ms — speculating (plain not timed)",
                            mon.tokens,
                            mon.round_ms,
                        );
                        SpecTrial::Decided {
                            spec: true,
                            recheck_at: usize::MAX,
                        }
                    } else {
                        SpecTrial::Plain {
                            t0: std::time::Instant::now(),
                            gen0: generated,
                        }
                    }
                } else {
                    SpecTrial::Spec { t0, gen0, rounds }
                }
            }
            SpecTrial::Decided { spec: true, .. } => {
                if mon.pays() {
                    mon.fails = 0;
                    trial
                } else {
                    mon.fails += 1;
                    if mon.fails >= 4 {
                        if mon.plain_ms <= 0.0 {
                            // Metal, plain never timed: four doubtful rounds
                            // buy the (bounded) plain measurement, and the
                            // exact rule decides from it.
                            tracing::info!(
                                "speculation doubtful: {:.2} tok/round in {:.1} ms — timing plain",
                                mon.tokens,
                                mon.round_ms,
                            );
                            return SpecTrial::Plain {
                                t0: std::time::Instant::now(),
                                gen0: generated,
                            };
                        }
                        tracing::info!(
                            "speculation stopped: {:.2} tok/round in {:.1} ms vs plain {:.1} ms/tok",
                            mon.tokens,
                            mon.round_ms,
                            mon.plain_ms
                        );
                        SpecTrial::Decided {
                            spec: false,
                            recheck_at: generated + SPEC_RECHECK_PLAIN,
                        }
                    } else {
                        trial
                    }
                }
            }
            other => other,
        }
    }

    /// The MTP block's device-mirror id: the trunk's id with a high bit,
    /// so the (kv_id, layer) mirror keys never collide.
    fn mtp_kv_id(&self) -> u64 {
        self.graph_kv_id | (1u64 << 40)
    }

    /// The MTP block's mirror layer index: 0 — its own kv_id keeps it
    /// apart from the trunk, and the BATCH graph (the warm-up path) keys
    /// its mirrors at layer 0 with no base of its own, so the draft's
    /// token graph must key the same slot.
    const MTP_LAYER_BASE: usize = 0;

    /// The wgpu MTP draft writes speculative rows straight into its device
    /// mirror while the CPU owner retains only the real prompt/decode anchor.
    /// After verification, move that mirror cursor back to the anchor before
    /// replaying accepted pairs.  The next graph append then sees the same
    /// contiguous position as the CPU/Metal path without uploading stale
    /// speculative rows.
    #[cfg(feature = "gpu")]
    fn rewind_mtp_graph_mirror(&self, stored: usize) -> bool {
        let stored = stored.saturating_sub(self.mtp_pos_base);
        self.mtp_graph_mode != Some(true)
            || crate::gpu::graph_kv_set_stored(self.mtp_kv_id(), Self::MTP_LAYER_BASE, stored)
    }

    /// A speculative verify graph appends the full `k+1` trunk rows before
    /// the acceptance count is known.  GDN state already has a snapshot
    /// restore; Full-attention mirrors need the matching logical cursor
    /// rewind so the next graph call does not reject an ahead-of-position KV
    /// cache after a partial acceptance.
    #[cfg(feature = "gpu")]
    fn rewind_trunk_graph_mirrors(&self, stored: usize) -> bool {
        let mut ok = true;
        let mut expected = false;
        for li in 0..self.num_layers {
            if matches!(
                self.weights.layers[self.phys_layer(li)].attn,
                AttnKind::Full { .. }
            ) {
                // A sealed layer has no mirror: its state moved by `o1_spec_commit`.
                if self.o1_flags.get(li).copied().unwrap_or(false) && self.kv_cache.layers[li].o1_sealed() {
                    continue;
                }
                expected = true;
                ok &= crate::gpu::graph_kv_set_stored(self.graph_kv_id, li, stored);
            }
        }
        !expected || ok
    }

    /// Count the recurrent layers participating in the trunk verify graph.
    /// Snapshot restore is all-or-nothing across that set; deriving the count
    /// from the model keeps the restore contract valid for looped models too.
    fn graph_gdn_layer_count(&self) -> usize {
        // stacks that keep their own layers (qwen4, DSV4) leave the generic
        // ones empty: no generic GDN layer, nothing to index
        (0..self.num_layers)
            .filter(|&li| {
                self.weights
                    .layers
                    .get(self.phys_layer(li))
                    .is_some_and(|l| matches!(&l.attn, AttnKind::LinearGdn(_)))
            })
            .count()
    }

    /// The block's input from (trunk hidden, token): eh_proj · [enorm(e);
    /// hnorm(h)] — the same arithmetic the per-op path starts with.
    fn mtp_block_input(&mut self, m: &MtpModule, hidden: &[f32], next_token: u32) -> Vec<f32> {
        self.mtp_block_inputs(m, &[(hidden, next_token)])
    }

    /// The block inputs of several (trunk hidden, token) pairs, `[n][hidden]`.
    /// On the CUDA hybrid arm eh_proj runs on the card for all of them at
    /// once (about 1 ms a pair on the host for Qwen3.8-27B's 27 MB matrix,
    /// tens of microseconds there); everywhere else one host matvec a pair.
    fn mtp_block_inputs(&mut self, m: &MtpModule, pairs: &[(&[f32], u32)]) -> Vec<f32> {
        let hs = self.hidden_size;
        let mut cats = vec![0.0f32; pairs.len() * 2 * hs];
        for (i, (hidden, tok)) in pairs.iter().enumerate() {
            let e = self.embed_single(*tok);
            let cat = &mut cats[i * 2 * hs..(i + 1) * 2 * hs];
            let (cat_e, cat_h) = cat.split_at_mut(hs);
            inference::rms_norm_into(&e, &m.enorm, self.rms_eps, self.norm_style, cat_e);
            inference::rms_norm_into(hidden, &m.hnorm, self.rms_eps, self.norm_style, cat_h);
        }
        let mut xs = vec![0.0f32; pairs.len() * hs];
        #[cfg(feature = "gpu")]
        if crate::gpu::cuda_active() {
            if let Some((model, idx, kind, rs)) = m.eh_proj.graph_weight() {
                let gw = crate::gpu::GraphW {
                    idx,
                    kind,
                    row_scale: rs,
                    data: &[],
                    prism: crate::gpu::GraphPrismOp::None,
                    affine: false,
                };
                let model = model.clone();
                if crate::gpu::rows_matvec(&model, &gw, hs, 2 * hs, &cats, pairs.len(), &mut xs) {
                    return xs;
                }
            }
        }
        for i in 0..pairs.len() {
            m.eh_proj.matvec(&cats[i * 2 * hs..(i + 1) * 2 * hs], &mut xs[i * hs..(i + 1) * hs], self.pool.as_deref());
        }
        xs
    }

    /// Is the MTP block graphable at all (device up, full attention
    /// without softplus, dense FFN)? The plan itself is built per call.
    #[cfg(feature = "gpu")]
    fn mtp_block_graph_ok(&self, m: &MtpModule) -> bool {
        if std::env::var("CMF_MTP_GRAPH").as_deref() == Ok("0") {
            return false;
        }
        if !crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode) || !crate::gpu::enabled_here() {
            return false;
        }
        self.mtp_block_shape_ok(m)
    }

    /// The shape a device MTP step takes (the wgpu token graph and native
    /// Metal's `mtp_step_metal` alike): one dense block of full attention
    /// without a softplus gate, V as wide as K, no softcap. A MoE draft block
    /// drafts op by op on the host and costs more than it saves.
    fn mtp_block_shape_ok(&self, m: &MtpModule) -> bool {
        if std::env::var("CMF_MTP_GRAPH").as_deref() == Ok("0")
            || self.attn_softcap > 0.0
            || self.attention_heads_per_layer.is_some()
            // The block graph caches V as wide as K and feeds o_proj
            // nh·head_dim; a narrow-V model keeps its MTP block per-op.
            || self.v_head_dim.is_some()
        {
            return false;
        }
        matches!(
            &m.layer.attn,
            AttnKind::Full {
                softplus_gate: None,
                ..
            }
        ) && matches!(&m.layer.ffn, FfnKind::Dense(_))
    }

    /// Full MTP token-graph eligibility, including the fused lm-head and all
    /// block projection weights.  Keep this distinct from the block-only
    /// check: prompt warm-up does not need the head, while a draft step does.
    #[cfg(feature = "gpu")]
    fn mtp_graph_ok(&self, m: &MtpModule) -> bool {
        if !self.mtp_block_graph_ok(m) {
            return false;
        }
        let AttnKind::Full { wq, wk, wv, wo, .. } = &m.layer.attn else {
            return false;
        };
        let FfnKind::Dense(d) = &m.layer.ffn else {
            return false;
        };
        d.segs.is_empty()
            && wq.graph_weight().is_some()
            && wk.graph_weight().is_some()
            && wv.graph_weight().is_some()
            && wo.graph_weight().is_some()
            && d.gate_proj.graph_weight().is_some()
            && d.up_proj.graph_weight().is_some()
            && d.down_proj.graph_weight().is_some()
            && self.weights.lm_head.graph_weight().is_some()
    }

    /// One MTP block step on the wgpu token graph: block + fused head in
    /// one submit, the block hidden and the logits read back together.
    /// None = the graph cannot take this block (softplus gate, non-dense
    /// FFN, unquantized head, no device) — the caller keeps the per-op
    /// path for the whole generation.
    #[cfg(feature = "gpu")]
    fn mtp_step_graph(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        next_token: u32,
        position: usize,
    ) -> Option<(Vec<f32>, Vec<f32>)> {
        if !self.mtp_graph_ok(m) {
            return None;
        }
        let lw = &m.layer;
        let AttnKind::Full {
            wq,
            wk,
            wv,
            wo,
            q_norm,
            k_norm,
            output_gate,
            softplus_gate,
            bias,
        } = &lw.attn
        else {
            return None;
        };
        if softplus_gate.is_some() {
            return None;
        }
        let FfnKind::Dense(d) = &lw.ffn else {
            return None;
        };
        if !d.segs.is_empty() {
            return None; // tube layers run on the segmented path
        }
        // The block's input first: it borrows `self` mutably (embed scratch,
        // pool), the plan below borrows the weights immutably.
        let mut x = self.mtp_block_input(m, hidden, next_token);
        fn gw(t: &QTensor) -> Option<crate::gpu::GraphW<'_>> {
            let (_, i, kind, rs) = t.graph_weight()?;
            Some(crate::gpu::GraphW {
                idx: i,
                kind,
                row_scale: rs,
                data: &[],
                prism: crate::gpu::GraphPrismOp::None,
                affine: false,
            })
        }
        let (model, _, _, _) = wq.graph_weight()?;
        let model = model.clone();
        let (lm_gw, lm_rows) = {
            let (_, i, kind, rs) = self.weights.lm_head.graph_weight()?;
            // The draft's head over the CMF_DRAFT_VOCAB shortlist (the same
            // cut the native Metal draft takes): 662 MB a step on Qwen3.8
            // becomes 170 MB at 65536; the verify keeps the full head.
            let rows = if kind == 6 {
                self.draft_head_rows(self.weights.lm_head.rows())
            } else {
                self.weights.lm_head.rows()
            };
            (
                crate::gpu::GraphW {
                    idx: i,
                    kind,
                    row_scale: rs,
                    data: &[],
                    prism: crate::gpu::GraphPrismOp::None,
                    affine: false,
                },
                rows,
            )
        };
        let layer = crate::gpu::GraphLayer {
            mhc: None,
            input_norm: &lw.input_norm,
            attn: crate::gpu::GraphAttn::Full {
                wq: gw(wq)?,
                wk: gw(wk)?,
                wv: gw(wv)?,
                wo: gw(wo)?,
                q_norm: q_norm.as_deref(),
                k_norm: k_norm.as_deref(),
                late_qk_norm: self.qk_norm_after_rope,
                bias: bias
                    .as_ref()
                    .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                output_gate: *output_gate,
                cpu_k: m.kv.k_heads(),
                cpu_v: m.kv.v_heads(),
                cpu_base: m.kv.base(),
                geom: None,
                head_gate: None,
            },
            post_norm: &lw.post_norm,
            attn_out_norm: None,
            ffn_out_norm: None,
            layer_scale: None,
            ffn: crate::gpu::GraphFfn::Dense {
                gate: gw(&d.gate_proj)?,
                up: gw(&d.up_proj)?,
                down: gw(&d.down_proj)?,
                act: d.act.graph_act()?,
                limit: 0.0,
                hot: None,
            },
        };
        let nh = self.num_heads;
        let (nkv, hd, rd) = self.layer_geom(0);
        let gemma = self.norm_style == cortiq_core::NormStyle::Gemma;
        let mut logits = Vec::new();
        let ok = crate::gpu::forward_token_graph(
            &model,
            self.mtp_kv_id(),
            std::slice::from_ref(&layer),
            &[None],
            self.o1_epoch,
            &self.inv_freq,
            &mut x,
            nh,
            nkv,
            hd,
            self.attn_scale,
            rd,
            self.hidden_size,
            // An MTP draft can have an independently compacted FFN. The
            // graph must use the checked local tensor width, not the trunk
            // arch-wide intermediate size.
            d.gate_proj.rows(),
            position,
            self.kv_cache.max_seq_len,
            gemma,
            self.rms_eps as f32,
            Some((&lm_gw, lm_rows)),
            &m.final_norm,
            &mut logits,
            &[],
            1,
            None,
            None,
            None,
            Self::MTP_LAYER_BASE,
            true,
        );
        match ok {
            crate::gpu::TokenGraphOutcome::Completed => {}
            crate::gpu::TokenGraphOutcome::Declined => return None,
            crate::gpu::TokenGraphOutcome::Failed => {
                // The backend has already admitted persistent state.  Keep
                // this distinct from a capability refusal so the caller
                // cannot switch to the stale CPU MTP cache.
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                return None;
            }
        }
        // The graph may deliberately evaluate only a prefix of the draft
        // head.  Do not turn every omitted token into a zero-logit candidate:
        // that can win an all-negative shortlist and collapses acceptance.
        pad_mtp_draft_logits(&mut logits, self.vocab_size);
        Some((logits, x))
    }

    /// The round's `k` greedy drafts on the CUDA hybrid arm as ONE graph
    /// (`gpu_cuda::mtp_chain`): the block input, the block and the shortlist
    /// head k times, each step's token embedding gathered on the card from
    /// the argmax before it. Err(false): declined before any state changed
    /// (the per-step loop takes the round); Err(true): failed after the
    /// block's mirror moved.
    #[cfg(feature = "cuda")]
    fn mtp_draft_chain_cuda(&self, m: &MtpModule, hidden: &[f32], t_next: u32, position: usize, k: usize) -> Result<Vec<u32>, bool> {
        let position = position.saturating_sub(self.mtp_pos_base);
        if !crate::gpu::cuda_active()
            || !Self::mtp_chain_on()
            || std::env::var("CMF_MTP_GRAPH").as_deref() == Ok("0")
            || self.draft_full_streak > 0
            || !self.mtp_graph_ok(m)
            || hidden.len() != self.hidden_size
        {
            return Err(false);
        }
        let lw = &m.layer;
        let AttnKind::Full { wq, wk, wv, wo, q_norm, k_norm, output_gate, softplus_gate: None, bias } = &lw.attn else {
            return Err(false);
        };
        let FfnKind::Dense(d) = &lw.ffn else {
            return Err(false);
        };
        if !d.segs.is_empty() {
            return Err(false);
        }
        fn gw(t: &QTensor) -> Option<crate::gpu::GraphW<'_>> {
            let (_, i, kind, rs) = t.graph_weight()?;
            Some(crate::gpu::GraphW { idx: i, kind, row_scale: rs, data: &[], prism: crate::gpu::GraphPrismOp::None, affine: false })
        }
        let mk = || -> Option<_> {
            let (model, _, _, _) = wq.graph_weight()?;
            let (_, li, lkind, lrs) = self.weights.lm_head.graph_weight()?;
            if lkind != 6 {
                return None;
            }
            let rows = Self::draft_vocab_rows(self.weights.lm_head.rows());
            let lm = crate::gpu::GraphW { idx: li, kind: lkind, row_scale: lrs, data: &[], prism: crate::gpu::GraphPrismOp::None, affine: false };
            let eh = gw(&m.eh_proj)?;
            let layer = crate::gpu::GraphLayer {
                mhc: None,
                input_norm: &lw.input_norm,
                attn: crate::gpu::GraphAttn::Full {
                    wq: gw(wq)?,
                    wk: gw(wk)?,
                    wv: gw(wv)?,
                    wo: gw(wo)?,
                    q_norm: q_norm.as_deref(),
                    k_norm: k_norm.as_deref(),
                    late_qk_norm: self.qk_norm_after_rope,
                    bias: bias.as_ref().map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                    output_gate: *output_gate,
                    cpu_k: m.kv.k_heads(),
                    cpu_v: m.kv.v_heads(),
                    cpu_base: m.kv.base(),
                    geom: None,
                    head_gate: None,
                },
                post_norm: &lw.post_norm,
                attn_out_norm: None,
                ffn_out_norm: None,
                layer_scale: None,
                ffn: crate::gpu::GraphFfn::Dense {
                    gate: gw(&d.gate_proj)?,
                    up: gw(&d.up_proj)?,
                    down: gw(&d.down_proj)?,
                    act: d.act.graph_act()?,
                    limit: 0.0,
                    hot: None,
                },
            };
            // the embedding: q4tp in the same file (the chain gathers its rows)
            let (emodel, ei, ekind, ers) = self.weights.embed_tokens.graph_weight()?;
            if ekind != 6 || !std::sync::Arc::ptr_eq(emodel, model) || crate::prism::is_inverse_embedding(model, &model.tensors[ei].name) {
                return None;
            }
            let emb = crate::gpu::GraphW { idx: ei, kind: ekind, row_scale: ers, data: &[], prism: crate::gpu::GraphPrismOp::None, affine: false };
            Some((model.clone(), lm, rows, eh, layer, emb))
        };
        let Some((model, lm, rows, eh, layer, emb)) = mk() else {
            return Err(false);
        };
        let (nkv, hd, rd) = self.layer_geom(0);
        let e0 = self.embed_single(t_next);
        crate::gpu_cuda::mtp_chain(
            &model,
            self.mtp_kv_id(),
            &layer,
            &self.inv_freq,
            hidden,
            &e0,
            t_next,
            k,
            self.num_heads,
            nkv,
            hd,
            self.attn_scale,
            rd,
            self.hidden_size,
            position,
            self.kv_cache.max_seq_len,
            self.norm_style == cortiq_core::NormStyle::Gemma,
            self.rms_eps as f32,
            (&lm, rows),
            &m.final_norm,
            &eh,
            &m.enorm,
            &m.hnorm,
            &emb,
            Self::MTP_LAYER_BASE,
        )
    }

    /// The warm-ups of one speculative round on the device: every accepted
    /// (hidden, token) pair as ONE batched graph run over the MTP block
    /// (no head) — its kv_append lands the pairs in the block's mirror.
    /// `pairs` are consecutive positions from `first_pos`.  The tri-state
    /// result is intentional: a refusal before admission may use the
    /// per-row/CPU route, while a failure after admission must terminate the
    /// sequence rather than fall through to a stale CPU cache.
    #[cfg(feature = "gpu")]
    fn mtp_warm_graph(
        &mut self,
        m: &mut MtpModule,
        pairs: &[(&[f32], u32)],
        first_pos: usize,
    ) -> crate::gpu::BatchGraphOutcome {
        let first_pos = first_pos.saturating_sub(self.mtp_pos_base);
        if pairs.is_empty() {
            return crate::gpu::BatchGraphOutcome::Completed;
        }
        if !self.mtp_block_graph_ok(m) {
            return crate::gpu::BatchGraphOutcome::Declined;
        }
        let hs = self.hidden_size;
        // Block inputs for every pair (eh_proj on the per-op path, one
        // matvec each — the plan's own prologue).
        let mut hiddens = self.mtp_block_inputs(m, pairs);
        debug_assert_eq!(hiddens.len(), pairs.len() * hs);
        spec_stamp("w.inp");
        let lw = &m.layer;
        let AttnKind::Full {
            wq,
            wk,
            wv,
            wo,
            q_norm,
            k_norm,
            output_gate,
            bias,
            ..
        } = &lw.attn
        else {
            return crate::gpu::BatchGraphOutcome::Declined;
        };
        let FfnKind::Dense(d) = &lw.ffn else {
            return crate::gpu::BatchGraphOutcome::Declined;
        };
        if !d.segs.is_empty() {
            return crate::gpu::BatchGraphOutcome::Declined; // tube layers run on the segmented path
        }
        // The graph has no arm for a projected output gate, and only the
        // activations `graph_act` names.
        let (
            AttnKind::Full {
                softplus_gate: None,
                ..
            },
            Some(gact),
        ) = (&lw.attn, d.act.graph_act())
        else {
            return crate::gpu::BatchGraphOutcome::Declined;
        };
        fn gw(t: &QTensor) -> Option<crate::gpu::GraphW<'_>> {
            let (_, i, kind, rs) = t.graph_weight()?;
            Some(crate::gpu::GraphW {
                idx: i,
                kind,
                row_scale: rs,
                data: &[],
                prism: crate::gpu::GraphPrismOp::None,
                affine: false,
            })
        }
        let Some((model, _, _, _)) = wq.graph_weight() else {
            return crate::gpu::BatchGraphOutcome::Declined;
        };
        let model = model.clone();
        let (Some(gwq), Some(gwk), Some(gwv), Some(gwo), Some(gg), Some(gu), Some(gd)) = (
            gw(wq),
            gw(wk),
            gw(wv),
            gw(wo),
            gw(&d.gate_proj),
            gw(&d.up_proj),
            gw(&d.down_proj),
        ) else {
            return crate::gpu::BatchGraphOutcome::Declined;
        };
        let layer = crate::gpu::GraphLayer {
            mhc: None,
            input_norm: &lw.input_norm,
            attn: crate::gpu::GraphAttn::Full {
                wq: gwq,
                wk: gwk,
                wv: gwv,
                wo: gwo,
                q_norm: q_norm.as_deref(),
                k_norm: k_norm.as_deref(),
                late_qk_norm: self.qk_norm_after_rope,
                bias: bias
                    .as_ref()
                    .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                output_gate: *output_gate,
                cpu_k: m.kv.k_heads(),
                cpu_v: m.kv.v_heads(),
                cpu_base: m.kv.base(),
                geom: None,
                head_gate: None,
            },
            post_norm: &lw.post_norm,
            attn_out_norm: None,
            ffn_out_norm: None,
            layer_scale: None,
            ffn: crate::gpu::GraphFfn::Dense {
                gate: gg,
                up: gu,
                down: gd,
                act: gact,
                limit: 0.0,
                hot: None,
            },
        };
        let positions: Vec<usize> = (first_pos..first_pos + pairs.len()).collect();
        let nh = self.num_heads;
        let (nkv, hd, rd) = self.layer_geom(0);
        let gemma = self.norm_style == cortiq_core::NormStyle::Gemma;
        // nothing reads the block's rows back: the warm-up is its K/V rows
        // (CUDA: no readback, no wait)
        let defer = crate::gpu::cuda_active();
        if defer {
            crate::gpu::set_batch_defer(true);
        }
        let out = crate::gpu::forward_batch_graph(
            &model,
            self.mtp_kv_id(),
            std::slice::from_ref(&layer),
            &self.inv_freq,
            &mut hiddens,
            nh,
            nkv,
            hd,
            rd,
            hs,
            // See `mtp_step_graph`: draft FFN geometry is local to this
            // block after independent MTP compaction.
            d.gate_proj.rows(),
            &positions,
            self.kv_cache.max_seq_len,
            gemma,
            self.rms_eps as f32,
            self.attn_scale,
            pairs.len(),
            &[],
            0,
            None,
            None,
        );
        if defer {
            crate::gpu::set_batch_defer(false);
        }
        spec_stamp("w.run");
        out
    }

    /// Complete an MTP warm-up after the batched graph has refused.  A
    /// graphable block is retried one row at a time; once any device row has
    /// been admitted, a CPU fallback would observe a stale mirror, so every
    /// token-graph refusal is terminal.  If the block is not graphable and no
    /// mirror exists yet, warming on the CPU is safe and records the CPU mode
    /// for the rest of the generation.
    #[cfg(feature = "gpu")]
    fn mtp_warm_graph_fallback(
        &mut self,
        m: &mut MtpModule,
        pairs: &[(&[f32], u32)],
        first_pos: usize,
    ) -> bool {
        let first_pos = first_pos.saturating_sub(self.mtp_pos_base);
        if pairs.is_empty() {
            return true;
        }
        let graphable = self.mtp_block_graph_ok(m);
        if !graphable {
            // A previously admitted mirror cannot be made coherent by
            // appending to the host cache.  The caller turns this into a
            // terminal generation error and clears both mirrors.
            if self.mtp_graph_mode == Some(true) {
                return false;
            }
            self.mtp_graph_mode = Some(false);
            for (j, (h, t)) in pairs.iter().enumerate() {
                self.mtp_warm(m, h, *t, first_pos + j);
            }
            return true;
        }

        // The batch refusal is recoverable only through the same device
        // state.  Keep rows owned until each token graph has completed; a
        // None is treated as unsafe because the token-graph API deliberately
        // collapses its backend refusal/failure into that result.
        for (j, (h, t)) in pairs.iter().enumerate() {
            if self.mtp_step_graph(m, h, *t, first_pos + j).is_none() {
                return false;
            }
        }
        self.mtp_graph_mode = Some(true);
        true
    }

    /// Warm a contiguous set of MTP pairs using the existing graph seam, with
    /// an all-or-nothing error contract for callers that already admitted the
    /// trunk batch.  The non-GPU build keeps the same pair accounting while
    /// using the established CPU warm path.
    #[cfg(feature = "gpu")]
    fn mtp_warm_prefill_pairs(
        &mut self,
        m: &mut MtpModule,
        pairs: &[(&[f32], u32)],
        first_pos: usize,
    ) -> Result<(), &'static str> {
        // Keep unsupported token-graph heads on the established CPU MTP
        // route before admitting any block mirror.  Once a device mirror is
        // active, the same condition is terminal because CPU rows cannot
        // repair its state.
        if self.mtp_graph_mode == Some(false) || !self.mtp_graph_ok(m) {
            if self.mtp_graph_mode == Some(true) {
                return Err("MTP token graph became unavailable after admission");
            }
            self.mtp_graph_mode = Some(false);
            for (j, (h, t)) in pairs.iter().enumerate() {
                self.mtp_warm(m, h, *t, first_pos + j);
            }
            return Ok(());
        }
        match self.mtp_warm_graph(m, pairs, first_pos) {
            crate::gpu::BatchGraphOutcome::Completed => {
                if !pairs.is_empty() {
                    self.mtp_graph_mode = Some(true);
                }
                Ok(())
            }
            crate::gpu::BatchGraphOutcome::Declined => {
                if self.mtp_warm_graph_fallback(m, pairs, first_pos) {
                    Ok(())
                } else {
                    Err("MTP warm-up fallback failed after device admission")
                }
            }
            crate::gpu::BatchGraphOutcome::Failed => {
                Err("MTP warm batch graph failed after admission")
            }
        }
    }

    #[cfg(not(feature = "gpu"))]
    fn mtp_warm_prefill_pairs(
        &mut self,
        m: &mut MtpModule,
        pairs: &[(&[f32], u32)],
        first_pos: usize,
    ) -> Result<(), &'static str> {
        for (j, (h, t)) in pairs.iter().enumerate() {
            self.mtp_warm(m, h, *t, first_pos + j);
        }
        Ok(())
    }

    /// The MTP block alone — advance its KV with a (hidden, token) pair the
    /// verify just proved, without paying the head. What keeps the draft's
    /// attention context warm between speculative rounds.
    fn mtp_warm(&mut self, m: &mut MtpModule, hidden: &[f32], next_token: u32, position: usize) {
        let position = position.saturating_sub(self.mtp_pos_base);
        let e = self.embed_single(next_token);
        let mut cat = vec![0.0f32; 2 * self.hidden_size];
        let (cat_e, cat_h) = cat.split_at_mut(self.hidden_size);
        inference::rms_norm_into(&e, &m.enorm, self.rms_eps, self.norm_style, cat_e);
        inference::rms_norm_into(hidden, &m.hnorm, self.rms_eps, self.norm_style, cat_h);
        let mut x = vec![0.0f32; self.hidden_size];
        m.eh_proj.matvec(&cat, &mut x, self.pool.as_deref());
        inference::rms_norm_into(
            &x,
            &m.layer.input_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.n1,
        );
        let attn = match &m.layer.attn {
            AttnKind::Full {
                wq,
                wk,
                wv,
                wo,
                q_norm,
                k_norm,
                output_gate,
                softplus_gate,
                bias,
            } => {
                let mut cfg = self.attn_cfg(position);
                cfg.q_norm = q_norm.as_deref();
                cfg.k_norm = k_norm.as_deref();
                cfg.output_gate = *output_gate;
                cfg.softplus_gate = softplus_gate.as_ref().map(|(g, p)| (g, *p));
                cfg.bias = bias
                    .as_ref()
                    .map(|(q, k, v)| (q.as_slice(), k.as_slice(), v.as_slice()));
                attention::qwen_attention(&self.ws.n1, wq, wk, wv, wo, &mut m.kv, &cfg)
            }
            _ => return,
        };
        let _ = attn;
    }

    /// Speculative decode ON the wgpu whole-token graph: draft k with the
    /// MTP head, verify all of them plus the tip in ONE batched graph
    /// submit whose tail folds the head, commit the accepted prefix and
    /// roll the GDN state back to the last real position. Greedy only —
    /// output equals the plain graph's token for token, the way the DSV4
    /// verify equals the walk.
    #[cfg(feature = "gpu")]
    #[allow(clippy::too_many_arguments)]
    fn graph_spec_step(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        t_next: u32,
        next_pos: usize,
        drafted: &mut usize,
        accepted: &mut usize,
        // The committed stream (prompt + generated so far, `t_next`
        // included): the sampler chain's penalties read it, and the
        // sampling arm extends it with the drafts position by position.
        all_ids: &mut Vec<u32>,
        // Tokens left before `max_tokens`. A round commits up to k
        // accepted drafts, and those positions are already in the cache,
        // so the depth is capped here — trimming the output afterwards
        // would leave cache rows the committed stream does not have.
        room: usize,
    ) -> Option<(Vec<u32>, usize, Vec<f32>)> {
        // 3 is the measured optimum on Qwen3.6-27B / RTX 5090 (medians
        // of three, greedy): 51.1 tok/s against a plain 49.4, where k=2
        // gives 46.1, k=4 50.0, k=5 47.4, k=6 45.2. Acceptance is 89-91%
        // throughout — what turns the curve over is the verify, which
        // costs ~7.4 ms per extra position, and the draft ~3 ms a step.
        // 4 since the draft moved onto the graph (Qwen3.8-27B / 5090:
        // k=3 51.2, k=4 51.8 with the per-op draft; the graph draft
        // halves the draft cost, so the extra draft is cheaper still).
        // 5 with the int8 verify (the default: measured 76.5 against
        // k=4's 72-74 and k=6's 74 on the 5090), 4 with the f32 one.
        #[cfg(target_os = "macos")]
        let metal_native = crate::gpu::q1_force();
        #[cfg(not(target_os = "macos"))]
        let metal_native = false;
        #[cfg(feature = "gpu")]
        let k_default = if metal_native {
            // the Metal verify's GEMM tile is 8 rows wide and flat in b:
            // seven drafts + the tip fill it for free
            7
        } else if crate::gpu_wgpu::verify_i8_on() {
            5
        } else {
            4
        };
        #[cfg(not(feature = "gpu"))]
        let k_default = 4;
        let k_env: Option<usize> = std::env::var("CMF_GRAPH_SPEC_K")
            .ok()
            .and_then(|v| v.parse().ok())
            .filter(|&v| (1..=8).contains(&v));
        // Adaptive depth: start below the card's flat-verify optimum and
        // let the accepted fraction move it — predictable text climbs to
        // the old default within a few rounds, prose settles at 2-3 where
        // the shorter verify pays.
        // Native Metal over a q4tp trunk: two rows verify at about a plain
        // token's price and three at a quarter more, so the depth follows
        // each depth's running acceptance instead of filling the GEMM tile.
        let metal_small = metal_native && self.metal_small_batch_verify();
        // Greedy without penalties verifies by argmax equality (bit-exact
        // against the plain path). Anything else is speculative SAMPLING:
        // each draft is a DRAW from the MTP head's post-chain distribution
        // q_j, kept for the accept test; the verify's rows give p_j.
        let cfg = self.sampler_config.clone();
        let penalized = !(cfg.repetition_penalty == 1.0
            && cfg.presence_penalty == 0.0
            && cfg.suppress_tokens.is_empty());
        // Three verify regimes: plain greedy (argmax of the raw rows),
        // greedy WITH penalties (argmax of the penalized rows — a single
        // pass each, no distributions), and sampling (draw / accept /
        // correct on post-chain distributions).
        let greedy_pen = cfg.temperature < 1e-6 && penalized;
        let sampling = cfg.temperature >= 1e-6;
        // A DFlash drafter beside the model drafts a round in one block
        // (plain greedy on native Metal, where the verify hands it the
        // trunk's rows). Its block costs the same at any depth, so its
        // rounds go deep where its drafts hold; the MTP chain's are short
        // and nearly free. Each keeps its own account of what it holds, and
        // the round goes to the one that lands more tokens in a unit of time
        // (the one in turn has to be beaten by more than the noise). The
        // block was trained on Latin-script text: while the committed tokens
        // come from the high table (`draft_full_streak`) the chain keeps the
        // rounds. A turn the chain takes back makes the block sit out, longer
        // each time it is a short one.
        // The wgpu graphs keep the drafter's rows on their way (`layer_taps`):
        // they become context here, and a round is the block's only while that
        // context reaches the tip. There the block is for measuring, pinned
        // with `CMF_DFLASH_PICK=dflash`, and the chain keeps the rounds
        // otherwise: the block is a matrix a submission, and on a 16 GB card
        // the Turbo trunk leaves its 1.3 GB no room among the resident weights
        // (RTX 2000 Ada: 135 ms a block against 11 ms for the chain's drafts,
        // and a verify of eight rows costs two plain tokens).
        if !metal_native {
            self.dflash_taps_absorb();
        }
        // The CUDA hybrid arm keeps the drafter's context at the tip every
        // call (its graphs copy the tapped rows out) and verifies eight rows
        // at about one price: the round goes to the drafter that lands more
        // tokens at that card's prices, as on Metal.
        let cuda_rate = !metal_native && crate::gpu::cuda_active();
        let dflash_ok = !sampling
            && !greedy_pen
            && match &self.dflash {
                Some(d) => metal_native || ((dflash_pick() == Some(true) || cuda_rate) && d.next_position() == next_pos),
                None => false,
            };
        if !metal_native && !cuda_rate && self.dflash.is_some() && dflash_pick() != Some(true) {
            static SAID: std::sync::Once = std::sync::Once::new();
            SAID.call_once(|| {
                tracing::info!(
                    "DFlash drafter: on wgpu the MTP chain keeps the rounds (CMF_DFLASH_PICK=dflash pins the block)"
                )
            });
        }
        let (k_flash, rate_flash) = if cuda_rate {
            spec_plan_at(&CUDA_ROUND_COST, &self.dflash_hold, CUDA_BLOCK_DRAFT, 0.0)
        } else {
            metal_spec_plan(&self.dflash_hold, DFLASH_ROUND_DRAFT)
        };
        let (_, rate_mtp) = if cuda_rate {
            spec_plan_at(&CUDA_ROUND_COST, &self.spec_hold, 0.0, CUDA_DRAFT_STEP)
        } else {
            metal_spec_plan(&self.spec_hold, 0.0)
        };
        // A sidecar that carries a router says which drafter the text at the
        // tip is for, from the target's own row there: two subspaces of such
        // rows, one of the rounds the block won and one of the chain's, and
        // the row goes to the one that holds it better (`dflash::Route`).
        // A few rounds are averaged, and the drafter in turn keeps a round
        // the average does not clearly give away.
        let routed = match (&self.dflash, dflash_ok) {
            (Some(d), true) => d.route.as_ref().map(|r| r.margin(hidden)),
            _ => None,
        };
        if let Some(m) = routed {
            self.dflash_lean += DFLASH_LEAN_STEP * (m - self.dflash_lean);
        }
        // CUDA verifies a lookup of sixteen rows at about one price: while the
        // lookups land (their running gain past `DFLASH_LOOKUP_KEEPS`), an
        // edit or a quote stays the chain's, which the router (fitted where
        // the lookup was eight rows) would give the block
        let copying = (routed.is_some() || cuda_rate)
            && dflash_pick().is_none()
            && (tail_repeat(all_ids) >= DFLASH_COPY_MIN || (cuda_rate && self.spec_lookup_gain > DFLASH_LOOKUP_KEEPS));
        let dflash_round = dflash_ok
            && match (dflash_pick(), routed) {
                (Some(pin), _) => pin,
                (None, Some(_)) if copying => false,
                // the block drafts over the head's shortlist: text from the
                // high table is the chain's (CUDA, where the router alone
                // sent a Danish article to the block: 55 against 73 tok/s)
                (None, Some(_)) if cuda_rate && self.draft_full_streak > 0 => false,
                (None, Some(_)) if self.dflash_last => self.dflash_lean > -DFLASH_LEAN_BAND,
                (None, Some(_)) => self.dflash_lean > DFLASH_LEAN_BAND,
                // the chain's short round with the prompt lookup copies for less
                (None, None) if copying => false,
                (None, None) if !metal_small && !cuda_rate => true,
                (None, None) if self.draft_full_streak > 0 => false,
                (None, None) if self.dflash_last => rate_flash * 1.05 >= rate_mtp,
                (None, None) if self.dflash_wait > 0 => {
                    self.dflash_wait -= 1;
                    false
                }
                (None, None) => rate_flash > rate_mtp * 1.05,
            };
        if dflash_ok && dflash_round != self.dflash_last {
            if dflash_round {
                (self.dflash_turn, self.dflash_turn_sum) = (0, (0.0, 0.0));
            } else {
                // the block's turn is over: it comes back to a fresh account
                let (tokens, cost) = self.dflash_turn_sum;
                if self.dflash_turn >= DFLASH_TURN && tokens >= rate_mtp * cost {
                    self.dflash_wait = DFLASH_WAIT_DIP;
                } else {
                    self.dflash_back = if self.dflash_turn < DFLASH_TURN {
                        (self.dflash_back * 2).min(DFLASH_WAIT_MOST)
                    } else {
                        DFLASH_WAIT
                    };
                    self.dflash_wait = self.dflash_back;
                }
                self.dflash_hold = DFLASH_HOLD_PRIOR;
            }
            if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
                eprintln!(
                    "spec-drafter: {} ({rate_flash:.2} against {rate_mtp:.2} tokens in a plain token's time)",
                    if dflash_round { "the DFlash block" } else { "the MTP chain" }
                );
            }
        }
        self.dflash_turn += u32::from(dflash_round);
        self.dflash_last = dflash_round;
        // a pinned block never hands a round to the chain: its cache may lapse
        let mtp_in_step = dflash_pick() != Some(true) || dflash_rows_log().is_some();
        let (k_start, k_max) = if dflash_round && metal_small {
            (k_flash, 7)
        } else if metal_small {
            (metal_spec_depth(&self.spec_hold), 7)
        } else if metal_native || dflash_round {
            // (a block costs the same at any depth: its rounds start at all seven)
            (7, 7)
        } else {
            (3, k_default.max(5))
        };
        let k_full: usize = k_env.unwrap_or_else(|| {
            if metal_small {
                k_start
            } else if dflash_round && !metal_native {
                self.dflash_k_adapt.unwrap_or(k_start)
            } else {
                self.spec_k_adapt.unwrap_or(k_start)
            }
        });
        let k_spec = k_full.min(room).max(1);
        // a tail round cut short by `room` says nothing about the text:
        // it must not move the adaptive depth the next request starts at
        let k_capped = k_spec < k_full;
        if next_pos == 0 {
            return None;
        }
        let t_round = std::time::Instant::now();
        // Submissions per phase — and they say where the round's money is.
        // Qwen3.6-27B on an RTX 5090, k=3:
        //
        //   draft   9.3 ms / 12 submissions   (four per MTP step)
        //   verify 52.8 ms /  1               (the batched graph)
        //   commit  5.4 ms /  6               (two per warm)
        //
        // The verify is already one submit. The draft's own work is 834 MB
        // a step — 0.8 ms at this card's measured 1056 GB/s — against 3.1
        // ms measured, so ~0.58 ms of every step is round trip, not
        // arithmetic, and the same holds for the warms. Eighteen round
        // trips a round at roughly half a millisecond each is ~11 ms of a
        // 68 ms round: fusing the MTP block into ONE submit the way the
        // trunk already is projects to ~64 tok/s against today's 50.9.
        // That is the largest measured item left on this path.
        let subs = || crate::gpu_wgpu::SUBMITS.load(std::sync::atomic::Ordering::Relaxed);
        let sub0 = subs();
        let k_spec = match &self.dflash {
            Some(d) if dflash_round => k_spec.min(d.g.block - 1),
            _ => k_spec,
        };
        // Sampling with a top-k goes through the SPARSE chain: the dense
        // one builds nine 248k-float distributions a round (four drafts,
        // five verify rows) and measured 19-22 tok/s against a plain 40 —
        // the host, not the card. Sparse, the same nine cost tens of
        // microseconds each.
        let sparse = sampling && sampler::sparse_ok(&cfg);
        let base_len = all_ids.len();
        if sampling && !sparse && self.spec_q.len() < k_spec {
            self.spec_q.resize_with(k_spec, Vec::new);
        }
        if sparse && self.spec_qs.len() < k_spec {
            self.spec_qs.resize_with(k_spec, Vec::new);
        }
        // Draft the chain: first from the trunk's tip hidden, then the head
        // iterating on itself. Rows land in the MTP KV; the chain rows past
        // the first are speculation over speculative state and roll back
        // below, replaced by verified pairs.
        let mut drafts = Vec::with_capacity(k_spec);
        let mut hx = hidden.to_vec();
        // CMF_SPEC_DBG=1: draft 0 through BOTH MTP arms (graph and per-op)
        // from the same inputs — are the arms the difference, or the inputs?
        let spec_dbg = std::env::var("CMF_SPEC_DBG").is_ok();
        spec_stamp("pro");
        if dflash_round {
            drafts = self.dflash_draft(t_next, next_pos, k_spec);
            spec_stamp("d.flash");
        }
        // the chain's drafts of a round the block has, for the rows log: its
        // cache is then cut and warmed as after a round of its own
        let mut beside: Vec<u32> = Vec::new();
        #[cfg(target_os = "macos")]
        if dflash_round && dflash_rows_log().is_some() && self.mtp_graph_mode != Some(false) {
            match self.mtp_draft_chain_metal(m, hidden, t_next, next_pos - 1, 7) {
                Ok(ids) => {
                    self.mtp_graph_mode = Some(true);
                    beside = ids;
                }
                Err(true) => {
                    tracing::error!("mtp Metal draft chain failed after commit");
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    return None;
                }
                Err(false) => {}
            }
        }
        // Plain greedy on native Metal: the whole chain as one command
        // buffer (device argmax + embedding gather between the steps).
        // A decline before commit hands the round to the per-step loop
        // below; a failure after commit is terminal, like any graph
        // failure after admission.
        #[cfg(target_os = "macos")]
        if metal_native && !dflash_round && !sampling && !greedy_pen && self.mtp_graph_mode != Some(false) {
            match self.mtp_draft_chain_metal(m, hidden, t_next, next_pos - 1, k_spec) {
                Ok(ids) => {
                    self.mtp_graph_mode = Some(true);
                    drafts = ids;
                }
                Err(true) => {
                    tracing::error!("mtp Metal draft chain failed after commit");
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    return None;
                }
                Err(false) => {}
            }
        }
        // CUDA hybrid arm, greedy: the whole chain as one graph (device
        // argmax and embedding gather between the steps). A suppress list
        // whose ids all sit past the draft shortlist cannot change its
        // argmax. A decline hands the round to the per-step loop below; a
        // failure after admission is terminal, like any graph failure.
        #[cfg(feature = "cuda")]
        if crate::gpu::cuda_active()
            && !dflash_round
            && !sampling
            && !spec_dbg
            && drafts.is_empty()
            && self.mtp_graph_mode != Some(false)
            && (!greedy_pen
                || (cfg.repetition_penalty == 1.0
                    && cfg.presence_penalty == 0.0
                    && cfg.suppress_tokens.iter().all(|&t| (t as usize) >= Self::draft_vocab_rows(self.weights.lm_head.rows()))))
        {
            match self.mtp_draft_chain_cuda(m, &hx, t_next, next_pos - 1, k_spec) {
                Ok(ids) => {
                    self.mtp_graph_mode = Some(true);
                    drafts = ids;
                    spec_stamp("d.chain");
                }
                Err(true) => {
                    tracing::error!("cuda draft chain failed after admission");
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    return None;
                }
                Err(false) => {}
            }
        }
        for j in drafts.len()..k_spec {
            let tok_in = if j == 0 { t_next } else { drafts[j - 1] };
            let mut dbg_ref: Option<(Vec<f32>, Vec<f32>)> = None;
            if spec_dbg {
                let saved = self.mtp_graph_mode;
                self.mtp_graph_mode = Some(false);
                let r = self.mtp_step_hl(m, &hx, tok_in, next_pos - 1 + j);
                self.mtp_graph_mode = saved;
                if self.graph_failed.load(std::sync::atomic::Ordering::Relaxed) {
                    return None;
                }
                m.kv.truncate_last(1);
                dbg_ref = Some(r);
            }
            let (mut lg, hj) = self.mtp_step_hl(m, &hx, tok_in, next_pos - 1 + j);
            if self.graph_failed.load(std::sync::atomic::Ordering::Relaxed) {
                return None;
            }
            if let Some((lg_cpu, h_cpu)) = dbg_ref {
                let n = |v: &[f32]| v.iter().map(|x| x * x).sum::<f32>().sqrt();
                let dl = lg
                    .iter()
                    .zip(&lg_cpu)
                    .fold(0f32, |m, (a, b)| m.max((a - b).abs()));
                let dh = hj
                    .iter()
                    .zip(&h_cpu)
                    .fold(0f32, |m, (a, b)| m.max((a - b).abs()));
                eprintln!(
                    "spec-dbg j={j} pos {} tok_in {tok_in}: per-op draft {} graph draft {} | max|dlogit| {dl:.3} | |h_cpu| {:.2} |h_graph| {:.2} max|dh| {dh:.3} | kv rows {}",
                    next_pos - 1 + j,
                    sampler::argmax(&lg_cpu),
                    sampler::argmax(&lg),
                    n(&h_cpu),
                    n(&hj),
                    m.kv.seq_len
                );
            }
            let dj = if sparse {
                let mut q = std::mem::take(&mut self.spec_qs[j]);
                let ok = sampler::sparse_distribution_into(
                    &lg,
                    &cfg,
                    all_ids,
                    &mut self.sampler_scratch,
                    self.pool.as_deref(),
                    &mut q,
                );
                let d = if ok {
                    sampler::draw_sparse(&q, &mut self.rng)
                } else {
                    // everything filtered: the dense chain's greedy fallback
                    let t = sampler::argmax(&lg);
                    q.clear();
                    q.push((t, 1.0));
                    t
                };
                self.spec_qs[j] = q;
                all_ids.push(d);
                d
            } else if sampling {
                let mut q = std::mem::take(&mut self.spec_q[j]);
                sampler::distribution_into(
                    &lg,
                    &cfg,
                    all_ids,
                    &mut self.sampler_scratch,
                    self.pool.as_deref(),
                    &mut q,
                );
                let d = sampler::draw(&q, &mut self.rng);
                self.spec_q[j] = q;
                all_ids.push(d); // the next draft's penalties see this one
                d
            } else if greedy_pen {
                let d = sampler::argmax_penalized(
                    &lg,
                    &cfg,
                    all_ids,
                    &mut self.sampler_scratch,
                    self.pool.as_deref(),
                );
                all_ids.push(d);
                d
            } else {
                sampler::argmax(&lg)
            };
            attention::recycle_buf(&mut lg);
            drafts.push(dj);
            hx = hj;
            spec_stamp("d.pick");
        }
        all_ids.truncate(base_len);
        // Prompt lookup, plain greedy on native Metal, where a verify of
        // four to eight rows has one price: when the tip and the head's
        // drafts repeat an earlier stretch of the sequence, the tokens that
        // followed it there go on as drafts. The head's drafts are the
        // test: a lookup continues only what they agree with.
        let k_mtp = k_spec;
        // steps the MTP block took this round: its own round's drafts, the
        // chain run beside a DFlash block, or none
        let mtp_steps = if dflash_round { beside.len() } else { k_mtp };
        // The CUDA hybrid arm verifies up to 16 rows on the tensor cores at
        // about one price (8 rows 1.05x a plain token, 16 about 1.6x on a
        // 3090): a copy may run 15 drafts deep there.
        let cuda_window = crate::gpu::cuda_active();
        let k_room = room.min(if cuda_window && self.spec_lookup_wide { 15 } else { 7 });
        // A suppress list alone scores a continuation the same at any
        // history, so the CUDA window takes lookups under it too.
        let history_free = cfg.repetition_penalty == 1.0 && cfg.presence_penalty == 0.0;
        if (metal_native || cuda_window)
            && !sampling
            && (!greedy_pen || (cuda_window && history_free))
            && k_mtp < k_room
            && drafts.len() == k_mtp
            && Self::spec_lookup_on()
        {
            if self.spec_lookup_rest > 0 {
                self.spec_lookup_rest -= 1;
            } else {
                all_ids.extend_from_slice(&drafts);
                let more =
                    lookup_continuation(all_ids, k_mtp + LOOKUP_MIN_REAL, k_room - k_mtp).to_vec();
                all_ids.truncate(base_len);
                drafts.extend(more);
            }
        }
        let k_spec = drafts.len();
        spec_stamp("d.look");
        *drafted += k_spec;
        let t_draft = t_round.elapsed();
        let sub_draft = subs();
        // Verify batch: [t_next, d1 .. d_{k-1}] at next_pos.. — every row's
        // logits come back from the graph's own head.
        let b = k_spec + 1;
        let mut hiddens = vec![0.0f32; b * self.hidden_size];
        for (i, &t) in std::iter::once(&t_next).chain(drafts.iter()).enumerate() {
            let e = self.embed_single(t);
            hiddens[i * self.hidden_size..(i + 1) * self.hidden_size].copy_from_slice(&e);
        }
        let positions: Vec<usize> = (next_pos..next_pos + b).collect();
        spec_stamp("v.emb");
        let (lm_gw, lm_rows) = {
            let (_, i, kind, rs) = self.weights.lm_head.graph_weight()?;
            (
                crate::gpu::GraphW {
                    idx: i,
                    kind,
                    row_scale: rs,
                    data: &[],
                    prism: crate::gpu::GraphPrismOp::None,
                    affine: false,
                },
                self.weights.lm_head.rows(),
            )
        };
        let mut logits = Vec::new();
        let final_norm = self.weights.final_norm.clone();
        // Plain greedy on Metal: the b argmaxes come from the device
        // (`argmax_rows` after the head) and the 7.9 MB logits plane is
        // never read back — the round's decision needs only the ids, and
        // the loop top takes the last verified id as `spec_forced`, which
        // is exactly what its argmax of the row would give. The full rows
        // stay for anything that reads them: sampling, penalties,
        // confidence, the verify oracle, the logit dump.
        // `CMF_METAL_DEV_ARGMAX=0` keeps the host path.
        #[cfg(target_os = "macos")]
        let greedy_dev = metal_native
            && !sampling
            && !greedy_pen
            && !self.confidence_on
            && self.final_softcap.is_none()
            // The host acceptance argmax scans the WHOLE head row
            // (`lm_rows`), the sampler's own row only `vocab_size`: they
            // coincide exactly when the head has no padding rows, and
            // only then is the device argmax (which scores `vocab_size`)
            // bit-identical to both.
            && self.vocab_size == lm_rows
            && std::env::var_os("CMF_METAL_VERIFY_CHECK").is_none()
            && std::env::var_os("CMF_LOGIT_DUMP").is_none()
            && std::env::var("CMF_METAL_DEV_ARGMAX").as_deref() != Ok("0");
        // The CUDA hybrid arm the same way: each verify row's argmax on the
        // card (the host's tie rule), 5 MB of logits not read back.
        // `CMF_CUDA_DEV_ARGMAX=0` keeps the host path.
        #[cfg(all(not(target_os = "macos"), feature = "cuda"))]
        let greedy_dev = crate::gpu::cuda_active()
            && !sampling
            && !greedy_pen
            && !self.confidence_on
            && self.final_softcap.is_none()
            && self.vocab_size == lm_rows
            && std::env::var_os("CMF_LOGIT_DUMP").is_none()
            && std::env::var("CMF_CUDA_DEV_ARGMAX").as_deref() != Ok("0");
        #[cfg(all(not(target_os = "macos"), not(feature = "cuda")))]
        let greedy_dev = false;
        let mut dev_ids: Vec<u32> = Vec::new();
        #[cfg(target_os = "macos")]
        let verify_outcome = if metal_native {
            let lm = self.weights.lm_head.q1_parts()?;
            let n_score = self.vocab_size.min(lm_rows);
            self.try_batch_graph_metal(
                &mut hiddens,
                &positions,
                b,
                Some((lm, &final_norm, &mut logits)),
                if greedy_dev {
                    Some((n_score, &mut dev_ids))
                } else {
                    None
                },
            )
        } else {
            self.try_batch_graph_wgpu(
                &mut hiddens,
                &positions,
                b,
                Some(crate::gpu::SpecTail {
                    lm: lm_gw,
                    lm_rows,
                    final_norm: &final_norm,
                    logits_out: &mut logits,
                    pick: None,
                }),
            )
        };
        #[cfg(all(not(target_os = "macos"), feature = "cuda"))]
        crate::gpu_cuda::verify_argmax_arm(greedy_dev);
        #[cfg(not(target_os = "macos"))]
        let verify_outcome = self.try_batch_graph_wgpu(
            &mut hiddens,
            &positions,
            b,
            Some(crate::gpu::SpecTail {
                lm: lm_gw,
                lm_rows,
                final_norm: &final_norm,
                logits_out: &mut logits,
                pick: None,
            }),
        );
        #[cfg(all(not(target_os = "macos"), feature = "cuda"))]
        if greedy_dev {
            if let Some(ids) = crate::gpu_cuda::verify_argmax_take() {
                dev_ids = ids;
            }
        }
        match verify_outcome {
            crate::gpu::BatchGraphOutcome::Completed => {}
            crate::gpu::BatchGraphOutcome::Declined => {
                // The verifier refused before admission.  Its draft MTP
                // rows are still device-resident, so rewind the separate
                // mirror before the caller takes the exact one-token path.
                // (A DFlash round put no rows there.)
                self.dflash_rows = None;
                m.kv.truncate_last(mtp_steps);
                if !metal_native && mtp_steps > 0 && !self.rewind_mtp_graph_mirror(next_pos) {
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    tracing::error!("MTP graph mirror rewind failed after verify decline");
                }
                return None;
            }
            crate::gpu::BatchGraphOutcome::Failed => {
                // A failed batch may have advanced trunk/GDN state.  Clear
                // both mirrors and preserve the terminal outcome rather than
                // falling through to stale CPU state.
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                tracing::error!("MTP verify batch graph failed after admission");
                self.dflash_rows = None;
                return None;
            }
        }
        // `CMF_METAL_VERIFY_CHECK=1`: run the same b tokens through the
        // plain per-token path and compare each row's argmax + logits with
        // the verify's — the bring-up oracle for the batched graph. The
        // plain forwards mutate the CPU state; it is snapshotted and put
        // back, and the K/V mirrors re-pointed, before the round goes on.
        #[cfg(target_os = "macos")]
        if metal_native && std::env::var("CMF_METAL_VERIFY_CHECK").as_deref() == Ok("1") {
            let snap: Vec<Vec<f32>> = self
                .kv_cache
                .layers
                .iter()
                .map(|l| l.linear_state.clone())
                .collect();
            let attn_lens: Vec<usize> = self.kv_cache.layers.iter().map(|l| l.seq_len).collect();
            let toks: Vec<u32> = std::iter::once(t_next)
                .chain(drafts.iter().copied())
                .collect();
            let want_save = self.graph_want_logits;
            self.graph_want_logits = false;
            for (i, &t) in toks.iter().enumerate() {
                let hi = self.forward_layers(&self.embed_single(t), next_pos + i, None);
                let _ = self.graph_logits.take();
                // CMF_SPEC_PLAIN_HIDDEN=1: the next round drafts from the
                // plain path's hidden instead of the verify's (an experiment
                // on the chain's sensitivity to the half-GEMM noise)
                if std::env::var("CMF_SPEC_PLAIN_HIDDEN").as_deref() == Ok("1") {
                    hiddens[i * self.hidden_size..(i + 1) * self.hidden_size].copy_from_slice(&hi);
                }
                let ref_lg = self.logits_from_hidden(&hi);
                let row = &logits[i * lm_rows..(i + 1) * lm_rows];
                let ra = sampler::argmax(&ref_lg);
                let va = sampler::argmax(row);
                let mut md = 0f32;
                let mut rms = 0f64;
                for j in 0..lm_rows.min(ref_lg.len()) {
                    let d = (ref_lg[j] - row[j]).abs();
                    md = md.max(d);
                    rms += (d as f64) * (d as f64);
                }
                let mut hd = 0f32;
                for j in 0..self.hidden_size {
                    hd = hd.max((hi[j] - hiddens[i * self.hidden_size + j]).abs());
                }
                eprintln!(
                    "verify-check row {i} tok {t} pos {}: ref argmax {ra} verify argmax {va} {} | max|dlogit| {md:.3e} rms {:.3e} | max|dhidden| {hd:.3e}",
                    next_pos + i,
                    if ra == va { "OK" } else { "MISMATCH" },
                    (rms / lm_rows as f64).sqrt()
                );
            }
            self.graph_want_logits = want_save;
            // restore IN PLACE: the pending verify graph wraps these very
            // allocations (zero-copy) — replacing the Vec would strand it
            for (l, st) in self.kv_cache.layers.iter_mut().zip(snap) {
                if l.linear_state.len() == st.len() {
                    l.linear_state.copy_from_slice(&st);
                } else {
                    l.linear_state = st;
                }
            }
            for (li, (l, n0)) in self.kv_cache.layers.iter_mut().zip(attn_lens).enumerate() {
                let extra = l.seq_len.saturating_sub(n0);
                if extra > 0 {
                    l.truncate_last(extra);
                    crate::gpu_metal::kv_mirror_set_stored(self.graph_kv_id, li, n0);
                }
            }
        }
        let t_verify = t_round.elapsed();
        let sub_verify = subs();
        // Acceptance. Greedy: row i's argmax is the trunk's token after
        // input i. Sampling: accept draft i with min(1, p_i/q_i), and on
        // the first rejection draw the correction from max(0, p_i − q_i)
        // — that token is committed by the loop top as-is (spec_forced).
        let mut a = 0usize;
        let mut forced: Option<u32> = None;
        let ids: Vec<u32> = if sparse {
            let mut p = std::mem::take(&mut self.spec_ps);
            let mut res = std::mem::take(&mut self.spec_ress);
            while a < k_spec {
                let ok = sampler::sparse_distribution_into(
                    &logits[a * lm_rows..(a + 1) * lm_rows],
                    &cfg,
                    all_ids,
                    &mut self.sampler_scratch,
                    self.pool.as_deref(),
                    &mut p,
                );
                if !ok {
                    let t = sampler::argmax(&logits[a * lm_rows..(a + 1) * lm_rows]);
                    p.clear();
                    p.push((t, 1.0));
                }
                match sampler::spec_accept_or_correct_sparse(
                    &p,
                    &self.spec_qs[a],
                    drafts[a],
                    &mut self.rng,
                    &mut res,
                ) {
                    None => {
                        all_ids.push(drafts[a]);
                        a += 1;
                    }
                    Some(c) => {
                        forced = Some(c);
                        break;
                    }
                }
            }
            all_ids.truncate(base_len);
            self.spec_ps = p;
            self.spec_ress = res;
            drafts.clone()
        } else if sampling {
            let mut p = std::mem::take(&mut self.spec_p);
            let mut res = std::mem::take(&mut self.spec_res);
            while a < k_spec {
                sampler::distribution_into(
                    &logits[a * lm_rows..(a + 1) * lm_rows],
                    &cfg,
                    all_ids,
                    &mut self.sampler_scratch,
                    self.pool.as_deref(),
                    &mut p,
                );
                match sampler::spec_accept_or_correct(
                    &p,
                    &self.spec_q[a],
                    drafts[a],
                    &mut self.rng,
                    &mut res,
                    self.pool.as_deref(),
                ) {
                    None => {
                        all_ids.push(drafts[a]);
                        a += 1;
                    }
                    Some(c) => {
                        forced = Some(c);
                        break;
                    }
                }
            }
            all_ids.truncate(base_len);
            self.spec_p = p;
            self.spec_res = res;
            // the accepted drafts ARE the verified tokens after inputs 0..a
            drafts.clone()
        } else if greedy_pen {
            // Row i's penalized argmax, penalties over the stream that
            // includes the accepted drafts before it — the plain loop's
            // exact arithmetic, one pass per row, no working copy.
            let mut ids: Vec<u32> = Vec::with_capacity(b);
            for i in 0..b {
                let t = sampler::argmax_penalized(
                    &logits[i * lm_rows..(i + 1) * lm_rows],
                    &cfg,
                    all_ids,
                    &mut self.sampler_scratch,
                    self.pool.as_deref(),
                );
                ids.push(t);
                if i < k_spec && t == drafts[i] {
                    all_ids.push(t);
                } else {
                    break;
                }
            }
            all_ids.truncate(base_len);
            while a < k_spec && a < ids.len() && ids[a] == drafts[a] {
                a += 1;
            }
            // rows past the first mismatch were never scored; the loop
            // top re-samples the last verified row itself.
            ids
        } else if greedy_dev && dev_ids.len() == b {
            let ids = std::mem::take(&mut dev_ids);
            while a < k_spec && ids[a] == drafts[a] {
                a += 1;
            }
            ids
        } else {
            if logits.len() < b * lm_rows {
                // the device argmax was asked for and came back short:
                // no rows to fall back on — terminal like a failed batch
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                tracing::error!("Metal verify returned neither logits nor argmax ids");
                return None;
            }
            let ids: Vec<u32> = (0..b)
                .map(|i| sampler::argmax(&logits[i * lm_rows..(i + 1) * lm_rows]))
                .collect();
            while a < k_spec && ids[a] == drafts[a] {
                a += 1;
            }
            ids
        };
        spec_stamp("acc");
        if dflash_round {
            if let Some(log) = dflash_rows_log() {
                let mut rec = [u32::MAX; 24];
                (rec[0], rec[1], rec[2], rec[3]) = (next_pos as u32, t_next, k_spec as u32, a as u32);
                for (o, &d) in rec[4..11].iter_mut().zip(&drafts) {
                    *o = d;
                }
                for (o, &d) in rec[11..18].iter_mut().zip(&beside) {
                    *o = d;
                }
                // what a round of the chain's own would have added from the context
                let mut more: Vec<u32> = Vec::new();
                if beside.len() >= 2 && Self::spec_lookup_on() {
                    all_ids.extend_from_slice(&beside[..2]);
                    more = lookup_continuation(all_ids, 2 + LOOKUP_MIN_REAL, 5).to_vec();
                    all_ids.truncate(base_len);
                }
                rec[18] = more.len() as u32;
                for (o, &d) in rec[19..24].iter_mut().zip(&more) {
                    *o = d;
                }
                let mut bytes: Vec<u8> = rec.iter().flat_map(|v| v.to_le_bytes()).collect();
                bytes.extend(hidden.iter().flat_map(|v| v.to_le_bytes()));
                use std::io::Write as _;
                // the stream through the first logged round's first token, once:
                // a lookup reads the prompt, and the fit has to as well
                static IDS: std::sync::Once = std::sync::Once::new();
                IDS.call_once(|| {
                    if let Ok(path) = std::env::var("CMF_DFLASH_ROWS") {
                        let ids: Vec<u8> = all_ids.iter().flat_map(|v| v.to_le_bytes()).collect();
                        if let Err(e) = std::fs::write(format!("{path}.ids"), ids) {
                            tracing::warn!("CMF_DFLASH_ROWS: {path}.ids: {e}");
                        }
                    }
                });
                if let Ok(mut f) = log.lock() {
                    let _ = f.write_all(&bytes);
                }
            }
        }
        if spec_dbg {
            eprintln!(
                "spec-dbg round: t_next {t_next} drafts {:?} verified {:?} accepted {a}",
                drafts, ids
            );
        }
        // CMF_METAL_VERIFY_CHECK=2: the commit oracle — plain-forward the
        // a+1 accepted tokens from a snapshot, then diff the replayed GDN
        // states and the appended K/V rows against that.
        #[cfg(target_os = "macos")]
        let commit_ref: Option<(Vec<Vec<f32>>, Vec<(usize, Vec<f32>, Vec<f32>)>)> = if metal_native
            && std::env::var("CMF_METAL_VERIFY_CHECK").as_deref() == Ok("2")
        {
            let snap: Vec<Vec<f32>> = self
                .kv_cache
                .layers
                .iter()
                .map(|l| l.linear_state.clone())
                .collect();
            let attn_lens: Vec<usize> = self.kv_cache.layers.iter().map(|l| l.seq_len).collect();
            let toks: Vec<u32> = std::iter::once(t_next)
                .chain(drafts.iter().copied())
                .collect();
            let want_save = self.graph_want_logits;
            self.graph_want_logits = false;
            for (i, &t) in toks.iter().take(a + 1).enumerate() {
                let _ = self.forward_layers(&self.embed_single(t), next_pos + i, None);
                let _ = self.graph_logits.take();
            }
            self.graph_want_logits = want_save;
            let plain_states: Vec<Vec<f32>> = self
                .kv_cache
                .layers
                .iter()
                .map(|l| l.linear_state.clone())
                .collect();
            let (nkv, hd) = (self.num_kv_heads, self.head_dim);
            let mut rows = Vec::new();
            for (li, (l, n0)) in self
                .kv_cache
                .layers
                .iter_mut()
                .zip(attn_lens.iter())
                .enumerate()
            {
                let extra = l.seq_len.saturating_sub(*n0);
                if extra > 0 {
                    let mut kk = Vec::new();
                    let mut vv = Vec::new();
                    for g in 0..nkv {
                        kk.extend_from_slice(&l.head_keys(g)[n0 * hd..]);
                        vv.extend_from_slice(&l.head_values(g)[n0 * hd..]);
                    }
                    rows.push((li, kk, vv));
                    l.truncate_last(extra);
                    crate::gpu_metal::kv_mirror_set_stored(self.graph_kv_id, li, *n0);
                }
            }
            for (l, st) in self.kv_cache.layers.iter_mut().zip(snap) {
                if l.linear_state.len() == st.len() {
                    l.linear_state.copy_from_slice(&st);
                } else {
                    l.linear_state = st;
                }
            }
            Some((plain_states, rows))
        } else {
            None
        };
        let warm_off = std::env::var("CMF_SPEC_WARM").is_ok_and(|v| v == "0");
        // Metal: the MTP cache cut and the round's warm-up SUBMIT come
        // BEFORE the trunk commit, so the warm-up's command buffer is
        // queued ahead of the GDN replay (second queue) and its wait
        // below no longer sits behind the replay — measured: the warm-up's
        // wait grew with the accepted count exactly like the replay does
        // (8 ms at a=1, 17 ms at a=3, 25 ms at a=5 for ~2 ms of its own
        // work). The replay now overlaps the warm-up's readback, the
        // round's return and the next draft chain.
        #[cfg(target_os = "macos")]
        let mut warm_pending: Option<MetalWarmPending> = None;
        // The pairs the MTP cache has to hold of this round: the accepted
        // ones and, before them, the tip's own when the block was DFlash's
        // (an MTP chain's first step is that pair). The MTP block stays in
        // step through DFlash rounds, so either drafter can take the next.
        let hs_w = self.hidden_size;
        let warm_first = usize::from(mtp_steps == 0);
        let warm_n = if dflash_round && !mtp_in_step { 0 } else { a + warm_first };
        let warm_pos = next_pos - warm_first;
        let warm_pair = |j: usize| -> (&[f32], u32) {
            if j < warm_first {
                (hidden, t_next)
            } else {
                let j = j - warm_first;
                (&hiddens[j * hs_w..(j + 1) * hs_w], ids[j])
            }
        };
        #[cfg(target_os = "macos")]
        if metal_native {
            if mtp_steps > 0 {
                m.kv.truncate_last(mtp_steps - 1);
            }
            if self.mtp_graph_mode == Some(true) {
                // the mirror rows below the cut are the CPU rows: re-point,
                // no re-upload
                crate::gpu_metal::kv_mirror_set_stored(
                    self.mtp_kv_id(),
                    Self::MTP_LAYER_BASE,
                    m.kv.seq_len,
                );
                if !warm_off && warm_n > 0 {
                    let pairs: Vec<(&[f32], u32)> = (0..warm_n).map(&warm_pair).collect();
                    warm_pending = self.mtp_warm_batch_submit(m, &pairs, warm_pos);
                }
            }
            spec_stamp("c.wsub");
        }
        // a fully-accepted round needs no restore: every input was real.
        #[cfg(target_os = "macos")]
        if metal_native {
            // the Metal verify never wrote its states: the commit replays the
            // accepted prefix into the CPU owners and appends the K/V rows
            if !self.metal_verify_commit(a) {
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                tracing::error!("Metal verify state/KV handoff failed after admission");
                return None;
            }
            // the rows the round keeps are the drafter's next context
            if let (Some((pos0, rows)), Some(d)) = (self.dflash_rows.take(), self.dflash.as_mut()) {
                let tw = d.g.tap_width();
                d.queue_context(pos0, &rows[..(a + 1) * tw], self.pool.as_deref());
                spec_stamp("c.flash");
            }
            if let Some((plain_states, rows)) = commit_ref {
                crate::gpu_metal::queue_fence();
                // the commit's replay runs on the second queue: collect it
                // before the oracle reads the CPU owners it writes into
                let _ = crate::gpu_metal::wait_replay();
                let (nkv, hd) = (self.num_kv_heads, self.head_dim);
                let mut worst_s = 0f32;
                let mut worst_li = 0usize;
                for (li, (l, ps)) in self.kv_cache.layers.iter().zip(&plain_states).enumerate() {
                    if l.linear_state.len() != ps.len() || ps.is_empty() {
                        continue;
                    }
                    let d = l
                        .linear_state
                        .iter()
                        .zip(ps)
                        .fold(0f32, |m, (x, y)| m.max((x - y).abs()));
                    let n = ps.iter().fold(0f32, |m, y| m.max(y.abs()));
                    let rel = d / n.max(1e-6);
                    if rel > worst_s {
                        worst_s = rel;
                        worst_li = li;
                    }
                }
                let mut worst_k = 0f32;
                for (li, kk, vv) in &rows {
                    let l = &self.kv_cache.layers[*li];
                    let n0 = l.seq_len - (kk.len() / (nkv * hd));
                    let mut ck = Vec::new();
                    let mut cv = Vec::new();
                    for g in 0..nkv {
                        ck.extend_from_slice(&l.head_keys(g)[n0 * hd..]);
                        cv.extend_from_slice(&l.head_values(g)[n0 * hd..]);
                    }
                    if ck.len() == kk.len() {
                        let dk = ck
                            .iter()
                            .zip(kk)
                            .fold(0f32, |m, (x, y)| m.max((x - y).abs()));
                        let dv = cv
                            .iter()
                            .zip(vv)
                            .fold(0f32, |m, (x, y)| m.max((x - y).abs()));
                        worst_k = worst_k.max(dk).max(dv);
                    } else {
                        eprintln!(
                            "commit-check L{li}: kv row count mismatch {} vs {}",
                            ck.len(),
                            kk.len()
                        );
                    }
                }
                eprintln!(
                    "commit-check a={a}: worst GDN state rel-max diff {worst_s:.2e} (L{worst_li}) | worst K/V row abs diff {worst_k:.4}"
                );
            }
        }
        if !metal_native && a + 1 < b {
            let expected_gdn_layers = self.graph_gdn_layer_count();
            if expected_gdn_layers > 0
                && !crate::gpu::gdn_spec_restore(self.graph_kv_id, a, next_pos, expected_gdn_layers)
            {
                self.clear_sequence_state();
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                self.cancel
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                tracing::error!("GDN speculative restore failed after verify");
                return None;
            }
        }
        if self.o1_active() && !crate::gpu::o1_spec_commit(self.graph_kv_id, next_pos, a + 1) {
            self.clear_sequence_state();
            self.graph_failed
                .store(true, std::sync::atomic::Ordering::Relaxed);
            self.cancel
                .store(true, std::sync::atomic::Ordering::Relaxed);
            tracing::error!("far field commit failed after verify");
            return None;
        }
        // the rows a wgpu verify kept for the drafter: those the round keeps
        // are its next context
        if !metal_native {
            let kept = self.dflash_taps.lock().unwrap().pop();
            if let (Some((pos0, rows)), Some(d)) = (kept, self.dflash.as_mut()) {
                let tw = d.g.tap_width();
                if pos0 == next_pos && rows.len() >= (a + 1) * tw {
                    d.queue_context(pos0, &rows[..(a + 1) * tw], self.pool.as_deref());
                }
            }
        }
        if !metal_native && !self.rewind_trunk_graph_mirrors(next_pos + a + 1) {
            // The verify graph committed the full batch, but one of its
            // persistent Full-attention mirrors could not be re-pointed to
            // the accepted prefix.  Treat that as terminal state failure;
            // an exact CPU fallback would otherwise consume stale GDN/KV.
            self.clear_sequence_state();
            self.graph_failed
                .store(true, std::sync::atomic::Ordering::Relaxed);
            self.cancel
                .store(true, std::sync::atomic::Ordering::Relaxed);
            tracing::error!("trunk graph KV rewind failed after speculative verify");
            return None;
        }
        *accepted += a;
        // MTP cache: keep the first draft row (its inputs were real), drop
        // the chain's, then append the verified pairs the round produced.
        // Each of those is a whole MTP block on the per-op path and they
        // cost 5.8 ms of a 69 ms round at k=3 — a third of what the
        // round's own draft costs. PRICED, and they earn it: skipping
        // them (`CMF_SPEC_WARM=0`) drops acceptance from 89% to 81% at
        // k=3 and 85% to 74% at k=4, and the tok/s goes nowhere at k=3
        // (50.3 against 50.5) and backwards at k=4 (48.1 against 50.1).
        // The knob stays so the next person can re-price it after the
        // warms are batched instead of assuming either way.
        if !metal_native && mtp_steps > 0 {
            // (Metal cut its MTP cache before the trunk commit, above)
            m.kv.truncate_last(mtp_steps - 1);
        }
        spec_stamp("c.trunc");
        // (the block's round put no row there: the mirror already ends where
        // the warm-up starts)
        if !metal_native
            && self.mtp_graph_mode == Some(true)
            && (mtp_steps > 0 || warm_n > 0)
            && !self.rewind_mtp_graph_mirror(warm_pos)
        {
            // The graph draft was admitted, so inability to move its cursor
            // back to the real anchor is a state failure, not a capability
            // refusal.  Do not warm or continue with a stale mirror.
            self.clear_sequence_state();
            self.graph_failed
                .store(true, std::sync::atomic::Ordering::Relaxed);
            self.cancel
                .store(true, std::sync::atomic::Ordering::Relaxed);
            tracing::error!("MTP graph mirror rewind failed after verify commit");
            return None;
        }
        if !warm_off && warm_n > 0 {
            // Graph arm: all accepted pairs in ONE batched run over the
            // MTP block; the token graph one by one if the batch declines.
            let mut warmed = false;
            #[cfg(target_os = "macos")]
            if metal_native && self.mtp_graph_mode == Some(true) {
                // the batched warm-up was submitted before the trunk
                // commit: collect it here; one by one on the token graph
                // if it declined (or failed)
                warmed = match warm_pending.take() {
                    Some(p) => self.mtp_warm_batch_finish(m, p),
                    None => false,
                };
                if !warmed {
                    warmed = true;
                    for j in 0..warm_n {
                        let (row, tok) = warm_pair(j);
                        let row = row.to_vec();
                        if self
                            .mtp_step_metal(m, &row, tok, warm_pos + j, false)
                            .is_none()
                        {
                            warmed = false;
                            break;
                        }
                    }
                }
            }
            if !warmed && self.mtp_graph_mode != Some(false) && !metal_native {
                let rows: Vec<(Vec<f32>, u32)> = (0..warm_n)
                    .map(|j| {
                        let (row, tok) = warm_pair(j);
                        (row.to_vec(), tok)
                    })
                    .collect();
                let pairs: Vec<(&[f32], u32)> = rows.iter().map(|(r, t)| (r.as_slice(), *t)).collect();
                match self.mtp_warm_prefill_pairs(m, &pairs, warm_pos) {
                    Ok(()) => warmed = true,
                    Err(err) => {
                        // A warm-up failure after graph admission cannot
                        // fall back to `mtp_warm`: the detached CPU cache is
                        // not authoritative for the device mirror.  Mark it
                        // terminal so the generation caller clears state and
                        // returns instead of drafting from stale attention.
                        tracing::error!("{err}");
                        self.clear_sequence_state();
                        self.graph_failed
                            .store(true, std::sync::atomic::Ordering::Relaxed);
                        self.cancel
                            .store(true, std::sync::atomic::Ordering::Relaxed);
                        return None;
                    }
                }
            }
            if !warmed {
                for j in 0..warm_n {
                    let (row, tok) = warm_pair(j);
                    let row = row.to_vec();
                    self.mtp_warm(m, &row, tok, warm_pos + j);
                }
            }
        }
        // The sampler's contract: logits of the LAST verified position —
        // unless a rejected draft already drew the correction, in which
        // case the loop top commits that token and samples nothing.
        spec_stamp("c.warm");
        if let Some(c) = forced {
            self.spec_forced = Some(c);
            self.graph_logits = None;
        } else if greedy_dev && logits.is_empty() {
            // the row's argmax IS the token the loop top would pick from
            // it (plain greedy, no penalties): commit it as forced
            self.spec_forced = Some(ids[a]);
            self.graph_logits = None;
        } else {
            let mut row = logits[a * lm_rows..(a + 1) * lm_rows].to_vec();
            row.resize(self.vocab_size, 0.0);
            if let Some(c) = self.final_softcap {
                for l in row.iter_mut() {
                    *l = c * (*l / c).tanh();
                }
            }
            self.graph_logits = Some(row);
        }
        let new_hidden = hiddens[a * self.hidden_size..(a + 1) * self.hidden_size].to_vec();
        spec_stamp("c.row");
        // Three phases, not two. The round's wall clock was 4 ms longer
        // than draft+verify and the difference had nowhere to be seen:
        // the accepted prefix re-runs the MTP block once per token to
        // keep the draft head's attention cache warm, and the GDN state
        // rolls back on any rejection. Both live here, after the verify.
        if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
            let end = subs();
            eprintln!(
                "spec-round: draft {:.1} ms/{} sub | verify {:.1} ms/{} sub | \
                 commit {:.1} ms/{} sub (accepted {a} of {k_spec}, full-head streak {})",
                t_draft.as_secs_f64() * 1e3,
                sub_draft - sub0,
                (t_verify - t_draft).as_secs_f64() * 1e3,
                sub_verify - sub_draft,
                (t_round.elapsed() - t_verify).as_secs_f64() * 1e3,
                end - sub_verify,
                self.draft_full_streak,
            );
        }
        // Native Metal's verify tile is flat in b (eight rows for the price
        // of one), so a shorter round only forfeits tokens — measured on
        // the M4: an essay round at k=2 still verified in 260 ms. The
        // adaptation is for cards whose verify grows with the rows.
        if k_spec > k_mtp {
            // a lookup's round: what it added over the head's own drafts
            let extra = a.saturating_sub(k_mtp) as f32;
            self.spec_lookup_gain += 0.2 * (extra - self.spec_lookup_gain);
            // a copy that holds whole earns the long window; a miss goes back
            self.spec_lookup_wide = a == k_spec;
            if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
                eprintln!(
                    "spec-lookup: {} drafts from the context, {extra} held (average {:.2})",
                    k_spec - k_mtp,
                    self.spec_lookup_gain
                );
            }
            if self.spec_lookup_gain < LOOKUP_PAYS {
                self.spec_lookup_rest = 24;
                self.spec_lookup_gain = 1.6;
            }
        }
        if metal_small && !k_capped {
            // (the chain's account stands as its last rounds on this text
            // left it while the block has the rounds: that is what the block
            // has to beat)
            if dflash_round {
                self.dflash_turn_sum.0 += (a + 1) as f32;
                self.dflash_turn_sum.1 += METAL_ROUND_COST[k_spec.clamp(1, 7) - 1] + DFLASH_ROUND_DRAFT;
            }
            let hold = if dflash_round { &mut self.dflash_hold } else { &mut self.spec_hold };
            spec_hold_update(hold, k_mtp, a.min(k_mtp));
            if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
                let next = metal_spec_plan(hold, if dflash_round { DFLASH_ROUND_DRAFT } else { 0.0 }).0;
                if next != k_mtp && k_env.is_none() {
                    eprintln!("spec-k: {k_mtp} → {next} (a draft holds after the last {hold:.2?})");
                }
            }
        }

        if k_env.is_none() && !metal_native && !k_capped {
            // The depth is the drafter's own: a round the context lookup
            // lengthened (CUDA) adapts by the chain's drafts and what of them
            // held, and its wall (a longer verify) is not a depth's price.
            let lookup_round = k_spec > k_mtp;
            let (k_spec, a) = (k_mtp, a.min(k_mtp));
            // Slow average and a wide band: a fast one oscillated 2↔3 on
            // an essay every other round (measured), which forfeits the
            // draft it just paid for. Each drafter has its own depth.
            if cuda_rate && dflash_round && !k_capped {
                self.dflash_turn_sum.0 += (a + 1) as f32;
                self.dflash_turn_sum.1 += CUDA_ROUND_COST[k_spec.clamp(1, 7) - 1] + CUDA_BLOCK_DRAFT;
                spec_hold_update(&mut self.dflash_hold, k_spec, a.min(k_spec));
            }
            let (ewma, k_min) = if dflash_round { (&mut self.dflash_acc_ewma, 3) } else { (&mut self.spec_acc_ewma, 2) };
            let f = a as f32 / k_spec.max(1) as f32;
            *ewma += 0.2 * (f - *ewma);
            let mut k_next = k_spec;
            if *ewma >= 0.75 && k_spec < k_max {
                k_next = k_spec + 1;
            } else if *ewma < 0.4 && k_spec > k_min {
                k_next = k_spec - 1;
            }
            // The chain's rounds are timed by depth, and once two depths
            // are, the depth is the one that lands the most tokens in a unit
            // of time at this device's prices (`wgpu_spec_depth`): the share
            // of drafts kept climbs to five on text that holds whatever a
            // fifth row costs. A depth's first round pays its scratch and
            // is not counted; a change stands for six rounds.
            let mut planned = false;
            if !dflash_round && !lookup_round {
                spec_hold_update(&mut self.spec_hold, k_spec, a);
                let d = k_spec.clamp(1, 7) - 1;
                let w = t_round.elapsed().as_secs_f32() * 1e3;
                match self.spec_wall_n[d] {
                    0 => self.spec_wall_n[d] = 1,
                    1 => (self.spec_wall[d], self.spec_wall_n[d]) = (w, 2),
                    _ => self.spec_wall[d] += 0.2 * (w - self.spec_wall[d]),
                }
                if let Some(k_plan) = wgpu_spec_depth(&self.spec_hold, &self.spec_wall, k_spec, k_min, k_max) {
                    planned = true;
                    k_next = if self.spec_k_dwell > 0 {
                        self.spec_k_dwell -= 1;
                        k_spec
                    } else {
                        k_plan
                    };
                    if k_next != k_spec {
                        self.spec_k_dwell = 6;
                    }
                }
            }
            if k_next != k_spec {
                *ewma = 0.6;
                if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
                    if planned {
                        eprintln!(
                            "spec-k: {k_spec} → {k_next} (a round costs {:.0?} ms, a draft holds after the last {:.2?})",
                            self.spec_wall, self.spec_hold
                        );
                    } else {
                        eprintln!("spec-k: {k_spec} → {k_next}");
                    }
                }
            }
            if dflash_round {
                self.dflash_k_adapt = Some(k_next);
            } else {
                self.spec_k_adapt = Some(k_next);
            }
        }
        spec_stamp("end");
        Some((drafts[..a].to_vec(), next_pos + a + 1, new_hidden))
    }

    /// A round's drafts from the DFlash drafter: the block behind the anchor
    /// `t_next` at `next_pos`, its first `k` tokens. The block reads the
    /// context the trunk's rows before `next_pos` left; the tokens come from
    /// the trunk's own head through the drafter's selector.
    fn dflash_draft(&mut self, t_next: u32, next_pos: usize, k: usize) -> Vec<u32> {
        let Some(mut d) = self.dflash.take() else {
            return Vec::new();
        };
        let (hs, rows) = (self.hidden_size, d.g.block);
        let mut h = vec![0f32; rows * hs];
        h[..hs].copy_from_slice(&self.embed_single(t_next));
        let mask = self.embed_single(d.g.mask_token);
        for r in 1..rows {
            h[r * hs..(r + 1) * hs].copy_from_slice(&mask);
        }
        // A trunk that scales its embeddings on the way in (Ripple): the
        // block reads the table's rows as they are (`CMF_DFLASH_EMBED=scaled`
        // hands it the trunk's input rows).
        if self.embed_multiplier != 1.0 && std::env::var("CMF_DFLASH_EMBED").as_deref() != Ok("scaled") {
            let inv = 1.0 / self.embed_multiplier;
            h.iter_mut().for_each(|v| *v *= inv);
        }
        let pool = self.pool.as_deref();
        let t0 = std::time::Instant::now();
        d.settle(pool);
        spec_stamp("d.ctx");
        let t_ctx = t0.elapsed();
        // the block, the head and the selector's projection as one
        // submission on wgpu; the host block below where it declines
        #[cfg(feature = "gpu")]
        if let Some((logits, hp)) = d.block_dev(next_pos, &h, k.min(rows - 1), &self.weights.lm_head) {
            spec_stamp("d.block");
            let t_block = t0.elapsed();
            let n = k.min(rows - 1);
            let (mut ids, _) = d.select_with(&hp, &logits, t_next, n);
            ids.truncate(k);
            // `CMF_DFLASH_DEV_CHECK=1`: the host block on the same rows, and
            // how far the device's logits, selector rows and drafts are from it
            if std::env::var_os("CMF_DFLASH_DEV_CHECK").is_some() {
                let out = d.block(next_pos, h.clone(), pool);
                let head = &self.weights.lm_head;
                let mut hl = vec![0f32; n * head.rows()];
                head.matmat(&out[hs..(n + 1) * hs], n, &mut hl, pool);
                // the device may score only the head's first rows (CUDA: the shortlist)
                let width = logits.len() / n.max(1);
                let hl: Vec<f32> = (0..n).flat_map(|j| hl[j * head.rows()..j * head.rows() + width].to_vec()).collect();
                let (hids, _) = d.select(&out[hs..(n + 1) * hs], &hl, t_next);
                let (mut dmax, mut ref_max, mut dsum, mut cnt) = (0f32, 0f32, 0f64, 0usize);
                for (a, b) in logits.iter().zip(&hl) {
                    dmax = dmax.max((a - b).abs());
                    ref_max = ref_max.max(b.abs());
                    dsum += ((a - b) * (a - b)) as f64;
                    cnt += 1;
                }
                let arg = |v: &[f32]| (0..n).map(|j| sampler::argmax(&v[j * width..(j + 1) * width])).collect::<Vec<u32>>();
                eprintln!(
                    "dflash-dev-check: logits max|Δ| {dmax:.4} of max {ref_max:.2}, rms Δ {:.5} | argmax device {:?} host {:?} | drafts device {:?} host {:?}",
                    (dsum / cnt.max(1) as f64).sqrt(),
                    arg(&logits),
                    arg(&hl),
                    ids,
                    &hids[..k.min(hids.len())]
                );
            }
            if self.dflash_solo && spec_time_level() > 0 {
                eprintln!(
                    "solo-draft: context {:.1} ms | device block + head {:.1} ms | selector {:.1} ms",
                    t_ctx.as_secs_f64() * 1e3,
                    (t_block - t_ctx).as_secs_f64() * 1e3,
                    (t0.elapsed() - t_block).as_secs_f64() * 1e3
                );
            }
            spec_stamp("d.head");
            self.dflash = Some(d);
            return ids;
        }
        let out = d.block(next_pos, h, pool);
        spec_stamp("d.block");
        let t_block = t0.elapsed();
        // the head over the round's shortlist of the vocabulary, as the MTP
        // draft has it (the full head while `draft_full_streak` runs). The
        // shortlist is the low ids of Qwen's vocabulary: a trunk with another
        // tokenizer (`dflash_solo`) scores the whole head.
        let (n, head) = (rows - 1, &self.weights.lm_head);
        let width = if self.dflash_solo { head.rows() } else { self.draft_head_rows(head.rows()) };
        let mut logits = vec![0f32; n * width];
        // the block's rows on the narrow kernel; any other head as a batch
        let narrow = head.mapped_q4tp().is_some_and(|(m, idx)| {
            crate::gpu::q4tp_rows8_many(m, &[(idx, head.rows(), head.cols(), width)], &out[hs..], n, &mut [&mut logits[..]])
        });
        if !narrow {
            logits = vec![0f32; n * head.rows()];
            if !head.device_matmat(&out[hs..], n, &mut logits) {
                head.matmat(&out[hs..], n, &mut logits, pool);
            }
        }
        spec_stamp("d.head");
        let t_head = t0.elapsed();
        let (mut ids, _) = d.select(&out[hs..], &logits, t_next);
        ids.truncate(k);
        if self.dflash_solo && spec_time_level() > 0 {
            eprintln!(
                "solo-draft: context {:.1} ms | block {:.1} ms | head {:.1} ms | selector {:.1} ms",
                t_ctx.as_secs_f64() * 1e3,
                (t_block - t_ctx).as_secs_f64() * 1e3,
                (t_head - t_block).as_secs_f64() * 1e3,
                (t0.elapsed() - t_head).as_secs_f64() * 1e3
            );
        }
        if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() && d.next_position() != next_pos {
            eprintln!("dflash: the context ends at {} for a block at {next_pos}", d.next_position());
        }
        self.dflash = Some(d);
        ids
    }

    /// A speculative round of a trunk that has no draft block of its own.
    /// The drafts are the DFlash sidecar's block behind the tip `t_next` (or
    /// the next ids of `CMF_SPEC_SCRIPT`); the batch graph verifies them with
    /// the tip in one submission, and the cache keeps the rows of the drafts
    /// that held and of the tip. None: no round was made (plain greedy goes
    /// on), or the graph failed after admission (`graph_failed` is set).
    #[cfg(feature = "gpu")]
    fn solo_spec_round(&mut self, t_next: u32, next_pos: usize, all_ids: &[u32], k: usize) -> Option<SoloRound> {
        self.dflash_taps_absorb();
        let t0 = std::time::Instant::now();
        let drafts: Vec<u32> = match solo_script() {
            Some(script) => script.iter().skip(all_ids.len()).take(k).copied().collect(),
            None => {
                if self.dflash.as_ref().is_none_or(|d| d.next_position() != next_pos) {
                    return None;
                }
                self.dflash_draft(t_next, next_pos, k)
            }
        };
        if drafts.is_empty() {
            return None;
        }
        let t_draft = t0.elapsed();
        let (b, hs) = (drafts.len() + 1, self.hidden_size);
        let mut hiddens = vec![0f32; b * hs];
        for (i, &t) in std::iter::once(&t_next).chain(drafts.iter()).enumerate() {
            hiddens[i * hs..(i + 1) * hs].copy_from_slice(&self.embed_single(t));
        }
        let positions: Vec<usize> = (next_pos..next_pos + b).collect();
        let (lm_gw, lm_rows) = {
            let (_, i, kind, rs) = self.weights.lm_head.graph_weight()?;
            (
                crate::gpu::GraphW { idx: i, kind, row_scale: rs, data: &[], prism: crate::gpu::GraphPrismOp::None, affine: false },
                self.weights.lm_head.rows(),
            )
        };
        let mut logits = Vec::new();
        let final_norm = self.weights.final_norm.clone();
        let outcome = self.try_batch_graph_wgpu(
            &mut hiddens,
            &positions,
            b,
            Some(crate::gpu::SpecTail { lm: lm_gw, lm_rows, final_norm: &final_norm, logits_out: &mut logits, pick: None }),
        );
        let fail = |p: &mut Self, what: &str| {
            p.clear_sequence_state();
            p.graph_failed.store(true, std::sync::atomic::Ordering::Relaxed);
            p.cancel.store(true, std::sync::atomic::Ordering::Relaxed);
            tracing::error!("{what}");
        };
        match outcome {
            crate::gpu::BatchGraphOutcome::Completed if logits.len() >= b * lm_rows => {}
            crate::gpu::BatchGraphOutcome::Declined => return None,
            _ => {
                fail(self, "the verify of a speculative round failed after admission");
                return None;
            }
        }
        let t_verify = t0.elapsed();
        // row i's argmax is the trunk's token after input i
        let ids: Vec<u32> = (0..b).map(|i| sampler::argmax(&logits[i * lm_rows..(i + 1) * lm_rows])).collect();
        let mut a = 0usize;
        while a < drafts.len() && ids[a] == drafts[a] {
            a += 1;
        }
        if std::env::var_os("CMF_SPEC_DBG").is_some() {
            eprintln!(
                "solo-dbg: tip {t_next} at {next_pos} | context {:?} | drafts {drafts:?} | the trunk's {ids:?} | kept {a}",
                self.dflash.as_ref().map(|d| d.span())
            );
        }
        if self.o1_active() && !crate::gpu::o1_spec_commit(self.graph_kv_id, next_pos, a + 1) {
            fail(self, "far field commit failed after a speculative round");
            return None;
        }
        // a hybrid trunk (Arete-27B, no draft block of its own): its GDN
        // states back to the rows the round kept, as after a chain's round
        if a + 1 < b {
            let gdn = self.graph_gdn_layer_count();
            if gdn > 0 && !crate::gpu::gdn_spec_restore(self.graph_kv_id, a, next_pos, gdn) {
                fail(self, "GDN restore failed after a speculative round");
                return None;
            }
        }
        // the rows the round keeps are the drafter's next context
        let kept = self.dflash_taps.lock().unwrap().pop();
        if let (Some((pos0, rows)), Some(d)) = (kept, self.dflash.as_mut()) {
            let tw = d.g.tap_width();
            if pos0 == next_pos && rows.len() >= (a + 1) * tw {
                d.queue_context(pos0, &rows[..(a + 1) * tw], self.pool.as_deref());
            }
        }
        if !self.rewind_trunk_graph_mirrors(next_pos + a + 1) {
            fail(self, "trunk graph KV rewind failed after a speculative round");
            return None;
        }
        let mut row = logits[a * lm_rows..(a + 1) * lm_rows].to_vec();
        row.resize(self.vocab_size, 0.0);
        if let Some(c) = self.final_softcap {
            for l in row.iter_mut() {
                *l = c * (*l / c).tanh();
            }
        }
        if spec_time_level() > 0 {
            eprintln!(
                "solo-round: draft {:.1} ms | verify {:.1} ms | commit {:.1} ms | kept {a} of {}",
                t_draft.as_secs_f64() * 1e3,
                (t_verify - t_draft).as_secs_f64() * 1e3,
                (t0.elapsed() - t_verify).as_secs_f64() * 1e3,
                drafts.len()
            );
        }
        Some(SoloRound { accepted: drafts[..a].to_vec(), drafted: drafts.len(), hidden: hiddens[a * hs..(a + 1) * hs].to_vec(), logits: row })
    }

    /// Micro-benchmark: two single-position forwards vs one fused pair
    /// from the current cache state (KV rewound after each probe).
    /// Returns (two_singles_ms, fused_pair_ms) per probe, or the (0, 0)
    /// sentinel when this model has no pair path to measure — the same
    /// answer the o1 arm gives, and the bench prints it the same way.
    /// (An architecture that loads its own layers leaves `weights.layers`
    /// empty; walking it here was an index panic, found by `bench` on
    /// deepseek_v4.)
    pub fn measure_pair_fusion(&mut self, iters: usize) -> (f64, f64) {
        if !self.pair_supported() {
            return (0.0, 0.0);
        }
        // A GDN model that needs an automatic device prefix never uses this
        // fused-pair path in normal generation: its recurrence is serial and
        // the speculative pair is disabled by default.  More importantly,
        // this diagnostic suppresses the token graph, so measuring it would
        // stream the non-resident tail through per-op Vulkan just to print a
        // non-production number.  Leave inference untouched and report the
        // established unavailable sentinel instead.
        if self.gdn_cfg.is_some()
            && self.graph_prefill_preferred()
            && self.automatic_gpu_prefix().is_some()
        {
            tracing::info!(
                "pair micro-benchmark skipped: GDN device-prefix path has no production pair route"
            );
            return (0.0, 0.0);
        }
        // This is a host-side pair micro-benchmark. It truncates the host KV
        // after every probe, so letting the whole-token graph participate
        // would leave its device GDN/KV mirror ahead of the next probe and
        // poison the process-wide graph verdict before the real generation
        // benchmark starts. Keep the existing per-op/GPU arithmetic while
        // suppressing only the stateful token graph for this measurement.
        let graph_env = std::env::var_os("CMF_GPU_WGPU_GRAPH");
        unsafe { std::env::set_var("CMF_GPU_WGPU_GRAPH", "0") };
        let emb1 = self.embed_single(1);
        let emb2 = self.embed_single(2);
        let pos = self.kv_cache.seq_len();

        let t0 = std::time::Instant::now();
        for _ in 0..iters {
            let _ = self.forward_layers(&emb1, pos, None);
            let _ = self.forward_layers(&emb2, pos + 1, None);
            for l in &mut self.kv_cache.layers {
                l.truncate_last(2);
            }
        }
        let singles_ms = t0.elapsed().as_secs_f64() * 1000.0 / iters as f64;

        let t1 = std::time::Instant::now();
        for _ in 0..iters {
            let _ = self.forward_pair(&emb1, &emb2, pos);
            for l in &mut self.kv_cache.layers {
                l.truncate_last(2);
            }
        }
        let pair_ms = t1.elapsed().as_secs_f64() * 1000.0 / iters as f64;
        match graph_env {
            Some(value) => unsafe { std::env::set_var("CMF_GPU_WGPU_GRAPH", value) },
            None => unsafe { std::env::remove_var("CMF_GPU_WGPU_GRAPH") },
        }
        (singles_ms, pair_ms)
    }

    /// Fused two-position forward: weight rows are streamed from memory
    /// once per layer for both positions. Full layers → fused GQA pair;
    /// linear layers → vmf_phase pair (lane 2 state is tentative in the
    /// per-layer scratch until the draft is accepted).
    /// Whether the fused two-position path covers every layer kind in
    /// this model. MLA and KDA run per position (their pair arms are
    /// unreachable); the seq prefill falls back to singles for them.
    fn pair_supported(&self) -> bool {
        // An EMPTY layer stack means the architecture loaded its own and
        // this path has nothing to walk. Checking that directly, rather
        // than naming each such architecture, is what makes the guard hold
        // for the next one: `any()` over no layers is false, so a
        // feature-by-feature test says "supported" for a model that has no
        // layers here at all.
        !self.weights.layers.is_empty()
            && !self.per_token_stack()
            && !self
                .weights
                .layers
                .iter()
                .any(|lw| matches!(&lw.attn, AttnKind::Mla(_) | AttnKind::Kda(_)))
    }

    fn forward_pair(
        &mut self,
        emb1: &[f32],
        emb2: &[f32],
        position: usize,
    ) -> (Vec<f32>, Vec<f32>) {
        // A two-token prompt starts here, not in the layer walk: decide the
        // MiMo placement before the pair's per-op MoE uploads any expert.
        self.mimo_moe_prepare();
        let mut h1 = emb1.to_vec();
        let mut h2 = emb2.to_vec();
        if self.value_blend.is_some() {
            self.vres_e0.clear();
            self.vres_e0.extend_from_slice(emb1);
            self.vres_e0.extend_from_slice(emb2);
        }
        let (_nkv, _hd, hs, _rd, eps) = (
            self.num_kv_heads,
            self.head_dim,
            self.hidden_size,
            self.rotary_dim,
            self.rms_eps,
        );
        let pool = self.pool.clone();
        // `forward_pair` bypasses `forward_layers_span`, but its per-op
        // body must still obey the ordinary layer placement. In particular,
        // an over-capacity Vulkan model has a device prefix and a CPU tail;
        // letting the pair walk submit the tail's selected MoE experts would
        // stream the whole tail through the residency arena and defeat the
        // measured VRAM bound.
        let automatic_gpu_prefix = self.automatic_gpu_prefix();

        for li in 0..self.num_layers {
            let _capacity_tail = automatic_gpu_prefix
                .filter(|&prefix| li >= prefix && !self.mimo_moe.is_dynamic(li, false))
                .map(|_| crate::gpu::enter_cpu_scope());
            // Also makes an explicit CMF_GPU_LAYERS split apply to fused
            // pairs, just as it does to the ordinary layer walk.
            crate::gpu::set_layer(li as i64);
            let lw = &self.weights.layers[self.phys_layer(li)];
            // Norms into pipeline scratch (4 allocs/layer on the MTP
            // decode hot path before this).
            inference::rms_norm_into(
                &h1,
                &lw.input_norm,
                self.rms_eps,
                self.norm_style,
                &mut self.ws.n1,
            );
            inference::rms_norm_into(
                &h2,
                &lw.input_norm,
                self.rms_eps,
                self.norm_style,
                &mut self.ws.n2,
            );
            // The two rows V projects, when the layer blends the embeddings into them.
            let vres = match self.layer_value_blend(li) {
                Some(blend) => {
                    let mut second = Vec::new();
                    vres_lerp(&self.vres_e0[..hs], &self.ws.n1, blend, &mut self.vres_in);
                    vres_lerp(&self.vres_e0[hs..], &self.ws.n2, blend, &mut second);
                    self.vres_in.extend_from_slice(&second);
                    true
                }
                None => false,
            };

            let (a1, a2) = match &lw.attn {
                AttnKind::Mla(_) => unreachable!("MLA has no MTP/pair path"),
                AttnKind::Kda(_) => unreachable!("KDA has no MTP/pair path"),
                AttnKind::Bounded(w) => {
                    // Two sequential positions of the bounded operator
                    // (the ring's causal order is the pair's order).
                    let rope = self
                        .bounded_rope
                        .clone()
                        .expect("bounded layer without an installed rotation table");
                    let cfg = crate::bounded::BoundedAttnCfg {
                        num_heads: self.num_heads,
                        num_kv_heads: self.num_kv_heads,
                        head_dim: self.head_dim,
                        hidden_size: hs,
                        scale: self.attn_scale,
                        rope: &rope,
                        pool: pool.as_deref(),
                    };
                    let a1 = crate::bounded::bounded_attention(
                        &self.ws.n1,
                        w,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    );
                    let a2 = crate::bounded::bounded_attention(
                        &self.ws.n2,
                        w,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    );
                    (a1, a2)
                }
                AttnKind::Linear(w) => {
                    let cfg = self.vmf_cfg.expect("linear layer without vmf_cfg");
                    let layer = &mut self.kv_cache.layers[li];
                    let (state, scratch) = (&mut layer.linear_state, &mut layer.linear_scratch);
                    vmf_phase_pair(
                        &self.ws.n1,
                        &self.ws.n2,
                        w,
                        &cfg,
                        state,
                        scratch,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::LinearGdn(w) => {
                    let cfg = self.gdn_cfg.expect("gdn layer without gdn_cfg");
                    let layer = &mut self.kv_cache.layers[li];
                    let (state, scratch) = (&mut layer.linear_state, &mut layer.linear_scratch);
                    gdn_pair(
                        &self.ws.n1,
                        &self.ws.n2,
                        w,
                        &cfg,
                        state,
                        scratch,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::ShortConv(w) => {
                    let cfg = self
                        .short_conv_cfg
                        .expect("short-conv layer without short_conv_cfg");
                    let layer = &mut self.kv_cache.layers[li];
                    let (state, scratch) = (&mut layer.linear_state, &mut layer.linear_scratch);
                    short_conv_pair(
                        &self.ws.n1,
                        &self.ws.n2,
                        w,
                        &cfg,
                        state,
                        scratch,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } => {
                    let inv_freq_l = self.layer_inv_freq(li);
                    let (nkv_l, hd_l, rd_l) = self.layer_geom(li);
                    let cfg = QwenAttnCfg {
                        mrope: None,
                        num_heads: self.layer_num_heads(li),
                        num_kv_heads: nkv_l,
                        head_dim: hd_l,
                        hidden_size: hs,
                        position,
                        inv_freq: &inv_freq_l,
                        rotary_dim: rd_l,
                        scale: self.attn_scale,
                        softcap: self.attn_softcap,
                        window: self.layer_window(li),
                        v_norm: self.attn_v_norm,
                        qk_norm_after_rope: self.qk_norm_after_rope,
                        gate_sigmoid: self.proj_gate_sigmoid,
                        q_norm: q_norm.as_deref(),
                        k_norm: k_norm.as_deref(),
                        output_gate: *output_gate,
                        softplus_gate: softplus_gate
                            .as_ref()
                            .map(|(gate, per_head)| (gate, *per_head)),
                        rope_scale: self.layer_rope_scale(li),
                        bias: bias
                            .as_ref()
                            .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                        rms_eps: eps,
                        norm_style: self.norm_style,
                        pool: pool.as_deref(),
                        v_head_dim: self.layer_v_dim(li),
                        value_in: vres.then(|| self.vres_in.as_slice()),
                    };
                    attention::qwen_attention_pair(
                        &self.ws.n1,
                        &self.ws.n2,
                        wq,
                        wk,
                        wv,
                        wo,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    )
                }
            };
            let (a1, a2) = match &self.weights.layers[self.phys_layer(li)].attn_out_norm {
                Some(w) => (
                    inference::rms_norm(&a1, w, self.rms_eps, self.norm_style),
                    inference::rms_norm(&a2, w, self.rms_eps, self.norm_style),
                ),
                None => (a1, a2),
            };
            for i in 0..self.hidden_size {
                h1[i] += a1[i];
                h2[i] += a2[i];
            }
            let (mut a1, mut a2) = (a1, a2);
            attention::recycle_buf(&mut a1);
            attention::recycle_buf(&mut a2);

            let lw = &self.weights.layers[self.phys_layer(li)];
            inference::rms_norm_into(
                &h1,
                &lw.post_norm,
                self.rms_eps,
                self.norm_style,
                &mut self.ws.p1,
            );
            inference::rms_norm_into(
                &h2,
                &lw.post_norm,
                self.rms_eps,
                self.norm_style,
                &mut self.ws.p2,
            );
            let (f1, f2) = match &lw.ffn {
                // Dual-branch layers need the raw residuals — run the
                // two positions through the same fn decode uses.
                FfnKind::DenseMoe(dm) => (
                    dense_moe_ffn(
                        dm,
                        &self.ws.p1,
                        &h1,
                        self.rms_eps,
                        self.norm_style,
                        self.pool.as_deref(),
                    ),
                    dense_moe_ffn(
                        dm,
                        &self.ws.p2,
                        &h2,
                        self.rms_eps,
                        self.norm_style,
                        self.pool.as_deref(),
                    ),
                ),
                FfnKind::Moe(m) if self.mimo_moe.is_dynamic(li, false) => (
                    moe_ffn_banked(&mut self.mimo_moe, li, m, &self.ws.p1, self.pool.as_deref()),
                    moe_ffn_banked(&mut self.mimo_moe, li, m, &self.ws.p2, self.pool.as_deref()),
                ),
                _ => ffn_forward_pair(
                    &lw.ffn,
                    &self.ws.p1,
                    &self.ws.p2,
                    self.pool.as_deref(),
                    None,
                ),
            };
            let (f1, f2) = match &self.weights.layers[self.phys_layer(li)].ffn_out_norm {
                Some(w) => (
                    inference::rms_norm(&f1, w, self.rms_eps, self.norm_style),
                    inference::rms_norm(&f2, w, self.rms_eps, self.norm_style),
                ),
                None => (f1, f2),
            };
            for i in 0..self.hidden_size {
                h1[i] += f1[i];
                h2[i] += f2[i];
            }
            let (mut f1, mut f2) = (f1, f2);
            attention::recycle_buf(&mut f1);
            attention::recycle_buf(&mut f2);
            if let Some(sc) = self.weights.layers[self.phys_layer(li)].layer_scale {
                for i in 0..self.hidden_size {
                    h1[i] *= sc;
                    h2[i] *= sc;
                }
            }
            // Looped Transformer: apply final norm at the end of each loop iteration.
            if self.is_loop_end(li) && li + 1 < self.num_layers {
                h1 = inference::rms_norm(
                    &h1,
                    &self.weights.final_norm,
                    self.rms_eps,
                    self.norm_style,
                );
                h2 = inference::rms_norm(
                    &h2,
                    &self.weights.final_norm,
                    self.rms_eps,
                    self.norm_style,
                );
            }
        }
        crate::gpu::set_layer(-1); // final/O(1) work is outside layer placement
        // Real O(1) prefill pairs may also carry tentative lane-2 recurrent
        // state. Commit it before publishing the transition epoch so the
        // next serial/device row cannot observe a new attention epoch with an
        // old GDN state. Speculative pairs run only when O(1) is inactive and
        // retain their existing caller-controlled commit/rollback semantics.
        if self.o1_active() {
            self.commit_linear_scratch();
        }
        self.o1_progress();
        self.swa_trim_tails();
        (h1, h2)
    }

    /// Commit lane-2 linear states after an accepted draft.
    fn commit_linear_scratch(&mut self) {
        for layer in &mut self.kv_cache.layers {
            if !layer.linear_scratch.is_empty() {
                std::mem::swap(&mut layer.linear_state, &mut layer.linear_scratch);
                layer.linear_scratch.clear();
            }
        }
    }

    /// This is the encoder counterpart to `forward_ids`: it runs a fresh
    /// sequence through the existing full/GDN hybrid stack and returns the
    /// final RMS-normalized hidden row for *every* token.  It is used by
    /// component pipelines whose text tower intentionally has no LM head
    /// (such as an image-conditioner Qwen3.5 model).  The sequence state is
    /// always released before returning, so a large text tower can be dropped
    /// immediately after conditioning a subsequent stage.
    pub fn encode_hidden_states(&mut self, ids: &[u32]) -> Result<Vec<f32>, String> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        if ids.is_empty() {
            return Err("empty id sequence".to_string());
        }

        self.nll_begin()?;
        let result = (|| {
            let hidden = self.prefill_input_rows(PrefillIn::Ids(ids), 0, None)?;
            self.nll_check_graph("encoder prefill", 0)?;
            let expected = ids.len() * self.hidden_size;
            if hidden.len() != expected {
                return Err(format!(
                    "encoder prefill returned {} values for {} rows of hidden size {}",
                    hidden.len(),
                    ids.len(),
                    self.hidden_size
                ));
            }

            let mut out = vec![0.0f32; expected];
            for (src, dst) in hidden
                .chunks_exact(self.hidden_size)
                .zip(out.chunks_exact_mut(self.hidden_size))
            {
                inference::rms_norm_into(
                    src,
                    &self.weights.final_norm,
                    self.rms_eps,
                    self.norm_style,
                    dst,
                );
            }
            Ok(out)
        })();
        self.nll_end();
        result
    }

    /// The last layer's hidden row (before the final norm) for every token
    /// of `ids`, from a fresh sequence, through the whole-stack prefill (the
    /// device chunk graph where there is one) — what a distillation cache of
    /// teacher outputs needs, at prefill speed.
    pub fn final_hidden_rows(&mut self, ids: &[u32]) -> Result<Vec<f32>, String> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        if ids.is_empty() {
            return Err("empty id sequence".to_string());
        }
        self.nll_begin()?;
        let result = (|| {
            let hidden = self.prefill_input_rows(PrefillIn::Ids(ids), 0, None)?;
            self.nll_check_graph("hidden prefill", 0)?;
            if hidden.len() != ids.len() * self.hidden_size {
                return Err(format!("hidden prefill returned {} values for {} rows", hidden.len(), ids.len()));
            }
            Ok(hidden)
        })();
        self.nll_end();
        result
    }

    /// Forward a full id sequence from a fresh cache and return the
    /// logits after the last position (golden-parity harness, bench).
    pub fn forward_ids(
        &mut self,
        ids: &[u32],
        task_mask: Option<&TaskMask>,
    ) -> Result<Vec<f32>, String> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        if ids.is_empty() {
            return Err("empty id sequence".to_string());
        }
        self.clear_sequence_state();
        self.check_forward_graph("forward_ids setup", 0)?;
        if task_mask.is_none() {
            self.o1_begin();
        }
        let mut hidden = vec![0.0f32; self.hidden_size];
        let mut pos = 0usize;
        if self.dory.is_some() {
            return Ok(self.dory_forward(ids, 0, crate::dory::Want::Last));
        }
        if let Some(b) = &mut self.dsv41 {
            let pool = self.pool.clone();
            let mut logits = Vec::new();
            crate::dsv41::forward_chunk(
                &b.0,
                &b.1,
                &b.2,
                &mut b.3,
                ids,
                0,
                pool.as_deref(),
                &mut logits,
            );
            if let Err(err) = self.o1_seal_checked() {
                self.clear_sequence_state();
                return Err(err);
            }
            return Ok(logits);
        }
        // Same routing predicate generation uses. Two reasons it must be
        // the same one: (1) a GDN hybrid's recurrent state is GPU-
        // resident, and a batched CPU prefill would build it on the host
        // only — decode then reads buffers the prefill never wrote;
        // (2) bench times THIS function and calls the result "prefill",
        // so a different path here reports a number production never
        // sees (W2 on 2×5090: 8.7 tok/s reported against 125 real).
        // Gemma-4: generation's batched-graph ingest (`g4_batch_ingest`),
        // so bench and the parity tools time and score the route run/serve
        // take; a refusal leaves the rest to the chunked host prefill.
        #[cfg(not(target_os = "macos"))]
        if task_mask.is_none() && ids.len() > 2 && self.g4_batch_prefill() {
            let (n, last) = match self.g4_batch_ingest(ids, 0, false) {
                Ok(r) => r,
                Err(e) => {
                    self.clear_sequence_state();
                    return Err(e);
                }
            };
            if n > 0 {
                hidden.copy_from_slice(&last);
                pos = n;
            }
        }
        if self.can_prefill_batched() && !self.graph_prefill_preferred() && ids.len() > 2 {
            // prefill-GEMM in chunks; only the last position's hidden is
            // needed. (o1-compatible: the batch path attends per position
            // through qwen_attention, which carries the collection hook.)
            let chunk = self.prefill_chunk();
            let hs = self.hidden_size;
            while pos < ids.len() {
                let end = (pos + chunk).min(ids.len());
                let hb = self.prefill_rows(&ids[pos..end], pos, task_mask)?;
                self.check_forward_graph("forward_ids batched prefill", end - 1)?;
                hidden.copy_from_slice(&hb[(end - pos - 1) * hs..]);
                pos = end;
            }
        }
        // Same guards as generation's prefill — INCLUDING the graph one.
        // The CPU pair walk was intercepting positions that the resident
        // token graph would have run itself: on a GDN hybrid over wgpu
        // that is 89 ms of host forward against 7 ms of device submit,
        // and it made prefill look 12× slower than it is (W2 on an RTX
        // 5090, ctx 512: 11.2 tok/s with the walk, 136.6 without).
        // CMF_PAIR=0 opts out; a model whose layers live outside
        // `weights.layers` has no pair walk to take.
        if task_mask.is_none()
            && !self.graph_prefill_preferred()
            && !std::env::var("CMF_PAIR").is_ok_and(|v| v == "0")
            && self.pair_supported()
        {
            while pos + 1 < ids.len() {
                let e1 = self.embed_single(ids[pos]);
                let e2 = self.embed_single(ids[pos + 1]);
                let (_, h2) = self.forward_pair(&e1, &e2, pos);
                self.check_forward_graph("forward_ids pair", pos + 1)?;
                self.commit_linear_scratch();
                hidden = h2;
                pos += 2;
            }
        }
        // Resident Embryo graph: the prompt in chunks of one submit each
        // (the same device state and logits as the per-position walk).
        if task_mask.is_none() && pos == 0 && ids.len() > 1 {
            if let Some(lg) = self.embryo_prefill_chunked(ids, 0) {
                self.graph_logits = Some(lg);
                hidden = vec![0.0; self.hidden_size];
                pos = ids.len();
            }
        }
        while pos < ids.len() {
            hidden = self.forward_layers(&self.embed_single(ids[pos]), pos, task_mask);
            self.check_forward_graph("forward_ids", pos)?;
            pos += 1;
        }
        if let Some(logits) = self.graph_logits.take() {
            // Resident stacks already applied final norm and their head in
            // the same submit; do not run a second norm/head over the zero
            // hidden sentinel returned by forward_layers_span.
            if let Err(err) = self.o1_seal_checked() {
                self.clear_sequence_state();
                return Err(err);
            }
            return Ok(logits);
        }
        // Harness contract: after forward_ids the cache is decode-ready —
        // under o1 that means sealed (bench measures the seal as part of
        // prefill, honestly).
        if let Err(err) = self.o1_seal_checked() {
            self.clear_sequence_state();
            return Err(err);
        }
        let normed = inference::rms_norm(
            &hidden,
            &self.weights.final_norm,
            self.rms_eps,
            self.norm_style,
        );
        Ok(self.lm_head_forward(&normed))
    }

    /// Run the V4.1 stack one token at a time and retain logits for every
    /// position. This is a diagnostic surface for comparing a converted
    /// checkpoint with a tokenwise reference implementation.
    #[doc(hidden)]
    pub fn dsv41_serial_logits(&mut self, ids: &[u32]) -> Result<Vec<Vec<f32>>, String> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        if ids.is_empty() {
            return Err("empty id sequence".to_string());
        }
        self.clear_sequence_state();
        self.dsv41
            .as_ref()
            .ok_or_else(|| "dsv41 serial logits require a DeepSeek-V4.1 model".to_string())?;
        self.o1_begin();
        let rows = {
            let pool = self.pool.clone();
            let b = self
                .dsv41
                .as_mut()
                .expect("dsv41 checked above; state cannot change during forward");
            let mut rows = Vec::with_capacity(ids.len());
            for (position, &id) in ids.iter().enumerate() {
                let mut logits = Vec::new();
                crate::dsv41::forward_token(
                    &b.0,
                    &b.1,
                    &b.2,
                    &mut b.3,
                    id,
                    position,
                    pool.as_deref(),
                    &mut logits,
                );
                rows.push(logits);
            }
            rows
        };
        self.o1_seal();
        Ok(rows)
    }

    /// GPTQ calibration of DeepSeek-V4.1 (`cortiq quantize-moe`): the MoE
    /// input rows and routed expert ids of layers `lo..hi` for `ids` (a fresh
    /// sequence), see [`crate::dsv41::Dsv41MoeCapture`].
    pub fn dsv41_moe_capture(
        &mut self,
        ids: &[u32],
        lo: usize,
        hi: usize,
    ) -> Result<crate::dsv41::Dsv41MoeCapture, String> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        if ids.is_empty() {
            return Err("empty id sequence".to_string());
        }
        self.dsv41
            .as_ref()
            .ok_or_else(|| "not a DeepSeek-V4.1 model".to_string())?;
        self.clear_sequence_state();
        let res = {
            let pool = self.pool.clone();
            let b = self.dsv41.as_mut().expect("dsv41 checked above");
            crate::dsv41::capture_window(&b.0, &b.1, &b.2, &mut b.3, ids, lo, hi, pool.as_deref())
        };
        self.clear_sequence_state();
        res
    }

    /// Teacher-forced perplexity over a token sequence (phase-C gate:
    /// honest quant comparisons instead of prompt vibes).
    ///
    /// Attention is EXACT even on a model whose layers are flagged for
    /// the O(1) kernel — scoring the backbone is the default on purpose
    /// (it is the yardstick). `nll_ids_o1` scores the CONVERTED model.
    pub fn ppl_ids(&mut self, ids: &[u32]) -> Result<f64, String> {
        let (nll, cnt) = self.nll_ids_from(ids, 0)?;
        Ok((nll / cnt.max(1) as f64).exp())
    }

    /// GPTQ calibration forward: `ids` through layers `0..upto` only, in
    /// layer-major chunks of `chunk` positions, with no vocabulary head and
    /// no scoring. The Hessian hook (`gptq_capture`) folds every
    /// projection's input on the way; the layers above the captured span
    /// and the head would only cost time. Falls back to a scored forward
    /// where the batched prefill does not apply.
    pub fn calib_forward(&mut self, ids: &[u32], upto: usize, chunk: usize) -> Result<(), String> {
        if !self.can_prefill_batched() {
            return self.nll_ids_from(ids, 0).map(|_| ());
        }
        self.nll_begin()?;
        let result: Result<(), String> = (|| {
            let chunk = chunk.max(1);
            let mut pos = 0usize;
            while pos < ids.len() {
                let end = (pos + chunk).min(ids.len());
                let _ = self.prefill_batch_span(PrefillIn::Ids(&ids[pos..end]), pos, None, 0, upto);
                self.nll_check_graph("calibration prefill", pos)?;
                pos = end;
            }
            Ok(())
        })();
        self.nll_end();
        result
    }

    /// Layer-streamed calibration of one fresh window: layers `from..mid` run
    /// on `input` (the hidden state entering layer `from`; `None` = the
    /// token embeddings of `ids`) and their output is returned, then layers
    /// `mid..upto` run on that output for the capture hooks (their output is
    /// dropped). A caller that keeps the returned state per window runs each
    /// layer once over the whole conversion instead of re-running the stack
    /// below every layer. With `mid == from` the input is returned as is
    /// (`None` input: an empty vector).
    pub fn calib_window_span(
        &mut self,
        ids: &[u32],
        input: Option<&[f32]>,
        from: usize,
        mid: usize,
        upto: usize,
    ) -> Result<Vec<f32>, String> {
        if !self.can_prefill_batched() {
            return Err("calib_window_span: this architecture has no batched prefill".into());
        }
        self.nll_begin()?;
        let result: Result<Vec<f32>, String> = (|| {
            let h = if mid > from {
                let inp = match input {
                    Some(h) => PrefillIn::Hidden(h),
                    None => PrefillIn::Ids(ids),
                };
                let h = self.prefill_batch_span(inp, 0, None, from, mid);
                self.nll_check_graph("calibration span", 0)?;
                h
            } else {
                input.map(<[f32]>::to_vec).unwrap_or_default()
            };
            if upto > mid {
                let inp = if mid > from || input.is_some() {
                    PrefillIn::Hidden(&h)
                } else {
                    PrefillIn::Ids(ids)
                };
                let _ = self.prefill_batch_span(inp, 0, None, mid, upto);
                self.nll_check_graph("calibration span", 0)?;
            }
            Ok(h)
        })();
        self.nll_end();
        result
    }

    /// GPTQ calibration of a Flash-Next-class MoE (`qwen4_exp`): MoE input
    /// rows and router logits of layers `lo..hi` for `ids` (a fresh
    /// sequence), per layer `[ids.len()][hidden + n_experts]`.
    #[cfg(feature = "gpu")]
    pub fn qwen4_capture(
        &mut self,
        ids: &[u32],
        lo: usize,
        hi: usize,
    ) -> Result<Vec<Vec<f32>>, String> {
        let b = self.qwen4_exp.as_mut().ok_or("not a qwen4_exp model")?;
        crate::qwen4_exp::capture_window(
            &b.0,
            &b.1,
            &b.2,
            &mut b.3,
            ids,
            lo,
            hi,
            &self.inv_freq,
            self.pool.as_deref(),
        )
    }

    /// GPTQ calibration capture of an ordinary MoE stack (Qwen3.5/3.6
    /// MoE, Clover): `ids` from position 0 through the batched device graph
    /// in prefill-sized chunks, the MoE input rows and router logits of
    /// layers `lo..hi` copied out after routing. Returns per layer
    /// `[ids.len()][hidden + n_experts]`; the sequence state is left fresh.
    #[cfg(feature = "gpu")]
    pub fn moe_capture(&mut self, ids: &[u32], lo: usize, hi: usize) -> Result<Vec<Vec<f32>>, String> {
        use crate::gpu_wgpu::clover as cap;
        let (hs, hi) = (self.hidden_size, hi.min(self.num_layers));
        let ne = (lo..hi)
            .find_map(|li| match &self.weights.layers[self.phys_layer(li)].ffn {
                FfnKind::Moe(m) => Some(m.experts.len()),
                _ => None,
            })
            .ok_or("no MoE layer in the capture range")?;
        let chunk = self.prefill_chunk().max(1);
        self.clear_sequence_state();
        if !cap::moe_capture_begin(lo, hi, chunk, hs, ne) {
            return Err("capture unavailable (no wgpu device)".into());
        }
        let mut out: Vec<Vec<f32>> = (lo..hi).map(|_| Vec::with_capacity(ids.len() * (hs + ne))).collect();
        let res = (|| {
            for (ci, part) in ids.chunks(chunk).enumerate() {
                let mut hiddens = Vec::with_capacity(part.len() * hs);
                for &id in part {
                    hiddens.extend_from_slice(&self.embed_single(id));
                }
                let positions: Vec<usize> = (ci * chunk..ci * chunk + part.len()).collect();
                match self.try_batch_graph_wgpu(&mut hiddens, &positions, part.len(), None) {
                    crate::gpu::BatchGraphOutcome::Completed => {}
                    _ => return Err("the batched graph declined the calibration forward (VRAM budget?)".to_string()),
                }
                let (rows, written) = cap::moe_capture_read(part.len()).ok_or("capture readback")?;
                if written < hi - lo {
                    return Err(format!("{written} of {} captured layers ran through the device MoE arm", hi - lo));
                }
                for (o, r) in out.iter_mut().zip(rows) {
                    o.extend_from_slice(&r);
                }
            }
            Ok(())
        })();
        cap::moe_capture_end();
        self.clear_sequence_state();
        res.map(|_| out)
    }

    /// Expert directory triples (gate, up, down) of an ordinary MoE layer,
    /// routed and shared.
    pub fn moe_expert_dirs(
        &self,
        li: usize,
    ) -> Option<(Vec<(usize, usize, usize)>, Option<(usize, usize, usize)>)> {
        let FfnKind::Moe(m) = &self.weights.layers.get(self.phys_layer(li))?.ffn else {
            return None;
        };
        let dirs = |d: &DenseFfn| Some((d.gate_proj.model_idx()?, d.up_proj.model_idx()?, d.down_proj.model_idx()?));
        let routed = m.experts.iter().map(dirs).collect::<Option<Vec<_>>>()?;
        let shared = match &m.shared {
            Some((se, _)) => Some(dirs(se)?),
            None => None,
        };
        Some((routed, shared))
    }

    /// Expert directory triples of a `qwen4_exp` layer (routed, shared).
    pub fn qwen4_expert_dirs(
        &self,
        li: usize,
    ) -> Option<(Vec<(usize, usize, usize)>, Option<(usize, usize, usize)>)> {
        let b = self.qwen4_exp.as_ref()?;
        crate::qwen4_exp::expert_dirs(&b.1, li)
    }

    /// Teacher-force the installed MTP draft stack and collect each draft
    /// FFN's own pre-down activation statistics.
    ///
    /// This is deliberately separate from [`Self::probe_ffn_mass`]: canonical
    /// MTP and MiMo sidecars can have independently compacted FFNs, and MiMo
    /// draft layers can differ in width from one another and from the trunk.
    /// The returned vector follows the actual draft stack (one entry for a
    /// canonical MTP head; one per MiMo draft layer). MiMo layer `k` replays
    /// the teacher-forced pairs `(hidden[j], ids[j + k + 1])`.
    ///
    /// Calibration starts from a fresh sequence and leaves the trunk, draft
    /// KVs, history, and device mirrors fresh on both success and error. It
    /// is therefore unsuitable for the middle of a conversation whose KV
    /// cache must be retained.
    pub fn probe_mtp_ffn(&mut self, ids: &[u32]) -> Result<Vec<MtpFfnProbe>, String> {
        self.reset_mtp_probe_state();
        // The trunk runs as one prefill (the device graph where there is
        // one); the draft replays on the host under a CPU scope, where its
        // FFN input can be measured. This guard also suppresses gate/oracle
        // sparsity experiments for the duration so the statistics and
        // admission replay always execute the full dense FFN.
        let _exact_calibration = ExactMtpCalibrationGuard::enter();
        let result = if ids.len() < 2 {
            Err("MTP FFN probe needs at least two token ids".into())
        } else if ids
            .iter()
            .any(|&id| id as usize >= self.weights.embed_tokens.rows())
        {
            Err("MTP FFN probe received a token id outside the embedding table".into())
        } else if self.mtp.is_some() && self.mimo_mtp.is_some() {
            // A synthetic pipeline can carry both mechanisms, but merging
            // unlike draft semantics into one compaction plan is unsafe.
            Err("MTP FFN probe found both canonical and MiMo draft stacks".into())
        } else if self.mimo_mtp.is_some() {
            let mut st = self
                .mimo_mtp
                .take()
                .expect("checked MiMo MTP before detaching it");
            let result = match self.probe_trunk_rows(ids) {
                Ok(trunk) => crate::gpu::cpu_scope(|| {
                    self.mimo_mtp_ffn_probe_teacher_forced(&mut st, ids, &trunk)
                }),
                Err(e) => Err(e),
            };
            // The owner is detached during the replay, so the common trunk
            // reset cannot clear its KVs. Restore it even on an error.
            st.reset();
            self.mimo_mtp = Some(st);
            result
        } else if self.mtp.is_some() {
            let mut mtp = self
                .mtp
                .take()
                .expect("checked canonical MTP before detaching it");
            let result = match self.probe_trunk_rows(ids) {
                Ok(trunk) => crate::gpu::cpu_scope(|| {
                    self.mtp_ffn_probe_teacher_forced(&mut mtp, ids, &trunk)
                }),
                Err(e) => Err(e),
            };
            mtp.kv.clear();
            self.mtp = Some(mtp);
            result
        } else {
            Err("MTP FFN probe: this pipeline has no draft stack".into())
        };
        // Cover every early/error arm above: no failed calibration can leak
        // a partially populated trunk or draft cache into the next request.
        self.reset_mtp_probe_state();
        result
    }

    /// Reset every state owner touched by [`Self::probe_mtp_ffn`].
    fn reset_mtp_probe_state(&mut self) {
        self.clear_sequence_state();
        if let Some(mtp) = self.mtp.as_mut() {
            mtp.kv.clear();
        }
        if let Some(mimo) = self.mimo_mtp.as_mut() {
            mimo.reset();
        }
        self.mtp_graph_mode = None;
    }

    /// The trunk's last hidden row (before the final norm) at every
    /// position a teacher-forced draft probe reads (`ids[..len-1]`), from
    /// the whole-stack prefill — the device graph where there is one. One
    /// position at a time through `forward_layers` on the host this was the
    /// probe's whole cost: a 14B's 96k calibration tokens ran for hours.
    pub(crate) fn probe_trunk_rows(&mut self, ids: &[u32]) -> Result<Vec<f32>, String> {
        if ids.len() < 2 {
            return Err("MTP FFN probe needs at least two token ids".into());
        }
        let rows = self.final_hidden_rows(&ids[..ids.len() - 1])?;
        self.clear_sequence_state();
        Ok(rows)
    }

    /// Canonical one-layer MTP teacher-forced replay over the trunk rows
    /// of [`Self::probe_trunk_rows`]. Its cache advances for every row so
    /// later attention inputs match a real draft warm-up rather than a
    /// collection of independent one-token measurements. The FFN inputs are
    /// measured in batches: nothing after the FFN feeds a later row.
    fn mtp_ffn_probe_teacher_forced(
        &mut self,
        mtp: &mut MtpModule,
        ids: &[u32],
        trunk: &[f32],
    ) -> Result<Vec<MtpFfnProbe>, String> {
        let FfnKind::Dense(dense) = &mtp.layer.ffn else {
            return Err("MTP FFN probe: canonical draft FFN is not dense".into());
        };
        let inter = dense.gate_proj.rows();
        let (hs, n) = (self.hidden_size, ids.len() - 1);
        if trunk.len() != n * hs {
            return Err(format!(
                "MTP FFN probe: {} trunk values for {n} rows of width {hs}",
                trunk.len()
            ));
        }
        let mut mass = vec![0.0f64; inter];
        let mut squared_mass = vec![0.0f64; inter];
        let mut inputs = Vec::with_capacity(MTP_PROBE_FFN_ROWS.min(n) * hs);
        for position in 0..n {
            self.mtp_probe_ffn_input(
                mtp,
                &trunk[position * hs..(position + 1) * hs],
                ids[position + 1],
                position,
            )?;
            inputs.extend_from_slice(&self.ws.p1[..hs]);
            if inputs.len() == MTP_PROBE_FFN_ROWS * hs || position + 1 == n {
                let FfnKind::Dense(dense) = &mtp.layer.ffn else {
                    unreachable!("checked dense above");
                };
                accumulate_dense_ffn_activation_mass(
                    dense,
                    &inputs,
                    inputs.len() / hs,
                    self.pool.as_deref(),
                    &mut mass,
                    &mut squared_mass,
                )?;
                inputs.clear();
            }
        }
        Ok(vec![MtpFfnProbe {
            mass,
            squared_mass,
            observed_positions: n,
        }])
    }

    /// CPU-only MTP block replay up to the FFN's input (the post-attention
    /// norm, left in `ws.p1`), where the probe measures. The ordinary
    /// `mtp_step_hl` device path keeps these values resident and therefore
    /// cannot truthfully provide a per-neuron calibration statistic. The
    /// FFN arm itself is not run: its output feeds only this row's logits.
    fn mtp_probe_ffn_input(
        &mut self,
        mtp: &mut MtpModule,
        hidden: &[f32],
        next_token: u32,
        position: usize,
    ) -> Result<(), String> {
        let e = self.embed_single(next_token);
        let mut cat = vec![0.0f32; 2 * self.hidden_size];
        let (cat_e, cat_h) = cat.split_at_mut(self.hidden_size);
        inference::rms_norm_into(&e, &mtp.enorm, self.rms_eps, self.norm_style, cat_e);
        inference::rms_norm_into(
            hidden,
            &mtp.hnorm,
            self.rms_eps,
            self.norm_style,
            cat_h,
        );
        let mut x = vec![0.0f32; self.hidden_size];
        mtp.eh_proj.matvec(&cat, &mut x, self.pool.as_deref());

        let lw = &mtp.layer;
        inference::rms_norm_into(
            &x,
            &lw.input_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.n1,
        );
        let attn = match &lw.attn {
            AttnKind::Full {
                wq,
                wk,
                wv,
                wo,
                q_norm,
                k_norm,
                output_gate,
                softplus_gate,
                bias,
            } => {
                let mut cfg = self.attn_cfg(position);
                cfg.q_norm = q_norm.as_deref();
                cfg.k_norm = k_norm.as_deref();
                cfg.output_gate = *output_gate;
                cfg.softplus_gate = softplus_gate
                    .as_ref()
                    .map(|(gate, per_head)| (gate, *per_head));
                cfg.bias = bias
                    .as_ref()
                    .map(|(q, k, v)| (q.as_slice(), k.as_slice(), v.as_slice()));
                attention::qwen_attention(&self.ws.n1, wq, wk, wv, wo, &mut mtp.kv, &cfg)
            }
            _ => return Err("MTP FFN probe: draft attention is not full attention".into()),
        };
        for (dst, src) in x.iter_mut().zip(attn) {
            *dst += src;
        }
        inference::rms_norm_into(
            &x,
            &lw.post_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.p1,
        );
        Ok(())
    }

    /// DTG-MA calibration pass (Patent 2): run `ids` through the model
    /// (CPU path, per position) and return each layer's per-neuron
    /// activation mass Σ|silu(gate)·up| — the statistic the task-guided
    /// FFN mask is derived from.
    pub fn probe_ffn_mass(&mut self, ids: &[u32]) -> Vec<Vec<f64>> {
        self.clear_sequence_state();
        FFN_PROBE.with(|p| {
            *p.borrow_mut() = Some(vec![vec![0f64; self.intermediate_size]; self.num_layers]);
        });
        crate::gpu::cpu_scope(|| {
            for (pos, &id) in ids.iter().enumerate() {
                let emb = self.embed_single(id);
                let _ = self.forward_layers(&emb, pos, None);
            }
        });
        self.clear_sequence_state();
        FFN_PROBE
            .with(|p| p.borrow_mut().take())
            .unwrap_or_default()
    }

    /// `probe_ffn_mass` over the BATCHED prefill: same accumulator, one
    /// sweep instead of one forward per token. What makes the statistic
    /// affordable on a 27B.
    pub fn probe_ffn_mass_batch(&mut self, ids: &[u32]) -> Result<Vec<Vec<f64>>, String> {
        if let Err(err) = self.nll_begin() {
            // A recorder can be left by a caller that was interrupted before
            // this request entered its scoring block.  Consume it even when
            // the preflight failure prevents initialization of a new one.
            let _ = FFN_PROBE.with(|p| p.borrow_mut().take());
            self.nll_end();
            return Err(err);
        }
        FFN_PROBE.with(|p| {
            *p.borrow_mut() = Some(vec![vec![0f64; self.intermediate_size]; self.num_layers]);
        });
        let result: Result<(), String> = (|| {
            for chunk in ids.chunks(256) {
                if chunk.len() < 2 {
                    continue;
                }
                self.nll_ids_masked(chunk, 0, None)?;
            }
            Ok(())
        })();
        self.nll_end();
        let probe = FFN_PROBE
            .with(|p| p.borrow_mut().take())
            .unwrap_or_default();
        match result {
            Ok(()) => Ok(probe),
            Err(err) => {
                drop(probe);
                Err(err)
            }
        }
    }

    /// The FFN probe over one window of the layer-major batched walk
    /// (`calib_forward`): the statistic of `probe_ffn_mass`, the window's rows
    /// in one context, every projection a GEMM on the device where one is up.
    pub fn probe_ffn_mass_span(&mut self, ids: &[u32], chunk: usize) -> Result<Vec<Vec<f64>>, String> {
        FFN_PROBE.with(|p| {
            *p.borrow_mut() = Some(vec![vec![0f64; self.intermediate_size]; self.num_layers]);
        });
        let result = self.calib_forward(ids, self.num_layers, chunk);
        let probe = FFN_PROBE.with(|p| p.borrow_mut().take()).unwrap_or_default();
        result.map(|()| probe)
    }

    /// The hot-neuron statistic of a MoE model's routed experts over `ids`:
    /// per layer `[expert · inter + neuron]` of Σ (w·act)², `w` the expert's
    /// final routing weight (a layer without experts gives an empty row).
    /// Qwen-3.5/3.8 MoE models only, on the host path: the caller runs with
    /// `CMF_GPU=0`, since the device frames and the fused expert kernels do
    /// not report activations.
    pub fn probe_moe_mass(&mut self, ids: &[u32]) -> Result<Vec<Vec<f64>>, String> {
        let Some(b) = self.qwen4_exp.as_mut() else {
            return Err("hot-probe --experts: not a Qwen MoE model (the probe reads the qwen4 host path)".into());
        };
        let geom: Vec<(usize, usize)> = b.1.iter().map(crate::qwen4_exp::Layer::expert_geometry).collect();
        let inter = geom.iter().map(|g| g.1).max().unwrap_or(0);
        if inter == 0 || ids.is_empty() {
            return Err("hot-probe --experts: the model has no routed experts".into());
        }
        MOE_PROBE.with(|p| {
            *p.borrow_mut() = Some(MoeProbe {
                acc: geom.iter().map(|&(ne, _)| vec![0f64; ne * inter]).collect(),
                inter,
                cur: None,
            });
        });
        b.3.reset();
        let mut pos = 0usize;
        while pos < ids.len() {
            let end = (pos + crate::qwen4_exp::prefill_chunk()).min(ids.len());
            let mut lg = Vec::new();
            crate::qwen4_exp::forward_tokens(&b.0, &b.1, &b.2, &mut b.3, &ids[pos..end], pos, &self.inv_freq, self.pool.as_deref(), &mut lg, false);
            pos = end;
        }
        b.3.reset();
        let probe = MOE_PROBE.with(|p| p.borrow_mut().take()).map_or_else(Vec::new, |p| p.acc);
        if !probe.iter().any(|r| r.iter().any(|&v| v > 0.0)) {
            return Err("hot-probe --experts: the statistic is all zero (a device path hid the experts from the probe; run with CMF_GPU=0)".into());
        }
        Ok(probe)
    }

    /// Teacher-forced PPL with a task mask active (sparse execution) —
    /// the quality gate for a DTG-MA-masked skill. Sequential per
    /// position: the batched prefill path is dense-only.
    pub fn ppl_ids_masked(&mut self, ids: &[u32], mask: &TaskMask) -> Result<f64, String> {
        self.nll_begin()?;
        let result: Result<f64, String> = (|| {
            let mut nll = 0f64;
            let mut cnt = 0usize;
            let mut hidden = vec![0f32; self.hidden_size];
            for (pos, &id) in ids.iter().enumerate() {
                if pos > 0 {
                    inference::rms_norm_into(
                        &hidden,
                        &self.weights.final_norm,
                        self.rms_eps,
                        self.norm_style,
                        &mut self.ws.n1,
                    );
                    let mut logits = self.lm_head_forward(&self.ws.n1);
                    let max = logits.iter().cloned().fold(f32::NEG_INFINITY, f32::max);
                    let sum: f64 = logits.iter().map(|&v| ((v - max) as f64).exp()).sum();
                    let p = ((logits[id as usize] - max) as f64).exp() / sum.max(1e-300);
                    nll -= p.max(1e-300).ln();
                    cnt += 1;
                    attention::recycle_buf(&mut logits);
                }
                let emb = self.embed_single(id);
                hidden = self.forward_layers(&emb, pos, Some(mask));
                self.nll_check_graph("masked serial forward", pos)?;
                // Consume a possible graph logits side channel before the
                // next row.  Masked scoring normally disables that route,
                // but stale channel state must never survive a request.
                let _ = self.graph_logits.take();
            }
            Ok((nll / cnt.max(1) as f64).exp())
        })();
        self.nll_end();
        result
    }

    /// Teacher-forced NLL sum + scored-token count over positions
    /// `start..len-1`, attention EXACT. Positions below `start` still
    /// run — they are the context — they are just not scored, so this
    /// pairs with `nll_ids_o1(ids, start)` over the very same tokens.
    ///
    /// Returning (nll, cnt) rather than a ppl is what lets a windowed
    /// caller combine windows before the exp, so every scored token
    /// weighs the same regardless of how the windows are cut.
    /// `nll_ids_from` with a task mask held active at every position.
    ///
    /// The batched prefill path does not thread masks, so this walks the
    /// per-position forward — slower, but it scores the file exactly the
    /// way `run --task` will serve it, which is the point of the gate
    /// that calls it. With `None` it defers to the fast path.
    /// Masked scoring rides the SAME batched sweep as unmasked scoring —
    /// the masked-inference fast path: `prefill_batch_masked` lands the
    /// per-visit FFN rows on the activations inside the fused arms. The
    /// per-position loop below remains only as the no-batch fallback.
    pub fn nll_ids_masked(
        &mut self,
        ids: &[u32],
        start: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<(f64, usize), String> {
        let task_mask = self.drop_open_mask(task_mask);
        self.nll_ids_inner(ids, start, task_mask)
    }

    pub fn nll_ids_from(&mut self, ids: &[u32], start: usize) -> Result<(f64, usize), String> {
        self.nll_ids_inner(ids, start, None)
    }

    /// Diagnostic (`CMF_PREFILL_PARITY=split[,k]` on `cortiq ppl`): the same
    /// tokens through three ingests, each from a clean sequence — H the host
    /// chunked prefill, G the wgpu batch graph in k-row chunks, M the host
    /// prefill up to `split` and the batch graph after it, seeded from the
    /// host state — and where they part: NLL and top-1 per 256-position bin
    /// from each arm's post-stack rows, every GDN layer's recurrent state
    /// (the host `linear_state` against the graph's) at `split` and at the
    /// end, and every exact-attention layer's K/V rows.
    pub fn prefill_parity_probe(
        &mut self,
        ids: &[u32],
        split: usize,
        bk: usize,
    ) -> Result<String, String> {
        use std::fmt::Write as _;
        let (n, hs) = (ids.len(), self.hidden_size);
        if split == 0 || split >= n || bk == 0 || !self.can_prefill_batched() {
            return Err(format!(
                "prefill parity: needs 0 < split < {n} tokens, k > 0 and a batched host prefill"
            ));
        }
        // 1 = GDN, 2 = exact attention, 0 = anything else (not compared).
        let kinds: Vec<u8> = (0..self.num_layers)
            .map(|li| match &self.weights.layers[self.phys_layer(li)].attn {
                AttnKind::LinearGdn(_) => 1,
                AttnKind::Full { .. } => 2,
                _ => 0,
            })
            .collect();
        let kv_id = self.graph_kv_id;
        let host_chunk = self.prefill_chunk().max(1);
        let host_states = |p: &Self| -> Vec<Vec<f32>> {
            (0..p.num_layers)
                .map(|li| {
                    if kinds[li] == 1 {
                        p.kv_cache.layers[li].linear_state.clone()
                    } else {
                        Vec::new()
                    }
                })
                .collect()
        };
        let graph_states = |_p: &Self| -> Vec<Vec<f32>> {
            (0..kinds.len())
                .map(|li| {
                    if kinds[li] == 1 {
                        crate::gpu::graph_gdn_state_read(kv_id, li).unwrap_or_default()
                    } else {
                        Vec::new()
                    }
                })
                .collect()
        };
        // Position-major K/V rows [0, n) of every exact-attention layer.
        let host_kv = |p: &Self| -> Vec<(Vec<f32>, Vec<f32>)> {
            (0..p.num_layers)
                .map(|li| {
                    let c = &p.kv_cache.layers[li];
                    if kinds[li] != 2
                        || c.mode != crate::kv_cache::KvMode::F32
                        || c.base() != 0
                        || c.seq_len != n
                    {
                        return (Vec::new(), Vec::new());
                    }
                    let (nkv, hd) = (c.num_kv_heads, c.head_dim);
                    let (mut k, mut v) = (vec![0f32; n * nkv * hd], vec![0f32; n * nkv * hd]);
                    for (h, (kh, vh)) in c.k_heads().iter().zip(c.v_heads()).enumerate() {
                        for pos in 0..n {
                            let d = (pos * nkv + h) * hd;
                            k[d..d + hd].copy_from_slice(&kh[pos * hd..(pos + 1) * hd]);
                            v[d..d + hd].copy_from_slice(&vh[pos * hd..(pos + 1) * hd]);
                        }
                    }
                    (k, v)
                })
                .collect()
        };
        let graph_kv = |p: &Self| -> Vec<(Vec<f32>, Vec<f32>)> {
            (0..p.num_layers)
                .map(|li| {
                    let c = &p.kv_cache.layers[li];
                    if kinds[li] != 2 {
                        return (Vec::new(), Vec::new());
                    }
                    crate::gpu::graph_kv_read_rows(kv_id, &[(li, 0, n)], c.num_kv_heads, c.head_dim)
                        .and_then(|mut v| v.pop())
                        .unwrap_or_default()
                })
                .collect()
        };
        let host_walk = |p: &mut Self,
                         from: usize,
                         to: usize,
                         rows: &mut [f32],
                         at_split: &mut Option<Vec<Vec<f32>>>| {
            let mut pos = from;
            while pos < to {
                let mut end = (pos + host_chunk).min(to);
                if pos < split && end > split {
                    end = split;
                }
                let hb = p.prefill_batch(&ids[pos..end], pos);
                rows[pos * hs..end * hs].copy_from_slice(&hb[..(end - pos) * hs]);
                pos = end;
                if pos == split {
                    *at_split = Some(host_states(p));
                }
            }
        };
        let graph_walk = |p: &mut Self,
                          from: usize,
                          to: usize,
                          rows: &mut [f32],
                          at_split: &mut Option<Vec<Vec<f32>>>|
         -> Result<(), String> {
            let mut pos = from;
            while pos < to {
                let mut end = (pos + bk).min(to);
                if pos < split && end > split {
                    end = split;
                }
                let k = end - pos;
                let mut hid = vec![0f32; k * hs];
                for (j, &id) in ids[pos..end].iter().enumerate() {
                    hid[j * hs..(j + 1) * hs].copy_from_slice(&p.embed_single(id));
                }
                let positions: Vec<usize> = (pos..end).collect();
                let outcome = p.try_batch_graph_wgpu(&mut hid, &positions, k, None);
                if outcome != crate::gpu::BatchGraphOutcome::Completed {
                    return Err(format!(
                        "prefill parity: batch graph {outcome:?} at position {pos}"
                    ));
                }
                rows[pos * hs..end * hs].copy_from_slice(&hid);
                pos = end;
                if pos == split {
                    *at_split = Some(graph_states(p));
                }
            }
            Ok(())
        };
        let score = |p: &Self, rows: &[f32], from: usize| p.parity_score(ids, rows, from);

        let t = std::time::Instant::now();
        self.clear_sequence_state();
        let (mut hh, mut h_split) = (vec![0f32; n * hs], None);
        host_walk(self, 0, n, &mut hh, &mut h_split);
        let (h_end, h_kv) = (host_states(self), host_kv(self));
        let t_h = t.elapsed().as_secs_f64();

        let t = std::time::Instant::now();
        self.clear_sequence_state();
        let (mut hg, mut g_split) = (vec![0f32; n * hs], None);
        let g_run = graph_walk(self, 0, n, &mut hg, &mut g_split);
        let (g_end, g_kv) = (graph_states(self), graph_kv(self));
        let t_g = t.elapsed().as_secs_f64();

        let t = std::time::Instant::now();
        self.clear_sequence_state();
        let (mut hm, mut m_split) = (vec![0f32; n * hs], None);
        host_walk(self, 0, split, &mut hm, &mut m_split);
        let m_run = graph_walk(self, split, n, &mut hm, &mut None);
        let (m_end, m_kv) = (graph_states(self), graph_kv(self));
        let t_m = t.elapsed().as_secs_f64();
        self.clear_sequence_state();
        g_run?;
        m_run?;

        let (sh, sg, sm) = (
            score(self, &hh, 0),
            score(self, &hg, 0),
            score(self, &hm, split),
        );
        let mut r = String::new();
        let _ = writeln!(
            r,
            "prefill parity: {n} tokens, split {split}, host chunk {host_chunk}, graph k {bk} \
             (host {t_h:.1} s, graph {t_g:.1} s, host+graph {t_m:.1} s)"
        );
        let _ = writeln!(
            r,
            "  bin          | NLL host  graph  h+g   | top1 host=graph h+g=graph | hidden rel host:graph h+g:graph"
        );
        let bin = 256usize;
        let mut b0 = 0;
        while b0 + 1 < n {
            let b1 = (b0 + bin).min(n - 1);
            let mean = |s: &[(f64, usize)], off: usize| -> Option<f64> {
                let v: Vec<f64> = (b0.max(off)..b1).map(|p| s[p - off].0).collect();
                (!v.is_empty()).then(|| v.iter().sum::<f64>() / v.len() as f64)
            };
            let agree = |a: &[(f64, usize)], ao: usize, b: &[(f64, usize)], bo: usize| {
                let ps: Vec<usize> = (b0.max(ao).max(bo)..b1).collect();
                if ps.is_empty() {
                    return None;
                }
                let same = ps.iter().filter(|&&p| a[p - ao].1 == b[p - bo].1).count();
                Some(100.0 * same as f64 / ps.len() as f64)
            };
            let hid_rel = |a: &[f32], from: usize| -> Option<f64> {
                (b0.max(from)..b1)
                    .map(|p| rel_l2(&a[p * hs..(p + 1) * hs], &hg[p * hs..(p + 1) * hs]))
                    .reduce(f64::max)
            };
            let f =
                |v: Option<f64>, prec: usize| v.map_or("-".to_string(), |x| format!("{x:.prec$}"));
            let e = |v: Option<f64>| v.map_or("-".to_string(), |x| format!("{x:.1e}"));
            let _ = writeln!(
                r,
                "  {b0:5}..{b1:<5} | {:>8} {:>6} {:>6} | {:>14} {:>9} | {:>16} {:>9}",
                f(mean(&sh, 0), 3),
                f(mean(&sg, 0), 3),
                f(mean(&sm, split), 3),
                f(agree(&sh, 0, &sg, 0), 1),
                f(agree(&sm, split, &sg, 0), 1),
                e(hid_rel(&hh, 0)),
                e(hid_rel(&hm, split)),
            );
            b0 = b1;
        }
        // Recurrent state, layer by layer: [conv ring | S] split at the ring.
        let ring_len = self
            .gdn_cfg
            .map(|c| c.conv_dim() * c.conv_kernel.saturating_sub(1))
            .unwrap_or(0);
        let state_line = |r: &mut String, label: &str, a: &[Vec<f32>], b: &[Vec<f32>]| {
            let _ = write!(r, "  GDN {label} (ring/S rel):");
            let mut first = None;
            for li in (0..kinds.len()).filter(|&li| kinds[li] == 1) {
                let (x, y) = (&a[li], &b[li]);
                if x.len() != y.len() || x.len() <= ring_len {
                    let _ = write!(r, " L{li} len {}/{}", x.len(), y.len());
                    continue;
                }
                let (rr, rs) = (
                    rel_l2(&x[..ring_len], &y[..ring_len]),
                    rel_l2(&x[ring_len..], &y[ring_len..]),
                );
                if first.is_none() && rr.max(rs) > 1e-2 {
                    first = Some(li);
                }
                let _ = write!(r, " L{li} {rr:.0e}/{rs:.0e}");
            }
            let _ = writeln!(
                r,
                "\n    first GDN layer past 1e-2: {}",
                first.map_or("none".to_string(), |l| l.to_string())
            );
        };
        match (&h_split, &g_split) {
            (Some(a), Some(b)) => state_line(&mut r, "host vs graph at split", a, b),
            _ => {
                let _ = writeln!(r, "  GDN at split: not captured");
            }
        }
        if let (Some(a), Some(b)) = (&m_split, &h_split) {
            state_line(&mut r, "h+g host part vs host at split", a, b);
        }
        state_line(&mut r, "host vs graph at end", &h_end, &g_end);
        state_line(&mut r, "h+g vs graph at end", &m_end, &g_end);
        // Exact-attention K/V: the worst 256-row bin per layer and the first
        // bin past 1e-2.
        let kv_line = |r: &mut String, label: &str, a: &[(Vec<f32>, Vec<f32>)], from: usize| {
            let _ = writeln!(r, "  K/V {label} (worst bin K/V rel, first bin past 1e-2):");
            for li in (0..kinds.len()).filter(|&li| kinds[li] == 2) {
                let ((ak, av), (gk, gv)) = (&a[li], &g_kv[li]);
                if ak.len() != gk.len() || ak.is_empty() {
                    let _ = writeln!(r, "    L{li}: rows {}/{}", ak.len(), gk.len());
                    continue;
                }
                let row = ak.len() / n;
                let (mut wk, mut wv, mut first) = (0f64, 0f64, None);
                let mut b0 = from;
                while b0 < n {
                    let b1 = (b0 + bin).min(n);
                    let (s0, s1) = (b0 * row, b1 * row);
                    let (rk, rv) = (
                        rel_l2(&ak[s0..s1], &gk[s0..s1]),
                        rel_l2(&av[s0..s1], &gv[s0..s1]),
                    );
                    (wk, wv) = (wk.max(rk), wv.max(rv));
                    if first.is_none() && rk.max(rv) > 1e-2 {
                        first = Some(b0);
                    }
                    b0 = b1;
                }
                let _ = writeln!(
                    r,
                    "    L{li}: {wk:.1e}/{wv:.1e} first {}",
                    first.map_or("none".to_string(), |p| p.to_string())
                );
            }
        };
        kv_line(&mut r, "host vs graph", &h_kv, 0);
        kv_line(&mut r, "h+g vs graph", &m_kv, 0);
        Ok(r)
    }

    /// (nll, top-1 id) of every position in [from, len − 1) from post-stack
    /// rows (`rows` indexed by absolute position), through the scorer's
    /// final norm and head.
    fn parity_score(&self, ids: &[u32], rows: &[f32], from: usize) -> Vec<(f64, usize)> {
        let (n, hs) = (ids.len(), self.hidden_size);
        let vrows = self.weights.lm_head.rows();
        let vs = self.vocab_size.min(vrows);
        let mut out = Vec::with_capacity(n.saturating_sub(from + 1));
        let mut pos = from;
        while pos + 1 < n {
            let end = (pos + 32).min(n - 1);
            let sb = end - pos;
            let mut normed = vec![0f32; sb * hs];
            for j in 0..sb {
                let r = inference::rms_norm(
                    &rows[(pos + j) * hs..(pos + j + 1) * hs],
                    &self.weights.final_norm,
                    self.rms_eps,
                    self.norm_style,
                );
                normed[j * hs..(j + 1) * hs].copy_from_slice(&r);
            }
            let mut logits = vec![0f32; sb * vrows];
            self.weights
                .lm_head
                .matmat(&normed, sb, &mut logits, self.pool.as_deref());
            for j in 0..sb {
                let lg = &mut logits[j * vrows..j * vrows + vs];
                if let Some(mu) = self.logit_multiplier {
                    lg.iter_mut().for_each(|v| *v *= mu);
                }
                if let Some(c) = self.final_softcap {
                    softcap_in_place(lg, c, self.pool.as_deref());
                }
                let (mut max, mut top) = (f32::NEG_INFINITY, 0usize);
                for (i, &v) in lg.iter().enumerate() {
                    if v > max {
                        (max, top) = (v, i);
                    }
                }
                let lse = lg
                    .iter()
                    .map(|&v| ((v - max) as f64).exp())
                    .sum::<f64>()
                    .ln()
                    + max as f64;
                out.push((lse - lg[ids[pos + j + 1] as usize] as f64, top));
            }
            pos = end;
        }
        out
    }

    /// Diagnostic (`CMF_PREFILL_PARITY_O1=k` on `cortiq ppl --o1 …
    /// --o1-prefill P`): how much the O(1) seal depends on where its exact
    /// prefix ran. Every arm continues on the batch graph from the boundary
    /// in k-row chunks:
    /// - OH: prefix on the host chunked prefill; seal from the host's
    ///   queries and K/V; recurrent state seeded from the host.
    /// - OG: prefix on the batch graph (recurrent state stays on the
    ///   device); seal from OH's host queries and host K/V.
    /// - OD: prefix on the batch graph; seal from OH's queries and the
    ///   graph's own K/V rows (read back).
    ///
    /// OH vs OG isolates the recurrent-state hand-off, OG vs OD the seal's
    /// response to the host/graph K/V difference. X is the exact graph.
    pub fn o1_seal_parity_probe(
        &mut self,
        ids: &[u32],
        cfg: crate::nystrom::O1Cfg,
        requested: usize,
        bk: usize,
    ) -> Result<String, String> {
        use std::fmt::Write as _;
        let (n, hs) = (ids.len(), self.hidden_size);
        self.set_o1(Some(cfg));
        let split = self
            .o1_effective_boundary(requested)
            .ok_or("o1 parity: no O(1) configuration")?;
        if split + 1 >= n || bk == 0 || !self.can_prefill_batched() {
            return Err(format!(
                "o1 parity: needs the boundary {split} inside {n} tokens, k > 0 and a batched host prefill"
            ));
        }
        let o1_layers: Vec<usize> = (0..self.num_layers)
            .filter(|&li| self.o1_flags.get(li).copied().unwrap_or(false))
            .collect();
        let graph_rows = |p: &mut Self, from: usize, to: usize, rows: &mut [f32]| {
            let mut pos = from;
            while pos < to {
                let end = (pos + bk).min(to);
                let k = end - pos;
                let mut hid = vec![0f32; k * hs];
                for (j, &id) in ids[pos..end].iter().enumerate() {
                    hid[j * hs..(j + 1) * hs].copy_from_slice(&p.embed_single(id));
                }
                let positions: Vec<usize> = (pos..end).collect();
                let outcome = p.try_batch_graph_wgpu(&mut hid, &positions, k, None);
                if outcome != crate::gpu::BatchGraphOutcome::Completed {
                    return Err(format!(
                        "o1 parity: batch graph {outcome:?} at position {pos}"
                    ));
                }
                rows[pos * hs..end * hs].copy_from_slice(&hid);
                pos = end;
            }
            Ok(())
        };
        // Seal every O(1) layer from the given rows; `trace` = (q, k, v) per
        // O(1) layer, position-major.
        let seal_from = |p: &mut Self, trace: &[(Vec<f32>, Vec<f32>, Vec<f32>)]| {
            for (&li, (q, k, v)) in o1_layers.iter().zip(trace) {
                let c = &mut p.kv_cache.layers[li];
                let (row, qrow) = (k.len() / split, q.len() / split);
                for pos in 0..split {
                    c.append(
                        &k[pos * row..(pos + 1) * row],
                        &v[pos * row..(pos + 1) * row],
                        &[],
                    );
                    c.o1_push_q(&q[pos * qrow..(pos + 1) * qrow]);
                }
            }
            p.o1_seal_checked()
        };
        // Greedy continuation (`CMF_PARITY_GREEDY` tokens, default 40) from
        // the last prompt row, one batch-graph row per step.
        let steps: usize = std::env::var("CMF_PARITY_GREEDY")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(40);
        // `CMF_PARITY_DECODE=token`: the steps through `decode_step_logits`
        // (the token graph generation decodes on) instead of the batch graph.
        let token_decode = std::env::var("CMF_PARITY_DECODE").as_deref() == Ok("token");
        let greedy = |p: &mut Self, rows: &[f32]| -> Result<Vec<u32>, String> {
            let argmax = |lg: &[f32], vs: usize| {
                (0..vs.min(lg.len())).fold(0, |b, i| if lg[i] > lg[b] { i } else { b }) as u32
            };
            let normed = inference::rms_norm(
                &rows[(n - 1) * hs..n * hs],
                &p.weights.final_norm,
                p.rms_eps,
                p.norm_style,
            );
            let mut out = vec![argmax(&p.lm_head_forward(&normed), p.vocab_size)];
            for s in 1..steps {
                let (tok, at) = (out[s - 1], n + s - 1);
                let lg = if token_decode {
                    p.decode_step_logits(tok, at)
                } else {
                    let mut hid = p.embed_single(tok);
                    let outcome = p.try_batch_graph_wgpu(&mut hid, &[at], 1, None);
                    if outcome != crate::gpu::BatchGraphOutcome::Completed {
                        return Err(format!("o1 parity: greedy step {s} {outcome:?}"));
                    }
                    let normed =
                        inference::rms_norm(&hid, &p.weights.final_norm, p.rms_eps, p.norm_style);
                    p.lm_head_forward(&normed)
                };
                out.push(argmax(&lg, p.vocab_size));
            }
            Ok(out)
        };

        // OW first, in a fresh process as `run` starts: the host prefix
        // exactly as generation runs it — boundary at `split`, the
        // pipeline's prefill chunk, the layers sealing after the chunk that
        // reaches the boundary (`CMF_O1_WALK_BOUNDARY=1`: that chunk walks
        // its rows one at a time, each layer sealing after the boundary row).
        self.clear_sequence_state();
        self.o1_begin_with_prefix(Some(requested));
        let walk_chunk = self.prefill_chunk().max(1);
        let walk_from = (split - 1) / walk_chunk * walk_chunk;
        let mut ow = vec![0f32; n * hs];
        let mut pos = 0;
        while pos < split {
            let end = (pos + walk_chunk).min(split);
            let hb = self.prefill_batch(&ids[pos..end], pos);
            ow[pos * hs..end * hs].copy_from_slice(&hb[..(end - pos) * hs]);
            pos = end;
        }
        self.o1_seal_checked()?;
        let ow_run = graph_rows(self, split, n, &mut ow);
        let ow_text = ow_run.clone().and_then(|_| greedy(self, &ow));

        // OH. Collect one row past the boundary's natural barrier so the
        // host walk does not seal inside the last chunk, copy the trace,
        // then seal at `split` exactly.
        let t = std::time::Instant::now();
        self.clear_sequence_state();
        self.o1_begin_with_prefix(Some(split + 1));
        let mut oh = vec![0f32; n * hs];
        let mut pos = 0;
        while pos < split {
            let end = (pos + 128).min(split);
            let hb = self.prefill_batch(&ids[pos..end], pos);
            oh[pos * hs..end * hs].copy_from_slice(&hb[..(end - pos) * hs]);
            pos = end;
        }
        let mut host = Vec::with_capacity(o1_layers.len());
        for &li in &o1_layers {
            let c = &self.kv_cache.layers[li];
            let q = c
                .o1_q_trace()
                .ok_or("o1 parity: host walk sealed early")?
                .to_vec();
            let (nkv, hd) = (c.num_kv_heads, c.head_dim);
            let (mut k, mut v) = (vec![0f32; split * nkv * hd], vec![0f32; split * nkv * hd]);
            for (h, (kh, vh)) in c.k_heads().iter().zip(c.v_heads()).enumerate() {
                for p in 0..split {
                    let d = (p * nkv + h) * hd;
                    k[d..d + hd].copy_from_slice(&kh[p * hd..(p + 1) * hd]);
                    v[d..d + hd].copy_from_slice(&vh[p * hd..(p + 1) * hd]);
                }
            }
            host.push((q, k, v));
        }
        for &li in &o1_layers {
            self.kv_cache.layers[li].o1_set_boundary(split);
        }
        self.o1_seal_checked()?;
        let oh_run = graph_rows(self, split, n, &mut oh);
        let t_oh = t.elapsed().as_secs_f64();
        let oh_text = oh_run.clone().and_then(|_| greedy(self, &oh));

        // OG: graph prefix, host seal inputs. `CMF_PARITY_PERTURB=eps`
        // scales every host K/V value by (1 ± eps), signs from a fixed
        // xorshift stream: the seal's sensitivity to rounding-size noise.
        self.clear_sequence_state();
        self.o1_begin_with_prefix(Some(requested));
        let mut og = vec![0f32; n * hs];
        graph_rows(self, 0, split, &mut og)?;
        let perturb: f32 = std::env::var("CMF_PARITY_PERTURB")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(0.0);
        if perturb > 0.0 {
            let mut seed = 0x9e37_79b9_7f4a_7c15u64;
            let noisy: Vec<_> = host
                .iter()
                .map(|(q, k, v)| {
                    let mut jitter = |x: &f32| {
                        seed ^= seed << 13;
                        seed ^= seed >> 7;
                        seed ^= seed << 17;
                        x * if seed & 1 == 0 {
                            1.0 + perturb
                        } else {
                            1.0 - perturb
                        }
                    };
                    let k: Vec<f32> = k.iter().map(&mut jitter).collect();
                    let v: Vec<f32> = v.iter().map(&mut jitter).collect();
                    (q.clone(), k, v)
                })
                .collect();
            seal_from(self, &noisy)?;
        } else {
            seal_from(self, &host)?;
        }
        let og_run = graph_rows(self, split, n, &mut og);
        let og_text = og_run.clone().and_then(|_| greedy(self, &og));

        // OD: graph prefix, the graph's own K/V with the host queries.
        self.clear_sequence_state();
        self.o1_begin_with_prefix(Some(requested));
        let mut od = vec![0f32; n * hs];
        graph_rows(self, 0, split, &mut od)?;
        let mut dev = Vec::with_capacity(o1_layers.len());
        let mut kv_rel = Vec::with_capacity(o1_layers.len());
        for (&li, (q, hk, hv)) in o1_layers.iter().zip(&host) {
            let c = &self.kv_cache.layers[li];
            let (k, v) = crate::gpu::graph_kv_read_rows(
                self.graph_kv_id,
                &[(li, 0, split)],
                c.num_kv_heads,
                c.head_dim,
            )
            .and_then(|mut rows| rows.pop())
            .ok_or_else(|| format!("o1 parity: no graph K/V rows for layer {li}"))?;
            kv_rel.push((li, rel_l2(hk, &k), rel_l2(hv, &v)));
            dev.push((q.clone(), k, v));
        }
        seal_from(self, &dev)?;
        let od_run = graph_rows(self, split, n, &mut od);
        let od_text = od_run.clone().and_then(|_| greedy(self, &od));

        // X: exact batch graph.
        self.clear_sequence_state();
        self.set_o1(None);
        let mut xx = vec![0f32; n * hs];
        let x_run = graph_rows(self, 0, n, &mut xx);
        let x_text = x_run.clone().and_then(|_| greedy(self, &xx));
        self.clear_sequence_state();
        oh_run?;
        ow_run?;
        og_run?;
        od_run?;
        x_run?;

        let sx = self.parity_score(ids, &xx, split);
        let arms = [
            ("OH", self.parity_score(ids, &oh, split)),
            ("OG", self.parity_score(ids, &og, split)),
            ("OD", self.parity_score(ids, &od, split)),
            ("OW", self.parity_score(ids, &ow, split)),
        ];
        let mut r = String::new();
        let _ = writeln!(
            r,
            "o1 seal parity: {n} tokens, boundary {split}, graph k {bk} (OH {t_oh:.1} s), \
             OW chunk {walk_chunk}, boundary chunk {walk_from}..{split}"
        );
        let _ = write!(r, "  seal K/V rel host vs graph:");
        for (li, rk, rv) in &kv_rel {
            let _ = write!(r, " L{li} {rk:.0e}/{rv:.0e}");
        }
        // Post-stack prefix rows against the exact graph: the batched rows,
        // then the rows OW walks one at a time.
        let worst = |a: &[f32], p0: usize, p1: usize| {
            (p0..p1)
                .map(|p| rel_l2(&a[p * hs..(p + 1) * hs], &xx[p * hs..(p + 1) * hs]))
                .fold(0f64, f64::max)
        };
        let _ = writeln!(
            r,
            "\n  prefix rows rel vs exact graph, [0,{walk_from}) / [{walk_from},{split}): \
             OH {:.1e} / {:.1e}, OW {:.1e} / {:.1e}",
            worst(&oh, 0, walk_from),
            worst(&oh, walk_from, split),
            worst(&ow, 0, walk_from),
            worst(&ow, walk_from, split),
        );
        let _ = writeln!(
            r,
            "  bin          | NLL exact    OH     OG     OD     OW | top1=exact  OH    OG    OD    OW"
        );
        let mean = |s: &[(f64, usize)], b0: usize, b1: usize| {
            (b0..b1).map(|p| s[p - split].0).sum::<f64>() / (b1 - b0).max(1) as f64
        };
        let agree = |s: &[(f64, usize)], b0: usize, b1: usize| {
            let same = (b0..b1)
                .filter(|&p| s[p - split].1 == sx[p - split].1)
                .count();
            100.0 * same as f64 / (b1 - b0).max(1) as f64
        };
        let mut b0 = split;
        let mut total = [0f64; 5];
        while b0 + 1 < n {
            let b1 = ((b0 / 256 + 1) * 256).min(n - 1);
            let _ = writeln!(
                r,
                "  {b0:5}..{b1:<5} | {:>9.3} {:>6.3} {:>6.3} {:>6.3} {:>6.3} | {:>12.1} {:>5.1} {:>5.1} {:>5.1}",
                mean(&sx, b0, b1),
                mean(&arms[0].1, b0, b1),
                mean(&arms[1].1, b0, b1),
                mean(&arms[2].1, b0, b1),
                mean(&arms[3].1, b0, b1),
                agree(&arms[0].1, b0, b1),
                agree(&arms[1].1, b0, b1),
                agree(&arms[2].1, b0, b1),
                agree(&arms[3].1, b0, b1),
            );
            b0 = b1;
        }
        for (i, s) in std::iter::once(&sx)
            .chain(arms.iter().map(|a| &a.1))
            .enumerate()
        {
            total[i] = s.iter().map(|x| x.0).sum::<f64>() / s.len().max(1) as f64;
        }
        let _ = writeln!(
            r,
            "  all          | {:>9.3} {:>6.3} {:>6.3} {:>6.3} {:>6.3} | ppl ratio vs exact OH ×{:.3} OG ×{:.3} OD ×{:.3} OW ×{:.3}",
            total[0],
            total[1],
            total[2],
            total[3],
            total[4],
            (total[1] - total[0]).exp(),
            (total[2] - total[0]).exp(),
            (total[3] - total[0]).exp(),
            (total[4] - total[0]).exp(),
        );
        for (name, text) in [
            ("X ", x_text),
            ("OH", oh_text),
            ("OG", og_text),
            ("OD", od_text),
            ("OW", ow_text),
        ] {
            let s = text.map_or_else(|e| e, |t| self.tokenizer.decode(&t));
            let _ = writeln!(r, "  greedy {name}: {:?}", s);
        }
        Ok(r)
    }

    /// The positions of `input_ids` a Dory sequence already holds: the common
    /// prefix, unless going back to it passes what a sliding ring still keeps.
    fn dory_cached_prefix(&self, input_ids: &[u32]) -> usize {
        if std::env::var("CMF_KV_REUSE").is_ok_and(|v| v == "0") {
            return 0;
        }
        let h = &self.kv_history;
        let lcp = h.iter().zip(input_ids).take_while(|(a, b)| a == b).count();
        let n = lcp.min(input_ids.len().saturating_sub(1));
        if n == 0 || h.len() - n > crate::dory::REWIND {
            return 0;
        }
        // Rows past the prefix have gone through the far field: a sealed sequence can
        // only be extended, and a turn that goes back starts over.
        let sealed = crate::gpu::dory_sealed(self.graph_kv_id)
            || self.dory.as_ref().is_some_and(|b| b.1.slots.iter().flatten().any(|s| !s.far.is_empty()));
        if n < h.len() && sealed {
            return 0;
        }
        n
    }

    /// Dory's score: chunks through its own stack, logits of every row.
    fn dory_nll(&mut self, ids: &[u32], start: usize) -> Result<(f64, usize), String> {
        self.clear_sequence_state();
        let chunk: usize = std::env::var("CMF_NLL_CHUNK")
            .ok()
            .and_then(|v| v.parse().ok())
            .filter(|&c: &usize| c > 0)
            .unwrap_or(128);
        let vocab = self.vocab_size;
        let n = ids.len().saturating_sub(1);
        // `CMF_NLL_SKIP`: a prompt of so many rows goes in as a prompt does.
        let skip: usize = std::env::var("CMF_NLL_SKIP").ok().and_then(|v| v.parse().ok()).unwrap_or(0);
        let start = start.max(skip.min(n));
        let (mut nll, mut cnt, mut pos) = (0f64, 0usize, 0usize);
        while pos < n {
            if pos < skip {
                let end = (pos + 64).min(skip).min(n);
                self.dory_forward(&ids[pos..end], pos, crate::dory::Want::None);
                pos = end;
                continue;
            }
            let end = (pos + chunk).min(n);
            let lg = self.dory_forward(&ids[pos..end], pos, crate::dory::Want::All);
            for (r, row) in lg.chunks_exact(vocab).enumerate() {
                if pos + r < start {
                    continue;
                }
                let target = ids[pos + r + 1] as usize;
                let best = row.iter().fold(f32::NEG_INFINITY, |a, &b| a.max(b)) as f64;
                let den: f64 = row.iter().map(|&x| ((x as f64) - best).exp()).sum();
                nll += den.ln() - (row[target] as f64 - best);
                cnt += 1;
            }
            pos = end;
        }
        Ok((nll, cnt))
    }

    /// Dory's forward over a chunk: the device path when it takes the file.
    fn dory_forward(&mut self, ids: &[u32], pos: usize, want: crate::dory::Want) -> Vec<f32> {
        let pool = self.pool.clone();
        let id = self.graph_kv_id;
        let b = self.dory.as_mut().expect("a Dory file");
        let (m, st) = (&b.0, &mut b.1);
        let mut logits = Vec::new();
        let loops = m.cfg.loops;
        // GPTQ's Hessian hook sees a matrix's input only on the host stack.
        let host = crate::gptq_capture::capturing();
        let file = m.file.clone();
        if host || !crate::gpu::dory_forward(id, file.as_ref(), m, ids, pos, loops, want, &mut logits) {
            logits.clear();
            crate::dory::forward_host(m, st, ids, pos, loops, want, pool.as_deref(), None, &mut logits);
        }
        if m.o1.is_some() && std::env::var_os("CMF_DORY_KV_REPORT").is_some() {
            let (e, f) = crate::dory::host_kv_bytes(st);
            eprintln!("dory kv at {}: exact {:.1} MB, far {:.1} MB", pos + ids.len(), e as f64 / 1e6, f as f64 / 1e6);
        }
        if let Ok(dir) = std::env::var("CMF_DORY_DUMP") {
            let bytes: Vec<u8> = logits.iter().flat_map(|v| v.to_le_bytes()).collect();
            let _ = std::fs::write(format!("{dir}/{pos}.bin"), bytes);
        }
        logits
    }

    fn nll_ids_inner(
        &mut self,
        ids: &[u32],
        start: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<(f64, usize), String> {
        if self.dory.is_some() && task_mask.is_none() {
            return self.dory_nll(ids, start);
        }
        self.nll_begin()?;
        // Block diffusion on Apple silicon: the Metal executor's causal path.
        #[cfg(target_os = "macos")]
        if task_mask.is_none() && self.is_block_diffusion() {
            if let Some(r) = self.clover_metal_nll(ids, start) {
                self.nll_end();
                return r;
            }
        }
        let result: Result<(f64, usize), String> = (|| {
            let mut nll = 0f64;
            let mut cnt = 0usize;
            // An unmasked quality run with the resident wgpu graph must score
            // the same stateful path used by generation.  The layer-major
            // GEMM prefill below is a valid CPU/GEMM oracle, but it seeds
            // neither the graph's device GDN state nor its device KV mirrors;
            // using it here would silently score a different execution.  Keep
            // masked scoring on the exact per-position path as before, and
            // let the serial arm below drive the graph-aware scorer.
            // Only native Metal has a fused graph lm_head contract.  Vulkan
            // and other graph backends may expose hidden state without the
            // optional logits side channel; preserve their established CPU
            // norm/head fallback instead of turning that valid route into a
            // hard missing-logits error.
            let (graph_quality, fused_head_quality) = nll_graph_policy(
                task_mask.is_none(),
                self.graph_prefill_preferred(),
                crate::gpu::q1_force(),
            );
            self.graph_head_required = fused_head_quality;
            self.graph_want_logits = fused_head_quality;
            #[cfg(target_os = "macos")]
            if graph_quality && std::env::var("CMF_METAL_BATCH_NLL").as_deref() != Ok("0") {
                match self.nll_batch_metal(ids, start) {
                    MetalBatchNllOutcome::Completed(nll, count) => {
                        return Ok((nll, count));
                    }
                    MetalBatchNllOutcome::Declined => {}
                    MetalBatchNllOutcome::Failed(err) => return Err(err),
                }
            }
            // CMF_NLL_SERIAL=1 scores position by position through the
            // decode path (the wgpu token graph where it admits the model)
            // — the perplexity gate of a decode kernel, which the batched
            // prefill arm below never runs.
            let force_serial = std::env::var("CMF_NLL_SERIAL").as_deref() == Ok("1");
            if self.can_prefill_batched() && !graph_quality && !force_serial {
                // prefill-GEMM: layer-major position chunks, lm_head batched
                // (254MB lm_head read once per chunk, not per position).
                // The layer chunk is large (grouping positions by MoE experts
                // wins with size), lm_head in sub-blocks (logit buffer
                // 32×vocab ≈ 32MB instead of 128×).
                // CMF_NLL_CHUNK: positions per prefill step (default 128).
                // A device scorer pays one round trip per projection per
                // step, so a 512-position step quarters them.
                let chunk_len: usize = std::env::var("CMF_NLL_CHUNK")
                    .ok()
                    .and_then(|v| v.parse().ok())
                    .filter(|&c: &usize| c > 0)
                    .unwrap_or(128);
                const LM_SUB: usize = 32;
                let n = ids.len().saturating_sub(1);
                let hs = self.hidden_size;
                let rows = self.weights.lm_head.rows();
                let mut pos = 0usize;
                let state_trace = std::env::var("CMF_STATE_TRACE").is_ok();
                while pos < n {
                    let end = (pos + chunk_len).min(n);
                    let bsz = end - pos;
                    let hb = self.prefill_rows(&ids[pos..end], pos, task_mask)?;
                    self.nll_check_graph("batched prefill", pos)?;
                    if state_trace && end % 256 == 0 {
                        self.trace_recurrent_state(end);
                    }
                    let mut k0 = 0usize;
                    while k0 < bsz {
                        let k1 = (k0 + LM_SUB).min(bsz);
                        let sb = k1 - k0;
                        // Sub-block entirely below the scored range: the KV
                        // it just built is all this pass needed from it.
                        if pos + k1 <= start {
                            k0 = k1;
                            continue;
                        }
                        let mut normed = vec![0.0f32; sb * hs];
                        for k in 0..sb {
                            let r = inference::rms_norm(
                                &hb[(k0 + k) * hs..(k0 + k + 1) * hs],
                                &self.weights.final_norm,
                                self.rms_eps,
                                self.norm_style,
                            );
                            normed[k * hs..(k + 1) * hs].copy_from_slice(&r);
                        }
                        let mut logits = vec![0.0f32; sb * rows];
                        self.weights
                            .lm_head
                            .matmat(&normed, sb, &mut logits, self.pool.as_deref());
                        for k in 0..sb {
                            if pos + k0 + k < start {
                                continue;
                            }
                            self.nll_check_graph("batched score row", pos + k0 + k)?;
                            let lg = &mut logits[k * rows..k * rows + self.vocab_size.min(rows)];
                            if let Some(mu) = self.logit_multiplier {
                                for v in lg.iter_mut() {
                                    *v *= mu;
                                }
                            }
                            // Gemma-class final-logit soft-capping: the
                            // decode paths apply it; scoring must too, or
                            // the uncapped softmax misprices every token.
                            if let Some(c) = self.final_softcap {
                                softcap_in_place(lg, c, self.pool.as_deref());
                            }
                            // Cortiq Embryo hierarchical head: same correction
                            // the decode path applies (lm_head_forward).
                            if let Some(cm) = self.head_clusters.clone() {
                                self.hierarchical_head_logprobs(
                                    &normed[k * hs..(k + 1) * hs],
                                    &cm,
                                    lg,
                                );
                            }
                            let lg = &logits[k * rows..k * rows + self.vocab_size.min(rows)];
                            let target = ids[pos + k0 + k + 1] as usize;
                            let max = lg.iter().fold(f32::NEG_INFINITY, |m, &v| m.max(v));
                            let lse: f64 = lg
                                .iter()
                                .map(|&v| ((v - max) as f64).exp())
                                .sum::<f64>()
                                .ln()
                                + max as f64;
                            nll += lse - lg[target] as f64;
                            cnt += 1;
                            if std::env::var("CMF_PPL_TRACE").is_ok() {
                                let top = lg
                                    .iter()
                                    .enumerate()
                                    .max_by(|a, b| a.1.partial_cmp(b.1).unwrap())
                                    .map(|(i, _)| i)
                                    .unwrap_or(0);
                                eprintln!(
                                    "BTRACE pos {} target {} nll {:.4} top {} lg_t {:.3} lg_top {:.3}",
                                    pos + k0 + k,
                                    target,
                                    lse - lg[target] as f64,
                                    top,
                                    lg[target],
                                    lg[top]
                                );
                            }
                        }
                        k0 = k1;
                    }
                    pos = end;
                }
                return Ok((nll, cnt));
            }
            for pos in 0..ids.len().saturating_sub(1) {
                let hidden = self.forward_layers(&self.embed_single(ids[pos]), pos, task_mask);
                self.nll_check_graph("serial forward", pos)?;
                // Architectures whose head lives inside their own stack return
                // the logits out of band and a zero hidden — DeepSeek-V4 folds
                // its hyper-connection copies between the last layer and the
                // norm, so it cannot hand back a vector this loop could use.
                // Scoring the zeros gave a perplexity of exactly the vocabulary
                // size, which is a uniform distribution reported as a
                // measurement. `generate` already reads this channel.
                let out_of_band = self.graph_logits.take();
                if self.graph_head_required && out_of_band.is_none() {
                    METAL_GRAPH_HEAD_MISS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                    return Err(format!(
                        "fused Metal graph head did not complete at NLL position {pos}"
                    ));
                }
                if pos < start {
                    continue;
                }
                let logits = match out_of_band {
                    Some(lg) => lg,
                    None => {
                        let normed = inference::rms_norm(
                            &hidden,
                            &self.weights.final_norm,
                            self.rms_eps,
                            self.norm_style,
                        );
                        // lm_head_forward applies the final-logit softcap itself
                        // — capping again here double-squashed gemma-class
                        // logits (tanh∘tanh) and reported a flattered ppl.
                        self.lm_head_forward(&normed)
                    }
                };
                let target = ids[pos + 1] as usize;
                let max = logits.iter().fold(f32::NEG_INFINITY, |m, &v| m.max(v));
                let lse: f64 = logits
                    .iter()
                    .map(|&v| ((v - max) as f64).exp())
                    .sum::<f64>()
                    .ln()
                    + max as f64;
                let tok_nll = lse - logits[target] as f64;
                if std::env::var("CMF_PPL_TRACE").is_ok() && pos < 10_000 {
                    let top = logits
                        .iter()
                        .enumerate()
                        .max_by(|a, b| a.1.partial_cmp(b.1).unwrap())
                        .map(|(i, _)| i)
                        .unwrap_or(0);
                    eprintln!(
                        "pos {pos:3} tgt {target:6} nll {tok_nll:7.3} | top1 {top:6} lg[t]={:.2} lg[top]={:.2}",
                        logits[target], logits[top]
                    );
                }
                nll += tok_nll;
                cnt += 1;
            }
            Ok((nll, cnt))
        })();
        self.nll_end();
        result
    }

    /// Score one post-layer hidden with the same final norm/head path used by
    /// decode. Keeping this in one helper is important for the production
    /// batch scorer: its rows stop before the final norm, just like the
    /// per-position O(1) path below.
    fn nll_from_hidden(&mut self, hidden: &[f32], target: u32, pos: usize) -> f64 {
        let normed = inference::rms_norm(
            hidden,
            &self.weights.final_norm,
            self.rms_eps,
            self.norm_style,
        );
        // lm_head_forward applies the final-logit softcap itself — capping
        // again here double-squashed gemma-class logits in earlier scorers.
        let mut logits = self.lm_head_forward(&normed);
        let target = target as usize;
        let max = logits.iter().fold(f32::NEG_INFINITY, |m, &v| m.max(v));
        let lse: f64 = logits
            .iter()
            .map(|&v| ((v - max) as f64).exp())
            .sum::<f64>()
            .ln()
            + max as f64;
        let tok_nll = lse - logits[target] as f64;
        if std::env::var("CMF_PPL_TRACE").is_ok() && pos < 10_000 {
            let top = logits
                .iter()
                .enumerate()
                .max_by(|a, b| a.1.partial_cmp(b.1).unwrap())
                .map(|(i, _)| i)
                .unwrap_or(0);
            eprintln!(
                "pos {pos:3} tgt {target:6} nll {tok_nll:7.3} | top1 {top:6} lg[t]={:.2} lg[top]={:.2}",
                logits[target], logits[top]
            );
        }
        attention::recycle_buf(&mut logits);
        tok_nll
    }

    /// `CMF_STATE_TRACE`: per-layer magnitude of the recurrent record at
    /// position `pos` — the whole `linear_state` (vmf: S then the conv
    /// ring; GDN: conv ring then S), its recurrent S part alone, the
    /// bounded ring, and the last per-position KV row count.  The tool
    /// that separated the ~4k perplexity cliff of the 500-step exports
    /// (a state that keeps climbing past the trained window) from a
    /// runtime boundary; one line per layer, `STATE pos=… layer=…`.
    fn trace_recurrent_state(&self, pos: usize) {
        let stats = |v: &[f32]| -> (f64, f64) {
            if v.is_empty() {
                return (0.0, 0.0);
            }
            let (mut ss, mut mx) = (0f64, 0f64);
            for &x in v {
                ss += (x as f64) * (x as f64);
                mx = mx.max((x as f64).abs());
            }
            ((ss / v.len() as f64).sqrt(), mx)
        };
        for (li, l) in self.kv_cache.layers.iter().enumerate() {
            let lw = &self.weights.layers[self.phys_layer(li)];
            let (kind, s_len) = match &lw.attn {
                AttnKind::Linear(_) => ("vmf", self.vmf_cfg.map(|c| c.state_len()).unwrap_or(0)),
                AttnKind::LinearGdn(_) => ("gdn", self.gdn_cfg.map(|c| c.state_len()).unwrap_or(0)),
                AttnKind::Bounded(_) => ("bounded", 0),
                AttnKind::Full { .. } => ("full", 0),
                _ => ("other", 0),
            };
            let (rms, max) = stats(&l.linear_state);
            let s_part = if kind == "vmf" {
                &l.linear_state[..s_len.min(l.linear_state.len())]
            } else if kind == "gdn" {
                let ring = l
                    .linear_state
                    .len()
                    .saturating_sub(s_len)
                    .min(l.linear_state.len());
                &l.linear_state[ring..]
            } else {
                &l.linear_state[..0]
            };
            let (s_rms, s_max) = stats(s_part);
            let (ring_rms, ring_len) = match &l.bounded {
                Some(b) => (stats(&b.ring_k).0, b.ring_k.len()),
                None => (0.0, 0),
            };
            eprintln!(
                "STATE pos={pos} layer={li} kind={kind} state_len={} rms={rms:.5} max={max:.4} \
                 S_rms={s_rms:.5} S_max={s_max:.4} ring_k_rms={ring_rms:.5} ring_len={ring_len} kv_rows={}",
                l.linear_state.len(),
                l.seq_len
            );
        }
    }

    /// Teacher-forced NLL of the CONVERTED model: the O(1) Nyström path
    /// is ACTIVE over the scored positions. Returns `Ok((nll sum, scored
    /// count))` over `prefill..len-1` and surfaces a post-mutation batch
    /// failure instead of returning a partial score.
    ///
    /// Runtime discipline, deliberately NOT the matrix probe's: the
    /// requested prefix plus any required deferred lead-in run the exact
    /// prompt pass — that pass is what freezes the landmarks and M — and
    /// every post-seal scored position goes through `NystromState::step()`,
    /// the same code decode runs.
    /// So the landmarks are PREFILL-frozen (what ships), not
    /// full-sequence oracles (what the published probe measured). When the
    /// requested prefix is shorter than the bounded transition, rows in the
    /// exact lead-in are still scored so the shifted target range is stable.
    ///
    /// Pair with `nll_ids_from(ids, prefill)` for the exact baseline
    /// over the identical token set — that ratio is the honest one.
    pub fn nll_ids_o1(&mut self, ids: &[u32], prefill: usize) -> Result<(f64, usize), String> {
        // This scorer consumes host hiddens, so never request the optional
        // token-graph lm_head side channel. `nll_begin` also consumes a
        // prior graph failure and clears only the cancel bit that failure
        // raised, leaving a caller-owned cancellation observable.
        self.nll_begin()?;
        let requested_prefix = (prefill > 0).then_some(prefill);
        self.o1_begin_with_prefix(requested_prefix);
        let n = ids.len().saturating_sub(1);
        let requested_start = prefill.min(n);
        // The exact prefix must reach the deferred boundary before a
        // collecting layer can convert. Rows between the requested start and
        // that boundary remain part of the public NLL range and are scored
        // from the same hidden pass below.
        let exact_end = if self.o1_active() {
            match requested_prefix {
                Some(requested) => self.o1_effective_boundary(requested),
                None => self
                    .o1_cfg
                    .as_ref()
                    .and_then(|c| crate::nystrom::o1_deferred_boundary(c.w, c.sink)),
            }
            .unwrap_or(requested_start)
            .min(n)
        } else {
            requested_start
        };
        let mut nll = 0f64;
        let mut cnt = 0usize;

        // Exact prompt pass over ids[..exact_end]: the seal consumes its
        // q/k/v. Rows at or after requested_start are scored here when the
        // bounded lead-in is longer than the caller's requested prefix.
        let mut pos = 0usize;
        if self.can_prefill_batched() {
            const CHUNK: usize = 128;
            while pos < exact_end {
                let end = (pos + CHUNK).min(exact_end);
                let hiddens = self.prefill_batch(&ids[pos..end], pos);
                if self
                    .graph_failed
                    .swap(false, std::sync::atomic::Ordering::Relaxed)
                {
                    self.cancel
                        .store(false, std::sync::atomic::Ordering::Relaxed);
                    self.nll_end();
                    return Err("GPU graph failed during O(1) NLL prefix".into());
                }
                for row in 0..end - pos {
                    let score_pos = pos + row;
                    if score_pos >= requested_start && score_pos < n {
                        nll += self.nll_from_hidden(
                            &hiddens[row * self.hidden_size..(row + 1) * self.hidden_size],
                            ids[score_pos + 1],
                            score_pos,
                        );
                        cnt += 1;
                    }
                }
                pos = end;
            }
        } else {
            while pos < exact_end {
                let hidden = self.forward_layers(&self.embed_single(ids[pos]), pos, None);
                if self
                    .graph_failed
                    .swap(false, std::sync::atomic::Ordering::Relaxed)
                {
                    self.cancel
                        .store(false, std::sync::atomic::Ordering::Relaxed);
                    self.nll_end();
                    return Err("GPU graph failed during O(1) NLL prefix".into());
                }
                if pos >= requested_start && pos < n {
                    nll += self.nll_from_hidden(&hidden, ids[pos + 1], pos);
                    cnt += 1;
                }
                pos += 1;
            }
        }
        self.o1_seal_checked().map_err(|err| {
            self.nll_end();
            err
        })?;

        // Reuse the production whole-token batch graph for the post-seal
        // suffix when the caller explicitly enabled both routes. This is a
        // teacher-forced scorer, so every row is ids[pos] and its target is
        // ids[pos + 1]; no speculative tail or rollback state is involved.
        // A first Declined is safe to handle with the established serial O(1)
        // path. Once a chunk completes, however, the device recurrent state
        // owns the sequence and a later decline must be terminal rather than
        // falling back to stale CPU state.
        let batch_k = std::env::var("CMF_BATCH_K")
            .ok()
            .and_then(|v| v.parse::<usize>().ok())
            .unwrap_or(0);
        let batch_admitted = batch_k > 0
            && self.can_prefill_batched()
            && self.o1_active()
            && self.o1_on_graph()
            && (0..self.num_layers).all(|li| {
                let cache = &self.kv_cache.layers[self.phys_layer(li)];
                cache.o1.is_none() || cache.o1_views().is_some()
            });
        if std::env::var("CMF_GRAPH_PROF").is_ok() {
            eprintln!(
                "nll-batch: phase=post-seal admission={} requested_k={} scored_rows={}",
                batch_admitted,
                batch_k,
                n.saturating_sub(exact_end),
            );
        }
        let mut batch_completed = false;
        if batch_admitted && exact_end < n {
            let hs = self.hidden_size;
            let mut batch_pos = exact_end;
            while batch_pos < n {
                let end = (batch_pos + batch_k).min(n);
                let bk = end - batch_pos;
                let mut hiddens = vec![0.0f32; bk * hs];
                for (row, &id) in ids[batch_pos..end].iter().enumerate() {
                    hiddens[row * hs..(row + 1) * hs].copy_from_slice(&self.embed_single(id));
                }
                let positions: Vec<usize> = (batch_pos..end).collect();
                let t_batch = std::time::Instant::now();
                let outcome = self.try_batch_graph_wgpu(&mut hiddens, &positions, bk, None);
                if std::env::var("CMF_GRAPH_PROF").is_ok() {
                    let ms = t_batch.elapsed().as_secs_f64() * 1000.0;
                    eprintln!(
                        "nll-batch: phase=post-seal mode=o1 k={bk} pos={}..{} outcome={outcome:?} {ms:.1} ms ({:.1} tok/s)",
                        batch_pos,
                        end.saturating_sub(1),
                        bk as f64 / (ms / 1000.0),
                    );
                }
                if let Err(err) = self.nll_check_graph("batch graph", batch_pos) {
                    self.nll_end();
                    return Err(err);
                }
                match outcome {
                    crate::gpu::BatchGraphOutcome::Completed => {
                        batch_completed = true;
                        for row in 0..bk {
                            nll += self.nll_from_hidden(
                                &hiddens[row * hs..(row + 1) * hs],
                                ids[batch_pos + row + 1],
                                batch_pos + row,
                            );
                            cnt += 1;
                        }
                        batch_pos = end;
                    }
                    crate::gpu::BatchGraphOutcome::Declined => {
                        if batch_completed {
                            self.nll_end();
                            return Err(format!(
                                "O(1) NLL batch declined after completed chunk at position {batch_pos}"
                            ));
                        }
                        break;
                    }
                    crate::gpu::BatchGraphOutcome::Failed => {
                        self.nll_end();
                        return Err(format!(
                            "O(1) NLL batch graph failed after admission at position {batch_pos}"
                        ));
                    }
                }
            }
            if batch_completed && cnt == n.saturating_sub(requested_start) {
                self.nll_end();
                return Ok((nll, cnt));
            }
        }

        // Serial O(1) fallback/reference. It is intentionally retained when
        // batch admission declines before mutation; callers must label this
        // CMF_BATCH_K=0/per-position path separately from the production
        // whole-token batch route.
        for pos in exact_end..n {
            let hidden = self.forward_layers(&self.embed_single(ids[pos]), pos, None);
            if self
                .graph_failed
                .swap(false, std::sync::atomic::Ordering::Relaxed)
            {
                self.cancel
                    .store(false, std::sync::atomic::Ordering::Relaxed);
                self.nll_end();
                return Err(format!(
                    "GPU graph failed during O(1) NLL serial scoring at position {pos}"
                ));
            }
            nll += self.nll_from_hidden(&hidden, ids[pos + 1], pos);
            cnt += 1;
        }
        self.nll_end();
        Ok((nll, cnt))
    }

    /// Teacher-forced calibration data (B1): for each position, whether the
    /// argmax equals the actual next token, and the top-1 softmax prob
    /// (top-1 probability) under EACH temperature in `temps` — all from ONE forward
    /// pass (argmax/correctness are temperature-invariant; only p_max
    /// reshapes). Feeds `cortiq calibrate` (reliability/ECE + temperature
    /// fit): is the model's confidence a true property, or does it need a
    /// measured scaling?
    pub fn calib_ids(&mut self, ids: &[u32], temps: &[f32]) -> (Vec<bool>, Vec<Vec<f32>>) {
        self.clear_sequence_state();
        let n = ids.len().saturating_sub(1);
        let mut correct = Vec::with_capacity(n);
        let mut pmax = Vec::with_capacity(n);
        for pos in 0..n {
            let emb = self.embed_single(ids[pos]);
            let hidden = self.forward_layers(&emb, pos, None);
            let logits = if let Some(logits) = self.graph_logits.take() {
                logits
            } else {
                let normed = inference::rms_norm(
                    &hidden,
                    &self.weights.final_norm,
                    self.rms_eps,
                    self.norm_style,
                );
                // lm_head_forward applies the final-logit softcap itself —
                // capping again here double-squashed gemma-class logits
                // (tanh∘tanh) and reported a flattered ppl.
                self.lm_head_forward(&normed)
            };
            let target = ids[pos + 1] as usize;
            let (mut amax, mut mval) = (0usize, f32::NEG_INFINITY);
            for (i, &v) in logits.iter().enumerate() {
                if v > mval {
                    mval = v;
                    amax = i;
                }
            }
            correct.push(amax == target);
            let row: Vec<f32> = temps
                .iter()
                .map(|&t| {
                    let tt = t.max(1e-3);
                    let s: f32 = logits.iter().map(|&v| ((v - mval) / tt).exp()).sum();
                    1.0 / s.max(1e-12) // numerator at the max is exp(0)=1
                })
                .collect();
            pmax.push(row);
        }
        self.clear_sequence_state();
        (correct, pmax)
    }

    /// Teacher-forced PPL with the dynamic router driving per-window
    /// skill switches (VMF experiment №2 measurement). Sequential (φ
    /// must update per token), returns (ppl, switch_count). The router
    /// must be enabled (`enable_dynamic_routing`); else this equals
    /// plain `ppl_ids`. The active skill when scoring token t shapes the
    /// logits for t+1 — on-policy over the held-out text itself.
    pub fn ppl_ids_dynamic(&mut self, ids: &[u32]) -> Result<(f64, usize), String> {
        if self.dyn_router.is_none() {
            return Ok((self.ppl_ids(ids)?, 0));
        }
        self.nll_begin()?;
        let saved_active = self.dyn_active;
        let mut router = self
            .dyn_router
            .take()
            .ok_or_else(|| "dynamic router disappeared before PPL scoring".to_string())?;
        router.reset();
        self.dyn_phi_seen = 0;
        let _ = self.set_active_skill(None);

        let result: Result<(f64, usize), String> = (|| {
            let mut nll = 0f64;
            let mut cnt = 0usize;
            for pos in 0..ids.len().saturating_sub(1) {
                let hidden = self.forward_layers(&self.embed_single(ids[pos]), pos, None);
                self.nll_check_graph("dynamic serial forward", pos)?;
                let out_of_band = self.graph_logits.take();
                let mut logits = match out_of_band {
                    Some(lg) => lg,
                    None => {
                        let normed = inference::rms_norm(
                            &hidden,
                            &self.weights.final_norm,
                            self.rms_eps,
                            self.norm_style,
                        );
                        // lm_head_forward applies the final-logit softcap itself —
                        // capping again here double-squashed gemma-class logits
                        // and reported a flattered ppl.
                        self.lm_head_forward(&normed)
                    }
                };
                let target = ids[pos + 1] as usize;
                let max = logits.iter().fold(f32::NEG_INFINITY, |m, &v| m.max(v));
                let lse: f64 = logits
                    .iter()
                    .map(|&v| ((v - max) as f64).exp())
                    .sum::<f64>()
                    .ln()
                    + max as f64;
                let tok_nll = lse - logits[target] as f64;
                if std::env::var("CMF_PPL_TRACE").is_ok() && pos < 10_000 {
                    let top = logits
                        .iter()
                        .enumerate()
                        .max_by(|a, b| a.1.partial_cmp(b.1).unwrap())
                        .map(|(i, _)| i)
                        .unwrap_or(0);
                    eprintln!(
                        "pos {pos:3} tgt {target:6} nll {tok_nll:7.3} | top1 {top:6} lg[t]={:.2} lg[top]={:.2}",
                        logits[target], logits[top]
                    );
                }
                nll += tok_nll;
                cnt += 1;
                attention::recycle_buf(&mut logits);
                // Route on the evolving phi (drives the NEXT token's skill).
                let phi = self.dyn_phi_ema.clone();
                if let Some(new_active) = router.step(&phi, pos) {
                    let _ = self.set_active_skill(new_active);
                }
            }
            Ok(((nll / cnt.max(1) as f64).exp(), router.switches.len()))
        })();

        // Restore the detached router and the active overlay on both success
        // and failure. The scoring state is cleared independently below.
        let _ = self.set_active_skill(saved_active);
        self.dyn_router = Some(router);
        self.nll_end();
        result
    }

    /// Routing probe φ (spec §9): mean-pooled hidden after `layer`.
    pub fn probe_phi(&mut self, ids: &[u32], layer: usize) -> Vec<f32> {
        self.clear_sequence_state();
        let mut acc = vec![0f32; self.hidden_size];
        for (pos, &id) in ids.iter().enumerate() {
            let h = self.forward_layers_upto(&self.embed_single(id), pos, None, Some(layer));
            for (a, v) in acc.iter_mut().zip(&h) {
                *a += v;
            }
        }
        let n = ids.len().max(1) as f32;
        for a in acc.iter_mut() {
            *a /= n;
        }
        self.clear_sequence_state();
        acc
    }

    /// Every position's hidden AFTER `layer` (n × hidden, not normalized): the
    /// walk of [`Self::probe_phi_span`] without the pooling, for `phi-dump`.
    pub fn probe_hidden_rows(&mut self, ids: &[u32], layer: usize) -> Vec<f32> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        self.clear_sequence_state();
        let mut rows = Vec::with_capacity(ids.len() * self.hidden_size);
        for (pos, &id) in ids.iter().enumerate() {
            let h = self.forward_layers_upto(&self.embed_single(id), pos, None, Some(layer));
            rows.extend_from_slice(&h);
        }
        self.clear_sequence_state();
        rows
    }

    /// Router-v2 φ probe (spec §9.4, `phi.pool = "span_mean"`): the hidden
    /// AFTER `layer` — the same per-position walk and the same quantity as
    /// [`Self::probe_phi`] — averaged over the positions in `span` only
    /// (the user text between the template's prefix and suffix ids), NOT
    /// unit-normalized (the decision normalizes). The walk stops at
    /// `span.end`: causality makes the later positions irrelevant, so the
    /// result is bit-identical to probing `ids[..span.end]`. An empty span
    /// gives the zero vector, which the decision treats as degenerate.
    ///
    /// Every sequence state is reset before and after — the host KV/ring/
    /// recurrent state, the reuse keys (`kv_history`, `kv_prefix`) and the
    /// device graph's sequence — so run it on a pipeline that does not
    /// also serve a conversation (its prefix reuse would be lost).
    pub fn probe_phi_span(
        &mut self,
        ids: &[u32],
        layer: usize,
        span: std::ops::Range<usize>,
    ) -> Vec<f32> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        let end = span.end.min(ids.len());
        let start = span.start.min(end);
        let reset = |p: &mut Self| p.clear_sequence_state();
        reset(self);
        let mut acc = vec![0f32; self.hidden_size];
        for (pos, &id) in ids[..end].iter().enumerate() {
            let h = self.forward_layers_upto(&self.embed_single(id), pos, None, Some(layer));
            if pos >= start {
                for (a, v) in acc.iter_mut().zip(&h) {
                    *a += v;
                }
            }
        }
        let n = end - start;
        if n > 0 {
            let n = n as f32;
            for a in acc.iter_mut() {
                *a /= n;
            }
        }
        reset(self);
        acc
    }

    /// One decode step of the current sequence: forward `token` at
    /// `position` (the cache holds positions `[0, position)`, e.g. after
    /// [`Self::forward_ids`]) and return the next-token logits — the same
    /// forward and head the generation loop runs (resident-graph logits
    /// when the graph ran, final norm + lm_head otherwise). The logit-dump
    /// tools drive greedy decoding with it so every position is observable.
    pub fn decode_step_logits(&mut self, token: u32, position: usize) -> Vec<f32> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        self.graph_logits = None;
        let hidden = self.forward_layers(&self.embed_single(token), position, None);
        if let Some(logits) = self.graph_logits.take() {
            return logits;
        }
        inference::rms_norm_into(
            &hidden,
            &self.weights.final_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.n1,
        );
        self.lm_head_forward(&self.ws.n1)
    }

    /// Layer-major batched prefill (prefill-GEMM): full-attention —
    /// per-position with the existing operators (KV grows naturally,
    /// causality preserved), GDN projections / FFN / MoE — batched
    /// (a weight row is read from DRAM once per chunk, not per
    /// position). Returns the hidden of all positions [b × hidden].
    fn prefill_batch(&mut self, ids: &[u32], start_pos: usize) -> Vec<f32> {
        self.prefill_batch_masked(ids, start_pos, None)
    }

    /// `prefill_batch` with a task mask honored on the dense-FFN panels
    /// (the masked-inference fast path: full fused compute, mask lands on
    /// the activations). The whole-chunk GPU graph is skipped for masked
    /// layers by the callers' arms; the per-GEMM device paths stay in
    /// play because the zeroing happens on the host between them.
    fn prefill_batch_masked(
        &mut self,
        ids: &[u32],
        start_pos: usize,
        task_mask: Option<&TaskMask>,
    ) -> Vec<f32> {
        self.prefill_batch_span(PrefillIn::Ids(ids), start_pos, task_mask, 0, usize::MAX)
    }

    /// One prompt chunk through the whole stack, post-stack rows out (no
    /// final norm) — the ingest generation uses, shared by scoring and
    /// `forward_ids` so they measure the same execution: the batched wgpu
    /// graph's device prefix plus the host's batched walk for the rest when
    /// `batch_prefix_prefill` holds and the graph admits the chunk, else
    /// the host's chunked prefill. Err only when a graph that had mutated
    /// device state failed.
    fn prefill_rows(
        &mut self,
        ids: &[u32],
        pos: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<Vec<f32>, String> {
        self.prefill_input_rows(PrefillIn::Ids(ids), pos, task_mask)
    }

    fn prefill_input_rows(
        &mut self,
        input: PrefillIn<'_>,
        pos: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<Vec<f32>, String> {
        if self.dash.is_some() {
            let PrefillIn::Hidden(rows) = input else {
                return Err("Unlimited-OCR prompts carry image rows".into());
            };
            return Ok(self.dash_prefill_rows(rows, pos));
        }
        self.mimo_moe_prepare();
        let hs = self.hidden_size;
        let bk = match input {
            PrefillIn::Ids(ids) => ids.len(),
            PrefillIn::Hidden(rows) => rows.len() / hs,
        };
        // MiniCPM-OCR's vision rows on native Metal: the rows graph, as an id
        // prompt's chunks take it in the generation loop.
        #[cfg(target_os = "macos")]
        if let PrefillIn::Hidden(rows) = input
            && task_mask.is_none()
            && self.onevision2_prefill()
            && (crate::gpu::q1_force() || crate::gpu::q2tp_gpu_opt_in())
            && crate::gpu::enabled_here()
            && self.gdn_cfg.is_some()
            && !self.per_token_stack()
            && bk > 8
            && bk <= 512
            && std::env::var("CMF_METAL_PREFILL").as_deref() != Ok("0")
        {
            match self.prefill_hiddens_metal(rows.to_vec(), pos, None) {
                MetalPrefillOutcome::Completed(h) => return Ok(h),
                MetalPrefillOutcome::Failed => {
                    return Err("Metal prefill of the prompt rows failed after admission".into());
                }
                MetalPrefillOutcome::Declined => {}
            }
        }
        #[cfg(not(target_os = "macos"))]
        if task_mask.is_none()
            && !self.o1_active()
            && bk > 1
            && (self.batch_prefix_prefill()
                // Ripple: scoring reads its chunks through the batch graph
                // too (the host walk attends 80 heads a row on the CPU).
                || (self.value_blend.is_some() && self.g4_batch_prefill())
                // An embedded prompt (vision rows) on the graph route takes
                // the batched graph like an id prompt does.
                || (matches!(input, PrefillIn::Hidden(_)) && self.generation_batch_k() > 0)
                || (self.verify_exact_moe
                    && crate::gpu::enabled_here()
                    && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode)))
        {
            let mut hiddens = match input {
                PrefillIn::Hidden(rows) => rows.to_vec(),
                PrefillIn::Ids(ids) => ids.iter().flat_map(|&id| self.embed_single(id)).collect(),
            };
            let positions: Vec<usize> = (pos..pos + bk).collect();
            let mut run = 0usize;
            match self.try_batch_graph_wgpu_prefix(
                &mut hiddens,
                &positions,
                bk,
                None,
                Some(&mut run),
            ) {
                crate::gpu::BatchGraphOutcome::Completed => {
                    let out = if run < self.num_layers {
                        self.prefill_batch_span(
                            PrefillIn::Hidden(&hiddens),
                            pos,
                            None,
                            run,
                            self.num_layers,
                        )
                    } else {
                        hiddens
                    };
                    return if self.graph_failed.load(std::sync::atomic::Ordering::Relaxed) {
                        Err("MiMo attention graph failed after admission".into())
                    } else {
                        Ok(out)
                    };
                }
                crate::gpu::BatchGraphOutcome::Failed => {
                    return Err("batched prefix prefill failed after admission".into());
                }
                crate::gpu::BatchGraphOutcome::Declined => {
                    // Rows an earlier chunk left on the device only.
                    #[cfg(feature = "gpu")]
                    self.pull_lagging_host_kv(0, self.num_layers, pos);
                }
            }
        }
        let out = self.prefill_batch_span(input, pos, task_mask, 0, usize::MAX);
        if self.graph_failed.load(std::sync::atomic::Ordering::Relaxed) {
            Err("batch tail graph failed after admission".into())
        } else {
            Ok(out)
        }
    }

    /// Unlimited-OCR's prompt rows, one position at a time: each query has its
    /// own coordinates and page candidates.
    fn dash_prefill_rows(&mut self, rows: &[f32], pos: usize) -> Vec<f32> {
        let hs = self.hidden_size;
        let n = rows.len() / hs;
        let mut last = vec![0f32; hs];
        let mut i = 0usize;
        while i < n && !self.cancel.load(std::sync::atomic::Ordering::Relaxed) {
            #[cfg(not(target_os = "macos"))]
            if self.dash_batch_on {
                let k = (n - i).min(crate::gpu::DASH_CHUNK_MAX);
                if let Some(d) = self.dash.as_mut() {
                    d.at_prompt_chunk(pos + i, k);
                }
                let mut h = rows[i * hs..(i + k) * hs].to_vec();
                let positions: Vec<usize> = (pos + i..pos + i + k).collect();
                match self.try_batch_graph_wgpu_prefix(&mut h, &positions, k, None, None) {
                    crate::gpu::BatchGraphOutcome::Completed => {
                        last.copy_from_slice(&h[(k - 1) * hs..]);
                        i += k;
                        continue;
                    }
                    crate::gpu::BatchGraphOutcome::Failed => {
                        self.graph_failed.store(true, std::sync::atomic::Ordering::Relaxed);
                        return last;
                    }
                    crate::gpu::BatchGraphOutcome::Declined => self.dash_batch_on = false,
                }
            }
            #[cfg(target_os = "macos")]
            if self.dash_batch_on && n - i >= 8 && crate::gpu::backend_name() == "metal" {
                let k = (n - i).min(crate::gpu::DASH_CHUNK_MAX);
                if let Some(d) = self.dash.as_mut() {
                    d.at_prompt_chunk(pos + i, k);
                }
                let mut h = rows[i * hs..(i + k) * hs].to_vec();
                if self.chunk_run_gpu(0, &mut h, k, pos + i, None, self.num_layers) == self.num_layers {
                    last.copy_from_slice(&h[(k - 1) * hs..]);
                    i += k;
                    continue;
                }
                self.dash_batch_on = false;
            }
            if let Some(d) = self.dash.as_mut() {
                d.at_prompt(pos + i);
            }
            last = self.forward_layers(&rows[i * hs..(i + 1) * hs], pos + i, None);
            i += 1;
        }
        last
    }

    /// The layer-major batched walk over a layer span [from..upto_excl):
    /// the whole prefill machinery (chunk graph, batched attends, GEMM
    /// panels) for a PARTIAL stack — the network split's prefill rides
    /// the same canon as the local one. Input is token ids (embeds
    /// itself, coordinator side) or ready boundary hiddens (worker side).
    fn prefill_batch_span(
        &mut self,
        input: PrefillIn<'_>,
        start_pos: usize,
        task_mask: Option<&TaskMask>,
        from: usize,
        upto_excl: usize,
    ) -> Vec<f32> {
        let hs = self.hidden_size;
        let b = match input {
            PrefillIn::Ids(ids) => ids.len(),
            PrefillIn::Hidden(hb) => hb.len() / hs,
        };
        let upto_excl = upto_excl.min(self.num_layers);
        // The CPU embed is deferred: when the chunk graph takes the run
        // from layer 0 it gathers the embeddings on the device instead.
        // A hidden input is ready by definition.
        let mut h: Vec<f32>;
        let mut h_ready;
        match input {
            PrefillIn::Ids(_) => {
                h = vec![0.0; b * hs];
                h_ready = false;
            }
            PrefillIn::Hidden(hb) => {
                h = hb.to_vec();
                h_ready = true;
            }
        }
        // Ripple's value residual reads the chunk's embedding rows in every layer.
        if self.value_blend.is_some() {
            self.vres_e0.clear();
            match input {
                PrefillIn::Ids(ids) => {
                    for &id in ids {
                        let e = self.embed_single(id);
                        self.vres_e0.extend_from_slice(&e);
                    }
                }
                PrefillIn::Hidden(hb) => {
                    assert!(from == 0, "value residual: a layer span past the first layer has no embedding rows");
                    self.vres_e0.extend_from_slice(hb);
                }
            }
        }
        let fill_h = |h: &mut Vec<f32>, me: &Self| {
            if let PrefillIn::Ids(ids) = input {
                for (bi, &id) in ids.iter().enumerate() {
                    let e = me.embed_single(id);
                    h[bi * hs..(bi + 1) * hs].copy_from_slice(&e);
                }
                if let Ok(tp) = std::env::var("CMF_TRACE_POS") {
                    if let Ok(t) = tp.parse::<usize>() {
                        if t >= start_pos && t < start_pos + ids.len() {
                            let bi = t - start_pos;
                            let row = &h[bi * hs..(bi + 1) * hs];
                            let n: f32 = row.iter().map(|x| x * x).sum::<f32>().sqrt();
                            eprintln!(
                                "BATCH pos {t} embed: id {} |h| = {n:.6} h0 {:.6} h1 {:.6} | b={} start={start_pos} ids[..8]={:?}",
                                ids[bi],
                                row[0],
                                row[1],
                                ids.len(),
                                &ids[..ids.len().min(8)]
                            );
                        }
                    }
                }
            }
        };
        let (_nkv, _hd, _rd, eps) = (
            self.num_kv_heads,
            self.head_dim,
            self.rotary_dim,
            self.rms_eps,
        );
        let pool = self.pool.clone();
        let norm_style = self.norm_style;
        self.mimo_moe_prepare();
        let automatic_gpu_prefix = self.automatic_gpu_prefix();

        #[cfg(target_os = "macos")]
        let mut chunk_skip_until = 0usize;
        // SenseNova-Loop: the chunk rows' mHC streams.
        let mut mhc_rs: Vec<f32> = Vec::new();
        for li in from..upto_excl {
            let _capacity_tail = automatic_gpu_prefix
                .filter(|&prefix| {
                    li >= prefix && !(self.verify_exact_moe && self.mimo_moe.is_dynamic(li, false))
                })
                .map(|_| crate::gpu::enter_cpu_scope());
            crate::gpu::set_layer(li as i64); // layer-split GPU/CPU
            // Spark-X2.5: the layer's int8 matrix-unit GEMMs take the
            // `zi_mm` tile, bit-identical to the 64x64 kernel and about
            // three times its rate (`gpu_wgpu::zi_gemm_route`).
            #[cfg(feature = "gpu")]
            let _fast_gemm = self
                .proj_gate_sigmoid
                .then(crate::gpu::enter_prefill_fast_gemm);
            // GPU chunk graph (default-on under CMF_GPU=1): a run of
            // consecutive eligible layers for the whole chunk in ONE
            // Metal submission — norm, QKV, RoPE with fused mirror
            // append, causal attend, O, FFN, hidden device-resident
            // across the run. Any refusal falls through to the CPU path.
            #[cfg(target_os = "macos")]
            if task_mask.is_none() {
                if li < chunk_skip_until {
                    continue;
                }
                // Device-side embedding needs a q8_row embedding matrix;
                // with any other layout the CPU fills `h` first and the
                // graph starts from a ready hidden (refusing the whole
                // run over the embedding alone kept q4t models — the
                // whole Nanbeige/Bonsai class — on the CPU prefill).
                if !h_ready && li == 0 && self.weights.embed_tokens.q8_row_parts().is_none() {
                    fill_h(&mut h, self);
                    h_ready = true;
                }
                let ids_for_embed = match input {
                    PrefillIn::Ids(ids) => (!h_ready && li == 0).then_some(ids),
                    PrefillIn::Hidden(_) => None,
                };
                let end = self.chunk_run_gpu(li, &mut h, b, start_pos, ids_for_embed, upto_excl);
                if end > li {
                    h_ready = true;
                    chunk_skip_until = end;
                    // Looped Transformer: the graph stopped at a loop
                    // boundary — apply final norm before the next iteration.
                    if self.is_loop_end(end - 1) && end < self.num_layers {
                        for bi in 0..b {
                            let normed = inference::rms_norm(
                                &h[bi * hs..(bi + 1) * hs],
                                &self.weights.final_norm,
                                eps,
                                norm_style,
                            );
                            h[bi * hs..(bi + 1) * hs].copy_from_slice(&normed);
                        }
                    }
                    continue;
                }
            }
            if !h_ready {
                fill_h(&mut h, self);
                h_ready = true;
            }
            if task_mask.is_none() && self.verify_exact_moe {
                let positions: Vec<_> = (start_pos..start_pos + b).collect();
                match self.mimo_graph_layer_rows(li, &mut h, &positions) {
                    crate::gpu::BatchGraphOutcome::Completed => continue,
                    crate::gpu::BatchGraphOutcome::Failed => return h,
                    crate::gpu::BatchGraphOutcome::Declined => {}
                }
            }
            #[cfg(feature = "gpu")]
            self.pull_lagging_host_kv(li, li + 1, start_pos);
            // SenseNova-Loop mHC: every row's streams route into `h`; the
            // attention below adds onto that branch, so its output is the
            // difference from the copy kept here.
            let mhc_attn = self.mhc_layer(li).then(|| {
                let m = self.mhc.as_deref().expect("mhc layer");
                let p = self.phys_layer(li);
                let n = m.s.streams * hs;
                mhc_rs.resize(b * n, 0.0);
                let coefs: Vec<_> = (0..b)
                    .map(|bi| {
                        let r = &mut mhc_rs[bi * n..(bi + 1) * n];
                        if m.enters(p) {
                            m.enter(r, &h[bi * hs..(bi + 1) * hs]);
                        }
                        m.route(p, false, r, &mut h[bi * hs..(bi + 1) * hs])
                    })
                    .collect();
                (h.clone(), coefs)
            });
            let lw = &self.weights.layers[self.phys_layer(li)];
            let t_attn = std::time::Instant::now();
            // ── attention ──
            match &lw.attn {
                AttnKind::Kda(w) => {
                    // Projections batched, recurrence sequential.
                    let cfg = self.kda_cfg.expect("kda layer without kda_cfg");
                    let mut normed = vec![0.0f32; b * hs];
                    for bi in 0..b {
                        inference::rms_norm_into(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                            &mut normed[bi * hs..(bi + 1) * hs],
                        );
                    }
                    let attn = crate::linear_core::kda_forward_batch(
                        &normed,
                        b,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        pool.as_deref(),
                    );
                    for (dst, &a) in h.iter_mut().zip(&attn) {
                        *dst += a;
                    }
                }
                AttnKind::LinearGdn(w) => {
                    // Projections batched, recurrence sequential.
                    let cfg = self.gdn_cfg.expect("gdn layer without gdn_cfg");
                    let mut normed = vec![0.0f32; b * hs];
                    for bi in 0..b {
                        let r = inference::rms_norm(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                        );
                        normed[bi * hs..(bi + 1) * hs].copy_from_slice(&r);
                    }
                    let attn = crate::linear_core::gdn_forward_batch(
                        &normed,
                        b,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        pool.as_deref(),
                    );
                    for (dst, &a) in h.iter_mut().zip(&attn) {
                        *dst += a;
                    }
                }
                AttnKind::ShortConv(w) => {
                    // Projections batched over the chunk; the conv walks the
                    // contiguous positions in order (same ring as decode).
                    let cfg = self
                        .short_conv_cfg
                        .expect("short-conv layer without short_conv_cfg");
                    let mut normed = vec![0.0f32; b * hs];
                    for bi in 0..b {
                        inference::rms_norm_into(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                            &mut normed[bi * hs..(bi + 1) * hs],
                        );
                    }
                    let mut attn = short_conv_forward_batch(
                        &normed,
                        b,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        pool.as_deref(),
                    );
                    // LFM3 sandwich: the mixer output is normalized before
                    // the residual, as on the decode path.
                    if let Some(wn) = &lw.attn_out_norm {
                        for bi in 0..b {
                            inference::rms_norm_into(
                                &attn[bi * hs..(bi + 1) * hs],
                                wn,
                                eps,
                                norm_style,
                                &mut normed[bi * hs..(bi + 1) * hs],
                            );
                        }
                        attn.copy_from_slice(&normed);
                    }
                    for (dst, &a) in h.iter_mut().zip(&attn) {
                        *dst += a;
                    }
                }
                AttnKind::Mla(w) => {
                    // Per-position prefill (correctness first; latent
                    // batching is a later optimization).
                    let inv_freq_l = self.layer_inv_freq(li);
                    let rs = self.layer_rope_scale(li);
                    let mut normed = vec![0.0f32; hs];
                    for bi in 0..b {
                        inference::rms_norm_into(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                            &mut normed,
                        );
                        let ao = mla_attention(
                            w,
                            &normed,
                            &mut self.kv_cache.layers[li],
                            start_pos + bi,
                            &inv_freq_l,
                            rs,
                            eps,
                            pool.as_deref(),
                        );
                        for (dst, &a) in h[bi * hs..(bi + 1) * hs].iter_mut().zip(&ao) {
                            *dst += a;
                        }
                    }
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } => {
                    // Chunk-GEMM QKV/O; per-position causal attention
                    // inside (roadmap §3 P0 — full-attention prefill no
                    // longer re-reads the projection weights b times).
                    let mut normed = vec![0.0f32; b * hs];
                    for bi in 0..b {
                        inference::rms_norm_into(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                            &mut normed[bi * hs..(bi + 1) * hs],
                        );
                    }
                    // The rows V projects, when the layer blends the embeddings into them.
                    let vres = match self.layer_value_blend(li) {
                        Some(blend) => {
                            vres_lerp(&self.vres_e0, &normed, blend, &mut self.vres_in);
                            true
                        }
                        None => false,
                    };
                    let inv_freq_l = self.layer_inv_freq(li);
                    let (nkv_l, hd_l, rd_l) = self.layer_geom(li);
                    let cfg = QwenAttnCfg {
                        mrope: self.prompt_mrope.as_deref().zip(self.mrope_sections).map(|(pos, sections)| attention::MropeView { base: 0, pos, sections }),
                        num_heads: self.layer_num_heads(li),
                        num_kv_heads: nkv_l,
                        head_dim: hd_l,
                        hidden_size: hs,
                        position: start_pos,
                        inv_freq: &inv_freq_l,
                        rotary_dim: rd_l,
                        scale: self.attn_scale,
                        softcap: self.attn_softcap,
                        window: self.layer_window(li),
                        v_norm: self.attn_v_norm,
                        qk_norm_after_rope: self.qk_norm_after_rope,
                        gate_sigmoid: self.proj_gate_sigmoid,
                        q_norm: q_norm.as_deref(),
                        k_norm: k_norm.as_deref(),
                        output_gate: *output_gate,
                        softplus_gate: softplus_gate
                            .as_ref()
                            .map(|(gate, per_head)| (gate, *per_head)),
                        rope_scale: self.layer_rope_scale(li),
                        bias: bias
                            .as_ref()
                            .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                        rms_eps: eps,
                        norm_style,
                        pool: pool.as_deref(),
                        v_head_dim: self.layer_v_dim(li),
                        value_in: vres.then(|| self.vres_in.as_slice()),
                    };
                    #[cfg(feature = "gpu")]
                    let _mirror = self
                        .prefill_mirror_target(li)
                        .map(crate::gpu::enter_prefill_mirror);
                    let mut attn = attention::qwen_attention_batch(
                        &normed,
                        b,
                        wq,
                        wk,
                        wv,
                        wo,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    );
                    if let Some(w) = &lw.attn_out_norm {
                        for bi in 0..b {
                            inference::rms_norm_into(
                                &attn[bi * hs..(bi + 1) * hs],
                                w,
                                eps,
                                norm_style,
                                &mut normed[bi * hs..(bi + 1) * hs],
                            );
                        }
                        attn.copy_from_slice(&normed);
                    }
                    for (dst, &a) in h.iter_mut().zip(&attn) {
                        *dst += a;
                    }
                }
                AttnKind::Bounded(w) => {
                    // Chunk-GEMM projections, the bounded operator per
                    // position over ring + chunk — never a growing KV.
                    let mut normed = vec![0.0f32; b * hs];
                    for bi in 0..b {
                        inference::rms_norm_into(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                            &mut normed[bi * hs..(bi + 1) * hs],
                        );
                    }
                    let rope = self
                        .bounded_rope
                        .clone()
                        .expect("bounded layer without an installed rotation table");
                    let cfg = crate::bounded::BoundedAttnCfg {
                        num_heads: self.num_heads,
                        num_kv_heads: self.num_kv_heads,
                        head_dim: self.head_dim,
                        hidden_size: hs,
                        scale: self.attn_scale,
                        rope: &rope,
                        pool: pool.as_deref(),
                    };
                    let mut attn = crate::bounded::bounded_attention_batch(
                        &normed,
                        b,
                        w,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    );
                    if let Some(wn) = &lw.attn_out_norm {
                        for bi in 0..b {
                            inference::rms_norm_into(
                                &attn[bi * hs..(bi + 1) * hs],
                                wn,
                                eps,
                                norm_style,
                                &mut normed[bi * hs..(bi + 1) * hs],
                            );
                        }
                        attn.copy_from_slice(&normed);
                    }
                    for (dst, &a) in h.iter_mut().zip(&attn) {
                        *dst += a;
                    }
                    attention::recycle_buf(&mut attn);
                }
                AttnKind::Linear(w) => {
                    for bi in 0..b {
                        let normed = inference::rms_norm(
                            &h[bi * hs..(bi + 1) * hs],
                            &lw.input_norm,
                            eps,
                            norm_style,
                        );
                        vmf_phase_forward(
                            &normed,
                            w,
                            &self.vmf_cfg.expect("linear layer without vmf_cfg"),
                            &mut self.kv_cache.layers[li].linear_state,
                            pool.as_deref(),
                        )
                        .iter()
                        .enumerate()
                        .for_each(|(i, &a)| h[bi * hs + i] += a);
                    }
                }
            }

            // mHC: fold the attention output into the streams, route the
            // FFN's branch.
            let mhc_ffn = mhc_attn.map(|(branch, coefs)| {
                let m = self.mhc.as_deref().expect("mhc layer");
                let p = self.phys_layer(li);
                let n = m.s.streams * hs;
                let mut y = vec![0f32; hs];
                (0..b)
                    .map(|bi| {
                        for (e, v) in y.iter_mut().enumerate() {
                            *v = h[bi * hs + e] - branch[bi * hs + e];
                        }
                        let r = &mut mhc_rs[bi * n..(bi + 1) * n];
                        m.merge(r, &y, &coefs[bi]);
                        m.route(p, true, r, &mut h[bi * hs..(bi + 1) * hs])
                    })
                    .collect::<Vec<_>>()
            });
            // ── FFN batched ──
            let lw = &self.weights.layers[self.phys_layer(li)];
            let mut post = vec![0.0f32; b * hs];
            for bi in 0..b {
                let r =
                    inference::rms_norm(&h[bi * hs..(bi + 1) * hs], &lw.post_norm, eps, norm_style);
                post[bi * hs..(bi + 1) * hs].copy_from_slice(&r);
            }
            // A restrictive per-visit FFN row lands on the activations
            // inside the dense arm; an all-open row costs nothing.
            let mask_row = task_mask
                .filter(|m| m.ffn_active_count(li) < self.intermediate_size)
                .and_then(|m| m.ffn_masks.get(li))
                .map(|v| v.as_slice());
            let attn_ns = t_attn.elapsed().as_nanos() as u64;
            let t_ffn = std::time::Instant::now();
            let mut ffn = match &lw.ffn {
                FfnKind::Dense(d) if !d.segs.is_empty() => {
                    tube_ffn(d, &post, b, pool.as_deref(), mask_row)
                }
                FfnKind::Dense(d) => dense_ffn_batch(d, &post, b, pool.as_deref(), mask_row),
                FfnKind::Moe(m) if self.verify_exact_moe && self.mimo_moe.is_dynamic(li, false) => {
                    moe_ffn_banked_rows(&mut self.mimo_moe, li, m, &post, b, hs, pool.as_deref())
                }
                FfnKind::Moe(m) if self.verify_exact_moe => {
                    moe_ffn_rows_exact(m, &post, b, hs, pool.as_deref())
                }
                // Keep prompt expert panels off the projection arena and
                // use their routes to prime the model-wide bank.
                FfnKind::Moe(m) if self.mimo_moe.is_dynamic(li, false) => {
                    let before = m.stats.borrow().clone();
                    let out = crate::gpu::cpu_scope(|| {
                        moe_ffn_batch(m, &post, b, hs, pool.as_deref(), None)
                    });
                    self.mimo_moe.prime(li, m, &before);
                    out
                }
                FfnKind::Moe(m) => moe_ffn_batch(m, &post, b, hs, pool.as_deref(), None),
                // Dual-branch layers run per position (the expert branch
                // reads the raw residual — nothing to batch yet).
                FfnKind::DenseMoe(dm) => {
                    let mut out = vec![0.0f32; b * hs];
                    for bi in 0..b {
                        let r = dense_moe_ffn(
                            dm,
                            &post[bi * hs..(bi + 1) * hs],
                            &h[bi * hs..(bi + 1) * hs],
                            eps,
                            norm_style,
                            pool.as_deref(),
                        );
                        out[bi * hs..(bi + 1) * hs].copy_from_slice(&r);
                    }
                    out
                }
            };
            if prefill_prof_on() {
                PREFILL_SPLIT[0].fetch_add(attn_ns, std::sync::atomic::Ordering::Relaxed);
                PREFILL_SPLIT[1].fetch_add(
                    t_ffn.elapsed().as_nanos() as u64,
                    std::sync::atomic::Ordering::Relaxed,
                );
            }
            if let Some(w) = &lw.ffn_out_norm {
                for bi in 0..b {
                    inference::rms_norm_into(
                        &ffn[bi * hs..(bi + 1) * hs],
                        w,
                        eps,
                        norm_style,
                        &mut post[bi * hs..(bi + 1) * hs],
                    );
                }
                ffn.copy_from_slice(&post);
            }
            if let Some(coefs) = mhc_ffn {
                // mHC: fold the FFN output in; the range's last layer hands
                // the streams' mean on as the hidden.
                let m = self.mhc.as_deref().expect("mhc layer");
                let p = self.phys_layer(li);
                let n = m.s.streams * hs;
                for bi in 0..b {
                    let r = &mut mhc_rs[bi * n..(bi + 1) * n];
                    m.merge(r, &ffn[bi * hs..(bi + 1) * hs], &coefs[bi]);
                    if m.leaves(p) {
                        m.leave(r, &mut h[bi * hs..(bi + 1) * hs]);
                    }
                }
            } else {
                for (dst, &f) in h.iter_mut().zip(&ffn) {
                    *dst += f;
                }
            }
            if let Some(sc) = lw.layer_scale {
                for v in h.iter_mut() {
                    *v *= sc;
                }
            }
            // CMF_LAYER_DUMP: every position's hidden after layer li.
            if self.layer_dump.is_some() {
                for bi in 0..b {
                    self.dump_layer_row(start_pos + bi, li, &h[bi * hs..(bi + 1) * hs]);
                }
            }
            if let Ok(tp) = std::env::var("CMF_TRACE_POS") {
                if let Ok(t) = tp.parse::<usize>() {
                    if t >= start_pos && t < start_pos + b {
                        let bi = t - start_pos;
                        let row = &h[bi * hs..(bi + 1) * hs];
                        let n: f32 = row.iter().map(|x| x * x).sum::<f32>().sqrt();
                        eprintln!(
                            "BATCH pos {t} after layer {li}: |h| = {n:.6} h0 {:.6} h1 {:.6}",
                            row[0], row[1]
                        );
                    }
                }
            }
            // CMF_DEBUG_LAYERS=1: per-layer hidden-state health of the
            // LAST prompt position — the knife for "which layer type
            // breaks first" on a new architecture.
            if std::env::var("CMF_DEBUG_LAYERS").is_ok() {
                let row = &h[(b - 1) * hs..b * hs];
                let rms =
                    (row.iter().map(|&v| (v as f64) * (v as f64)).sum::<f64>() / hs as f64).sqrt();
                let mx = row.iter().fold(0f32, |m, &v| m.max(v.abs()));
                eprintln!(
                    "layer {li:>3} {:>10} ffn={:<5} rms={rms:>12.4} max={mx:>12.4}",
                    match &self.weights.layers[self.phys_layer(li)].attn {
                        AttnKind::LinearGdn(_) => "gdn",
                        AttnKind::Linear(_) => "vmf",
                        AttnKind::ShortConv(_) => "conv",
                        _ => "attn",
                    },
                    match &lw.ffn {
                        FfnKind::Moe(_) => "moe",
                        FfnKind::Dense(_) => "dense",
                        FfnKind::DenseMoe(_) => "dense+moe",
                    },
                );
            }
            // Looped Transformer: apply final norm at the end of each loop iteration.
            if self.is_loop_end(li) && li + 1 < self.num_layers {
                for bi in 0..b {
                    let normed = inference::rms_norm(
                        &h[bi * hs..(bi + 1) * hs],
                        &self.weights.final_norm,
                        eps,
                        norm_style,
                    );
                    h[bi * hs..(bi + 1) * hs].copy_from_slice(&normed);
                }
            }
            if std::env::var("CMF_TRACE_H").is_ok() {
                let n = h[..hs].iter().map(|v| v.abs()).sum::<f32>() / hs as f32;
                let mx = h[..hs].iter().fold(0.0f32, |a, &v| a.max(v.abs()));
                eprintln!(
                    "layer {li}: mean|h|={n:.4} max|h|={mx:.2} scale={:?}",
                    lw.layer_scale
                );
            }
        }
        crate::gpu::set_layer(-1); // lm_head/final ops outside layer-split
        if prefill_prof_on() {
            let ms = |a: &std::sync::atomic::AtomicU64| {
                a.load(std::sync::atomic::Ordering::Relaxed) as f64 / 1e6
            };
            let sp = &attention::ATTN_SPLIT;
            let (qkv_enq, qkv_wait, ca_wait, zi) = wgpu_prefill_counters();
            eprintln!(
                "prefill-split: attention {:.1} ms (proj {:.1} [qkv enqueue {:.1} wait {:.1}, \
                 host gate {:.1}], host loop {:.1}, attend {:.1} \
                 [q pack {:.1}, device {:.1} of which readback {:.1}], o-proj {:.1}), \
                 ffn {:.1} ms (cumulative; zi_mm GEMMs {zi})",
                ms(&PREFILL_SPLIT[0]),
                ms(&sp[0]),
                qkv_enq,
                qkv_wait,
                ms(&sp[6]),
                ms(&sp[1]),
                ms(&sp[2]),
                ms(&sp[4]),
                ms(&sp[5]),
                ca_wait,
                ms(&sp[3]),
                ms(&PREFILL_SPLIT[1]),
            );
            let [calls, attended, wo, ring, reseed, f16] = wgpu_mirror_counters();
            eprintln!(
                "prefill-mirror: {calls} calls, {attended} attended ({wo} with O on the card), \
                 {ring} ring refusals, {reseed} reseeds, {f16} f16 fallbacks, {} upload \
                 fallbacks (cumulative)",
                attention::MIRROR_UPLOADS.load(std::sync::atomic::Ordering::Relaxed),
            );
        }
        // A batched span owns a complete set of positions. Publish any
        // collecting→sealed transition only after every layer has finished;
        // callers that cross into serial/device work must see the new epoch
        // before this function returns.
        self.o1_progress();
        // Every layer of the chunk has appended and attended its rows.
        self.swa_trim_tails();
        h
    }

    /// Embed a single token.
    fn embed_single(&self, id: u32) -> Vec<f32> {
        let mut out = vec![0.0f32; self.hidden_size];
        if (id as usize) < self.weights.embed_tokens.rows() {
            self.weights.embed_tokens.row_f32(id as usize, &mut out);
        }
        if self.embed_multiplier != 1.0 {
            for v in out.iter_mut() {
                *v *= self.embed_multiplier;
            }
        }
        // DeepSeek-V4's hash layers route by TOKEN ID, so the id has to
        // reach the forward. It rides in slot 0 (the forward re-reads the
        // real embedding itself from the table).
        if self.dsv4.is_some() || self.dsv41.is_some() || self.dory.is_some() || self.qwen4_exp.is_some() {
            let mut v = vec![0.0f32; self.hidden_size.max(1)];
            v[0] = id as f32;
            return v;
        }
        // Gemma-3n: the per-layer-embedding half needs the token ID, so
        // it rides appended to the embedding; the g3n forward splits it.
        // Gemma-4 E-series PLE: same contract, its own table.
        if let Some(b) = &self.g4e {
            return b.0.extend_embedding(id, &out, self.pool.as_deref());
        }
        if let Some(b) = &self.g3n {
            return b.0.extend_embedding(id, &out, self.pool.as_deref());
        }
        out
    }

    /// A run of consecutive prefill layers on the GPU for the whole
    /// chunk (default-on under CMF_GPU=1; CMF_GPU_CHUNK=0 disables).
    /// Eligibility per layer: q8_row weights, plain full attention
    /// (no output gate), F32 KV, no o1/masks/gemma extras. Returns the
    /// first layer index NOT processed (== `li0` when the run is empty).
    #[cfg(target_os = "macos")]
    fn chunk_run_gpu(
        &mut self,
        li0: usize,
        h: &mut [f32],
        b: usize,
        pos0: usize,
        embed_ids: Option<&[u32]>,
        cap: usize,
    ) -> usize {
        // (The old streaming attend needed a depth bound at ~1k; the
        // GEMM attention scales like the CPU path and lifted it.)
        // CMF_GPU_CHUNK=0 disables the graph.
        // Gemma-4 (`metal_gemma4`) brings its own kernels for the global
        // layers, V norm, attention scale and sandwich (`ChunkGemma4`).
        // `CMF_METAL_GEMMA4_CHUNK=0` keeps its prompt on the host walk.
        let gemma4 =
            self.metal_gemma4() && std::env::var("CMF_METAL_GEMMA4_CHUNK").as_deref() != Ok("0");
        if !crate::gpu::enabled_here()
            || std::env::var("CMF_GPU_CHUNK")
                .map(|v| v == "0")
                .unwrap_or(false)
            || (b < self.chunk_min_rows && self.dash.is_none() && !self.o1_chunk_prefix)
            // MRoPE rows rotate on the host (`attention::MropeView`).
            || self.prompt_mrope.is_some()
            // V with rows of its own (Ripple's value residual) stays on the host walk.
            || self.value_blend.is_some()
            // Sliding windows with per-layer RoPE ride the chunk graph
            // (`metal_graph_swa`: causal_softmax_win, per-layer tables).
            || (self.swa.is_some() && !self.metal_graph_swa() && !gemma4)
            || (self.global_attn.is_some() && !gemma4)
            // Chunk attention has no value-less learned-sink column. q1
            // decode can carry it through ordinary `gqa_attend`, but prompt
            // chunks must stay on the exact host attention path.
            || self.kv_cache.layers.iter().any(|l| l.sinks.is_some())
            // Per-layer KV heads and narrow V remain outside this chunk
            // graph (the q1 sliding-native door checks the same geometry).
            || (self.graph_attn_decline_reason().is_some() && !self.metal_graph_swa() && !gemma4)
            // Collection owns the exact Q trace and boundary conversion;
            // this chunk graph appends dense KV without feeding that trace,
            // but for a far field's exact prefix, where it keeps the queries.
            || (self.o1_active() && !self.o1_chunk_prefix)
            || (self.attn_v_norm && !gemma4)
            || !self.metal_rope_scale_ok()
            || ((self.attn_scale - 1.0 / (self.head_dim as f32).sqrt()).abs() > 1e-9 && !gemma4)
        {
            return li0;
        }
        let Some(model) = self.model.clone() else {
            return li0;
        };
        let (nh, nkv, hd, hs) = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.hidden_size,
        );
        // Collect the longest run of consecutive eligible layers.
        // Looped Transformer: stop at the loop boundary so the CPU can
        // apply loop_final_norm between iterations.
        let loop_end = if self.loop_final_norm {
            ((li0 / self.physical_layers) + 1) * self.physical_layers
        } else {
            self.num_layers
        };
        let run_end = self.num_layers.min(loop_end).min(cap);
        // Each layer's own RoPE table (Spark-X2.5: sliding and full layers
        // differ); the global one for every model without sliding layers.
        // Declared before `layers`, which borrows it (and drops a routing
        // closure on MoE layers).
        let tables: Vec<std::sync::Arc<Vec<f32>>> =
            (li0..run_end).map(|li| self.layer_inv_freq(li)).collect();
        let mut layers: Vec<crate::gpu_metal::ChunkLayer> = Vec::new();
        let mut stored_at: Vec<usize> = Vec::new();
        for li in li0..run_end {
            if self.mhc_layer(li) {
                break;
            }
            let lw = &self.weights.layers[self.phys_layer(li)];
            if (lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some() || lw.layer_scale.is_some())
                && !gemma4
            {
                break;
            }
            let AttnKind::Full {
                wq,
                wk,
                wv,
                wo,
                q_norm,
                k_norm,
                output_gate: false,
                softplus_gate,
                bias,
            } = &lw.attn
            else {
                break;
            };
            // Spark-X2.5's per-head sigmoid g_proj gate, from f32 rows.
            let head_gate = match softplus_gate {
                None => None,
                Some((g, true)) if self.proj_gate_sigmoid => match g.f32_parts() {
                    Some((d, r, c)) if r == nh && c == hs => Some(d),
                    _ => break,
                },
                Some(_) => break,
            };
            // The FFN: a dense SiLU/GELU trio, or routed q4tp experts
            // (Mellum2.1: softmax router, no shared expert) whose first
            // trio stands in for the shape checks.
            let (gate_t, up_t, down_t, ffn_act, moe) = match &lw.ffn {
                FfnKind::Dense(d)
                    if (matches!(d.act, Act::Silu | Act::Gelu)
                        || (gemma4 && d.act == Act::GeluTanh))
                        && d.segs.is_empty() =>
                {
                    (&d.gate_proj, &d.up_proj, &d.down_proj, d.act, None)
                }
                FfnKind::Moe(m) => match chunk_moe_parts(m, hs) {
                    Some((router, experts, q8)) => {
                        let e0 = &m.experts[0];
                        let route = Box::new(move |lg: &[f32]| {
                            // `moe_ffn_batch`'s routing and weights, row by row.
                            let (idx, p, wsum) = moe_route(lg, m, None);
                            let mut st = m.stats.borrow_mut();
                            if st.len() < m.experts.len() {
                                st.resize(m.experts.len(), 0);
                            }
                            for &e in &idx {
                                st[e] += 1;
                            }
                            let w = idx.iter().map(|&e| p[e] / wsum).collect();
                            (idx, w)
                        });
                        let detached = m.shared.as_ref().map(|(s, _)| {
                            let t = |x: &QTensor| {
                                x.q8_2f_parts().map(|p| p.0).or_else(|| x.q4tp_parts().map(|p| p.0)).unwrap_or(usize::MAX)
                            };
                            ([t(&s.gate_proj), t(&s.up_proj), t(&s.down_proj)], s.gate_proj.rows())
                        });
                        (
                            &e0.gate_proj,
                            &e0.up_proj,
                            &e0.down_proj,
                            Act::Silu,
                            Some(crate::gpu_metal::ChunkMoe {
                                router,
                                experts,
                                q8,
                                route,
                                detached,
                            }),
                        )
                    }
                    None => break,
                },
                _ => break,
            };
            // q8_row (row_scale populated), q8_2f (plus its input field),
            // or q4_tiled / q4tp (row_scale empty — their scales are in the
            // payload). Mixing across the seven projections of one layer is
            // fine; the encoder branches per weight on the tensor's dtype.
            // Anything else refuses.
            fn cw(t: &QTensor) -> Option<(usize, usize, usize, &[f32])> {
                t.q8_row_parts()
                    .or_else(|| t.q8_2f_parts().map(|(i, r, c, rs, _)| (i, r, c, rs)))
                    .or_else(|| t.q4t_parts().map(|(i, r, c)| (i, r, c, &[][..])))
                    .or_else(|| t.q4tp_parts().map(|(i, r, c)| (i, r, c, &[][..])))
            }
            fn cf(t: &QTensor) -> &[f32] {
                t.q8_2f_parts().map_or(&[][..], |(_, _, _, _, cf)| cf)
            }
            let col = [cf(wq), cf(wk), cf(wv), cf(wo)];
            let ffn_col = [cf(gate_t), cf(up_t), cf(down_t)];
            // q8_2f projections ride the chunk graph on the MoE layers it
            // was measured on (Mellum2.1) and on the dense exact-GELU FFN
            // (Spark-X2.6-4B q8_2f on the M4: the gate/up inputs staged as
            // x·col, the down field applied after the activation —
            // `ChunkLayer::ffn_col`). A dense SiLU q8_2f stack keeps the host
            // walk: its down GEMM fuses the activation into the X-tile load
            // and has no input field (0.8.14 refused every q8_2f weight here).
            // Gemma-4 reads every q8_2f weight through the blob GEMM with its
            // own field (`ChunkGemma4`), so its dense q8_2f stack rides.
            if moe.is_none()
                && !gemma4
                && self.dash.is_none()
                && ffn_act != Act::Gelu
                && (col.iter().any(|c| !c.is_empty()) || ffn_col.iter().any(|c| !c.is_empty()))
            {
                break;
            }
            let parts = (
                cw(wq),
                cw(wk),
                cw(wv),
                cw(wo),
                cw(gate_t),
                cw(up_t),
                cw(down_t),
            );
            let (Some(pq), Some(pk), Some(pv), Some(po), Some(pg), Some(pu), Some(pd)) = parts
            else {
                break;
            };
            let layer = &self.kv_cache.layers[li];
            if layer.mode != crate::kv_cache::KvMode::F32
                || (layer.o1.is_some() && !(self.o1_chunk_prefix && layer.o1_is_collecting()))
            {
                break;
            }
            // A trimmed tail holds every row the chunk's first query reads.
            debug_assert!(
                layer.base() == 0
                    || self
                        .layer_window(li)
                        .is_some_and(|w| layer.head_len(0) + 1 >= w)
            );
            stored_at.push(layer.head_len(0));
            // Per-layer geometry for Gemma-4 (512-wide global layers over
            // one KV head); every other model keeps the pipeline-wide one.
            let (nkv, hd) = if gemma4 {
                let (a, bb, _) = self.layer_geom(li);
                (a, bb)
            } else {
                (nkv, hd)
            };
            layers.push(crate::gpu_metal::ChunkLayer {
                model: &model,
                kv_id: self.graph_kv_id,
                layer: li,
                wq: pq,
                wk: pk,
                wv: pv,
                wo: po,
                gate: pg,
                up: pu,
                down: pd,
                input_norm: &lw.input_norm,
                post_norm: &lw.post_norm,
                bias: bias
                    .as_ref()
                    .map(|(a, bb, cc)| (a.as_slice(), bb.as_slice(), cc.as_slice())),
                q_norm: q_norm.as_deref(),
                k_norm: k_norm.as_deref(),
                inv_freq: &tables[li - li0],
                rope_scale: self.layer_rope_scale(li),
                rd: self.layer_geom(li).2,
                nh,
                nkv,
                hd,
                hs,
                inter: gate_t.rows(),
                gemma: matches!(self.norm_style, cortiq_core::NormStyle::Gemma),
                late_qk_norm: self.qk_norm_after_rope,
                eps: self.rms_eps as f32,
                window: self.layer_window(li),
                head_gate,
                act: ffn_act.graph_act().map_or(0, |a| a.code() as u8),
                g4: gemma4.then(|| crate::gpu_metal::ChunkGemma4 {
                    v_norm: self.attn_v_norm,
                    scale: self.attn_scale,
                    attn_out_norm: lw.attn_out_norm.as_deref(),
                    ffn_out_norm: lw.ffn_out_norm.as_deref(),
                    layer_scale: lw.layer_scale,
                }),
                col,
                // The plain dense branch alone reads it: routed experts and
                // Gemma-4 carry their own fields.
                ffn_col: if moe.is_none() && !gemma4 {
                    ffn_col
                } else {
                    [&[][..]; 3]
                },
                moe,
                dash: self.graph_dash(li),
            });
        }
        if layers.is_empty() {
            return li0;
        }
        // Unlimited-OCR: all of it or none of it (the router state).
        if self.dash.is_some() && (li0 != 0 || layers.len() != self.num_layers) {
            return li0;
        }
        // KV row width per layer (uniform but for Gemma-4).
        let rows_kv: Vec<(usize, usize)> = layers.iter().map(|l| (l.nkv, l.nkv * l.hd)).collect();
        let mut store: Vec<(Vec<f32>, Vec<f32>, Vec<f32>)> = stored_at
            .iter()
            .zip(&rows_kv)
            .map(|(&st, &(_, row))| (vec![0f32; b * row], vec![0f32; b * row], vec![0f32; st + b]))
            .collect();
        let mut io: Vec<crate::gpu_metal::ChunkIo> = Vec::with_capacity(layers.len());
        for (i, (ok, ov, oi)) in store.iter_mut().enumerate() {
            let li = layers[i].layer;
            let layer = &self.kv_cache.layers[li];
            let nkv = rows_kv[i].0;
            io.push(crate::gpu_metal::ChunkIo {
                cpu_stored: stored_at[i],
                cpu_gen: layer.generation(),
                cpu_k: (0..nkv).map(|g| layer.head_keys(g)).collect(),
                cpu_v: (0..nkv).map(|g| layer.head_values(g)).collect(),
                out_k: ok,
                out_v: ov,
                imp: oi,
            });
        }
        let n_run = layers.len();
        let last = layers.last().map(|l| l.layer + 1).unwrap_or(li0);
        // Device-side embedding when the run starts the model and the
        // embedding matrix is q8_row-mapped.
        let ep = embed_ids.and_then(|ids| {
            self.weights
                .embed_tokens
                .q8_row_parts()
                .map(|(idx, rows, _c, rs)| crate::gpu_metal::ChunkEmbed {
                    idx,
                    rows,
                    row_scale: rs,
                    ids,
                    mult: self.embed_multiplier,
                })
        });
        if embed_ids.is_some() && ep.is_none() {
            return li0;
        }
        if !crate::gpu_metal::chunk_run_gpu(&layers, &mut io, h, b, pos0, ep.as_ref()) {
            return li0;
        }
        drop(io);
        drop(layers);
        // CPU caches stay the owners of record: append the chunk rows
        // and bank the importance masses per layer.
        for (i, (ok, ov, oi)) in store.iter().enumerate().take(n_run) {
            let li = li0 + i;
            let row = rows_kv[i].1;
            let layer = &mut self.kv_cache.layers[li];
            for bi in 0..b {
                layer.append(
                    &ok[bi * row..(bi + 1) * row],
                    &ov[bi * row..(bi + 1) * row],
                    &[],
                );
            }
            layer.accumulate_imp(oi);
        }
        last
    }

    /// Is layer `li` a sliding-window (local-RoPE) layer? Gemma-3:
    /// every `pattern`-th layer is global, the rest are local.
    fn layer_is_local(&self, li: usize) -> bool {
        if let Some(layers) = &self.sliding_layers {
            return layers.get(li).copied().unwrap_or(false);
        }
        match self.swa {
            Some((_, pattern)) => (li + 1) % pattern.max(1) != 0,
            None => false,
        }
    }

    /// The RoPE table for layer `li` (local layers may have their own;
    /// Gemma-4 global layers use the proportional padded table).
    fn layer_inv_freq(&self, li: usize) -> std::sync::Arc<Vec<f32>> {
        if self.layer_is_local(li) {
            if let Some(f) = &self.inv_freq_local {
                return f.clone();
            }
        } else if let Some(f) = &self.inv_freq_global {
            return f.clone();
        }
        self.inv_freq.clone()
    }

    /// Layer `li`'s value-residual blend (None = V reads the normed input).
    fn layer_value_blend(&self, li: usize) -> Option<f32> {
        self.value_blend
            .as_ref()
            .and_then(|v| v.get(self.phys_layer(li)).copied())
    }

    /// The attend window for layer `li` (None = full context).
    fn layer_window(&self, li: usize) -> Option<usize> {
        self.swa
            .and_then(|(w, _)| self.layer_is_local(li).then_some(w))
    }

    /// Drop every sliding layer's rows its window can no longer read
    /// (`LayerKvCache::trim_window`). Call only at a safe point — after a
    /// complete position / pair / chunk walk, never between a layer's
    /// appends and its attend. One comparison per layer below the trigger.
    ///
    /// Off with an MTP head: its verify oracles and rollbacks snapshot and
    /// compare per-layer row counts as positions (`CMF_METAL_VERIFY_CHECK`,
    /// the MTP caches), which a trimmed tail would break.
    fn swa_trim_tails(&mut self) {
        let Some((slack, align)) = self.swa_trim else {
            return;
        };
        if self.mtp.is_some() || self.mimo_mtp.is_some() || !self.dsv4_mtp.is_empty() {
            return;
        }
        for li in 0..self.num_layers.min(self.kv_cache.layers.len()) {
            if let Some(w) = self.layer_window(li) {
                self.kv_cache.layers[li].trim_window_anchored(w, slack, align, self.swa_trim_anchor);
            }
        }
    }

    fn layer_num_heads(&self, li: usize) -> usize {
        self.attention_heads_per_layer
            .as_ref()
            .and_then(|v| v.get(li).copied())
            .unwrap_or(self.num_heads)
    }

    fn layer_rope_scale(&self, li: usize) -> f32 {
        if self.layer_is_local(li) {
            self.rope_scale_local
        } else {
            self.rope_scale
        }
    }

    /// Attention geometry of layer `li`: (num_kv_heads, head_dim,
    /// rotary_dim). Gemma-4 global layers override all three.
    fn layer_geom(&self, li: usize) -> (usize, usize, usize) {
        if !self.layer_is_local(li) {
            if let Some((ghd, gkv)) = self.global_attn {
                return (gkv, ghd, ghd);
            }
        }
        let rd = if self.layer_is_local(li) {
            self.rotary_dim_local.unwrap_or(self.rotary_dim)
        } else {
            self.rotary_dim
        };
        // A layer without positional encoding rotates nothing.
        let rd = if self
            .no_rope_layers
            .as_ref()
            .and_then(|v| v.get(li))
            .copied()
            == Some(true)
        {
            0
        } else {
            rd
        };
        (self.layer_num_kv_heads(li), self.head_dim, rd)
    }

    /// KV heads of layer `li` (virtual index): the per-layer count when the
    /// model has one (MiMo-V2), else the uniform `num_kv_heads`.
    fn layer_num_kv_heads(&self, li: usize) -> usize {
        self.kv_heads_per_layer
            .as_ref()
            .and_then(|v| v.get(self.phys_layer(li)).copied())
            .unwrap_or(self.num_kv_heads)
    }

    /// V head width of layer `li` (≤ its head_dim).
    fn layer_v_dim(&self, li: usize) -> usize {
        let (_, hd, _) = self.layer_geom(li);
        self.v_head_dim.unwrap_or(hd).min(hd)
    }

    /// Install a per-layer KV geometry: KV heads per PHYSICAL layer and/or
    /// a V head width narrower than `head_dim` (MiMo-V2). Validates it and
    /// reshapes the caches of every layer whose KV head count differs from
    /// `num_kv_heads`. The loader and the tests share this one path, so a
    /// hand-built pipeline cannot hold a geometry the loader would refuse.
    /// Call before the first forward (it drops cached rows of reshaped
    /// layers). Refuses combinations whose paths would read it wrong:
    /// Gemma-4 global layers and MLA carry their own geometry.
    pub fn set_attn_geometry(
        &mut self,
        kv_heads_per_layer: Option<Vec<usize>>,
        v_head_dim: Option<usize>,
    ) -> Result<(), String> {
        if kv_heads_per_layer.is_some() || v_head_dim.is_some() {
            if self.global_attn.is_some() {
                return Err(
                    "per-layer KV heads / v_head_dim cannot combine with Gemma-4 global \
                     attention geometry"
                        .into(),
                );
            }
            if self
                .weights
                .layers
                .iter()
                .any(|lw| matches!(lw.attn, AttnKind::Mla(_)))
            {
                return Err("per-layer KV heads / v_head_dim cannot combine with MLA".into());
            }
        }
        if let Some(vd) = v_head_dim {
            if vd == 0 || vd > self.head_dim {
                return Err(format!(
                    "v_head_dim {vd} must be in 1..={} (head_dim)",
                    self.head_dim
                ));
            }
        }
        if let Some(v) = &kv_heads_per_layer {
            if v.len() != self.physical_layers {
                return Err(format!(
                    "kv_heads_per_layer has {} entries, expected {} layers",
                    v.len(),
                    self.physical_layers
                ));
            }
            for (li, &nkv) in v.iter().enumerate() {
                let is_attn = matches!(
                    self.weights.layers.get(li).map(|lw| &lw.attn),
                    Some(AttnKind::Full { .. }) | None
                );
                if !is_attn {
                    continue;
                }
                let nh = self
                    .attention_heads_per_layer
                    .as_ref()
                    .and_then(|h| h.get(li).copied())
                    .unwrap_or(self.num_heads);
                if nkv == 0 || nh % nkv != 0 {
                    return Err(format!(
                        "layer {li}: {nkv} KV heads must be nonzero and divide {nh} Q heads"
                    ));
                }
            }
        }
        self.kv_heads_per_layer = kv_heads_per_layer;
        self.v_head_dim = v_head_dim.filter(|&vd| vd != self.head_dim);
        if self.kv_heads_per_layer.is_some() {
            for li in 0..self.kv_cache.layers.len() {
                let full = matches!(
                    self.weights
                        .layers
                        .get(self.phys_layer(li))
                        .map(|lw| &lw.attn),
                    Some(AttnKind::Full { .. })
                );
                let nkv = self.layer_num_kv_heads(li);
                let cache = &self.kv_cache.layers[li];
                if full && (cache.num_kv_heads != nkv || cache.head_dim != self.head_dim) {
                    let sinks = cache.sinks.clone();
                    self.kv_cache.layers[li] =
                        crate::kv_cache::LayerKvCache::new(nkv, self.head_dim);
                    self.kv_cache.layers[li].sinks = sinks;
                }
            }
        }
        Ok(())
    }

    /// Attach learned attention-sink logits (one per Q head) to PHYSICAL
    /// layer `phys` — every virtual layer that runs it. The loader calls
    /// this for each `model.layers.N.self_attn.sinks` tensor.
    pub fn set_layer_sinks(&mut self, phys: usize, sinks: Vec<f32>) -> Result<(), String> {
        let Some(lw) = self.weights.layers.get(phys) else {
            return Err(format!("sinks for layer {phys}: no such layer"));
        };
        if !matches!(lw.attn, AttnKind::Full { .. }) {
            return Err(format!(
                "sinks for layer {phys}: only softmax (Full) attention layers take sinks"
            ));
        }
        let nh = self
            .attention_heads_per_layer
            .as_ref()
            .and_then(|h| h.get(phys).copied())
            .unwrap_or(self.num_heads);
        if sinks.len() != nh {
            return Err(format!(
                "sinks for layer {phys}: {} values, expected one per Q head ({nh})",
                sinks.len()
            ));
        }
        if let Some(bad) = sinks.iter().find(|v| !v.is_finite()) {
            return Err(format!("sinks for layer {phys}: non-finite value {bad}"));
        }
        for li in 0..self.kv_cache.layers.len() {
            if self.phys_layer(li) == phys {
                self.kv_cache.layers[li].sinks = Some(sinks.clone());
            }
        }
        Ok(())
    }

    /// Why the GPU attention graphs cannot serve this model, if they
    /// cannot: the wgpu whole-token and batched graphs, the greedy
    /// multi-burst, the q1 attention dropin and the Metal block/chunk/rows
    /// graphs all assume ONE (num_kv_heads, head_dim) geometry, V heads as
    /// wide as K, a single RoPE table, full-context attention and a plain
    /// softmax. A model outside that contract runs on the CPU layer walk
    /// (and the per-op GPU matvecs) until a graph learns it — never on a
    /// graph that would read it wrong. None = no attention-level reason
    /// (the graph builders still check weights and layer kinds).
    pub fn graph_attn_decline_reason(&self) -> Option<&'static str> {
        if self.kv_heads_per_layer.is_some() {
            return Some("per-layer KV head counts");
        }
        if self.v_head_dim.is_some_and(|vd| vd != self.head_dim) {
            return Some("V heads narrower than Q/K heads");
        }
        if self.kv_cache.layers.iter().any(|l| l.sinks.is_some()) {
            return Some("learned attention sinks");
        }
        if self.swa.is_some() || self.sliding_layers.is_some() {
            return Some("sliding-window layers");
        }
        None
    }

    /// Can the Metal kernels apply this model's RoPE amplitude? Every
    /// rotation kernel (`attn_rope_qkn[_b]`, `chunk_rope_kv`) multiplies the
    /// rotated pair by the layer's `rope_scale` (YaRN `attention_factor`,
    /// Mellum2.1's global layers) exactly where the CPU's
    /// `rope_rotate_scaled` does. With the Q/K norm AFTER RoPE the kernels'
    /// shared sum of squares would be the unscaled one, so that pairing
    /// (no known model) declines.
    #[cfg(target_os = "macos")]
    fn metal_rope_scale_ok(&self) -> bool {
        !(self.qk_norm_after_rope
            && (0..self.num_layers).any(|li| self.layer_rope_scale(li) != 1.0))
    }

    /// Can the Metal block graph carry this model's sliding-window layers?
    /// Both of its attention forms take a layer's own window, RoPE table
    /// and rotary width: the device attend (`AttnDeviceParams::window`, the
    /// layer's `inv_freq`/`rd`) and the sandwich's host attend (exactly the
    /// CPU path's attention). True when the sliding window is the model's
    /// only attention-level decline (Spark-X2.5). Learned, value-less
    /// sinks may accompany that geometry: q1's ordinary device GQA
    /// includes the sink in its softmax denominator and disables split-K.
    /// Per-layer KV heads, narrow V and Gemma-4 global geometry still
    /// decline; a YaRN amplitude per layer rides along
    /// (`metal_rope_scale_ok`).
    ///
    /// Per-layer Q heads (Laguna) and capped scores (Gemma-2) decline here
    /// too, with V norm (Gemma-4): the chunk prefill's own gate checks
    /// neither of the first two, and before this door opened its `swa`
    /// refusal kept every sliding model with them off the chunk graph.
    #[cfg(target_os = "macos")]
    fn metal_graph_swa(&self) -> bool {
        (self.swa.is_some() || self.sliding_layers.is_some())
            && self.attention_heads_per_layer.is_none()
            && !self.attn_v_norm
            && self.attn_softcap == 0.0
            && self.kv_heads_per_layer.is_none()
            && self.v_head_dim.map_or(true, |vd| vd == self.head_dim)
            && self.global_attn.is_none()
            && self.inv_freq_global.is_none()
            && self.metal_rope_scale_ok()
            && !(0..self.num_layers).any(|li| {
                self.layer_is_local(li)
                    && self.inv_freq_local.is_none()
                    && self.rotary_dim_local.is_some_and(|r| r != self.rotary_dim)
            })
    }

    /// Can the Metal graphs carry this Gemma-4 model (`gpu_metal::gemma4`)?
    /// Its sliding layers (window, local RoPE table, 256-wide heads)
    /// device-attend like Spark-X2.5's; the 512-wide global layers (one KV
    /// head, proportional RoPE in the zero-padded table) take the 16-slot
    /// kernels; the V norm, sandwich norms, layer scalar and tanh-GELU come
    /// from the Gemma-4 library. Dense FFNs only (no Gemma-4 MoE measured).
    /// `CMF_METAL_GEMMA4=0` declines it as before (CPU attention).
    #[cfg(target_os = "macos")]
    fn metal_gemma4(&self) -> bool {
        crate::gpu_metal::gemma4::enabled()
            && (self.global_attn.is_some() || self.attn_v_norm)
            && self.attention_heads_per_layer.is_none()
            && self.kv_heads_per_layer.is_none()
            && self.v_head_dim.is_none()
            && !self.kv_cache.layers.iter().any(|l| l.sinks.is_some())
            && self.attn_softcap == 0.0
            && !self.qk_norm_after_rope
            && self.metal_rope_scale_ok()
            && self
                .weights
                .layers
                .iter()
                .all(|lw| matches!(&lw.ffn, FfnKind::Dense(d) if d.segs.is_empty()))
            && !(0..self.num_layers).any(|li| {
                self.layer_is_local(li)
                    && self.inv_freq_local.is_none()
                    && self.rotary_dim_local.is_some_and(|r| r != self.rotary_dim)
            })
    }

    /// Why the WGPU graphs (whole-token, batched prefill, greedy burst)
    /// cannot run this model's attention, if they cannot. Per-layer KV
    /// heads, V narrower than K, learned sinks and sliding windows ride
    /// their per-layer geometry (`GraphAttnGeom`, the ATTEND_X kernels);
    /// what that geometry does not express keeps the decline, by name.
    /// None for every model with one attention geometry.
    pub fn wgpu_graph_attn_decline(&self) -> Option<&'static str> {
        if self.value_blend.is_some() && !crate::gpu::vres_graph_on() {
            return Some("value residual");
        }
        // Keep the ordinary (uniform) fast arms off YaRN until they carry a
        // scale field too. A non-uniform geometry gets a `GraphAttnGeom` and
        // is handled below by the generic graph kernels.
        let geometry_reason = self.graph_attn_decline_reason();
        let has_scaled_rope = (0..self.num_layers).any(|li| self.layer_rope_scale(li) != 1.0);
        if has_scaled_rope && geometry_reason.is_none() {
            return Some("scaled RoPE without per-layer geometry");
        }
        // For Q/K norm after partial RoPE, the scale changes only the rotary
        // slice's RMS denominator. The generic graph deliberately declines
        // that uncommon combination until it carries a separate rotary sum;
        // Mellum has q/k norm before RoPE, so it remains on this path.
        if has_scaled_rope && self.qk_norm_after_rope {
            return Some("scaled RoPE with post-RoPE Q/K norm");
        }
        geometry_reason?;
        // Gemma-4: global layers 512 wide over 256-wide sliding ones
        // (`GraphAttnGeom::hd`), the scale-less V norm (`v_norm`), and the
        // sandwich norms + layer scalar (`GraphLayer`) ride the TOKEN graph.
        // The batch graph has none of the three and refuses them itself
        // (`batch_graph_gemma_decline`).
        if self.attention_heads_per_layer.is_some() {
            return Some("per-layer Q head counts with per-layer geometry");
        }
        // Sandwich norms are measured on Gemma-4 (the humanizer port) and
        // LFM3, both with plain x̂·w weights, against HF transformers;
        // Gemma-2/3's (1+w) norms keep the per-op path until they are
        // measured the same way, and a layer scale stays Gemma-4's.
        let gemma4 = self.global_attn.is_some() || self.attn_v_norm;
        let plain_norms = self.norm_style == cortiq_core::NormStyle::Qwen;
        if !gemma4
            && self.weights.layers.iter().any(|lw| {
                lw.layer_scale.is_some()
                    || (!plain_norms && (lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some()))
            })
        {
            return Some("sandwich norms / layer scale with per-layer geometry");
        }
        // `GraphAttnGeom::rope_scale` carries YaRN's post-rotation
        // attention-amplitude factor to the WGPU RoPE kernel. It is not an
        // angular position scale, so it must not be folded into `invf`.
        if self.weights.layers.iter().any(|lw| {
            matches!(
                &lw.attn,
                AttnKind::Full {
                    output_gate: true,
                    ..
                }
            )
        }) && self.v_head_dim.is_some()
        {
            return Some("gated attention with V narrower than K");
        }
        if (0..self.num_layers).any(|li| {
            self.layer_is_local(li)
                && self.inv_freq_local.is_none()
                && self.rotary_dim_local.is_some_and(|r| r != self.rotary_dim)
        }) {
            return Some("local rotary width without a local RoPE table");
        }
        None
    }

    /// What the wgpu BATCH graph (and the attention-only singleton graphs)
    /// cannot run of Gemma-4, which the token graph does run: per-layer
    /// head widths, the V norm, sandwich norms and the layer scalar.
    fn batch_graph_gemma_decline(&self) -> Option<&'static str> {
        // Gemma-4 rides `gemma_batch` (per-layer head width, V norm,
        // sandwich norms, layer scalar) unless CMF_G4_BATCH=0.
        if (self.global_attn.is_some() || self.attn_v_norm) && crate::gpu::g4_batch_on() {
            return None;
        }
        if self.global_attn.is_some() {
            return Some("per-layer head width (Gemma-4 global layers)");
        }
        if self.attn_v_norm {
            return Some("V norm");
        }
        // Sandwich norms alone ride the batch graph's plain tails (Ripple).
        if self.weights.layers.iter().any(|lw| lw.layer_scale.is_some()) {
            return Some("layer scale");
        }
        if self.value_blend.is_none()
            && self
                .weights
                .layers
                .iter()
                .any(|lw| lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some())
        {
            return Some("sandwich norms");
        }
        None
    }

    /// The wgpu graphs' attention geometry for layer `li` (virtual index):
    /// Some only for a model whose layers do not share one (MiMo-V2) — KV
    /// heads, V width, rotary width and RoPE table, window and sinks of
    /// THIS layer, exactly what the CPU attention reads for it.
    /// Unlimited-OCR: layer `li`'s router for the device graphs.
    fn graph_dash(&self, li: usize) -> Option<crate::gpu::GraphDash<'_>> {
        self.dash.as_deref().map(|d| {
            let l = &d.layers[li];
            crate::gpu::GraphDash {
                qk_proj: &l.qk_proj,
                q_norm: &l.q_norm,
                k_norm: &l.k_norm,
                head_cls: &l.head_cls,
                idx_scale: l.route.idx_scale,
                floor: l.route.floor,
                sigma: l.route.sigma,
                k: l.route.k,
                block: d.block,
                local_blocks: d.local_blocks,
                nblk: d.allow.len(),
                cands: &d.cands,
                coff: &d.coff,
                angles: &d.angles,
            }
        })
    }

    fn graph_attn_geom(&self, li: usize) -> Option<crate::gpu::GraphAttnGeom<'_>> {
        if self.dash.is_none() {
            self.graph_attn_decline_reason()?;
        }
        let (nkv, hd, rd) = self.layer_geom(li);
        let dash = self.graph_dash(li);
        let invf: &[f32] = if let Some(d) = self.dash.as_deref() {
            &d.angles
        } else if self.layer_is_local(li) {
            match &self.inv_freq_local {
                Some(f) => f.as_slice(),
                None => self.inv_freq.as_slice(),
            }
        } else {
            match &self.inv_freq_global {
                Some(f) => f.as_slice(),
                None => self.inv_freq.as_slice(),
            }
        };
        Some(crate::gpu::GraphAttnGeom {
            nkv,
            hd,
            dv: self.layer_v_dim(li),
            rd,
            invf,
            rope_scale: self.layer_rope_scale(li),
            window: self.layer_window(li),
            sink: self.kv_cache.layers[li].sinks.as_deref(),
            v_norm: self.attn_v_norm,
            dash,
            vres: None,
        })
    }

    /// `graph_attn_geom` with Ripple's value residual: the layer's blend and
    /// `e0`, the embedding rows of the graph call.
    fn graph_attn_geom_vres<'a>(&'a self, li: usize, e0: &'a [f32]) -> Option<crate::gpu::GraphAttnGeom<'a>> {
        let mut g = self.graph_attn_geom(li)?;
        g.vres = self.layer_value_blend(li).map(|b| (b, e0));
        Some(g)
    }

    /// The decode graph's device K/V mirror that layer `li`'s batched
    /// prefill appends its chunk to and attends against (wgpu), instead
    /// of uploading the layer's whole K/V prefix every chunk and the whole
    /// cache again at the first decode token. Only where the token graph
    /// will read that very mirror: the decode graph on, not refused, and
    /// this layer's geometry what it requests (`graph_attn_geom`: KV heads,
    /// V as wide as K, the window as a ring, no sink).
    ///
    /// Spark-X2.5 only (`proj_gate_sigmoid`), the one architecture whose
    /// output was measured identical on it. `CMF_PREFILL_MIRROR=0` keeps
    /// the host upload (A/B).
    #[cfg(feature = "gpu")]
    fn prefill_mirror_target(&self, li: usize) -> Option<crate::gpu::PrefillMirror> {
        if !self.proj_gate_sigmoid
            || std::env::var("CMF_PREFILL_MIRROR").as_deref() == Ok("0")
            || !crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode)
            || self.graph_refused()
            || self.o1_active()
            || self.attn_softcap > 0.0
            || self.wgpu_graph_attn_decline().is_some()
        {
            return None;
        }
        let g = self.graph_attn_geom(li)?;
        let (nkv, hd, _) = self.layer_geom(li);
        // The token graph passes the call-wide head width (layer 0's).
        if g.nkv != nkv || g.dv != hd || g.sink.is_some() || hd != self.layer_geom(0).1 {
            return None;
        }
        Some(crate::gpu::PrefillMirror {
            kv_id: self.graph_kv_id,
            layer: li,
            limit: self.kv_cache.max_seq_len,
        })
    }

    /// Bring the host KV cache of every Full-attention layer in
    /// `[from, upto)` up to `position` rows from the wgpu mirrors, where a
    /// device graph advanced a layer that the host is about to run: a
    /// device prefix that shrank since the prompt (or a batched prefill
    /// prefix longer than the decode one). A layer whose mirror does not
    /// hold the missing rows is left alone. Rows a sliding layer's ring
    /// no longer holds come back as zeros — outside every window that
    /// will read them.
    #[cfg(feature = "gpu")]
    fn pull_lagging_host_kv(&mut self, from: usize, upto: usize, position: usize) {
        let kv_id = self.graph_kv_id;
        for li in from..upto.min(self.num_layers) {
            if !matches!(
                self.weights.layers[self.phys_layer(li)].attn,
                AttnKind::Full { .. }
            ) {
                continue;
            }
            // Absolute: a trimmed sliding tail holds positions base.. only.
            let host = self.kv_cache.layers[li].pos_len();
            if host >= position {
                continue;
            }
            let Some(dev) = crate::gpu::graph_kv_stored(kv_id, li) else {
                continue;
            };
            let to = dev.min(position);
            if to <= host {
                continue;
            }
            let (nkv, hd) = {
                let c = &self.kv_cache.layers[li];
                (c.num_kv_heads, c.head_dim)
            };
            let Some((k, v, first_valid)) =
                crate::gpu::graph_kv_pull_host(kv_id, li, host, to, nkv, hd)
            else {
                continue;
            };
            // A sliding layer only ever reads its last `window` rows; a
            // full-context layer needs every row it did not have.
            let need_from = match self.layer_window(li) {
                Some(w) => host.max((position + 1).saturating_sub(w)),
                None => host,
            };
            if first_valid > need_from {
                tracing::warn!(
                    "layer {li}: device KV rows {host}..{to} no longer resident \
                     (from {first_valid}); host attention will miss them"
                );
            }
            let row = nkv * hd;
            let cache = &mut self.kv_cache.layers[li];
            for p in 0..to - host {
                cache.append(&k[p * row..(p + 1) * row], &v[p * row..(p + 1) * row], &[]);
            }
        }
    }

    /// Log (once per graph site and pipeline) that `site` declined for
    /// `reason`. The lines are kept so a caller or a test can read them.
    fn note_graph_decline(&self, site: &'static str, reason: &'static str) {
        let mut seen = self.graph_declines.borrow_mut();
        if !seen.iter().any(|&(s, r)| s == site && r == reason) {
            tracing::warn!("{site} declined: {reason} (CPU attention path)");
            seen.push((site, reason));
        }
    }

    /// The GPU-graph declines this pipeline has logged so far, as the
    /// logged lines.
    pub fn graph_declines(&self) -> Vec<String> {
        self.graph_declines
            .borrow()
            .iter()
            .map(|(site, reason)| format!("{site} declined: {reason} (CPU attention path)"))
            .collect()
    }

    /// Does layer `li` have the plain attention geometry the historical
    /// head-masked f32 path (`multi_head_attention`) assumes — pipeline-wide
    /// KV heads / head_dim / RoPE table, full context, no sink, V as wide
    /// as K? Anything else runs the dense `qwen_attention` instead.
    /// `CMF_LAYER_DUMP` writer (see `Pipeline::layer_dump`): one position's
    /// hidden after layer `li` as raw little-endian f32 into
    /// `<dir>/p{pos:06}_l{li:02}.f32`. A failed write is reported once and
    /// never stops the forward — the dump is a diagnostic.
    fn dump_layer_row(&self, pos: usize, li: usize, row: &[f32]) {
        let Some(dir) = &self.layer_dump else {
            return;
        };
        let mut bytes = Vec::with_capacity(row.len() * 4);
        for v in row {
            bytes.extend_from_slice(&v.to_le_bytes());
        }
        let path = dir.join(format!("p{pos:06}_l{li:02}.f32"));
        if let Err(e) = std::fs::create_dir_all(dir).and_then(|_| std::fs::write(&path, &bytes)) {
            use std::sync::atomic::{AtomicBool, Ordering};
            static SAID: AtomicBool = AtomicBool::new(false);
            if !SAID.swap(true, Ordering::Relaxed) {
                tracing::error!("CMF_LAYER_DUMP: cannot write {}: {e}", path.display());
            }
        }
    }

    /// Decide the MiMo-V2 expert placement once (`crate::mimo_moe`). Any
    /// other model turns the slot off on the first call.
    fn mimo_moe_prepare(&mut self) {
        if !self.mimo_moe.is_undecided() {
            return;
        }
        let slot = {
            let layers: Vec<(usize, &MoeFfn)> = (0..self.num_layers)
                .filter_map(
                    |li| match &self.weights.layers.get(self.phys_layer(li))?.ffn {
                        FfnKind::Moe(m) => Some((li, m)),
                        _ => None,
                    },
                )
                .collect();
            // One bank lives on one device: an in-process multi-GPU split
            // keeps the whole-layer path.
            if layers.is_empty()
                || self.physical_layers != self.num_layers
                || self.gpu_plan.is_some()
            {
                crate::mimo_moe::Slot::Off
            } else {
                // Whether a whole-token graph could run this model's layers
                // (then a whole-layer prefix is one submit, not per-layer
                // fences).
                let graph_prefix =
                    self.wgpu_graph_attn_decline().is_none() && crate::gpu::wgpu_graph_default();
                crate::mimo_moe::Slot::decide(&layers, self.num_layers, graph_prefix)
            }
        };
        self.mimo_moe = slot;
    }

    #[cfg(test)]
    pub(crate) fn test_graph_kv_id(&self) -> u64 {
        self.graph_kv_id
    }

    /// Dynamic MiMo layer: one device attention graph, followed by a bank
    /// frame. Both decode and short verification use this same attention
    /// path and absolute layer key; the host KV may intentionally lag.
    pub(crate) fn mimo_graph_layer_rows(
        &mut self,
        li: usize,
        h: &mut [f32],
        positions: &[usize],
    ) -> crate::gpu::BatchGraphOutcome {
        use crate::gpu::BatchGraphOutcome as Out;
        let b = positions.len();
        if !(1..=4).contains(&b)
            || h.len() != b * self.hidden_size
            || !self.mimo_moe.is_dynamic(li, true)
            || !crate::gpu::enabled_here()
            || !crate::gpu::wgpu_active()
            || self.o1_active()
            || self.physical_layers != self.num_layers
            // The pair-fusion diagnostic (and an explicit graph-off run)
            // rewinds only host KV. A hidden singleton attention graph here
            // would leave device mirrors ahead of the next host position.
            || std::env::var("CMF_GPU_WGPU_GRAPH").as_deref() == Ok("0")
            || std::env::var("CMF_MIMO_ATTN_GRAPH").as_deref() == Ok("0")
            || self.wgpu_graph_attn_decline().is_some()
        {
            return Out::Declined;
        }
        let attn_started = std::time::Instant::now();
        let outcome = {
            let lw = &self.weights.layers[li];
            if lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some() || lw.layer_scale.is_some() {
                return Out::Declined;
            }
            let FfnKind::Moe(m) = &lw.ffn else {
                return Out::Declined;
            };
            let AttnKind::Full {
                wq,
                wk,
                wv,
                wo,
                q_norm,
                k_norm,
                output_gate,
                softplus_gate,
                bias,
            } = &lw.attn
            else {
                return Out::Declined;
            };
            if *output_gate || softplus_gate.is_some() {
                return Out::Declined;
            }
            let Some(model) = wq.graph_weight().map(|(m, ..)| m.clone()).or_else(|| {
                m.experts
                    .first()?
                    .gate_proj
                    .mapped_q4tp()
                    .map(|(m, _)| m.clone())
            }) else {
                return Out::Declined;
            };
            fn gw<'a>(
                t: &'a QTensor,
                owner: &std::sync::Arc<cortiq_core::CmfModel>,
            ) -> Option<crate::gpu::GraphW<'a>> {
                if let Some((m, idx, kind, rs)) = t.graph_weight() {
                    if m.uid() != owner.uid() || t.has_prism_contract() {
                        return None;
                    }
                    return Some(crate::gpu::GraphW {
                        idx,
                        kind,
                        row_scale: rs,
                        data: &[],
                        prism: crate::gpu::GraphPrismOp::None,
                        affine: false,
                    });
                }
                t.as_f32().map(|data| crate::gpu::GraphW {
                    idx: 0,
                    kind: 4,
                    row_scale: &[],
                    data,
                    prism: crate::gpu::GraphPrismOp::None,
                    affine: false,
                })
            }
            let (Some(q), Some(k), Some(v), Some(o)) = (
                gw(wq, &model),
                gw(wk, &model),
                gw(wv, &model),
                gw(wo, &model),
            ) else {
                return Out::Declined;
            };
            let layer = crate::gpu::GraphLayer {
                mhc: None,
                input_norm: &lw.input_norm,
                post_norm: &lw.post_norm,
                attn_out_norm: None,
                ffn_out_norm: None,
                layer_scale: None,
                ffn: crate::gpu::GraphFfn::AttentionOnly,
                attn: crate::gpu::GraphAttn::Full {
                    wq: q,
                    wk: k,
                    wv: v,
                    wo: o,
                    q_norm: q_norm.as_deref(),
                    k_norm: k_norm.as_deref(),
                    late_qk_norm: self.qk_norm_after_rope,
                    bias: bias
                        .as_ref()
                        .map(|(q, k, v)| (q.as_slice(), k.as_slice(), v.as_slice())),
                    output_gate: false,
                    cpu_k: self.kv_cache.layers[li].k_heads(),
                    cpu_v: self.kv_cache.layers[li].v_heads(),
                    cpu_base: self.kv_cache.layers[li].base(),
                    geom: self.graph_attn_geom(li),
                    head_gate: None,
                },
            };
            let (nkv, hd, rd) = self.layer_geom(li);
            crate::gpu::forward_batch_graph_at(
                &model,
                self.graph_kv_id,
                li,
                &[layer],
                &self.inv_freq,
                h,
                self.layer_num_heads(li),
                nkv,
                hd,
                rd,
                self.hidden_size,
                1,
                positions,
                self.kv_cache.max_seq_len,
                self.norm_style == cortiq_core::NormStyle::Gemma,
                self.rms_eps as f32,
                self.attn_scale,
                b,
                &[],
                self.o1_epoch,
                None,
                None,
            )
        };
        match outcome {
            Out::Completed => {}
            Out::Declined => return Out::Declined,
            Out::Failed => {
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                return Out::Failed;
            }
        }
        let attn_ns = attn_started.elapsed().as_nanos() as u64;
        let hs = self.hidden_size;
        let lw = &self.weights.layers[li];
        let FfnKind::Moe(m) = &lw.ffn else {
            unreachable!()
        };
        let mut post = vec![0.0; h.len()];
        for (x, y) in h.chunks_exact(hs).zip(post.chunks_exact_mut(hs)) {
            inference::rms_norm_into(x, &lw.post_norm, self.rms_eps, self.norm_style, y);
        }
        let mut ffn = if b == 1 {
            moe_ffn_banked(&mut self.mimo_moe, li, m, &post, self.pool.as_deref())
        } else {
            moe_ffn_banked_rows(
                &mut self.mimo_moe,
                li,
                m,
                &post,
                b,
                hs,
                self.pool.as_deref(),
            )
        };
        for (x, &f) in h.iter_mut().zip(&ffn) {
            *x += f;
        }
        attention::recycle_buf(&mut ffn);
        if self.layer_dump.is_some() {
            for (&pos, row) in positions.iter().zip(h.chunks_exact(hs)) {
                self.dump_layer_row(pos, li, row);
            }
        }
        crate::mimo_moe::note_attention_graph(b, attn_ns);
        Out::Completed
    }

    fn layer_attn_plain(&self, li: usize) -> bool {
        self.kv_heads_per_layer.is_none()
            && self.v_head_dim.is_none()
            && self.global_attn.is_none()
            && self.layer_window(li).is_none()
            && self.kv_cache.layers[li].sinks.is_none()
    }

    /// Forward one position through all layers (hybrid dispatch).
    fn forward_layers(
        &mut self,
        hidden: &[f32],
        position: usize,
        task_mask: Option<&TaskMask>,
    ) -> Vec<f32> {
        let out = self.forward_layers_upto(hidden, position, task_mask, None);
        self.o1_progress();
        self.swa_trim_tails();
        out
    }

    // ── Network pipeline-split building blocks (coordinator/worker) ──
    // A remote worker owns layers [from ..= upto] and their KV; the
    // coordinator owns the rest plus embed / final norm / head. Attention
    // causality is per-layer, so a whole prompt's boundary hiddens ship
    // as one batch and decode ships one vector per token.

    /// Embed one token id (embed multiplier applied).
    pub fn embed_id(&self, id: u32) -> Vec<f32> {
        self.embed_single(id)
    }

    /// Refuse the archs/modes whose forward cannot be cut at a layer
    /// boundary. Loud by design: a split that silently changed the math
    /// would be a chimera.
    pub fn split_supported(&self) -> Result<(), String> {
        if self.dsv4.is_some() {
            return Err(
                "network split: DeepSeek-V4 runs its own fused stack (not splittable yet)".into(),
            );
        }
        if self.dory.is_some() {
            return Err("network split: Dory's looped stack is not splittable".into());
        }
        if self.dsv41.is_some() {
            return Err(
                "network split: DeepSeek-V4.1 owns the shared CED/CSA2 state (not splittable)"
                    .into(),
            );
        }
        if self.qwen4_exp.is_some() {
            return Err(
                "network split: Qwen3.8-Flash-Next hyper/QSA stack is not splittable yet".into(),
            );
        }
        if self.per_token_stack() {
            return Err(
                "network split: the per-token stack (gemma-3n AltUp / gemma-4 E-series) is not splittable yet".into(),
            );
        }
        if self.value_blend.is_some() {
            return Err(
                "network split: a value-residual stack (Ripple) reads the embedding row in every layer".into(),
            );
        }
        Ok(())
    }

    /// Forward `hidden` through layers [from ..= upto] at `position`,
    /// appending those layers' KV/state. Both split sides call this
    /// over their own range; a task mask applies to the span's own
    /// layers (each side masks what it runs).
    pub fn forward_span(
        &mut self,
        hidden: &[f32],
        position: usize,
        from: usize,
        upto: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<Vec<f32>, String> {
        self.split_supported()?;
        if from > upto || upto >= self.num_layers {
            return Err(format!(
                "forward_span: layer range {from}..={upto} outside 0..{}",
                self.num_layers
            ));
        }
        if hidden.len() != self.hidden_size {
            return Err(format!(
                "forward_span: hidden len {} ≠ hidden_size {}",
                hidden.len(),
                self.hidden_size
            ));
        }
        let out = self.forward_layers_span(hidden, position, task_mask, from, Some(upto));
        self.o1_progress();
        self.swa_trim_tails();
        if self
            .graph_failed
            .swap(false, std::sync::atomic::Ordering::Relaxed)
        {
            self.cancel
                .store(false, std::sync::atomic::Ordering::Relaxed);
            self.clear_sequence_state();
            return Err("forward_span: deferred O(1) transition failed".into());
        }
        Ok(out)
    }

    /// Final norm + lm_head over a boundary hidden (the final-logit
    /// softcap is applied by lm_head_forward itself).
    pub fn logits_from_hidden(&mut self, hidden: &[f32]) -> Vec<f32> {
        let normed = inference::rms_norm(
            hidden,
            &self.weights.final_norm,
            self.rms_eps,
            self.norm_style,
        );
        self.lm_head_forward(&normed)
    }

    /// Sample the next token with this pipeline's sampler state.
    pub fn sample_next(&mut self, logits: &[f32], past_tokens: &[u32]) -> u32 {
        sampler::sample_with_scratch(
            logits,
            &self.sampler_config,
            past_tokens,
            &mut self.rng,
            &mut self.sampler_scratch,
        )
    }

    /// Fresh sequence: clear KV, reuse history and device mirrors.
    pub fn reset_session(&mut self) {
        self.clear_sequence_state();
    }

    /// Batched span prefill from token ids (coordinator side): embed +
    /// layers [0 ..= upto]; returns the boundary hiddens of ALL positions
    /// (ids.len() × hidden). Rides the same layer-major machinery as the
    /// local prefill; falls back to the per-position walk under
    /// CMF_PREFILL=seq.
    pub fn prefill_span_ids(
        &mut self,
        ids: &[u32],
        start_pos: usize,
        upto: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<Vec<f32>, String> {
        self.split_supported()?;
        if upto >= self.num_layers {
            return Err(format!(
                "prefill_span_ids: upto {upto} outside 0..{}",
                self.num_layers
            ));
        }
        // Same predicate as the whole-stack prefill: a span whose GDN
        // state lives on the device must walk positions through the
        // graph, not through the batched CPU span.
        if self.can_prefill_batched() && !self.graph_prefill_preferred() {
            let out =
                self.prefill_batch_span(PrefillIn::Ids(ids), start_pos, task_mask, 0, upto + 1);
            self.check_o1_progress_failure("prefill_span_ids")?;
            Ok(out)
        } else {
            let hs = self.hidden_size;
            let mut out = Vec::with_capacity(ids.len() * hs);
            for (i, &id) in ids.iter().enumerate() {
                let emb = self.embed_id(id);
                out.extend_from_slice(&self.forward_span(
                    &emb,
                    start_pos + i,
                    0,
                    upto,
                    task_mask,
                )?);
            }
            Ok(out)
        }
    }

    /// Batched span prefill from boundary hiddens (worker side): layers
    /// [from ..= upto] for every position in the batch; returns the batch.
    pub fn prefill_span_hidden(
        &mut self,
        hidden: &[f32],
        start_pos: usize,
        from: usize,
        upto: usize,
        task_mask: Option<&TaskMask>,
    ) -> Result<Vec<f32>, String> {
        self.split_supported()?;
        let hs = self.hidden_size;
        if hidden.is_empty() || hidden.len() % hs != 0 {
            return Err(format!(
                "prefill_span_hidden: {} floats is not a multiple of hidden {hs}",
                hidden.len()
            ));
        }
        if from > upto || upto >= self.num_layers {
            return Err(format!(
                "prefill_span_hidden: layer range {from}..={upto} outside 0..{}",
                self.num_layers
            ));
        }
        if self.can_prefill_batched() && !self.graph_prefill_preferred() {
            let out = self.prefill_batch_span(
                PrefillIn::Hidden(hidden),
                start_pos,
                task_mask,
                from,
                upto + 1,
            );
            self.check_o1_progress_failure("prefill_span_hidden")?;
            Ok(out)
        } else {
            let b = hidden.len() / hs;
            let mut out = Vec::with_capacity(hidden.len());
            for i in 0..b {
                let h = self.forward_span(
                    &hidden[i * hs..(i + 1) * hs],
                    start_pos + i,
                    from,
                    upto,
                    task_mask,
                )?;
                out.extend_from_slice(&h);
            }
            Ok(out)
        }
    }

    /// Build the whole-token wgpu graph for a pure-attention q1 model (every
    /// layer Full q1 + dense q1 FFN, no gate/bias). Returns the post-stack
    /// hidden (caller does final norm + lm_head), or None to fall back.
    fn try_token_graph_wgpu(
        &self,
        hidden: &[f32],
        position: usize,
        logits_out: &mut Vec<f32>,
        layers_run: &mut usize,
    ) -> Option<Result<Vec<f32>, ()>> {
        self.try_token_graph_wgpu_steps(
            hidden,
            position,
            logits_out,
            1,
            None,
            Some(layers_run),
            0,
            self.num_layers,
        )
    }

    /// The span twin (network split): the graph covers [from..upto_excl)
    /// — one submit per SEGMENT per token. lm_head folds in only when
    /// the span reaches the last layer.
    fn try_token_graph_wgpu_span(
        &self,
        hidden: &[f32],
        position: usize,
        logits_out: &mut Vec<f32>,
        from: usize,
        upto_excl: usize,
        layers_run: &mut usize,
    ) -> Option<Result<Vec<f32>, ()>> {
        self.try_token_graph_wgpu_steps(
            hidden,
            position,
            logits_out,
            1,
            None,
            Some(layers_run),
            from,
            upto_excl,
        )
    }

    /// A device token graph (wgpu or CUDA) decodes this pipeline: the head
    /// of a row the graph did not run — the first token after a prompt —
    /// takes the graph's head pass as well (`CMF_HEAD_GRAPH=0`: the host
    /// head, as before).
    ///
    /// The host head of a q8 file on a GPU run is a hybrid: half of the
    /// vocabulary's rows on the card in f32, the other half on the CPU with
    /// integer activations (`gpu_split_frac`). Every later token's logits
    /// come from the graph's fused head, so that one row alone carried the
    /// integer half. Spark-X2.6-4B q8_2f on an A40 over Vulkan, against the
    /// host with float activations: first-token logits 0.29 off (and a
    /// near-tie token flipped on one prompt in four), every other token
    /// 0.015; through the graph's head the first token is 0.014 off too.
    /// On wgpu only those two codecs take it (`m3_device_logits`): a q4tp
    /// head measured the same either way.
    #[cfg(feature = "gpu")]
    fn graph_head_after_prompt(&self) -> bool {
        (crate::gpu::wgpu_active() || crate::gpu::cuda_active())
            && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode)
            && !self.graph_refused()
            && std::env::var("CMF_HEAD_GRAPH").as_deref() != Ok("0")
    }

    /// The pooled tail's device lm_head: final-norm + head as one
    /// layer-less graph pass, so decode stops paying the double-digit
    /// millisecond host matvec every token. `None` keeps the host head.
    /// Also the head of the first token after a prompt wherever a device
    /// graph decodes (`graph_head_after_prompt`).
    #[cfg(feature = "gpu")]
    fn m3_device_logits(&self, hidden: &[f32]) -> Option<Vec<f32>> {
        let pooled = crate::minicpm_tail::minimax_pool_on();
        if !(pooled || self.graph_head_after_prompt())
            || !crate::gpu::enabled_here()
            || self.head_clusters.is_some()
            || self.graph_failed.load(std::sync::atomic::Ordering::Relaxed)
            || std::env::var("CMF_GPU_LMHEAD").map(|v| v != "0") == Ok(false)
        {
            return None;
        }
        let (model, i, kind, rs) = self
            .weights
            .lm_head
            .graph_weight()
            .or_else(|| self.weights.lm_head.graph_weight_descriptor())?;
        // After a prompt on wgpu: the codecs whose host head is the hybrid
        // (q8 by rows, q8_2f). CUDA has no host GPU head at all.
        if !pooled && !crate::gpu::cuda_active() && !matches!(kind, 0 | 7) {
            return None;
        }
        let name = &model.tensors[i].name;
        let prism = if crate::prism::is_inverse_embedding(&model, name) {
            crate::gpu::GraphPrismOp::InverseEmbedding
        } else if crate::prism::is_forward_weight(&model, name) {
            crate::gpu::GraphPrismOp::Forward
        } else {
            crate::gpu::GraphPrismOp::None
        };
        let gw = crate::gpu::GraphW {
            idx: i,
            kind,
            row_scale: rs,
            data: &[],
            prism,
            affine: crate::prism::is_affine_target(&model, name),
        };
        let rows = self.weights.lm_head.rows();
        let mut h = hidden.to_vec();
        let mut lg = Vec::new();
        let mut layers_run = 0usize;
        let outcome = crate::gpu::forward_token_graph(
            &model,
            self.graph_kv_id,
            &[],
            &[],
            self.o1_epoch,
            &self.inv_freq,
            &mut h,
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.attn_scale,
            self.head_dim,
            self.hidden_size,
            self.intermediate_size,
            0,
            self.kv_cache.max_seq_len,
            self.norm_style == cortiq_core::NormStyle::Gemma,
            self.rms_eps as f32,
            Some((&gw, rows)),
            &self.weights.final_norm,
            &mut lg,
            &[],
            1,
            None,
            None,
            Some(&mut layers_run),
            0,
            false,
        );
        if outcome != crate::gpu::TokenGraphOutcome::Completed || lg.is_empty() {
            return None;
        }
        // The same post-steps the host head applies — keep sampling
        // identical whichever arm produced the logits.
        lg.resize(self.vocab_size, 0.0);
        if let Some(m) = self.logit_multiplier {
            for l in lg.iter_mut() {
                *l *= m;
            }
        }
        if let Some(c) = self.final_softcap {
            softcap_in_place(&mut lg, c, self.pool.as_deref());
        }
        Some(lg)
    }

    /// Record one token-layer's winners into the route-frequency profile and
    /// write it out every 16 tokens when `CMF_M3_PROFILE_SAVE=<path>` is set.
    fn m3_note_route(&mut self, li: usize, winners: &[u32]) {
        if winners.is_empty() {
            return;
        }
        if self.m3_n_exp == 0 {
            self.m3_n_exp = crate::minicpm_tail::minimax_n_experts(&self.weights.layers, self.phys_layer(0)).max(1);
            self.m3_counts = vec![0; self.num_layers * self.m3_n_exp];
        }
        for &e in winners {
            let e = e as usize;
            if e < self.m3_n_exp && li < self.num_layers {
                self.m3_counts[li * self.m3_n_exp + e] = self.m3_counts[li * self.m3_n_exp + e].saturating_add(1);
            }
        }
        if li + 1 == self.num_layers {
            self.m3_tokens += 1;
            if self.m3_tokens % 16 == 0 {
                if let Ok(path) = std::env::var("CMF_M3_PROFILE_SAVE") {
                    let bytes: Vec<u8> = self.m3_counts.iter().flat_map(|c| c.to_le_bytes()).collect();
                    let _ = std::fs::write(&path, bytes);
                }
            }
        }
    }

    /// Admit the most frequent (layer, expert) pairs of a saved profile into
    /// the bank before the first token: `CMF_M3_PROFILE=<path>` names the
    /// file, `CMF_M3_PREWARM_N` (default 300) bounds how many experts go in.
    /// The bank's own eviction stays in charge; prewarm only chooses order.
    fn m3_prewarm(&mut self) {
        let Ok(path) = std::env::var("CMF_M3_PROFILE") else {
            return;
        };
        let Ok(bytes) = std::fs::read(&path) else {
            tracing::warn!("m3 prewarm: cannot read profile {path}");
            return;
        };
        let counts: Vec<u32> = bytes
            .chunks_exact(4)
            .map(|b| u32::from_le_bytes([b[0], b[1], b[2], b[3]]))
            .collect();
        let n_exp = crate::minicpm_tail::minimax_n_experts(&self.weights.layers, self.phys_layer(0)).max(1);
        if counts.len() != self.num_layers * n_exp {
            tracing::warn!("m3 prewarm: profile size {} does not match {}x{}", counts.len(), self.num_layers, n_exp);
            return;
        }
        let limit: usize = std::env::var("CMF_M3_PREWARM_N")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(300);
        let mut ranked: Vec<(u32, usize, usize)> = counts
            .iter()
            .enumerate()
            .filter(|(_, c)| **c > 0)
            .map(|(i, &c)| (c, i / n_exp, i % n_exp))
            .collect();
        ranked.sort_unstable_by(|a, b| b.0.cmp(&a.0).then(a.1.cmp(&b.1)).then(a.2.cmp(&b.2)));
        ranked.truncate(limit);
        let mut per_layer: Vec<Vec<usize>> = vec![Vec::new(); self.num_layers];
        for (_, li, e) in ranked {
            per_layer[li].push(e);
        }
        let mut admitted = 0usize;
        for (li, ids) in per_layer.iter().enumerate() {
            if ids.is_empty() {
                continue;
            }
            let lw = &self.weights.layers[self.phys_layer(li)];
            let FfnKind::Moe(m) = &lw.ffn else {
                continue;
            };
            // Arming installs the layer's layout; nothing predicted yet.
            let _ = crate::minicpm_tail::minimax_pool_arm(m, li, self.num_layers, &[]);
            if crate::minicpm_tail::minimax_pool_ensure(m, li, self.num_layers, ids) {
                admitted += ids.len();
            }
        }
        tracing::info!("m3 prewarm: admitted {admitted} experts from {path}");
    }

    /// One MiniMax tail layer through the pooled token-graph arm: attention,
    /// the pre-FFN norm, device routing and the descriptor-indexed expert
    /// bank in ONE submit (one sync instead of host attention + a MoE
    /// frame), with cold experts finished on the host against the read-back
    /// FFN input and admitted for the next token.
    ///
    /// `Ok(true)` — the layer is done (hidden replaced). `Ok(false)` —
    /// decline before any device mutation; the ordinary host path owns this
    /// position. `Err(())` — the device failed after admission; the caller
    /// must stop the sequence exactly like a failed span run.
    #[cfg(feature = "gpu")]
    fn m3_pooled_layer(&mut self, li: usize, position: usize, h: &mut Vec<f32>) -> Result<bool, ()> {
        if self.o1_active() || self.attn_softcap > 0.0 {
            return Ok(false);
        }
        if !self.m3_prewarmed {
            self.m3_prewarmed = true;
            self.m3_prewarm();
        }
        let frame = {
            let lw = &self.weights.layers[self.phys_layer(li)];
            let FfnKind::Moe(m) = &lw.ffn else {
                return Ok(false);
            };
            if !crate::minicpm_tail::MiniCpmTail::is_requested_target(m) {
                return Ok(false);
            }
            let t_arm = std::time::Instant::now();
            if self.m3_winners.len() != self.num_layers {
                self.m3_winners = vec![Vec::new(); self.num_layers];
            }
            let pred = std::mem::take(&mut self.m3_winners[li]);
            let armed = crate::minicpm_tail::minimax_pool_arm(m, li, self.num_layers, &pred);
            if armed.is_none() {
                self.m3_winners[li] = pred; // declined before anything ran
            }
            M3_ARM_NS.fetch_add(t_arm.elapsed().as_nanos() as u64, std::sync::atomic::Ordering::Relaxed);
            match armed {
                Some(frame) => frame,
                // First-call refusal (geometry/bank): the host layer still
                // runs; nothing was mutated.
                None => return Ok(false),
            }
        };
        crate::gpu_wgpu::pooled_frame_enter(frame);
        // The pooled call must not fold lm_head: its cold experts have to
        // land before any final norm. The decode loop re-arms this flag for
        // the next position anyway.
        let want_logits = self.graph_want_logits;
        self.graph_want_logits = false;
        let mut lg = Vec::new();
        let mut gl = 0usize;
        let t_span = std::time::Instant::now();
        let span = crate::gpu::gpu_scope(|| {
            self.try_token_graph_wgpu_span(h, position, &mut lg, li, li + 1, &mut gl)
        });
        self.graph_want_logits = want_logits;
        M3_SPAN_NS.fetch_add(t_span.elapsed().as_nanos() as u64, std::sync::atomic::Ordering::Relaxed);
        let hh = match span {
            Some(Ok(hh)) => hh,
            Some(Err(())) => return Err(()),
            None => {
                // Declined before submission (seed/resolve/refusal): the
                // device mirror has not moved, so the host path is exact.
                return Ok(false);
            }
        };
        if gl != 1 {
            // A single-layer run that reports no layer mutated nothing we
            // may build on; anything else is a contract break.
            return if gl == 0 { Ok(false) } else { Err(()) };
        }
        *h = hh;
        let winners = crate::gpu_wgpu::pooled_frame_take_winners();
        self.m3_note_route(li, &winners);
        if self.m3_winners.len() != self.num_layers {
            self.m3_winners = vec![Vec::new(); self.num_layers];
        }
        self.m3_winners[li] = winners;
        let mut cold = crate::gpu_wgpu::pooled_frame_take_cold();
        // A non-finite parsed weight would poison the residual for the rest
        // of the sequence — drop such entries loudly instead.
        cold.retain(|&(_, w)| {
            if w.is_finite() {
                true
            } else {
                tracing::error!("pooled tail: non-finite cold weight from expert route");
                false
            }
        });
        if cold.is_empty() {
            return Ok(true);
        }
        let x = crate::gpu_wgpu::pooled_frame_take_input();
        if x.len() != self.hidden_size {
            return Err(());
        }
        // Cold experts: on the device first (admit, then one prepared frame
        // over exactly those slots — one submit for the layer). The host
        // computes them only when the device declines, and then they are
        // admitted for the next token. `CMF_M3_COLD_CPU=1` forces the host
        // arm for an A/B measurement.
        let lw = &self.weights.layers[self.phys_layer(li)];
        let FfnKind::Moe(m) = &lw.ffn else {
            return Err(());
        };
        let t_cold = std::time::Instant::now();
        let force_host = std::env::var("CMF_M3_COLD_CPU").as_deref() == Ok("1");
        let mut out = crate::attention::take_buf(self.hidden_size);
        let on_device = !force_host
            && crate::minicpm_tail::minimax_cold_device(m, li, self.num_layers, &cold, &x, &mut out);
        if !on_device {
            crate::attention::recycle_buf(&mut out);
            let jobs: Vec<(&crate::pipeline::DenseFfn, f32)> = cold
                .iter()
                .map(|&(e, w)| m.experts.get(e).map(|ex| (ex, w)).ok_or(()))
                .collect::<Result<_, ()>>()?;
            out = crate::gpu::cpu_scope(|| {
                crate::pipeline::moe_cold_experts_cpu(&jobs, &x, self.pool.as_deref())
            });
            let ids: Vec<usize> = cold.iter().map(|&(e, _)| e).collect();
            let _ = crate::minicpm_tail::minimax_pool_ensure(m, li, self.num_layers, &ids);
        }
        M3_COLD_NS.fetch_add(t_cold.elapsed().as_nanos() as u64, std::sync::atomic::Ordering::Relaxed);
        M3_COLD_N.fetch_add(cold.len() as u64, std::sync::atomic::Ordering::Relaxed);
        if out.len() != h.len() {
            crate::attention::recycle_buf(&mut out);
            return Err(());
        }
        for (dst, src) in h.iter_mut().zip(out.iter()) {
            *dst += src;
        }
        crate::attention::recycle_buf(&mut out);
        if on_device {
            M3_COLD_DEV_N.fetch_add(cold.len() as u64, std::sync::atomic::Ordering::Relaxed);
        }
        Ok(true)
    }

    #[cfg(not(feature = "gpu"))]
    fn m3_pooled_layer(
        &mut self,
        _li: usize,
        _position: usize,
        _h: &mut Vec<f32>,
    ) -> Result<bool, ()> {
        Ok(false)
    }

    /// Greedy burst: forward `t_next` and let the device pick + re-embed
    /// the next k−1 tokens — k frames, ONE submit, k ids back. The ZML
    /// trade, on wgpu. None ⇒ caller keeps the per-token path.
    fn try_multi_burst(&self, t_next: u32, position: usize, k: usize) -> Option<Vec<u32>> {
        if self.o1_active() || self.attn_softcap > 0.0 {
            return None;
        }
        // The burst builds the whole-token graph; attention the graph's
        // per-layer geometry cannot express keeps the per-token path.
        if let Some(reason) = self.wgpu_graph_attn_decline() {
            self.note_graph_decline("wgpu multi-burst", reason);
            return None;
        }
        let graph_on = crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode);
        if !graph_on || self.graph_refused() {
            // Same memo as the decode site: this path builds the very
            // same graph, so a model it cannot build for must not be
            // walked again here either. Missing this guard was worth
            // 2.5x on an Adreno — 0.361 tok/s against 0.905 — because
            // the burst retried per token what decode had already given
            // up on.
            return None;
        }
        let emb = self.embed_single(t_next);
        let mut lg = Vec::new();
        let mut ids = Vec::new();
        match self.try_token_graph_wgpu_steps(
            &emb,
            position,
            &mut lg,
            k,
            Some(&mut ids),
            None,
            0,
            self.num_layers,
        ) {
            Some(Ok(_)) => {}
            Some(Err(())) => {
                // Preserve the backend's post-admission failure through the
                // Option-based burst API.  The decode caller consumes this
                // flag and clears the sequence instead of falling through
                // to a stale CPU recurrent state.
                self.graph_failed
                    .store(true, std::sync::atomic::Ordering::Relaxed);
                return None;
            }
            None => return None,
        }
        (ids.len() == k).then_some(ids)
    }

    /// The sequence may keep f16 K/V mirrors on the wgpu graphs (`kv16`):
    /// nothing it runs reads f32 mirror rows — no MTP head, no drafter, no
    /// O(1) seal, no block preview.
    fn kv16_allowed(&self) -> bool {
        self.mtp.is_none()
            && self.dflash.is_none()
            && !self.o1_active()
            && !self.is_block_diffusion()
            && self.clover.is_none()
    }

    /// Multi-step greedy: k whole frames in ONE submit, argmax and re-embed
    /// on the device. `ids_out` receives the k winner ids; the hidden/logits
    /// outputs are NOT produced in that mode.
    fn try_token_graph_wgpu_steps(
        &self,
        hidden: &[f32],
        position: usize,
        logits_out: &mut Vec<f32>,
        steps: usize,
        ids_out: Option<&mut Vec<u32>>,
        layers_run: Option<&mut usize>,
        from: usize,
        upto_excl: usize,
    ) -> Option<Result<Vec<f32>, ()>> {
        crate::gpu::graph_kv16_note(self.graph_kv_id, self.kv16_allowed());
        // SenseNova-Loop: MRoPE prompt rows rotate on the host; the graph's
        // mHC kernels take two streams only, and a graph must not enter an
        // mHC range midway (its streams would be the host's).
        if self.prompt_mrope.is_some()
            || self.mhc.as_deref().is_some_and(|m| {
                from < self.num_layers && m.on(self.phys_layer(from)) && !m.enters(self.phys_layer(from))
            })
            || self.mhc.as_ref().is_some_and(|m| m.s.streams != 2 || m.s.fixed_identity)
            || std::env::var("CMF_MHC_GRAPH").as_deref() == Ok("0")
                && (from..upto_excl.min(self.num_layers)).any(|li| self.mhc_layer(li))
        {
            return None;
        }
        // The bank has already reserved its VRAM. Never build a second
        // all-expert arena across bank-owned layers (including bursts).
        let upto_excl = match self.mimo_moe.graph_prefix_end() {
            Some(end) if end < upto_excl => {
                if steps != 1 || layers_run.is_none() || from >= end {
                    return None;
                }
                end
            }
            _ => upto_excl,
        };
        // O(1) Nyström decode runs off the sealed state, not the KV cache the
        // graph mirrors — never take the graph while o1 is active.
        let o1_gpu = self.o1_on_graph();
        if (self.o1_active() && !o1_gpu) || self.attn_softcap > 0.0 {
            // Softcapped scores have no graph kernel yet — CPU owns them.
            // o1 rides the graph only behind CMF_O1_GPU=1 while the port
            // proves itself; without it the CPU path owns o1 as before.
            return None;
        }
        // Per-layer KV heads, narrow V, sinks and sliding windows ride
        // `GraphAttn::Full::geom` (the ATTEND_X kernels). Anything that
        // geometry cannot express declines here, by name — before the
        // per-layer gate existed a sliding/sink model ran the graph as
        // full-context attention, fluent and wrong. The caller memoizes
        // the refusal.
        if let Some(reason) = self.wgpu_graph_attn_decline() {
            self.note_graph_decline("wgpu token graph", reason);
            return None;
        }
        // Per-layer sealed o1 state for the graph. During prefill the
        // state is still Collecting -> views are None -> the graph
        // refuses below and the CPU prefill records the q trace and
        // seals, exactly as the o1 design requires.
        let o1_views: Vec<Option<Vec<crate::nystrom::O1DeviceView<'_>>>> = (from..upto_excl)
            .map(|li| {
                if !o1_gpu {
                    return None;
                }
                self.kv_cache.layers[self.phys_layer(li)].o1_views()
            })
            .collect();
        if self.o1_active() && o1_gpu {
            // Any o1 layer not sealed (or degenerate exact-only) keeps the
            // whole token on the CPU: half-graph forwards would desync.
            let want: usize = (from..upto_excl)
                .filter(|li| self.kv_cache.layers[self.phys_layer(*li)].o1.is_some())
                .count();
            let have = o1_views.iter().filter(|v| v.is_some()).count();
            if want == 0 || have != want {
                // The silent twin of the gpu-side o1 gates, found the
                // same way: a 15x decode drop with an empty log. Views
                // stay None until the layer's state SEALS, so `have`
                // lagging `want` early in a run is the o1 design working
                // — but it must say so, or the next reader spends a
                // night proving the kernels innocent.
                // On CHANGE, not once: the first decline is the legal
                // unsealed prefill, and a once-print buries the state
                // that matters — what the count reads AFTER the seal.
                use std::sync::atomic::{AtomicUsize, Ordering};
                static LAST: AtomicUsize = AtomicUsize::new(usize::MAX);
                let code = have * 1000 + want;
                if LAST.swap(code, Ordering::Relaxed) != code {
                    tracing::warn!(
                        "o1 graph: {have} of {want} layers sealed — per-op until all seal"
                    );
                }
                return None;
            }
        }
        let nh = self.num_heads;
        let (nkv, hd, rd) = self.layer_geom(0);
        let gemma = self.norm_style == cortiq_core::NormStyle::Gemma;
        // Ripple's value residual: the embedding row of this position. A
        // span past the first layer reads the one `forward_layers_span` kept.
        let vres_e0: &[f32] = if from == 0 { hidden } else { &self.vres_e0 };
        let mut layers = Vec::with_capacity(upto_excl - from);
        let mut model = None;
        let dbg = std::env::var("CMF_GRAPH_DEBUG").is_ok();
        fn gw(t: &QTensor) -> Option<crate::gpu::GraphW<'_>> {
            // `blr` rides as GRAPH_KIND_BLR (two stage dispatches).
            if let Some((m, i, kind, rs)) = t.graph_weight_or_blr() {
                let name = &m.tensors[i].name;
                let prism = if crate::prism::is_inverse_embedding(m, name) {
                    crate::gpu::GraphPrismOp::InverseEmbedding
                } else if crate::prism::is_forward_weight(m, name) {
                    crate::gpu::GraphPrismOp::Forward
                } else {
                    crate::gpu::GraphPrismOp::None
                };
                return Some(crate::gpu::GraphW {
                    idx: i,
                    kind,
                    row_scale: rs,
                    data: &[],
                    prism,
                    affine: crate::prism::is_affine_target(m, name),
                });
            }
            // Small unquantized projections (GDN in_proj_a/b) stay f32.
            match t.as_f32() {
                Some(d) => Some(crate::gpu::GraphW {
                    idx: 0,
                    kind: 4,
                    row_scale: &[],
                    data: d,
                    prism: crate::gpu::GraphPrismOp::None,
                    affine: false,
                }),
                None => {
                    if std::env::var_os("CMF_BATCH_DEBUG").is_some() {
                        eprintln!("batch graph: weight has no graph/f32 representation");
                    }
                    None
                }
            }
        }
        for li in from..upto_excl {
            let lw = &self.weights.layers[self.phys_layer(li)];
            if dbg {
                let ak = match &lw.attn {
                    AttnKind::Mla(_) => "Mla".into(),
                    AttnKind::Full {
                        output_gate, bias, ..
                    } => format!("Full gate={output_gate} bias={}", bias.is_some()),
                    AttnKind::LinearGdn(_) => "LinearGdn".into(),
                    AttnKind::Kda(_) => "Kda".into(),
                    AttnKind::Linear(_) => "Linear".into(),
                    AttnKind::ShortConv(_) => "ShortConv".into(),
                    AttnKind::Bounded(_) => "Bounded".into(),
                };
                let fk = match &lw.ffn {
                    FfnKind::Dense(_) => "Dense",
                    FfnKind::Moe(_) => "Moe",
                    FfnKind::DenseMoe(_) => "DenseMoe",
                };
                eprintln!("graph L{li}: attn={ak} ffn={fk}");
            }
            let gffn = match &lw.ffn {
                FfnKind::DenseMoe(_) => return None, // dual branch: CPU path
                // A tube layer is several matrices, not one. The graph has
                // a shape for the core with one more triple that is always
                // on (a hot-neuron file); task tubes keep the segmented path.
                FfnKind::Dense(d) if d.segs.len() > 1 => return None,
                FfnKind::Dense(d) => {
                    // An activation the graph has no kernel arm for keeps
                    // the CPU/per-op owner, by name — the dense graph FFN
                    // used to compute SiLU for whatever the model asked.
                    let Some((act, limit)) = d.act.dense_graph_contract() else {
                        self.note_graph_decline(
                            "wgpu token graph",
                            "dense FFN activation without a graph kernel",
                        );
                        return None;
                    };
                    crate::gpu::GraphFfn::Dense {
                        gate: gw(&d.gate_proj)?,
                        up: gw(&d.up_proj)?,
                        down: gw(&d.down_proj)?,
                        act,
                        limit,
                        hot: match d.segs.first() {
                            Some(seg) => Some(crate::gpu::GraphMoeDetachedShared {
                                gate: gw(&seg.gate)?,
                                up: gw(&seg.up)?,
                                down: gw(&seg.down)?,
                                width: seg.width,
                            }),
                            None => None,
                        },
                    }
                }
                FfnKind::Moe(m) => {
                    // Adaptive τ and expert masks keep the CPU path, where
                    // they are implemented. Sigmoid routing with a selection
                    // bias (LFM2-MoE / DeepSeek noaux_tc), a routed scale ≠ 1
                    // and an UNGATED shared expert (HunYuan hy_v3: ×2.826 on
                    // the routed mix, the shared expert at weight 1) are all
                    // graphed — before, every such token fell to the per-op
                    // path whole (145 submits/token on Hy-MT2-30B-A3B).
                    if m.route_tau.is_some() || m.mask.is_some() {
                        return None;
                    }
                    let shared = m.shared.as_ref();
                    // The resident MoE kernels do not yet carry the
                    // descriptor-aware transform through router/shared-gate
                    // selection.  Refuse the complete layer instead of
                    // scoring with an untransformed Prism plane (the dense
                    // path has an explicit FWHT boundary below).
                    let inter = m.experts.first()?.gate_proj.rows();
                    // Flint's shared expert is a 1024-wide SwiGLU while its
                    // routed bank is 512-wide.  The resident MoE shader
                    // indexes a uniform-width packed bank, so keep that
                    // expert out of the routed slots and add it through the
                    // dense q4tp path after routed accumulation.  This is
                    // also the safe route for a mixed q2-routed/q4-shared
                    // artifact: neither layout nor row stride is faked.
                    let detached_shared = match shared {
                        Some((se, None))
                            if se.gate_proj.rows() != inter || se.up_proj.rows() != inter =>
                        {
                            let q4 = se.gate_proj.mapped_q4tp().is_some()
                                && se.up_proj.mapped_q4tp().is_some()
                                && se.down_proj.mapped_q4tp().is_some();
                            let q8 = se.gate_proj.mapped_q8_2f().is_some()
                                && se.up_proj.mapped_q8_2f().is_some()
                                && se.down_proj.mapped_q8_2f().is_some();
                            if !matches!(se.act, Act::Silu) || !(q4 || q8) {
                                return None;
                            }
                            Some(crate::gpu::GraphMoeDetachedShared {
                                gate: gw(&se.gate_proj)?,
                                up: gw(&se.up_proj)?,
                                down: gw(&se.down_proj)?,
                                width: se.gate_proj.rows(),
                            })
                        }
                        // A separately shaped gated shared expert needs a
                        // second sigmoid gate path.  Do not turn it into an
                        // ungated one merely to make the graph run.
                        Some((se, Some(_)))
                            if se.gate_proj.rows() != inter || se.up_proj.rows() != inter =>
                        {
                            return None;
                        }
                        _ => None,
                    };
                    let has_shared = shared.is_some() && detached_shared.is_none();
                    let shared_gated = has_shared && matches!(shared, Some((_, Some(_))));
                    let sgate = match shared {
                        Some((_, Some(sg))) if has_shared => gw(sg)?,
                        // No gate, no shared expert, or a detached shared
                        // expert: the router only keeps the binding total;
                        // the selection shader does not read it.
                        _ => gw(&m.router)?,
                    };
                    let router = gw(&m.router)?;
                    // The resident MoE kernels do not yet carry the
                    // descriptor-aware transform through router/shared-gate
                    // selection.  Refuse the complete layer instead of
                    // scoring with an untransformed Prism plane (the dense
                    // path has an explicit FWHT boundary below).
                    if router.prism != crate::gpu::GraphPrismOp::None
                        || sgate.prism != crate::gpu::GraphPrismOp::None
                        || router.affine
                        || sgate.affine
                    {
                        tracing::warn!(
                            "resident MoE declined: Prism/affine router or shared gate transform is not implemented"
                        );
                        return None;
                    }
                    let in_bank_shared = shared.filter(|_| has_shared).map(|(se, _)| se);
                    let edge = |t: &QTensor| {
                        t.graph_weight()
                            .or_else(|| t.graph_weight_descriptor())
                            .map(|(mm, i, _, _)| (std::sync::Arc::as_ptr(mm) as usize, i))
                    };
                    let bank_key: Option<GraphMoeKey> = match (
                        m.experts.first().and_then(|e| edge(&e.gate_proj)),
                        m.experts.last().and_then(|e| edge(&e.down_proj)),
                    ) {
                        (Some((fm, fi)), Some((_, di))) if graph_moe_bank_on() => Some((
                            self.phys_layer(li),
                            m.experts.as_ptr() as usize,
                            m.experts.len(),
                            in_bank_shared.map_or(0, |se| std::ptr::from_ref(se) as usize),
                            fm,
                            fi,
                            di,
                        )),
                        _ => None,
                    };
                    let cached =
                        bank_key.and_then(|k| self.graph_moe_banks.lock().unwrap().get(&k).cloned());
                    let bank = if let Some(b) = cached {
                        b
                    } else {
                    let mut experts = Vec::with_capacity(m.experts.len() + 1);
                    let mut bank_model: Option<std::sync::Arc<cortiq_core::CmfModel>> = None;
                    // q4t or q4tp, but not both in one layer — the kernels
                    // are picked per layer, not per expert.
                    let mut q4tp: Option<bool> = None;
                    // The mixed 2-bit profile: q2tp gate/up over a q4tp
                    // down. Uniform across the layer, like `q4tp` itself.
                    let mut gu_q2: Option<bool> = None;
                    // q8_2f experts (gate, up and down): their own kernels.
                    let mut q82: Option<bool> = None;
                    // One MoE gate/up kernel serves the complete packed bank.
                    // Bind an activation only when every routed (and in-bank
                    // shared) expert owns the same exact WGPU contract.
                    let mut moe_act = None;
                    for e in m.experts.iter().chain(in_bank_shared.into_iter()) {
                        let Some(e_act) = e.act.wgpu_graph_act() else {
                            return None;
                        };
                        match moe_act {
                            Some(existing) if existing != e_act => return None,
                            None => moe_act = Some(e_act),
                            _ => {}
                        }
                        if e.gate_proj.rows() != inter || e.up_proj.rows() != inter {
                            return None;
                        }
                        // Expert tensors are packed into one resident buffer
                        // and the MoE kernels have no transform slot per
                        // expert.  Keep the CPU/per-op owner for Prism or
                        // affine experts rather than silently using raw bytes.
                        for expert_weight in [&e.gate_proj, &e.up_proj, &e.down_proj] {
                            let Some((em, ei, _, _)) = expert_weight
                                .graph_weight()
                                .or_else(|| expert_weight.graph_weight_descriptor())
                            else {
                                return None;
                            };
                            let name = &em.tensors[ei].name;
                            if crate::prism::is_forward_weight(em, name)
                                || crate::prism::is_inverse_embedding(em, name)
                                || crate::prism::is_affine_target(em, name)
                            {
                                tracing::warn!(
                                    "resident MoE declined: expert Prism/affine transform is not implemented"
                                );
                                return None;
                            }
                        }
                        let (mm, gi, ui, di, is_p, is_q2, is_8) = match e.gate_proj.mapped_q4t() {
                            Some((mm, gi)) => (
                                mm,
                                gi,
                                e.up_proj.mapped_q4t()?.1,
                                e.down_proj.mapped_q4t()?.1,
                                false,
                                false,
                                false,
                            ),
                            None => match e.gate_proj.mapped_q2tp() {
                                Some((mm, gi)) => (
                                    mm,
                                    gi,
                                    e.up_proj.mapped_q2tp()?.1,
                                    e.down_proj.mapped_q4tp()?.1,
                                    true,
                                    true,
                                    false,
                                ),
                                None => match e.gate_proj.mapped_q4tp() {
                                    Some((mm, gi)) => (
                                        mm,
                                        gi,
                                        e.up_proj.mapped_q4tp()?.1,
                                        e.down_proj.mapped_q4tp()?.1,
                                        true,
                                        false,
                                        false,
                                    ),
                                    // q8_2f experts: all three projections,
                                    // each with its own column field.
                                    None => {
                                        if !crate::gpu::moe_q82_graph_on() {
                                            return None;
                                        }
                                        let (mm, gi) = e.gate_proj.mapped_q8_2f()?;
                                        (
                                            mm,
                                            gi,
                                            e.up_proj.mapped_q8_2f()?.1,
                                            e.down_proj.mapped_q8_2f()?.1,
                                            false,
                                            false,
                                            true,
                                        )
                                    }
                                },
                            },
                        };
                        if *q4tp.get_or_insert(is_p) != is_p
                            || *gu_q2.get_or_insert(is_q2) != is_q2
                            || *q82.get_or_insert(is_8) != is_8
                        {
                            // The shared expert rides in the same packed
                            // buffer as the routed ones, so a layer that
                            // mixes layouts cannot be indexed by one stride.
                            // Say so: the symptom is a whole model quietly
                            // running its MoE on the CPU.
                            tracing::warn!(
                                "MoE layer mixes expert layouts (q4tp={is_p}, q2tp gate/up={is_q2}, q8_2f={is_8})                                  — every expert of a layer, INCLUDING the shared one, must share                                  a layout. The whole-token graph declines this layer."
                            );
                            return None;
                        }
                        bank_model.get_or_insert_with(|| mm.clone());
                        experts.push((gi, ui, di));
                    }
                    let b = GraphMoeBank {
                        experts,
                        q4tp,
                        gu_q2,
                        q82,
                        act: moe_act,
                        model: bank_model,
                    };
                    if let Some(k) = bank_key {
                        self.graph_moe_banks.lock().unwrap().insert(k, b.clone());
                    }
                    b
                    };
                    if let Some(mm) = &bank.model {
                        model.get_or_insert_with(|| mm.clone());
                    }
                    crate::gpu::GraphFfn::Moe {
                        router,
                        shared_gate: sgate,
                        experts: bank.experts,
                        n_exp: m.experts.len(),
                        // CMF_TOPK_PROBE: timing probe only — output is WRONG.
                        // Fewer experts shrink the MoE arithmetic while the
                        // dispatch count stays identical, which is the only
                        // clean way to tell a launch-bound decode from a
                        // compute-bound one.
                        top_k: std::env::var("CMF_TOPK_PROBE")
                            .ok()
                            .and_then(|v| v.parse::<usize>().ok())
                            .filter(|k| *k > 0 && *k <= m.top_k)
                            .unwrap_or(m.top_k),
                        inter,
                        act: bank.act?,
                        norm_topk: m.norm_topk_prob,
                        q4tp: bank.q4tp?,
                        gu_q2: bank.gu_q2.unwrap_or(false),
                        q82: bank.q82.unwrap_or(false),
                        sigmoid: m.router_sigmoid,
                        sigmoid_denom_eps: m.sigmoid_denom_eps,
                        bias: m.expert_bias.as_deref(),
                        has_shared,
                        detached_shared,
                        shared_gated,
                        route_scale: m.routed_scaling,
                    }
                }
            };
            let attn = match &lw.attn {
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } => {
                    if self.attention_heads_per_layer.is_some() {
                        return None;
                    }
                    // A projected output gate rides the graph in one form:
                    // Spark-X2.5's head-wise sigmoid (one g_proj row per Q
                    // head). Laguna's softplus gate keeps the CPU path.
                    let head_gate = match softplus_gate {
                        None => None,
                        Some((g, true)) if self.proj_gate_sigmoid && !*output_gate => Some(gw(g)?),
                        Some(_) => {
                            self.note_graph_decline(
                                "wgpu token graph",
                                "projected softplus / per-element output gate",
                            );
                            return None;
                        }
                    };
                    let (m, _, _, _) = wq.graph_weight_or_blr()?;
                    model = Some(m.clone());
                    crate::gpu::GraphAttn::Full {
                        wq: gw(wq)?,
                        wk: gw(wk)?,
                        wv: gw(wv)?,
                        wo: gw(wo)?,
                        q_norm: q_norm.as_deref(),
                        k_norm: k_norm.as_deref(),
                        late_qk_norm: self.qk_norm_after_rope,
                        bias: bias
                            .as_ref()
                            .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                        output_gate: *output_gate,
                        cpu_k: self.kv_cache.layers[li].k_heads(),
                        cpu_v: self.kv_cache.layers[li].v_heads(),
                        cpu_base: self.kv_cache.layers[li].base(),
                        geom: self.graph_attn_geom_vres(li, vres_e0),
                        head_gate,
                    }
                }
                AttnKind::LinearGdn(w) => {
                    let cfg = self.gdn_cfg?;
                    let (m, _, _, _) = w.in_proj_qkv.graph_weight_or_blr()?;
                    model = Some(m.clone());
                    crate::gpu::GraphAttn::Gdn {
                        qkv: gw(&w.in_proj_qkv)?,
                        z: gw(&w.in_proj_z)?,
                        a: gw(&w.in_proj_a)?,
                        b: gw(&w.in_proj_b)?,
                        out: gw(&w.out_proj)?,
                        conv1d: &w.conv1d,
                        a_log: &w.a_log,
                        dt_bias: &w.dt_bias,
                        norm: &w.norm,
                        nv: cfg.num_v_heads,
                        nk: cfg.num_k_heads,
                        dk: cfg.key_head_dim,
                        dv: cfg.value_head_dim,
                        kk: cfg.conv_kernel,
                        cpu_state: &self.kv_cache.layers[self.phys_layer(li)].linear_state,
                        preview: None,
                    }
                }
                AttnKind::ShortConv(w) => {
                    let cfg = self.short_conv_cfg?;
                    let (m, _, _, _) = w
                        .in_proj
                        .graph_weight()
                        .or_else(|| w.in_proj.graph_weight_descriptor())?;
                    model = Some(m.clone());
                    crate::gpu::GraphAttn::ShortConv {
                        inp: gw(&w.in_proj)?,
                        out: gw(&w.out_proj)?,
                        taps: &w.conv,
                        kernel: cfg.kernel,
                        cpu_state: &self.kv_cache.layers[self.phys_layer(li)].linear_state,
                    }
                }
                _ => return None,
            };
            layers.push(crate::gpu::GraphLayer {
                mhc: crate::sensenova::graph_mhc(self.mhc.as_deref(), self.phys_layer(li)),
                input_norm: &lw.input_norm,
                attn,
                post_norm: &lw.post_norm,
                attn_out_norm: lw.attn_out_norm.as_deref(),
                ffn_out_norm: lw.ffn_out_norm.as_deref(),
                layer_scale: lw.layer_scale,
                ffn: gffn,
            });
        }
        let model = model?;
        // Fold final-norm + lm_head into the graph when this call wants logits
        // and the lm_head is a graphable (quantized) weight — the graph then
        // reads back logits (into logits_out) instead of the hidden, dropping
        // the separate CPU/GPU lm_head op + its sync. Never the f32 fallback:
        // an unquantized lm_head is vocab·hidden and must not be uploaded.
        let lm_gw = if upto_excl == self.num_layers
            && self.graph_want_logits
            && std::env::var("CMF_GPU_LMHEAD")
                .map(|v| v != "0")
                .unwrap_or(true)
        {
            self.weights
                .lm_head
                .graph_weight()
                .or_else(|| self.weights.lm_head.graph_weight_descriptor())
                .map(|(m, i, kind, rs)| {
                    let name = &m.tensors[i].name;
                    let prism = if crate::prism::is_inverse_embedding(m, name) {
                        crate::gpu::GraphPrismOp::InverseEmbedding
                    } else if crate::prism::is_forward_weight(m, name) {
                        crate::gpu::GraphPrismOp::Forward
                    } else {
                        crate::gpu::GraphPrismOp::None
                    };
                    (
                        crate::gpu::GraphW {
                            idx: i,
                            kind,
                            row_scale: rs,
                            data: &[],
                            prism,
                            affine: crate::prism::is_affine_target(m, name),
                        },
                        self.weights.lm_head.rows(),
                    )
                })
        } else {
            None
        };
        let lm = lm_gw.as_ref().map(|(gw, rows)| (gw, *rows));
        // Multi-step re-embeds the winner on the device.
        let emb_gw = if steps > 1 {
            self.weights
                .embed_tokens
                .graph_weight()
                .or_else(|| self.weights.embed_tokens.graph_weight_descriptor())
                .map(|(m, i, kind, rs)| {
                    let name = &m.tensors[i].name;
                    let prism = if crate::prism::is_inverse_embedding(m, name) {
                        crate::gpu::GraphPrismOp::InverseEmbedding
                    } else if crate::prism::is_forward_weight(m, name) {
                        crate::gpu::GraphPrismOp::Forward
                    } else {
                        crate::gpu::GraphPrismOp::None
                    };
                    (
                        crate::gpu::GraphW {
                            idx: i,
                            kind,
                            row_scale: rs,
                            data: &[],
                            prism,
                            affine: crate::prism::is_affine_target(m, name),
                        },
                        self.weights.embed_tokens.rows(),
                        self.embed_multiplier,
                    )
                })
        } else {
            None
        };

        // Loop boundaries: virtual layer indices after which final_norm is
        // applied (mid-stack only; the GLOBAL last layer's norm folds into
        // lm_head). Span-relative — the executor compares its enumerate
        // index. A span ending mid-stack keeps its boundary norm even when
        // it is the span's own last layer.
        let loop_norm_at: Vec<usize> = if self.loop_final_norm {
            (from..upto_excl.min(self.num_layers - 1))
                .filter(|&li| (li + 1) % self.physical_layers == 0)
                .map(|li| li - from)
                .collect()
        } else {
            Vec::new()
        };
        let mut h = hidden.to_vec();
        // The normal decode path only needs the fused lm-head logits.  A
        // CMF_LOGIT_DUMP diagnostic, however, promises a prompt-boundary
        // post-stack hidden alongside those logits; request the existing
        // second readback only for that explicit probe instead of dumping
        // the input copy left in `h` by a folded-head graph.
        let dump_hidden = std::env::var_os("CMF_LOGIT_DUMP").is_some();
        let taps = if steps == 1 { self.dflash_taps_wanted(from, upto_excl) } else { Vec::new() };
        crate::gpu::layer_taps_arm(&taps);
        let outcome = crate::gpu::forward_token_graph(
            &model,
            self.graph_kv_id,
            &layers,
            &o1_views,
            self.o1_epoch,
            &self.inv_freq,
            &mut h,
            nh,
            nkv,
            hd,
            self.attn_scale,
            rd,
            self.hidden_size,
            self.intermediate_size,
            position,
            self.kv_cache.max_seq_len,
            gemma,
            self.rms_eps as f32,
            lm,
            &self.weights.final_norm,
            logits_out,
            &loop_norm_at,
            steps,
            emb_gw.as_ref().map(|(gw, rows, m)| (gw, *rows, *m)),
            ids_out,
            layers_run,
            from,
            dump_hidden,
        );
        self.dflash_taps_keep(&taps, position, 1, outcome == crate::gpu::TokenGraphOutcome::Completed);
        match outcome {
            crate::gpu::TokenGraphOutcome::Completed => Some(Ok(h)),
            crate::gpu::TokenGraphOutcome::Failed => Some(Err(())),
            crate::gpu::TokenGraphOutcome::Declined => None,
        }
    }

    /// Batched prefill: k contiguous prompt positions through the whole wgpu
    /// graph in ONE submit (projections/FFN as GEMMs). `hiddens` is [k·hidden]
    /// in/out (embeddings in, layer output out); KV mirror / GDN state advance.
    /// false ⇒ unsupported → caller keeps the per-position graph.
    /// The b-row Metal graph plan for the whole model: every layer as a
    /// GDN run or a full-attention item, all-or-nothing (a layer outside the
    /// graph's contract → None, the caller runs plain). Shared by the
    /// speculative verify and the batched prefill.
    #[cfg(target_os = "macos")]
    #[allow(clippy::type_complexity)]
    fn metal_rows_plan(
        &self,
    ) -> Option<(
        Vec<MetalRowsItem<'_>>,
        std::sync::Arc<cortiq_core::CmfModel>,
        Option<crate::gpu_metal::GdnGpuCfg>,
    )> {
        use crate::gpu_metal::{AttnGpuLayer, GdnGpuCfg, GdnGpuLayer, MetalFfn};
        let graph_force = crate::gpu::q1_force() || crate::gpu::q2tp_gpu_opt_in();
        if !graph_force
            || !crate::gpu::enabled_here()
            || std::env::var("CMF_GPU_BLOCK")
                .map(|v| v == "0")
                .unwrap_or(false)
            || self.attn_softcap > 0.0
            || (self.o1_active() && !self.o1_on_graph())
            // Sliding windows with per-layer RoPE (Spark-X2.6) ride the rows graph
            // as they ride the chunk graph (`metal_graph_swa`).
            || (self.swa.is_some() && !self.metal_graph_swa())
            || self.global_attn.is_some()
            || self.attention_heads_per_layer.is_some()
            // per-layer KV heads, narrow V, learned sinks (MiMo-V2)
            || (self.graph_attn_decline_reason().is_some() && !self.metal_graph_swa())
            || self.attn_v_norm
            || self.loop_final_norm
            || !self.metal_rope_scale_ok()
        {
            return None;
        }
        let attend_contract = self.head_dim % 4 == 0
            && self.head_dim <= 256
            && self.rotary_dim >= 2
            && self.rotary_dim <= self.head_dim
            && (self.rotary_dim / 2) % 32 == 0
            && self.num_kv_heads > 0
            && self.num_heads % self.num_kv_heads == 0;
        if !attend_contract {
            return None;
        }
        let mut plan: Vec<MetalRowsItem> = Vec::new();
        let mut model_ref: Option<std::sync::Arc<cortiq_core::CmfModel>> = None;
        for li in 0..self.num_layers {
            let lw = &self.weights.layers[self.phys_layer(li)];
            if lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some() || lw.layer_scale.is_some() {
                return None;
            }
            let ffn = match &lw.ffn {
                FfnKind::Dense(d) if matches!(d.act, Act::Silu | Act::Gelu) && d.segs.is_empty() => {
                    let (Some(g), Some(u), Some(dn)) = (
                        d.gate_proj.metal_graph_parts(),
                        d.up_proj.metal_graph_parts(),
                        d.down_proj.metal_graph_parts(),
                    ) else {
                        return None;
                    };
                    MetalFfn::Dense {
                        gate: g,
                        up: u,
                        down: dn,
                        // SiLU, or the exact GELU of Spark-X2.6 (`gelu_rows`).
                        act: if d.act == Act::Gelu { 1 } else { 0 },
                    }
                }
                _ => return None,
            };
            match &lw.attn {
                AttnKind::LinearGdn(w) if self.gdn_cfg.is_some() => {
                    let (Some(qkv), Some(z), Some(a), Some(bb), Some(out)) = (
                        w.in_proj_qkv.metal_graph_parts(),
                        w.in_proj_z.metal_graph_parts(),
                        w.in_proj_a.f32_parts(),
                        w.in_proj_b.f32_parts(),
                        w.out_proj.metal_graph_parts(),
                    ) else {
                        return None;
                    };
                    if let QTensor::Mapped { model, .. } = &w.in_proj_qkv {
                        model_ref.get_or_insert_with(|| model.clone());
                    }
                    let gl = GdnGpuLayer {
                        mhc: None,
                        attn_norm: &lw.input_norm,
                        post_norm: &lw.post_norm,
                        qkv,
                        z,
                        a,
                        b: bb,
                        out,
                        ffn,
                        conv1d: &w.conv1d,
                        a_log: &w.a_log,
                        dt_bias: &w.dt_bias,
                        gnorm: &w.norm,
                    };
                    match plan.last_mut() {
                        Some(MetalRowsItem::Gdn { run, .. }) => run.push(gl),
                        _ => plan.push(MetalRowsItem::Gdn {
                            run: vec![gl],
                            first: li,
                        }),
                    }
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias: None,
                } => {
                    // Spark-X2.6's per-head sigmoid g_proj gate, from f32 rows.
                    let head_gate = match softplus_gate {
                        None => None,
                        Some((g, true)) if self.proj_gate_sigmoid && !*output_gate => match g.f32_parts() {
                            Some((d, r, c)) if r == self.num_heads && c == self.hidden_size => Some(d),
                            _ => return None,
                        },
                        Some(_) => return None,
                    };
                    let (Some(pq), Some(pk), Some(pv), Some(po)) = (
                        wq.metal_graph_parts(),
                        wk.metal_graph_parts(),
                        wv.metal_graph_parts(),
                        wo.metal_graph_parts(),
                    ) else {
                        return None;
                    };
                    if let QTensor::Mapped { model, .. } = wq {
                        model_ref.get_or_insert_with(|| model.clone());
                    }
                    let cache = &self.kv_cache.layers[li];
                    if cache.mode != crate::kv_cache::KvMode::F32 || (cache.o1.is_some() && !self.o1_on_graph()) {
                        return None;
                    }
                    plan.push(MetalRowsItem::Attn {
                        l: AttnGpuLayer {
                            mhc: None,
                            attn_norm: &lw.input_norm,
                            post_norm: &lw.post_norm,
                            wq: pq,
                            wk: pk,
                            wv: pv,
                            wo: po,
                            ffn,
                            attn_out_norm: None,
                            ffn_out_norm: None,
                            layer_scale: None,
                        },
                        li,
                        q_norm: q_norm.as_deref(),
                        k_norm: k_norm.as_deref(),
                        output_gate: *output_gate,
                        head_gate,
                    });
                }
                _ => return None,
            }
        }
        let model = model_ref?;
        let gcfg = self.gdn_cfg.map(|cfg| GdnGpuCfg {
            nv: cfg.num_v_heads,
            nk: cfg.num_k_heads,
            dk: cfg.key_head_dim,
            dv: cfg.value_head_dim,
            kk: cfg.conv_kernel,
            hidden: self.hidden_size,
            inter: self.intermediate_size,
            c_dim: cfg.conv_dim(),
            eps: cfg.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        });
        Some((plan, model, gcfg))
    }

    /// `AttnDeviceParams` for a plan item over the CPU cache as it stands.
    #[cfg(target_os = "macos")]
    #[allow(clippy::too_many_arguments)]
    fn metal_attn_params<'a>(
        li: usize,
        cache: &'a crate::kv_cache::LayerKvCache,
        q_norm: Option<&'a [f32]>,
        k_norm: Option<&'a [f32]>,
        output_gate: bool,
        inv_freq: &'a [f32],
        rope_scale: f32,
        geom: (usize, usize, usize, usize),
        pos0: usize,
        kv_id: u64,
        scale: f32,
        eps: f32,
        gemma: bool,
        late_qk_norm: bool,
        o1_epoch: u64,
        head_gate: Option<&'a [f32]>,
        window: Option<usize>,
    ) -> (crate::gpu_metal::AttnDeviceParams<'a>, usize) {
        let (nh, nkv, hd, rd) = geom;
        let cpu_k: Vec<&[f32]> = (0..nkv).map(|g| cache.head_keys(g)).collect();
        let cpu_v: Vec<&[f32]> = (0..nkv).map(|g| cache.head_values(g)).collect();
        let cpu_stored = cpu_k[0].len() / hd;
        (
            crate::gpu_metal::AttnDeviceParams {
                kv_id,
                layer: li,
                nh,
                nkv,
                hd,
                rd,
                position: pos0,
                scale,
                eps,
                gemma,
                late_qk_norm,
                output_gate,
                q_norm,
                k_norm,
                inv_freq,
                rope_scale,
                cpu_k,
                cpu_v,
                cpu_stored,
                cpu_gen: cache.generation(),
                // A layer still collecting has no views, and its rows go through the mirror.
                o1: cache.o1_views().map(|views| crate::gpu_metal::O1AttnParams { views, epoch: o1_epoch }),
                window,
                softmax_sink: cache.sinks.as_deref(),
                head_gate,
                v_norm: false,
                dash: None,
            },
            cpu_stored,
        )
    }

    /// Run the rows plan over `hiddens` (b rows at `pos0..`): validate,
    /// encode every item, optionally the head, sync. Returns the graph
    /// (for the commit / state finish) plus the GDN layer indices and the
    /// attention layers with the row count they were encoded against.
    #[cfg(target_os = "macos")]
    #[allow(clippy::type_complexity)]
    fn metal_rows_run(
        &mut self,
        hiddens: &mut [f32],
        pos0: usize,
        b: usize,
        prefill: bool,
        spec: Option<((usize, usize, usize), &[f32], &mut Vec<f32>)>,
        // Greedy verify: (row length scored, the b argmax ids out) — the
        // head's argmax runs on the device and the logits plane is NOT
        // read back (`spec.2` stays empty).
        mut argmax_out: Option<(usize, &mut Vec<u32>)>,
    ) -> MetalRowsRun {
        use crate::gpu_metal::{GraphDims, VerifyGraph};
        // The previous round's commit may still be replaying into the
        // trunk GDN owners on the second queue: this graph reads them
        // (zero-copy wraps) and may reallocate them below — collect the
        // replay first. Normally already complete (the draft chain ran
        // in between); a failed replay is terminal like a failed commit.
        if !crate::gpu_metal::wait_replay() {
            tracing::error!("Metal rows graph: the pending async replay failed");
            return MetalRowsRun::Failed;
        }
        spec_stamp("v.wait");
        // Seed the GDN recurrent records the rows graph reads — GDN layers
        // ONLY (the record the CPU path would allocate anyway).  Sizing
        // every layer here planted a zero GDN-sized record on a bounded
        // anchor of a natively bounded file this path then refused, and
        // that record counted as recurrent state on macOS.
        let want = self.gdn_cfg.map(|c| c.state_len()).unwrap_or(0);
        if want > 0 {
            let phys = self.physical_layers.max(1);
            for (li, l) in self.kv_cache.layers.iter_mut().enumerate() {
                let is_gdn = self
                    .weights
                    .layers
                    .get(li % phys)
                    .is_some_and(|lw| matches!(lw.attn, AttnKind::LinearGdn(_)));
                if is_gdn && l.linear_state.len() != want {
                    l.linear_state = vec![0f32; want];
                }
            }
        }
        let Some((plan, model, gcfg)) = self.metal_rows_plan() else {
            return MetalRowsRun::Declined;
        };
        spec_stamp("v.plan");
        let dims = GraphDims {
            hidden: self.hidden_size,
            eps: self.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        };
        // A prompt chunk for the Neural Engine goes as two halves, a thread each: one is on the
        // ANE while the GPU has the other.
        let hs = self.hidden_size;
        let relay = prefill
            && spec.is_none()
            && b >= 128
            && crate::gpu_metal::ane::wanted()
            && std::env::var("CMF_ANE_RELAY").as_deref() != Ok("0");
        let cuts: Vec<(usize, usize)> = if relay { vec![(0, b / 2), (b / 2, b - b / 2)] } else { vec![(0, b)] };
        let gate = crate::gpu_metal::LaneGate::new();
        let mut lanes: Vec<VerifyGraph> = Vec::with_capacity(cuts.len());
        for (ln, &(r0, n)) in cuts.iter().enumerate() {
            let h = &hiddens[r0 * hs..(r0 + n) * hs];
            let g = if relay {
                VerifyGraph::new_prefill_lane(&model, dims, h, n, ln, b - r0 - n, &gate)
            } else if prefill {
                VerifyGraph::new_prefill(&model, dims, h, n)
            } else {
                VerifyGraph::new(&model, dims, h, n)
            };
            let Some(g) = g else {
                return MetalRowsRun::Declined;
            };
            lanes.push(g);
        }
        if prefill {
            use crate::gpu_metal::{AneWants, MetalFfn};
            // SiLU or the exact GELU (Spark-X2.6), one activation for the file's FFNs.
            let mut ane_act = None;
            let ffn = |f: &MetalFfn<'_>, ane_act: &mut Option<u8>| match f {
                MetalFfn::Dense { gate, up, down, act } if *act <= 1 && ane_act.is_none_or(|a| a == *act) => {
                    *ane_act = Some(*act);
                    Some([*gate, *up, *down])
                }
                _ => None,
            };
            let mut wants = Vec::new();
            for item in &plan {
                match item {
                    MetalRowsItem::Gdn { run, .. } => {
                        wants.extend(run.iter().map(|l| AneWants {
                            ffn: ffn(&l.ffn, &mut ane_act),
                            mix: if crate::gpu_metal::ane_takes_qkv() { vec![l.qkv, l.z] } else { vec![l.z] },
                        }))
                    }
                    MetalRowsItem::Attn { l, .. } => wants.push(AneWants {
                        ffn: ffn(&l.ffn, &mut ane_act),
                        mix: if crate::gpu_metal::ane_takes_qkv() {
                            vec![l.wk, l.wv, l.wq]
                        } else if crate::gpu_metal::ane_takes_q() {
                            vec![l.wq]
                        } else {
                            Vec::new()
                        },
                    }),
                }
            }
            crate::gpu_metal::ane::set_act(ane_act.unwrap_or(0));
            for g in lanes.iter_mut() {
                g.ane_attach(&wants);
            }
            lanes[0].ane_begin(lanes.len());
        }
        // With the Neural Engine a layer's command is committed as it ends, so a refusal past
        // the first one leaves states half written.
        let hard = relay || lanes[0].has_ane();
        let geom = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.rotary_dim,
        );
        let gemma = self.norm_style == cortiq_core::NormStyle::Gemma;
        let eps = self.rms_eps as f32;
        let kv_id = self.graph_kv_id;
        // Each layer's own RoPE table and width (Spark-X2.6: sliding and full layers differ).
        let tables: Vec<std::sync::Arc<Vec<f32>>> = (0..self.num_layers).map(|li| self.layer_inv_freq(li)).collect();
        let lgeom = |li: usize| (geom.0, geom.1, geom.2, self.layer_geom(li).2);
        for item in &plan {
            let ok = match item {
                MetalRowsItem::Gdn { run, .. } => gcfg
                    .as_ref()
                    .map(|gc| lanes.iter().all(|g| run.iter().all(|l| g.gdn_ok(l, gc))))
                    .unwrap_or(false),
                MetalRowsItem::Attn {
                    l,
                    li,
                    q_norm,
                    k_norm,
                    output_gate,
                    head_gate,
                } => {
                    let (p, _) = Self::metal_attn_params(
                        *li,
                        &self.kv_cache.layers[*li],
                        *q_norm,
                        *k_norm,
                        *output_gate,
                        &tables[*li],
                        self.layer_rope_scale(*li),
                        lgeom(*li),
                        pos0,
                        kv_id,
                        self.attn_scale,
                        eps,
                        gemma,
                        self.qk_norm_after_rope,
                        self.o1_epoch,
                        *head_gate,
                        self.layer_window(*li),
                    );
                    lanes.iter().all(|g| g.attn_ok(l, &p))
                }
            };
            if !ok {
                use std::sync::atomic::{AtomicBool, Ordering};
                static SAID: AtomicBool = AtomicBool::new(false);
                if !SAID.swap(true, Ordering::Relaxed) {
                    tracing::warn!("metal rows graph: a layer failed preflight — declining");
                }
                return MetalRowsRun::Declined;
            }
        }
        let lm = match &spec {
            Some((lm, _, _)) => {
                if !lanes[0].lm_head_ok(*lm) {
                    return MetalRowsRun::Declined;
                }
                Some(*lm)
            }
            None => None,
        };
        // What each half encodes, layer by layer: nothing here changes while they run.
        enum Step<'a> {
            Gdn(&'a crate::gpu_metal::GdnGpuLayer<'a>, &'a [f32]),
            Attn(&'a crate::gpu_metal::AttnGpuLayer<'a>, crate::gpu_metal::AttnDeviceParams<'a>),
        }
        let mut gdn_layers = Vec::new();
        let mut attn_layers = Vec::new();
        let mut steps: Vec<Vec<Step<'_>>> = cuts.iter().map(|_| Vec::new()).collect();
        // the layer each step is, for the rows a DFlash drafter reads
        let mut step_layer: Vec<usize> = Vec::new();
        for item in &plan {
            match item {
                MetalRowsItem::Gdn { run, first } => {
                    for (l, kv) in run.iter().zip(&self.kv_cache.layers[*first..*first + run.len()]) {
                        for st in steps.iter_mut() {
                            st.push(Step::Gdn(l, kv.linear_state.as_slice()));
                        }
                    }
                    gdn_layers.extend(*first..*first + run.len());
                    step_layer.extend(*first..*first + run.len());
                }
                MetalRowsItem::Attn {
                    l,
                    li,
                    q_norm,
                    k_norm,
                    output_gate,
                    head_gate,
                } => {
                    for (ln, st) in steps.iter_mut().enumerate() {
                        let (mut p, cpu_stored) = Self::metal_attn_params(
                            *li,
                            &self.kv_cache.layers[*li],
                            *q_norm,
                            *k_norm,
                            *output_gate,
                            &tables[*li],
                            self.layer_rope_scale(*li),
                            lgeom(*li),
                            pos0 + cuts[ln].0,
                            kv_id,
                            self.attn_scale,
                            eps,
                            gemma,
                            self.qk_norm_after_rope,
                            self.o1_epoch,
                            *head_gate,
                            self.layer_window(*li),
                        );
                        // The half before leaves its rows in the mirror, not yet in the host's.
                        p.cpu_stored += cuts[ln].0;
                        // A sealed layer leaves no mirror row to pull.
                        if ln == 0 && p.o1.is_none() {
                            attn_layers.push((*li, cpu_stored));
                        }
                        st.push(Step::Attn(l, p));
                    }
                    step_layer.push(*li);
                }
            }
        }
        // The outputs of the layers a DFlash drafter reads are kept on the way
        // (one graph only: a chunk in halves through the Neural Engine keeps none).
        let taps: Vec<usize> = match &self.dflash {
            Some(d) if !relay => d.g.taps.clone(),
            _ => Vec::new(),
        };
        let tap_slot: Vec<Option<usize>> = step_layer.iter().map(|l| taps.iter().position(|t| t == l)).collect();
        let tapped = std::sync::atomic::AtomicUsize::new(0);
        // One half's layers in order; `Err` tells whether a command was already committed.
        let gc = gcfg.as_ref();
        let walk = |g: &mut VerifyGraph, steps: &[Step<'_>]| -> Result<(), bool> {
            for (i, step) in steps.iter().enumerate() {
                let ok = match step {
                    Step::Gdn(l, state) => match gc {
                        Some(gc) => g.encode_gdn_run_b(std::slice::from_ref(*l), &[*state], gc),
                        None => false,
                    },
                    Step::Attn(l, p) => g.encode_attn_b(l, p),
                };
                if !ok {
                    return Err(i > 0);
                }
                if let Some(slot) = tap_slot.get(i).copied().flatten() {
                    if g.tap(slot, taps.len()) {
                        tapped.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                    }
                }
            }
            Ok(())
        };
        let refused = |started: bool| if hard && started { MetalRowsRun::Failed } else { MetalRowsRun::Declined };
        if relay {
            let (first, second) = lanes.split_at_mut(1);
            let (sa, sb) = (&steps[0], &steps[1]);
            let (ra, rb) = std::thread::scope(|sc| {
                let other = sc.spawn(|| {
                    let r = walk(&mut second[0], sb);
                    if r.is_err() {
                        // The first half must not wait for this one's turn on the ANE.
                        crate::gpu_metal::ane::retire("a half of the chunk stopped");
                    }
                    r
                });
                let r = walk(&mut first[0], sa);
                if r.is_err() {
                    gate.fail();
                }
                (r, other.join().unwrap_or(Err(true)))
            });
            if ra.is_err() || rb.is_err() {
                return MetalRowsRun::Failed;
            }
        } else if let Err(started) = walk(&mut lanes[0], &steps[0]) {
            return refused(started);
        }
        drop(steps);
        if let (Some(lm), Some((_, final_norm, _))) = (lm, spec.as_ref()) {
            if !lanes[0].encode_lm_head_b(final_norm, lm) {
                return refused(true);
            }
            // The device argmax is an OPTIMISATION, never a reason to
            // decline the round: if it will not encode, drop it and read
            // the logits plane back the old way (the head is encoded
            // either way, so the rows are there).
            if let Some((n, _)) = argmax_out.as_ref() {
                if !lanes[0].encode_argmax_b(*n) {
                    argmax_out = None;
                }
            }
        }
        spec_stamp("v.enc");
        for g in lanes.iter_mut() {
            if !g.sync() {
                return MetalRowsRun::Failed;
            }
        }
        spec_stamp("v.gpu");
        match (spec, argmax_out) {
            (Some(_), Some((_, ids))) => {
                ids.resize(b, 0);
                if !lanes[0].read_argmax(ids) {
                    return MetalRowsRun::Failed;
                }
                spec_stamp("v.am");
            }
            (Some((lm, _, logits)), None) => {
                logits.resize(b * lm.1, 0.0);
                if !lanes[0].read_logits(logits) {
                    return MetalRowsRun::Failed;
                }
                spec_stamp("v.lg");
            }
            (None, _) => {}
        }
        for (g, &(r0, n)) in lanes.iter().zip(&cuts) {
            if !g.read_hidden(&mut hiddens[r0 * hs..(r0 + n) * hs]) {
                return MetalRowsRun::Failed;
            }
        }
        spec_stamp("v.hid");
        // The tapped rows, a row's layers joined: a prompt's rows are context at
        // once, a verify's wait for the round to say which of them it keeps.
        self.dflash_rows = None;
        if !taps.is_empty() && tapped.load(std::sync::atomic::Ordering::Relaxed) == taps.len() && lanes.len() == 1 {
            let nt = taps.len();
            let mut raw = vec![0f32; nt * b * hs];
            if lanes[0].read_taps(&mut raw) {
                let mut joined = vec![0f32; b * nt * hs];
                for s in 0..nt {
                    for r in 0..b {
                        joined[(r * nt + s) * hs..][..hs].copy_from_slice(&raw[(s * b + r) * hs..][..hs]);
                    }
                }
                if prefill {
                    if let Some(d) = self.dflash.as_mut() {
                        d.queue_context(pos0, &joined, self.pool.as_deref());
                    }
                } else {
                    self.dflash_rows = Some((pos0, joined));
                }
                spec_stamp("v.taps");
            }
        }
        // The last half's graph: the layers' states are the chunk's.
        let graph = lanes.pop().unwrap();
        MetalRowsRun::Completed(MetalVerifyPending {
            graph,
            gdn_layers,
            attn_layers,
        })
    }

    /// Native-Metal twin of `try_batch_graph_wgpu`: the b rows through the
    /// whole model on the `VerifyGraph` (one submit), the head folded in
    /// when `spec` asks; `hiddens` come back as the last layer's output
    /// rows, `spec.2` as `[b][lm_rows]` logits. The graph is parked in
    /// `metal_verify` for `metal_verify_commit`.
    #[cfg(target_os = "macos")]
    fn try_batch_graph_metal(
        &mut self,
        hiddens: &mut [f32],
        positions: &[usize],
        b: usize,
        spec: Option<((usize, usize, usize), &[f32], &mut Vec<f32>)>,
        argmax_out: Option<(usize, &mut Vec<u32>)>,
    ) -> crate::gpu::BatchGraphOutcome {
        let _t0 = std::time::Instant::now();
        if positions.len() != b
            || self.mhc.is_some()
            || self.prompt_mrope.is_some()
            || self.value_blend.is_some()
            || positions.windows(2).any(|w| w[1] != w[0] + 1)
            || hiddens.len() != b * self.hidden_size
        {
            return crate::gpu::BatchGraphOutcome::Declined;
        }
        let pending = match self.metal_rows_run(hiddens, positions[0], b, false, spec, argmax_out) {
            MetalRowsRun::Declined => return crate::gpu::BatchGraphOutcome::Declined,
            MetalRowsRun::Failed => return crate::gpu::BatchGraphOutcome::Failed,
            MetalRowsRun::Completed(pending) => pending,
        };
        if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
            eprintln!(
                "metal-verify: {:.1} ms | b={b}",
                _t0.elapsed().as_secs_f64() * 1e3
            );
        }
        self.metal_verify = Some(pending);
        crate::gpu::BatchGraphOutcome::Completed
    }

    /// Batched prefill on the Metal rows graph: `ids` (≤ 512) at
    /// `start_pos..`, states written in place, K/V rows appended to the
    /// CPU caches; optional final norm/head logits are returned in `spec`.
    /// Declined means no command buffer was admitted; Failed is terminal.
    #[cfg(target_os = "macos")]
    fn prefill_rows_metal(
        &mut self,
        ids: &[u32],
        start_pos: usize,
        spec: Option<((usize, usize, usize), &[f32], &mut Vec<f32>)>,
    ) -> MetalPrefillOutcome {
        let b = ids.len();
        if b == 0 || b > 512 {
            return MetalPrefillOutcome::Declined;
        }
        let hs = self.hidden_size;
        let mut hiddens = vec![0f32; b * hs];
        for (j, &id) in ids.iter().enumerate() {
            let e = self.embed_single(id);
            hiddens[j * hs..(j + 1) * hs].copy_from_slice(&e);
        }
        self.prefill_hiddens_metal(hiddens, start_pos, spec)
    }

    /// Ready prompt rows (`b <= 512`) through the rows graph.
    #[cfg(target_os = "macos")]
    fn prefill_hiddens_metal(
        &mut self,
        mut hiddens: Vec<f32>,
        start_pos: usize,
        spec: Option<((usize, usize, usize), &[f32], &mut Vec<f32>)>,
    ) -> MetalPrefillOutcome {
        let b = hiddens.len() / self.hidden_size;
        METAL_PREFILL_CHUNKS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        let with_head = spec.is_some();
        let mut pending = match self.metal_rows_run(&mut hiddens, start_pos, b, true, spec, None) {
            MetalRowsRun::Declined => return MetalPrefillOutcome::Declined,
            MetalRowsRun::Failed => {
                METAL_PREFILL_ERRORS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                return MetalPrefillOutcome::Failed;
            }
            MetalRowsRun::Completed(pending) => pending,
        };
        // states are final: copy them to the owners
        let idxs = pending.gdn_layers.clone();
        let mut outs: Vec<&mut [f32]> = self
            .kv_cache
            .layers
            .iter_mut()
            .enumerate()
            .filter(|(i, _)| idxs.binary_search(i).is_ok())
            .map(|(_, l)| l.linear_state.as_mut_slice())
            .collect();
        if !pending.graph.finish_states(&mut outs) {
            METAL_PREFILL_ERRORS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
            return MetalPrefillOutcome::Failed;
        }
        let (nkv, hd) = (self.num_kv_heads, self.head_dim);
        // Read every layer before mutating any CPU cache.  A missing mirror
        // row is a terminal graph failure, not a reason to append a partial
        // prefix and replay the remainder serially.
        let mut rows = Vec::with_capacity(pending.attn_layers.len());
        for (li, cpu_stored) in &pending.attn_layers {
            let mut kbuf = vec![0f32; b * nkv * hd];
            let mut vbuf = vec![0f32; b * nkv * hd];
            if !crate::gpu_metal::kv_mirror_read_rows(
                self.graph_kv_id,
                *li,
                nkv,
                hd,
                *cpu_stored,
                b,
                &mut kbuf,
                &mut vbuf,
            ) {
                METAL_PREFILL_ERRORS.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                return MetalPrefillOutcome::Failed;
            }
            rows.push((*li, *cpu_stored, kbuf, vbuf));
        }
        for (li, cpu_stored, kbuf, vbuf) in rows {
            let cache = &mut self.kv_cache.layers[li];
            for r in 0..b {
                cache.append(
                    &kbuf[r * nkv * hd..(r + 1) * nkv * hd],
                    &vbuf[r * nkv * hd..(r + 1) * nkv * hd],
                    &[],
                );
            }
            crate::gpu_metal::kv_mirror_set_stored(self.graph_kv_id, li, cpu_stored + b);
        }
        METAL_PREFILL_ROWS.fetch_add(b as u64, std::sync::atomic::Ordering::Relaxed);
        if with_head {
            METAL_PREFILL_HEAD_ROWS.fetch_add(b as u64, std::sync::atomic::Ordering::Relaxed);
        }
        // Every layer appended the chunk: sliding layers keep their tails only.
        self.swa_trim_tails();
        MetalPrefillOutcome::Completed(hiddens)
    }

    #[cfg(target_os = "macos")]
    fn prefill_batch_metal(&mut self, ids: &[u32], start_pos: usize) -> MetalPrefillOutcome {
        self.prefill_rows_metal(ids, start_pos, None)
    }

    /// Exact teacher-forced NLL through the ordinary Metal rows graph.  This
    /// is intentionally separate from the serial TokenGraph scorer: every
    /// chunk owns a real b-row graph/head completion and the recurrent/KV
    /// handoff is committed before the next chunk begins.
    #[cfg(target_os = "macos")]
    fn nll_batch_metal(&mut self, ids: &[u32], start: usize) -> MetalBatchNllOutcome {
        if ids.len() < 2 || self.o1_active() || self.head_clusters.is_some() {
            return MetalBatchNllOutcome::Declined;
        }
        let Some(lm) = self.weights.lm_head.metal_graph_parts() else {
            return MetalBatchNllOutcome::Declined;
        };
        let chunk = std::env::var("CMF_METAL_PREFILL_CHUNK")
            .ok()
            .and_then(|v| v.parse::<usize>().ok())
            .filter(|&v| (1..=512).contains(&v))
            .unwrap_or(32);
        let final_norm = self.weights.final_norm.clone();
        let mut nll = 0.0f64;
        let mut count = 0usize;
        let mut pos = 0usize;
        let mut completed = 0usize;
        while pos < ids.len() {
            let end = (pos + chunk).min(ids.len());
            let mut logits = Vec::new();
            let outcome =
                self.prefill_rows_metal(&ids[pos..end], pos, Some((lm, &final_norm, &mut logits)));
            match outcome {
                MetalPrefillOutcome::Declined => {
                    return if completed == 0 {
                        MetalBatchNllOutcome::Declined
                    } else {
                        MetalBatchNllOutcome::Failed(format!(
                            "ordinary Metal NLL batch declined after {completed} chunks"
                        ))
                    };
                }
                MetalPrefillOutcome::Failed => {
                    return MetalBatchNllOutcome::Failed(
                        "ordinary Metal NLL batch failed after admission".to_string(),
                    );
                }
                MetalPrefillOutcome::Completed(_) => {}
            }
            completed += 1;
            let vocab = self.vocab_size.min(lm.1);
            if logits.len() != (end - pos) * lm.1 || vocab == 0 {
                return MetalBatchNllOutcome::Failed(
                    "ordinary Metal NLL head returned an invalid shape".to_string(),
                );
            }
            for row in 0..(end - pos) {
                let absolute = pos + row;
                if absolute < start || absolute + 1 >= ids.len() {
                    continue;
                }
                let lg = &mut logits[row * lm.1..row * lm.1 + vocab];
                if let Some(mu) = self.logit_multiplier {
                    for v in lg.iter_mut() {
                        *v *= mu;
                    }
                }
                if let Some(c) = self.final_softcap {
                    softcap_in_place(lg, c, self.pool.as_deref());
                }
                let target = ids[absolute + 1] as usize;
                if target >= vocab {
                    return MetalBatchNllOutcome::Failed(format!(
                        "target token {target} exceeds Metal head rows {vocab}"
                    ));
                }
                let max = lg.iter().fold(f32::NEG_INFINITY, |m, &v| m.max(v));
                let lse: f64 = lg
                    .iter()
                    .map(|&v| ((v - max) as f64).exp())
                    .sum::<f64>()
                    .ln()
                    + max as f64;
                nll += lse - lg[target] as f64;
                count += 1;
            }
            pos = end;
        }
        MetalBatchNllOutcome::Completed(nll, count)
    }

    /// Commit a Metal verify round: replay the GDN recurrences over the
    /// `a + 1` accepted positions into the CPU states, append the accepted
    /// K/V rows from the mirrors to the CPU caches, re-point the mirrors.
    #[cfg(target_os = "macos")]
    fn metal_verify_commit(&mut self, a: usize) -> bool {
        let Some(mut pending) = self.metal_verify.take() else {
            return false;
        };
        let n = a + 1;
        // encode order == ascending layer order (the plan walks 0..layers)
        let idxs = pending.gdn_layers.clone();
        let mut outs: Vec<&mut [f32]> = self
            .kv_cache
            .layers
            .iter_mut()
            .enumerate()
            .filter(|(i, _)| idxs.binary_search(i).is_ok())
            .map(|(_, l)| l.linear_state.as_mut_slice())
            .collect();
        if !pending.graph.commit(n, &mut outs) {
            return false;
        }
        spec_stamp("c.replay");
        let (nkv, hd) = (self.num_kv_heads, self.head_dim);
        // Read every layer before mutating any CPU cache.  Missing rows are
        // terminal after the replay has executed; never append a partial KV
        // prefix and continue on a serial path.
        let mut rows = Vec::with_capacity(pending.attn_layers.len());
        for (li, cpu_stored) in &pending.attn_layers {
            let mut kbuf = vec![0f32; n * nkv * hd];
            let mut vbuf = vec![0f32; n * nkv * hd];
            if !crate::gpu_metal::kv_mirror_read_rows(
                self.graph_kv_id,
                *li,
                nkv,
                hd,
                *cpu_stored,
                n,
                &mut kbuf,
                &mut vbuf,
            ) {
                return false;
            }
            rows.push((*li, *cpu_stored, kbuf, vbuf));
        }
        for (li, cpu_stored, kbuf, vbuf) in rows {
            let cache = &mut self.kv_cache.layers[li];
            for r in 0..n {
                cache.append(
                    &kbuf[r * nkv * hd..(r + 1) * nkv * hd],
                    &vbuf[r * nkv * hd..(r + 1) * nkv * hd],
                    &[],
                );
            }
            crate::gpu_metal::kv_mirror_set_stored(self.graph_kv_id, li, cpu_stored + n);
        }
        spec_stamp("c.kv");
        true
    }

    /// The round's warm-ups as ONE b-row graph run over the MTP block on
    /// Metal: `pairs` = (trunk hidden, next token) at consecutive positions
    /// from `first_pos`; the block's input projection is folded in. This
    /// half encodes and SUBMITS (no wait); `mtp_warm_batch_finish` waits
    /// and pulls the appended K/V rows into the CPU MTP cache. None = the
    /// graph declined (nothing submitted, nothing appended).
    #[cfg(target_os = "macos")]
    fn mtp_warm_batch_submit(
        &mut self,
        m: &mut MtpModule,
        pairs: &[(&[f32], u32)],
        first_pos: usize,
    ) -> Option<MetalWarmPending> {
        use crate::gpu_metal::{AttnDeviceParams, AttnGpuLayer, GraphDims, MetalFfn, VerifyGraph};
        let first_pos = first_pos.saturating_sub(self.mtp_pos_base);
        let b = pairs.len();
        if b == 0 || b > 512 || m.kv.mode != crate::kv_cache::KvMode::F32 || m.kv.o1.is_some() {
            return None;
        }
        let AttnKind::Full {
            wq,
            wk,
            wv,
            wo,
            q_norm,
            k_norm,
            output_gate,
            softplus_gate: None,
            bias: None,
        } = &m.layer.attn
        else {
            return None;
        };
        let FfnKind::Dense(d) = &m.layer.ffn else {
            return None;
        };
        if !d.segs.is_empty() {
            return None;
        }
        let (Some(pq), Some(pk), Some(pv), Some(po)) =
            (wq.q1_parts(), wk.q1_parts(), wv.q1_parts(), wo.q1_parts())
        else {
            return None;
        };
        let (Some(g), Some(u), Some(dn)) = (
            d.gate_proj.q1_parts(),
            d.up_proj.q1_parts(),
            d.down_proj.q1_parts(),
        ) else {
            return None;
        };
        let Some(eh) = m.eh_proj.q1_parts() else {
            return None;
        };
        let QTensor::Mapped { model, .. } = wq else {
            return None;
        };
        let model = model.clone();
        let hs = self.hidden_size;
        // [enorm(embed(tok)); hnorm(hidden)] rows
        let mut cat = vec![0f32; b * 2 * hs];
        for (j, (h, tok)) in pairs.iter().enumerate() {
            let e = self.embed_single(*tok);
            let (ce, ch) = cat[j * 2 * hs..(j + 1) * 2 * hs].split_at_mut(hs);
            inference::rms_norm_into(&e, &m.enorm, self.rms_eps, self.norm_style, ce);
            inference::rms_norm_into(h, &m.hnorm, self.rms_eps, self.norm_style, ch);
        }
        let dims = GraphDims {
            hidden: hs,
            eps: self.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        };
        spec_stamp("w.cat");
        let Some(mut graph) = VerifyGraph::new_via_proj(&model, dims, eh, &cat, b) else {
            return None;
        };
        spec_stamp("w.new");
        let l = AttnGpuLayer {
            mhc: None,
            attn_norm: &m.layer.input_norm,
            post_norm: &m.layer.post_norm,
            wq: pq,
            wk: pk,
            wv: pv,
            wo: po,
            ffn: MetalFfn::Dense {
                gate: g,
                up: u,
                down: dn,
                act: (d.act == Act::Gelu) as u8,
            },
            attn_out_norm: None,
            ffn_out_norm: None,
            layer_scale: None,
        };
        let (nh, nkv, hd, rd) = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.rotary_dim,
        );
        let inv_freq = self.inv_freq.clone();
        let cpu_stored;
        {
            let cache = &m.kv;
            let cpu_k: Vec<&[f32]> = (0..nkv).map(|g| cache.head_keys(g)).collect();
            let cpu_v: Vec<&[f32]> = (0..nkv).map(|g| cache.head_values(g)).collect();
            cpu_stored = cpu_k[0].len() / hd;
            // The cache may LAG the position (rows nobody warmed): the
            // pairs land at cpu_stored.. with their true RoPE positions
            // first_pos.., exactly what the one-by-one warm does. A cache
            // AHEAD of the position is a real inconsistency.
            if cpu_stored > first_pos {
                spec_stamp("w.decl");
                return None;
            }
            let p = AttnDeviceParams {
                kv_id: self.mtp_kv_id(),
                layer: Self::MTP_LAYER_BASE,
                nh,
                nkv,
                hd,
                rd,
                position: first_pos,
                scale: self.attn_scale,
                eps: self.rms_eps as f32,
                gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
                late_qk_norm: self.qk_norm_after_rope,
                output_gate: *output_gate,
                q_norm: q_norm.as_deref(),
                k_norm: k_norm.as_deref(),
                inv_freq: &inv_freq,
                rope_scale: self.rope_scale,
                cpu_k,
                cpu_v,
                cpu_stored,
                cpu_gen: cache.generation(),
                o1: None,
                window: None,
                softmax_sink: None,
                head_gate: None,
                v_norm: false,
                dash: None,
            };
            if !graph.attn_ok(&l, &p) || !graph.encode_attn_b(&l, &p) {
                return None;
            }
        }
        spec_stamp("w.enc");
        if !graph.submit() {
            return None;
        }
        spec_stamp("w.sub");
        Some(MetalWarmPending {
            graph,
            cpu_stored,
            b,
        })
    }

    /// Submit and finish in one call (the prefill's MTP warm-up, where
    /// nothing runs in between).
    #[cfg(target_os = "macos")]
    fn mtp_warm_batch_metal(
        &mut self,
        m: &mut MtpModule,
        pairs: &[(&[f32], u32)],
        first_pos: usize,
    ) -> bool {
        match self.mtp_warm_batch_submit(m, pairs, first_pos) {
            Some(p) => self.mtp_warm_batch_finish(m, p),
            None => false,
        }
    }

    /// Second half of the batched warm-up: wait for the submitted graph,
    /// pull its b appended K/V rows into the CPU MTP cache, re-point the
    /// mirror. False = the command buffer failed or the rows are missing
    /// (nothing appended; the caller falls back to the one-by-one warm).
    #[cfg(target_os = "macos")]
    fn mtp_warm_batch_finish(&mut self, m: &mut MtpModule, pending: MetalWarmPending) -> bool {
        let MetalWarmPending {
            mut graph,
            cpu_stored,
            b,
        } = pending;
        let (nkv, hd) = (self.num_kv_heads, self.head_dim);
        if !graph.sync() {
            return false;
        }
        spec_stamp("w.gpu");
        let mut kbuf = vec![0f32; b * nkv * hd];
        let mut vbuf = vec![0f32; b * nkv * hd];
        if !crate::gpu_metal::kv_mirror_read_rows(
            self.mtp_kv_id(),
            Self::MTP_LAYER_BASE,
            nkv,
            hd,
            cpu_stored,
            b,
            &mut kbuf,
            &mut vbuf,
        ) {
            return false;
        }
        for r in 0..b {
            m.kv.append(
                &kbuf[r * nkv * hd..(r + 1) * nkv * hd],
                &vbuf[r * nkv * hd..(r + 1) * nkv * hd],
                &[],
            );
        }
        crate::gpu_metal::kv_mirror_set_stored(
            self.mtp_kv_id(),
            Self::MTP_LAYER_BASE,
            cpu_stored + b,
        );
        spec_stamp("w.kv");
        true
    }

    /// A committed token id from the high table (Cyrillic, CJK and the
    /// like sit above 131072 in Qwen's vocabulary; Latin subwords past
    /// the 65536 cut are rare enough to lose as rejected drafts) switches
    /// the draft to the full head for the next 16 tokens; other ids count
    /// down. On an M4 the full 660 MB head costs 5.5 ms a draft step
    /// against 1.4 for the shortlist, so the streak is kept short.
    pub(crate) fn note_draft_id(&mut self, id: u32) {
        let cut = Self::draft_vocab_rows(usize::MAX).max(131_072);
        if (id as usize) >= cut {
            self.draft_full_streak = 16;
        } else {
            self.draft_full_streak = self.draft_full_streak.saturating_sub(1);
        }
    }

    /// The draft head's rows for the next step: the shortlist, or the full
    /// head while `draft_full_streak` runs.
    fn draft_head_rows(&self, head_rows: usize) -> usize {
        if self.draft_full_streak > 0 {
            head_rows
        } else {
            Self::draft_vocab_rows(head_rows)
        }
    }

    /// Draft-head shortlist size: `CMF_DRAFT_VOCAB` rows (default 65536,
    /// capped at the head; 0 = full head).
    fn draft_vocab_rows(head_rows: usize) -> usize {
        static N: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
        let n = *N.get_or_init(|| {
            std::env::var("CMF_DRAFT_VOCAB")
                .ok()
                .and_then(|v| v.parse().ok())
                .unwrap_or(65536)
        });
        if n == 0 { head_rows } else { n.min(head_rows) }
    }

    /// One MTP block step on the native Metal token graph: block input on
    /// the host, the attention layer + FFN device-resident over the MTP
    /// mirror, the head folded in when `want_logits`. The appended K/V row
    /// is pulled into the CPU MTP cache (owner of record) after the sync.
    #[cfg(target_os = "macos")]
    fn mtp_step_metal(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        next_token: u32,
        position: usize,
        want_logits: bool,
    ) -> Option<(Vec<f32>, Vec<f32>)> {
        use crate::gpu_metal::{AttnDeviceParams, AttnGpuLayer, GraphDims, MetalFfn, TokenGraph};
        let position = position.saturating_sub(self.mtp_pos_base);
        if std::env::var("CMF_MTP_GRAPH").as_deref() == Ok("0")
            || !crate::gpu::q1_force()
            || !crate::gpu::enabled_here()
            || self.attn_softcap > 0.0
            || self.attention_heads_per_layer.is_some()
            || m.kv.mode != crate::kv_cache::KvMode::F32
            || m.kv.o1.is_some()
        {
            return None;
        }
        let AttnKind::Full {
            wq,
            wk,
            wv,
            wo,
            q_norm,
            k_norm,
            output_gate,
            softplus_gate: None,
            bias: None,
        } = &m.layer.attn
        else {
            return None;
        };
        let FfnKind::Dense(d) = &m.layer.ffn else {
            return None;
        };
        if d.act != Act::Silu || !d.segs.is_empty() {
            return None;
        }
        let (pq, pk, pv, po) = (
            wq.q1_parts()?,
            wk.q1_parts()?,
            wv.q1_parts()?,
            wo.q1_parts()?,
        );
        let (g, u, dn) = (
            d.gate_proj.q1_parts()?,
            d.up_proj.q1_parts()?,
            d.down_proj.q1_parts()?,
        );
        let QTensor::Mapped { model, .. } = wq else {
            return None;
        };
        let model = model.clone();
        let lm = if want_logits {
            Some(self.weights.lm_head.q1_parts()?)
        } else {
            None
        };
        let dims = GraphDims {
            hidden: self.hidden_size,
            eps: self.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        };
        // The block input `eh_proj · [enorm(e); hnorm(h)]` rides in the
        // graph (one submit a step); the host per-op matvec if it cannot.
        let hs = self.hidden_size;
        let mut x = vec![0f32; hs];
        // Let an eligible q4tp MTP draft use the measured masked-nibble
        // matvec.  Unlike fused epilogues, this reduces the draft's
        // projection work without changing its residual-update schedule;
        // the target verifier remains the authority over emitted tokens.
        // The guard keeps `CMF_METAL_MVFAST=0` as an immediate rollback
        // switch and restores the caller's setting on every early return.
        let _mtp_fast = crate::gpu_metal::MvFastGuard::set_bits(
            crate::gpu_metal::DENSE_MV,
        );
        let mut graph = TokenGraph::new(&model, dims, &x)?;
        let mut folded = false;
        if let Some(eh) = m.eh_proj.q1_parts() {
            let e = self.embed_single(next_token);
            let mut cat = vec![0.0f32; 2 * hs];
            let (cat_e, cat_h) = cat.split_at_mut(hs);
            inference::rms_norm_into(&e, &m.enorm, self.rms_eps, self.norm_style, cat_e);
            inference::rms_norm_into(hidden, &m.hnorm, self.rms_eps, self.norm_style, cat_h);
            folded = graph.encode_input_proj(eh, &cat);
        }
        if !folded {
            x = self.mtp_block_input(m, hidden, next_token);
            graph = TokenGraph::new(&model, dims, &x)?;
        }
        spec_stamp("d.in");
        let l = AttnGpuLayer {
            mhc: None,
            attn_norm: &m.layer.input_norm,
            post_norm: &m.layer.post_norm,
            wq: pq,
            wk: pk,
            wv: pv,
            wo: po,
            ffn: MetalFfn::Dense {
                gate: g,
                up: u,
                down: dn,
                act: (d.act == Act::Gelu) as u8,
            },
            attn_out_norm: None,
            ffn_out_norm: None,
            layer_scale: None,
        };
        let (nh, nkv, hd, rd) = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.rotary_dim,
        );
        let inv_freq = self.inv_freq.clone();
        {
            let cache = &m.kv;
            let cpu_k: Vec<&[f32]> = (0..nkv).map(|g| cache.head_keys(g)).collect();
            let cpu_v: Vec<&[f32]> = (0..nkv).map(|g| cache.head_values(g)).collect();
            let cpu_stored = cpu_k[0].len() / hd;
            let p = AttnDeviceParams {
                kv_id: self.mtp_kv_id(),
                layer: Self::MTP_LAYER_BASE,
                nh,
                nkv,
                hd,
                rd,
                position,
                scale: self.attn_scale,
                eps: self.rms_eps as f32,
                gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
                late_qk_norm: self.qk_norm_after_rope,
                output_gate: *output_gate,
                q_norm: q_norm.as_deref(),
                k_norm: k_norm.as_deref(),
                inv_freq: &inv_freq,
                rope_scale: self.rope_scale,
                cpu_k,
                cpu_v,
                cpu_stored,
                cpu_gen: cache.generation(),
                o1: None,
                window: None,
                softmax_sink: None,
                head_gate: None,
                v_norm: false,
                dash: None,
            };
            if !graph.attn_device_ok(&l, &p) || !graph.encode_attn_device(&l, &p) {
                return None;
            }
        }
        // The draft's head over a vocabulary SHORTLIST (the first
        // CMF_DRAFT_VOCAB rows — BPE ids run roughly by merge rank, so the
        // low ids carry the mass): the verify keeps the full head, so a true
        // token past the cut is only a rejected draft, never a wrong token.
        // 662 MB a step on Qwen3.8 becomes 170 MB at 65536.
        let draft_rows = if let Some(lm) = lm {
            self.draft_head_rows(lm.1)
        } else {
            0
        };
        if let Some(lm) = lm {
            if !graph.lm_head_ok(lm) {
                return None;
            }
            if draft_rows < lm.1 {
                if !graph.encode_lm_head_part(&m.final_norm, lm, draft_rows) {
                    return None;
                }
            } else {
                graph.encode_lm_head(&m.final_norm, lm);
            }
        }
        spec_stamp("d.enc");
        if graph.sync_checked().is_err() {
            return None;
        }
        spec_stamp("d.gpu");
        let mut logits = Vec::new();
        if let Some(lm) = lm {
            let n_read = draft_rows.min(lm.1).min(self.vocab_size);
            logits = attention::take_buf(n_read);
            graph.read_logits(&mut logits);
            // ids past the shortlist: never drafted (−∞ in every chain)
            pad_mtp_draft_logits(&mut logits, self.vocab_size);
        }
        graph.finish(&mut x);
        let mut krow = attention::take_buf(nkv * hd);
        let mut vrow = attention::take_buf(nkv * hd);
        if crate::gpu_metal::kv_mirror_read_last(
            self.mtp_kv_id(),
            Self::MTP_LAYER_BASE,
            nkv,
            hd,
            &mut krow,
            &mut vrow,
        ) {
            m.kv.append(&krow, &vrow, &[]);
        }
        attention::recycle_buf(&mut krow);
        attention::recycle_buf(&mut vrow);
        spec_stamp("d.rd");
        Some((logits, x))
    }

    /// `CMF_MTP_CHAIN=0` keeps the per-step draft (one submit and one
    /// host round trip per MTP step); the default drafts the whole chain
    /// in one command buffer when the round is plain greedy.
    ///
    /// Measured on an M4 (24 GB), Qwen3.8-27B q4tp, P3 at 160 tokens,
    /// k=7, six runs per arm alternating inside one lock window — the
    /// round's draft phase (median over the 34 rounds of a run) is
    /// 34.5 ms per round old against 30.1 new, i.e. 4.93 → 4.31 ms per
    /// draft step. That is the whole prize: the 7 submits cost ~0.6 ms
    /// each in host and submit latency and nothing else changes —
    /// acceptance (3.41 of 7) and tokens per round (4.41) are identical,
    /// and the round is 289 → 285 ms, decode 13.8 → 14.0 tok/s.
    fn mtp_chain_on() -> bool {
        static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
        *ON.get_or_init(|| std::env::var("CMF_MTP_CHAIN").as_deref() != Ok("0"))
    }

    /// The round's k greedy drafts as ONE command buffer on Metal: the MTP
    /// block k times back to back, each step's token embedding gathered
    /// on the device from the argmax the step before it wrote, the head
    /// over the round's shortlist (or the full head during a full-head
    /// streak — decided once, before the chain, exactly as the per-step
    /// path decides it per step, since `draft_full_streak` only moves on
    /// a commit). One wait, then the k ids and the k appended K/V rows
    /// come back; the CPU MTP cache ends where k `mtp_step_metal` calls
    /// would have left it. `Err(false)` = declined before anything was
    /// committed (the per-step path takes the round); `Err(true)` = the
    /// command buffer failed after commit.
    #[cfg(target_os = "macos")]
    fn mtp_draft_chain_metal(
        &mut self,
        m: &mut MtpModule,
        hidden: &[f32],
        t_next: u32,
        position: usize,
        k: usize,
    ) -> Result<Vec<u32>, bool> {
        use crate::gpu_metal::{AttnDeviceParams, AttnGpuLayer, GraphDims, MetalFfn, TokenGraph};
        let position = position.saturating_sub(self.mtp_pos_base);
        if k == 0
            || k > 64
            || !Self::mtp_chain_on()
            || std::env::var("CMF_MTP_GRAPH").as_deref() == Ok("0")
            || !crate::gpu::q1_force()
            || !crate::gpu::enabled_here()
            || self.attn_softcap > 0.0
            || self.attention_heads_per_layer.is_some()
            || m.kv.mode != crate::kv_cache::KvMode::F32
            || m.kv.o1.is_some()
            // the chain gathers embeddings itself: only the plain table
            || self.dsv4.is_some()
            || self.dsv41.is_some()
            || self.dory.is_some()
            || self.qwen4_exp.is_some()
            || self.per_token_stack()
        {
            return Err(false);
        }
        let AttnKind::Full {
            wq,
            wk,
            wv,
            wo,
            q_norm,
            k_norm,
            output_gate,
            softplus_gate: None,
            bias: None,
        } = &m.layer.attn
        else {
            return Err(false);
        };
        let FfnKind::Dense(d) = &m.layer.ffn else {
            return Err(false);
        };
        if d.act != Act::Silu || !d.segs.is_empty() {
            return Err(false);
        }
        let (Some(pq), Some(pk), Some(pv), Some(po)) =
            (wq.q1_parts(), wk.q1_parts(), wv.q1_parts(), wo.q1_parts())
        else {
            return Err(false);
        };
        let (Some(g), Some(u), Some(dn)) = (
            d.gate_proj.q1_parts(),
            d.up_proj.q1_parts(),
            d.down_proj.q1_parts(),
        ) else {
            return Err(false);
        };
        let (Some(eh), Some(lm)) = (m.eh_proj.q1_parts(), self.weights.lm_head.q1_parts()) else {
            return Err(false);
        };
        let QTensor::Mapped { model, .. } = wq else {
            return Err(false);
        };
        let model = model.clone();
        // the embedding table: a q4tp tensor of the SAME blob, no Prism
        // inverse-embedding post-pass
        let QTensor::Mapped {
            model: em,
            idx: eidx,
            dtype: cortiq_core::TensorDtype::Q4TiledP,
            ..
        } = &self.weights.embed_tokens
        else {
            return Err(false);
        };
        if !std::sync::Arc::ptr_eq(em, &model)
            || crate::prism::is_inverse_embedding(&model, &model.tensors[*eidx].name)
        {
            return Err(false);
        }
        let embed = (
            *eidx,
            self.weights.embed_tokens.rows(),
            self.weights.embed_tokens.cols(),
        );
        if embed.2 != self.hidden_size || hidden.len() != self.hidden_size {
            return Err(false);
        }
        let dims = GraphDims {
            hidden: self.hidden_size,
            eps: self.rms_eps as f32,
            gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
        };
        // Keep the chained MTP draft on the masked-nibble Metal matvec
        // path.  This scope covers every encode in the chain; the guard
        // restores its predecessor when this round returns or declines.
        let _mtp_fast = crate::gpu_metal::MvFastGuard::set_bits(
            crate::gpu_metal::DENSE_MV,
        );
        let Some(mut graph) = TokenGraph::new(&model, dims, hidden) else {
            return Err(false);
        };
        if !graph.chain_embed_ok(embed) || !graph.lm_head_ok(lm) {
            return Err(false);
        }
        let l = AttnGpuLayer {
            mhc: None,
            attn_norm: &m.layer.input_norm,
            post_norm: &m.layer.post_norm,
            wq: pq,
            wk: pk,
            wv: pv,
            wo: po,
            ffn: MetalFfn::Dense {
                gate: g,
                up: u,
                down: dn,
                act: (d.act == Act::Gelu) as u8,
            },
            attn_out_norm: None,
            ffn_out_norm: None,
            layer_scale: None,
        };
        let (nh, nkv, hd, rd) = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.rotary_dim,
        );
        let inv_freq = self.inv_freq.clone();
        let draft_rows = self.draft_head_rows(lm.1);
        let n_arg = draft_rows.min(lm.1).min(self.vocab_size);
        if n_arg == 0 {
            return Err(false);
        }
        // `CMF_MTP_CHAIN_SPLIT=1` commits each step as it is encoded, so
        // the GPU starts on step 0 while the host is still encoding step
        // 1 — a probe for whether the host encode is on the critical
        // path. It is not: three runs each, draft 30.0 ms per round split
        // against 30.1 whole, and the whole chain's host encode measures
        // 0.3 ms against a 29.7 ms wait. Kept as a probe, off by default.
        let split = std::env::var("CMF_MTP_CHAIN_SPLIT").as_deref() == Ok("1");
        // The input stage, the embedding and the block's input projection, goes as a command
        // of its own. The weights are one buffer of 13.6 GB on a Mac, the embedding table lies
        // 1.5 GB into it and the draft block 13.1 GB: in one command with the block the driver
        // held the command 150 to 170 ms before the GPU ran its 9 ms, in every round until the
        // first one without a warm-up. MacBook Air M4, Qwen3.8-27B, a round of two drafts:
        // 362 → 204 ms. `CMF_MTP_CHAIN_JOIN=1` keeps one command.
        let join = std::env::var("CMF_MTP_CHAIN_JOIN").as_deref() == Ok("1");
        let t_chain = std::time::Instant::now();
        graph.chain_ids_init(t_next, k);
        let cpu_stored;
        {
            let cache = &m.kv;
            let cpu_k: Vec<&[f32]> = (0..nkv).map(|g| cache.head_keys(g)).collect();
            let cpu_v: Vec<&[f32]> = (0..nkv).map(|g| cache.head_values(g)).collect();
            cpu_stored = cpu_k[0].len() / hd;
            for j in 0..k {
                if !graph.encode_chain_input(
                    embed,
                    j as u32,
                    &m.enorm,
                    &m.hnorm,
                    self.embed_multiplier,
                    eh,
                ) {
                    return Err(false);
                }
                // step j's mirror row: the mirror is re-pointed at the CPU
                // rows before step 0 and advances by one per step; its
                // resync (never taken past step 0) reads the CPU rows
                let p = AttnDeviceParams {
                    kv_id: self.mtp_kv_id(),
                    layer: Self::MTP_LAYER_BASE,
                    nh,
                    nkv,
                    hd,
                    rd,
                    position: position + j,
                    scale: self.attn_scale,
                    eps: self.rms_eps as f32,
                    gemma: self.norm_style == cortiq_core::NormStyle::Gemma,
                    late_qk_norm: self.qk_norm_after_rope,
                    output_gate: *output_gate,
                    q_norm: q_norm.as_deref(),
                    k_norm: k_norm.as_deref(),
                    inv_freq: &inv_freq,
                    rope_scale: self.rope_scale,
                    cpu_k: cpu_k.clone(),
                    cpu_v: cpu_v.clone(),
                    cpu_stored: cpu_stored + j,
                    cpu_gen: cache.generation(),
                    o1: None,
                    window: None,
                    softmax_sink: None,
                    head_gate: None,
                    v_norm: false,
                    dash: None,
                };
                if !join {
                    graph.commit();
                }
                if !graph.attn_device_ok(&l, &p) || !graph.encode_attn_device(&l, &p) {
                    return Err(false);
                }
                if draft_rows < lm.1 {
                    if !graph.encode_lm_head_part(&m.final_norm, lm, draft_rows) {
                        return Err(false);
                    }
                } else {
                    graph.encode_lm_head(&m.final_norm, lm);
                }
                if !graph.encode_argmax(n_arg, j as u32 + 1) {
                    return Err(false);
                }
                if split {
                    // CMF_MTP_CHAIN_SPLIT=1: commit every step so the GPU
                    // starts on step 0 while the host encodes the rest
                    graph.commit();
                }
            }
        }
        let t_enc = t_chain.elapsed();
        if graph.sync_checked().is_err() {
            return Err(true);
        }
        if std::env::var_os("CMF_GRAPH_SPEC_TIME").is_some() {
            eprintln!(
                "mtp-chain: encode {:.1} ms | wait {:.1} ms (k={k}, head rows {draft_rows}{})",
                t_enc.as_secs_f64() * 1e3,
                (t_chain.elapsed() - t_enc).as_secs_f64() * 1e3,
                if split { ", split" } else { "" }
            );
            if std::env::var("CMF_METAL_CMD_TIMES").as_deref() == Ok("1") {
                eprintln!("metal-set: {}", crate::gpu_metal::working_set_report());
            }
        }
        let mut ids = vec![0u32; k];
        if !graph.chain_ids_read(&mut ids) {
            return Err(true);
        }
        let mut kbuf = vec![0f32; k * nkv * hd];
        let mut vbuf = vec![0f32; k * nkv * hd];
        if !crate::gpu_metal::kv_mirror_read_rows(
            self.mtp_kv_id(),
            Self::MTP_LAYER_BASE,
            nkv,
            hd,
            cpu_stored,
            k,
            &mut kbuf,
            &mut vbuf,
        ) {
            return Err(true);
        }
        for r in 0..k {
            m.kv.append(
                &kbuf[r * nkv * hd..(r + 1) * nkv * hd],
                &vbuf[r * nkv * hd..(r + 1) * nkv * hd],
                &[],
            );
        }
        Ok(ids)
    }

    fn try_batch_graph_wgpu(
        &self,
        hiddens: &mut [f32],
        positions: &[usize],
        k: usize,
        spec: Option<crate::gpu::SpecTail<'_>>,
    ) -> crate::gpu::BatchGraphOutcome {
        self.try_batch_graph_wgpu_prefix(hiddens, positions, k, spec, None)
    }

    /// `try_batch_graph_wgpu` with the device-prefix mode: `layers_run`
    /// Some lets a stack that does not fit run its leading layers (the
    /// token graph's prefix rule) and reports how many; `hiddens` then
    /// holds the boundary rows and the caller runs the rest on the host.
    fn try_batch_graph_wgpu_prefix(
        &self,
        hiddens: &mut [f32],
        positions: &[usize],
        k: usize,
        spec: Option<crate::gpu::SpecTail<'_>>,
        layers_run: Option<&mut usize>,
    ) -> crate::gpu::BatchGraphOutcome {
        crate::gpu::graph_kv16_note(self.graph_kv_id, self.kv16_allowed());
        // SenseNova-Loop: the mHC kernels take two streams (the
        // CMF_MHC_GRAPH=0 knob keeps the host); MRoPE prompt rows ride the
        // per-row attention loop with their own angle tables.
        if self.mhc.as_ref().is_some_and(|m| {
                m.s.streams != 2 || m.s.fixed_identity || std::env::var("CMF_MHC_GRAPH").as_deref() == Ok("0")
            })
        {
            return crate::gpu::BatchGraphOutcome::Declined;
        }
        let graph_end = match self.mimo_moe.graph_prefix_end() {
            Some(end) if end < self.num_layers => {
                if layers_run.is_none() || spec.is_some() || end == 0 {
                    return crate::gpu::BatchGraphOutcome::Declined;
                }
                end
            }
            _ => self.num_layers,
        };
        let _tb = std::time::Instant::now();
        let batch_debug = std::env::var_os("CMF_BATCH_DEBUG").is_some();
        if self.attn_softcap > 0.0 {
            return crate::gpu::BatchGraphOutcome::Declined; // capped scores: no graph kernel — CPU path
        }
        // Same attention contract as the token graph: per-layer geometry
        // rides `geom`, anything it cannot express declines by name.
        if let Some(reason) = self
            .wgpu_graph_attn_decline()
            .or_else(|| self.batch_graph_gemma_decline())
        {
            self.note_graph_decline("wgpu batch graph", reason);
            return crate::gpu::BatchGraphOutcome::Declined;
        }
        let nh = self.num_heads;
        let (nkv, hd, rd) = self.layer_geom(0);
        let gemma = self.norm_style == cortiq_core::NormStyle::Gemma;
        fn gw(t: &QTensor) -> Option<crate::gpu::GraphW<'_>> {
            if let Some((m, i, kind, rs)) = t.graph_weight().or_else(|| t.graph_weight_descriptor())
            {
                let name = &m.tensors[i].name;
                let prism = if crate::prism::is_inverse_embedding(m, name) {
                    crate::gpu::GraphPrismOp::InverseEmbedding
                } else if crate::prism::is_forward_weight(m, name) {
                    crate::gpu::GraphPrismOp::Forward
                } else {
                    crate::gpu::GraphPrismOp::None
                };
                return Some(crate::gpu::GraphW {
                    idx: i,
                    kind,
                    row_scale: rs,
                    data: &[],
                    prism,
                    affine: crate::prism::is_affine_target(m, name),
                });
            }
            if std::env::var_os("CMF_BATCH_DEBUG").is_some() {
                eprintln!(
                    "batch graph: tensor has no graph descriptor/f32 fallback rows={} cols={}",
                    t.rows(),
                    t.cols()
                );
            }
            t.as_f32().map(|d| crate::gpu::GraphW {
                idx: 0,
                kind: 4,
                row_scale: &[],
                data: d,
                prism: crate::gpu::GraphPrismOp::None,
                affine: false,
            })
        }
        // Ripple's value residual: the chunk's embedding rows, as they enter
        // the first layer (the graph overwrites `hiddens`).
        let vres_e0: Vec<f32> = if self.value_blend.is_some() {
            hiddens[..k * self.hidden_size].to_vec()
        } else {
            Vec::new()
        };
        let built: Option<(
            Vec<crate::gpu::GraphLayer<'_>>,
            std::sync::Arc<cortiq_core::CmfModel>,
        )> = (|| {
            let mut layers = Vec::with_capacity(graph_end);
            let mut model = None;
            for li in 0..graph_end {
                let lw = &self.weights.layers[self.phys_layer(li)];
                // MoE routes per token, so its experts are encoded token by
                // token inside the batched submit while attention and the
                // projections stay GEMMs. Refusing MoE here is what left
                // prefill running one position at a time: 33 tok/s against
                // 54 on decode, i.e. reading the prompt was slower than
                // writing the answer.
                let gffn = match &lw.ffn {
                    FfnKind::Dense(d) if d.segs.len() > 1 => {
                        if batch_debug {
                            eprintln!("batch graph: dense segmented FFN at layer {li}");
                        }
                        return None;
                    }
                    FfnKind::Dense(d) => {
                        let Some((act, limit)) = d.act.dense_graph_contract() else {
                            if batch_debug {
                                eprintln!(
                                    "batch graph: dense FFN activation {:?} without a graph kernel at layer {li}",
                                    d.act
                                );
                            }
                            return None;
                        };
                        crate::gpu::GraphFfn::Dense {
                            gate: gw(&d.gate_proj)?,
                            up: gw(&d.up_proj)?,
                            down: gw(&d.down_proj)?,
                            act,
                            limit,
                            // The layer's one tube (hot neurons), always on.
                            hot: match d.segs.first() {
                                Some(seg) => Some(crate::gpu::GraphMoeDetachedShared {
                                    gate: gw(&seg.gate)?,
                                    up: gw(&seg.up)?,
                                    down: gw(&seg.down)?,
                                    width: seg.width,
                                }),
                                None => None,
                            },
                        }
                    }
                    FfnKind::Moe(m) => {
                        // Adaptive τ and expert masks stay on the CPU path.
                        // Sigmoid scores, the selection bias, a routed scale
                        // ≠ 1 and an ungated shared expert (hy_v3) ride the
                        // same flags word as the token graph — before, this
                        // refusal sent every Hy-MT2-30B prompt to the chunked
                        // fallback (8 tok/s of ingest against 53 of decode).
                        if m.route_tau.is_some() || m.mask.is_some() {
                            return None;
                        }
                        // A shared expert rides as slot top_k (gated or
                        // not is a flag on the select kernel); without one
                        // (MiMo-V2, LFM2-MoE) the kernels run top_k slots.
                        let inter0 = m.experts.first()?.gate_proj.rows();
                        // A wider shared expert (Unlimited-OCR) stays out of
                        // the packed bank, as on the token graph.
                        let detached_shared = match m.shared.as_ref() {
                            Some((se, None)) if se.gate_proj.rows() != inter0 || se.up_proj.rows() != inter0 => {
                                if !matches!(se.act, Act::Silu) {
                                    return None;
                                }
                                Some(crate::gpu::GraphMoeDetachedShared {
                                    gate: gw(&se.gate_proj)?,
                                    up: gw(&se.up_proj)?,
                                    down: gw(&se.down_proj)?,
                                    width: se.gate_proj.rows(),
                                })
                            }
                            _ => None,
                        };
                        let shared = m.shared.as_ref().filter(|_| detached_shared.is_none());
                        let has_shared = shared.is_some();
                        let shared_gated = matches!(shared, Some((_, Some(_))));
                        let sgate = match shared {
                            Some((_, Some(sg))) => gw(sg)?,
                            // Ungated or absent: the router plane stands in
                            // so the plumbing stays total; the kernel pins
                            // weight 1 or never reads it.
                            _ => gw(&m.router)?,
                        };
                        let router = gw(&m.router)?;
                        // The batch MoE kernels still consume raw per-token
                        // rows and do not carry the descriptor-aware Prism
                        // transform/affine bit for router or shared-gate
                        // planes.  Refuse rather than route an untransformed
                        // source activation.
                        if router.prism != crate::gpu::GraphPrismOp::None
                            || router.affine
                            || sgate.prism != crate::gpu::GraphPrismOp::None
                            || sgate.affine
                        {
                            return None;
                        }
                        let inter = m.experts.first()?.gate_proj.rows();
                        let mut experts = Vec::with_capacity(m.experts.len() + 1);
                        let mut q4tp: Option<bool> = None;
                        let mut gu_q2: Option<bool> = None;
                        let mut q82: Option<bool> = None;
                        // The packed MoE graph has one gate/up program per
                        // layer, so accept only one exact activation contract
                        // across routed and in-bank shared experts.
                        let mut moe_act = None;
                        for e in m.experts.iter().chain(shared.map(|(se, _)| se)) {
                            let Some(e_act) = e.act.wgpu_graph_act() else {
                                return None;
                            };
                            match moe_act {
                                Some(existing) if existing != e_act => return None,
                                None => moe_act = Some(e_act),
                                _ => {}
                            }
                            if e.gate_proj.rows() != inter || e.up_proj.rows() != inter {
                                return None;
                            }
                            // Same ladder as the token graph: q4t → q2tp
                            // (mixed profile: 2-bit gate/up over a q4tp
                            // down) → q4tp → q8_2f. Uniform across the layer.
                            let (mm, gi, ui, di, is_p, is_q2, is_8) = match e.gate_proj.mapped_q4t()
                            {
                                Some((mm, gi)) => (
                                    mm,
                                    gi,
                                    e.up_proj.mapped_q4t()?.1,
                                    e.down_proj.mapped_q4t()?.1,
                                    false,
                                    false,
                                    false,
                                ),
                                None => match e.gate_proj.mapped_q2tp() {
                                    Some((mm, gi)) => (
                                        mm,
                                        gi,
                                        e.up_proj.mapped_q2tp()?.1,
                                        e.down_proj.mapped_q4tp()?.1,
                                        true,
                                        true,
                                        false,
                                    ),
                                    None => match e.gate_proj.mapped_q4tp() {
                                        Some((mm, gi)) => (
                                            mm,
                                            gi,
                                            e.up_proj.mapped_q4tp()?.1,
                                            e.down_proj.mapped_q4tp()?.1,
                                            true,
                                            false,
                                            false,
                                        ),
                                        None => {
                                            if !crate::gpu::moe_q82_graph_on() {
                                                return None;
                                            }
                                            let (mm, gi) = e.gate_proj.mapped_q8_2f()?;
                                            (
                                                mm,
                                                gi,
                                                e.up_proj.mapped_q8_2f()?.1,
                                                e.down_proj.mapped_q8_2f()?.1,
                                                false,
                                                false,
                                                true,
                                            )
                                        }
                                    },
                                },
                            };
                            if *q4tp.get_or_insert(is_p) != is_p
                                || *gu_q2.get_or_insert(is_q2) != is_q2
                                || *q82.get_or_insert(is_8) != is_8
                            {
                                return None;
                            }
                            if [gi, ui, di].into_iter().any(|idx| {
                                mm.tensors.get(idx).is_some_and(|t| {
                                    crate::prism::is_forward_weight(mm, &t.name)
                                        || crate::prism::is_affine_target(mm, &t.name)
                                })
                            }) {
                                return None;
                            }
                            model.get_or_insert_with(|| mm.clone());
                            experts.push((gi, ui, di));
                        }
                        crate::gpu::GraphFfn::Moe {
                            router,
                            shared_gate: sgate,
                            experts,
                            n_exp: m.experts.len(),
                            top_k: m.top_k,
                            inter,
                            act: moe_act?,
                            norm_topk: m.norm_topk_prob,
                            q4tp: q4tp?,
                            gu_q2: gu_q2.unwrap_or(false),
                            q82: q82.unwrap_or(false),
                            sigmoid: m.router_sigmoid,
                            sigmoid_denom_eps: m.sigmoid_denom_eps,
                            bias: m.expert_bias.as_deref(),
                            has_shared,
                            detached_shared,
                            shared_gated,
                            route_scale: m.routed_scaling,
                        }
                    }
                    _ => return None,
                };
                let attn = match &lw.attn {
                    AttnKind::Full {
                        wq,
                        wk,
                        wv,
                        wo,
                        q_norm,
                        k_norm,
                        output_gate,
                        softplus_gate,
                        bias,
                    } => {
                        // Spark-X2.6's head-wise sigmoid gate rides the batch graph
                        // (one g_proj row per Q head); Laguna's softplus gate does not.
                        let head_gate = match softplus_gate {
                            Some((g, true)) if self.proj_gate_sigmoid && !*output_gate => Some(gw(g)?),
                            None => None,
                            Some(_) => {
                                if batch_debug {
                                    eprintln!("batch graph: unsupported Full attention gate at layer {li}");
                                }
                                return None;
                            }
                        };
                        if self.attention_heads_per_layer.is_some() {
                            if batch_debug {
                                eprintln!("batch graph: per-layer Q heads at layer {li}");
                            }
                            return None;
                        }
                        let (m, _, _, _) =
                            wq.graph_weight().or_else(|| wq.graph_weight_descriptor())?;
                        model = Some(m.clone());
                        crate::gpu::GraphAttn::Full {
                            wq: gw(wq)?,
                            wk: gw(wk)?,
                            wv: gw(wv)?,
                            wo: gw(wo)?,
                            q_norm: q_norm.as_deref(),
                            k_norm: k_norm.as_deref(),
                            late_qk_norm: self.qk_norm_after_rope,
                            bias: bias
                                .as_ref()
                                .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                            output_gate: *output_gate,
                            cpu_k: self.kv_cache.layers[li].k_heads(),
                            cpu_v: self.kv_cache.layers[li].v_heads(),
                            cpu_base: self.kv_cache.layers[li].base(),
                            geom: self.graph_attn_geom_vres(li, &vres_e0),
                            head_gate,
                        }
                    }
                    AttnKind::LinearGdn(w) => {
                        let Some(cfg) = self.gdn_cfg else {
                            if batch_debug {
                                eprintln!("batch graph: no GDN config at layer {li}");
                            }
                            return None;
                        };
                        let (m, _, _, _) = w
                            .in_proj_qkv
                            .graph_weight()
                            .or_else(|| w.in_proj_qkv.graph_weight_descriptor())?;
                        model = Some(m.clone());
                        crate::gpu::GraphAttn::Gdn {
                            qkv: gw(&w.in_proj_qkv)?,
                            z: gw(&w.in_proj_z)?,
                            a: gw(&w.in_proj_a)?,
                            b: gw(&w.in_proj_b)?,
                            out: gw(&w.out_proj)?,
                            conv1d: &w.conv1d,
                            a_log: &w.a_log,
                            dt_bias: &w.dt_bias,
                            norm: &w.norm,
                            nv: cfg.num_v_heads,
                            nk: cfg.num_k_heads,
                            dk: cfg.key_head_dim,
                            dv: cfg.value_head_dim,
                            kk: cfg.conv_kernel,
                            cpu_state: &self.kv_cache.layers[self.phys_layer(li)].linear_state,
                            preview: self.clover.as_ref().and_then(|c| c.graph_preview(li)),
                        }
                    }
                    _ => return None,
                };
                // Gemma-4's sandwich norms and layer scalar (`gemma_batch`),
                // Ripple's sandwich norms (the plain tails); every other
                // model hands the graph none, as before.
                let g4 = self.global_attn.is_some() || self.attn_v_norm;
                let sandwich = g4 || self.value_blend.is_some();
                layers.push(crate::gpu::GraphLayer {
                    mhc: crate::sensenova::graph_mhc(self.mhc.as_deref(), self.phys_layer(li)),
                    input_norm: &lw.input_norm,
                    attn,
                    post_norm: &lw.post_norm,
                    attn_out_norm: if sandwich {
                        lw.attn_out_norm.as_deref()
                    } else {
                        None
                    },
                    ffn_out_norm: if sandwich { lw.ffn_out_norm.as_deref() } else { None },
                    layer_scale: if g4 { lw.layer_scale } else { None },
                    ffn: gffn,
                });
            }
            Some((layers, model?))
        })();
        let Some((layers, model)) = built else {
            {
                use std::sync::atomic::{AtomicBool, Ordering};
                static SAID: AtomicBool = AtomicBool::new(false);
                if !SAID.swap(true, Ordering::Relaxed) {
                    tracing::warn!("batch graph: BUILDER refused (layer weights/kinds)");
                }
            }
            return crate::gpu::BatchGraphOutcome::Declined;
        };
        if std::env::var("CMF_GRAPH_SPEC_TIME").is_ok() {
            eprintln!("batch-build: {:.1} ms", _tb.elapsed().as_secs_f64() * 1e3);
        }
        // SenseNova-Loop and Mage-VL: their q8_2f prompt chunks take the
        // batched int8 GEMM.
        #[cfg(feature = "gpu")]
        crate::gpu_wgpu::set_batch_q82_mm(self.mhc.is_some() || self.onevision2_prefill());
        // SenseNova-Loop image prompt: each row's absolute MRoPE angles.
        #[cfg(feature = "gpu")]
        let _mrope = self.prompt_mrope.as_deref().zip(self.mrope_sections).map(|(pos, sections)| {
            let half = rd / 2;
            let mut tab = vec![0f32; k * 64];
            for (i, &p) in positions.iter().enumerate() {
                for j in 0..half.min(64) {
                    let a = pos.get(p).map_or(p as f32, |q| q[crate::sensenova::mrope_axis(j, sections)] as f32);
                    tab[i * 64 + j] = a * self.inv_freq[j];
                }
            }
            crate::gpu_wgpu::set_batch_mrope(Some(tab));
            struct Clear;
            impl Drop for Clear {
                fn drop(&mut self) {
                    crate::gpu_wgpu::set_batch_mrope(None);
                }
            }
            Clear
        });
        // a prompt chunk wholly before what the drafter's windows reach keeps none
        let taps = if positions.last().is_some_and(|&p| p < self.dflash_tap_from) { Vec::new() } else { self.dflash_taps_wanted(0, graph_end) };
        crate::gpu::layer_taps_arm(&taps);
        let outcome = crate::gpu::forward_batch_graph(
            &model,
            self.graph_kv_id,
            &layers,
            &self.inv_freq,
            hiddens,
            nh,
            nkv,
            hd,
            rd,
            self.hidden_size,
            self.intermediate_size,
            positions,
            self.kv_cache.max_seq_len,
            gemma,
            self.rms_eps as f32,
            self.attn_scale,
            k,
            &(0..graph_end)
                .map(|li| self.kv_cache.layers[self.phys_layer(li)].o1_views())
                .collect::<Vec<_>>(),
            self.o1_epoch,
            spec,
            layers_run,
        );
        self.dflash_taps_keep(&taps, positions[0], k, outcome == crate::gpu::BatchGraphOutcome::Completed);
        outcome
    }

    /// The layers a DFlash drafter reads, when a wgpu graph over layers
    /// `from..upto_excl` is the whole stack (nothing otherwise).
    fn dflash_taps_wanted(&self, from: usize, upto_excl: usize) -> Vec<usize> {
        match &self.dflash {
            Some(d) if (self.dflash_solo || dflash_pick() == Some(true) || crate::gpu::cuda_active()) && from == 0 && upto_excl >= self.num_layers => d.g.taps.clone(),
            _ => Vec::new(),
        }
    }

    /// Collect what the armed graph kept for `rows` rows from `pos0`
    /// (`ok`: it completed) into `dflash_taps`, a row's layers joined.
    fn dflash_taps_keep(&self, taps: &[usize], pos0: usize, rows: usize, ok: bool) {
        if taps.is_empty() {
            return;
        }
        let (nt, hs) = (taps.len(), self.hidden_size);
        let mut raw = Vec::new();
        if !crate::gpu::layer_taps_take(&mut raw) || !ok || raw.len() != nt * rows * hs {
            return;
        }
        let mut joined = vec![0f32; rows * nt * hs];
        for s in 0..nt {
            for r in 0..rows {
                joined[(r * nt + s) * hs..][..hs].copy_from_slice(&raw[(s * rows + r) * hs..][..hs]);
            }
        }
        if std::env::var_os("CMF_SPEC_DBG").is_some() {
            let rms = (joined.iter().map(|v| (*v as f64) * (*v as f64)).sum::<f64>() / joined.len().max(1) as f64).sqrt();
            eprintln!("solo-dbg: {rows} rows of {nt} layers kept from position {pos0} (rms {rms:.3})");
        }
        if let Some(dir) = std::env::var_os("CMF_DFLASH_DUMP") {
            self.dflash_dump(std::path::Path::new(&dir), pos0, rows, &joined);
        }
        let mut kept = self.dflash_taps.lock().unwrap();
        kept.push((pos0, joined));
        // a long prompt's rows wait here until the first round: past
        // `DFLASH_TAPS_ROWS` the oldest chunks go, and the drafter's context
        // starts at what is left
        let mut rows: usize = kept.iter().map(|(_, r)| r.len()).sum::<usize>() / (nt * hs);
        let cap = match &self.dflash {
            Some(d) if (0..d.g.layers).all(|l| d.g.window_of(l) > 0) => {
                DFLASH_TAPS_ROWS.min((0..d.g.layers).map(|l| d.g.window_of(l)).max().unwrap_or(0) + crate::dflash::BLOCK_SLACK)
            }
            _ => DFLASH_TAPS_ROWS,
        };
        while rows > cap && kept.len() > 1 {
            rows -= kept.remove(0).1.len() / (nt * hs);
        }
    }

    /// `CMF_DFLASH_DUMP=DIR`: what a reference run of the published drafter
    /// reads (`scripts/ripple/ripple_dflash_ref.py`). `taps.bin` grows by a
    /// record a kept chunk (position and row count as u64, then the rows'
    /// f32, a row's layers joined); the embedding table and the head are
    /// written once as f32, the table without the trunk's input scale.
    fn dflash_dump(&self, dir: &std::path::Path, pos0: usize, rows: usize, joined: &[f32]) {
        use std::io::Write;
        let _ = std::fs::create_dir_all(dir);
        let table = |name: &str, t: &QTensor| {
            let p = dir.join(name);
            if p.exists() {
                return;
            }
            let Ok(f) = std::fs::File::create(&p) else { return };
            let mut w = std::io::BufWriter::new(f);
            let mut row = vec![0f32; t.cols()];
            for r in 0..t.rows() {
                t.row_f32(r, &mut row);
                let _ = w.write_all(&f32_bytes(&row));
            }
        };
        table("embed.f32", &self.weights.embed_tokens);
        table("head.f32", &self.weights.lm_head);
        let meta = dir.join("meta.json");
        if !meta.exists() {
            let _ = std::fs::write(
                &meta,
                format!(
                    "{{\"hidden\": {}, \"vocab\": {}, \"embed_multiplier\": {}}}\n",
                    self.hidden_size,
                    self.weights.lm_head.rows(),
                    self.embed_multiplier
                ),
            );
        }
        if let Ok(mut f) = std::fs::OpenOptions::new().create(true).append(true).open(dir.join("taps.bin")) {
            let _ = f.write_all(&(pos0 as u64).to_le_bytes());
            let _ = f.write_all(&(rows as u64).to_le_bytes());
            let _ = f.write_all(&f32_bytes(joined));
        }
    }

    /// Rows the wgpu graphs kept become the drafter's context, oldest first.
    fn dflash_taps_absorb(&mut self) {
        let kept = std::mem::take(&mut *self.dflash_taps.lock().unwrap());
        if let Some(d) = self.dflash.as_mut() {
            for (pos0, rows) in kept {
                d.queue_context(pos0, &rows, self.pool.as_deref());
            }
        }
    }

    /// Same, stopping after layer `upto` inclusive (routing probe φ).
    /// `CMF_DSV4_DRAFT_PROBE=1` — grade the draft against what the trunk goes on
    /// to produce. Off by default; it runs a whole draft per decoded token.
    fn draft_probe() -> bool {
        static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
        *ON.get_or_init(|| std::env::var("CMF_DSV4_DRAFT_PROBE").is_ok_and(|v| v != "0"))
    }

    /// `CMF_DSV4_DRAFT_PROBE=1`: measure how much of the draft the trunk
    /// would have agreed with, WITHOUT verifying or rolling anything back.
    ///
    /// The number this produces decides the whole speculation design — at
    /// acceptance a, a block of B positions yields 1 + a + a² + ... tokens
    /// per trunk pass — so it is worth measuring before any of the machinery
    /// that would exploit it exists. Each draft is parked with the position
    /// it was made at, and graded as the real tokens arrive.
    /// `CMF_DSV4_SPEC=1` — the DeepSeek-V4 speculative decode: draft five
    /// on the card, verify them in one batched trunk pass, commit the
    /// accepted prefix, roll the rest back.
    #[cfg(feature = "gpu")]
    fn dsv4_spec_on() -> bool {
        static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
        *ON.get_or_init(|| {
            // Test-only runtime gate: model loading still performs the same
            // reservation and trunk packing, which gives rollback parity a
            // topology-identical non-speculative control arm.
            if let Ok(v) = std::env::var("CMF_DSV4_SPEC_RUN") {
                return v != "0";
            }
            // An explicit value is a diagnostic force/escape hatch.  With no
            // knob, speculation is eligible only when model loading reserved
            // its bounded pack.  On small q4tp cards the geometric reserve
            // gate deliberately leaves this at zero: trying to build DSpark
            // after the exact trunk filled VRAM is both slower and a device
            // OOM (measured on A40).
            std::env::var("CMF_DSV4_SPEC")
                .map(|v| v != "0")
                .unwrap_or_else(|_| {
                    crate::gpu_wgpu::DRAFT_RESERVE.load(std::sync::atomic::Ordering::Relaxed) > 0
                })
        })
    }

    /// One speculative round at the decode tip. `t_next` is the token the
    /// sampler just committed for `next_pos`. Returns the EXTRA accepted
    /// tokens (possibly none) and the new position, with `graph_logits`
    /// left holding the last accepted position's logits — exactly what the
    /// loop top expects. `None` means "speculate not this round": nothing
    /// was committed, the caller forwards normally.
    #[cfg(feature = "gpu")]
    fn dsv4_spec_step(
        &mut self,
        tip_token: u32,
        t_next: u32,
        next_pos: usize,
        max_extra: usize,
        drafted: &mut usize,
        accepted_ctr: &mut usize,
    ) -> Option<(Vec<u32>, usize)> {
        let t_all = std::time::Instant::now();
        if std::env::var("CMF_DSV4_SPEC_TIME").is_ok() {
            thread_local! {
                static LAST: std::cell::Cell<Option<std::time::Instant>> =
                    const { std::cell::Cell::new(None) };
            }
            LAST.with(|l| {
                if let Some(prev) = l.get() {
                    eprintln!(
                        "between rounds {:.1} ms",
                        prev.elapsed().as_secs_f64() * 1e3
                    );
                }
                l.set(Some(std::time::Instant::now()));
            });
        }
        if std::env::var("CMF_DSV4_SPEC_DEBUG").is_ok() {
            eprintln!("spec_step: enter pos={next_pos}");
        }
        let n_layers = self.dsv4.as_ref().map(|b| b.1.len())?;
        let cfg = self.dsv4.as_ref().map(|b| b.2)?;
        // The draft state and its capture, armed exactly as the probe does.
        if self.dspark.is_none() {
            let t = crate::dsv4::dspark_targets(&self.dsv4_mtp, &cfg, n_layers);
            if t.is_empty() {
                return None;
            }
            crate::dsv4::dspark_arm(&t, cfg.dim);
            self.dspark = Some(crate::dsv4::DsparkState::new(
                self.dsv4_mtp.len(),
                &cfg,
                t.len(),
            ));
        }
        let targets = crate::dsv4::dspark_targets(&self.dsv4_mtp, &cfg, n_layers);
        let pack = crate::dsv4::dspark_pack_get(&self.dsv4_mtp, &cfg);
        if pack.is_none() && std::env::var("CMF_DSV4_SPEC_DEBUG").is_ok() {
            eprintln!("spec_step: the pack was not built (targets {targets:?})");
        }
        let pack = pack?;
        let block = crate::dsv4::dspark_block();
        let b_box = self.dsv4.as_mut()?;
        let (g, layers, st) = (&b_box.0, &b_box.1, &mut b_box.3);
        let ds = self.dspark.as_mut()?;
        // The tip's captures: either this token ran on a normal path that
        // filled the thread-local, or the previous spec round left them.
        let dbg = std::env::var("CMF_DSV4_SPEC_DEBUG").is_ok();
        if !crate::dsv4::dspark_take(&mut ds.main_hidden) && !ds.have_hidden {
            if dbg {
                eprintln!("spec_step: no capture");
            }
            return None;
        }
        ds.have_hidden = true;
        let tip_pos = next_pos.checked_sub(1)?;
        let draft_started = std::time::Instant::now();
        let mut conf = Vec::new();
        let props = crate::dsv4::dspark_draft_gpu(
            g,
            &self.dsv4_mtp,
            &cfg,
            ds,
            pack,
            st.kv_id,
            tip_token,
            tip_pos,
            self.pool.as_deref(),
            &mut conf,
        );
        self.dspark_draft_ns += draft_started.elapsed().as_nanos();
        *drafted += block;
        if props.is_empty() || props[0] != t_next {
            if dbg {
                eprintln!(
                    "spec_step: draft {} (props0={:?} t_next={t_next})",
                    if props.is_empty() {
                        "empty"
                    } else {
                        "miss"
                    },
                    props.first()
                );
            }
            return None;
        }
        // `fed[0]` is `t_next`, which the outer loop has already committed;
        // only `fed[1..]` become additional output tokens. Cap the verify
        // transaction itself to the caller's remaining output budget instead
        // of merely truncating the returned vector: otherwise the KV/state
        // would advance past `max_tokens` and a 64-token request could return
        // 66 tokens (and poison a reused session with two invisible steps).
        let mut k_verify = crate::dsv4::dspark_verify_k()
            .min(props.len())
            .min(max_extra.saturating_add(1));
        // Adaptive depth: positions the draft itself doubts are paid for on
        // every verify and delivered almost never (natural-text survival
        // [.67 .50 .29 .08 .04]). `CMF_DSPARK_CONF_MIN=p` trims the fed
        // prefix at the first proposal whose confidence drops below p; on
        // predictable text the confidences stay high and nothing changes.
        let conf_min = {
            static M: std::sync::OnceLock<f32> = std::sync::OnceLock::new();
            *M.get_or_init(|| {
                std::env::var("CMF_DSPARK_CONF_MIN")
                    .ok()
                    .and_then(|v| v.parse().ok())
                    .unwrap_or(0.0)
            })
        };
        if conf_min > 0.0 && conf.len() >= props.len() {
            let mut keep = 1usize;
            while keep < k_verify && conf.get(keep).copied().unwrap_or(0.0) >= conf_min {
                keep += 1;
            }
            k_verify = k_verify.min(keep.max(2));
        }
        if k_verify < 2 {
            return None;
        }
        let mut fed = Vec::with_capacity(k_verify);
        fed.push(t_next);
        fed.extend_from_slice(&props[1..k_verify]);
        let mut argmax = Vec::new();
        let mut logits_all = Vec::new();
        let mut walked = Vec::new();
        let txn = crate::dsv4::dsv4_verify_chunk(
            g,
            layers,
            &cfg,
            st,
            &fed,
            next_pos,
            &self.inv_freq,
            self.pool.as_deref(),
            &targets,
            &mut argmax,
            &mut logits_all,
            &mut walked,
        );
        if txn.is_none() && dbg {
            eprintln!("spec_step: verify declined");
        }
        let txn = txn?;
        let spec_gpu_end = txn.gpu_end;
        let b = fed.len();
        let mut accepted = 1usize;
        while accepted < b && fed[accepted] == argmax[accepted - 1] {
            accepted += 1;
        }
        // `CMF_DSV4_SPEC_FORCE_REJECT=1` — accept nothing beyond the known
        // token, every round: the pure rollback exerciser. The output must
        // stay byte-identical to the plain walk; anything else is a
        // transaction bug, isolated from the acceptance logic.
        if std::env::var("CMF_DSV4_SPEC_FORCE_REJECT").is_ok_and(|v| v != "0") {
            accepted = 1;
        }
        if std::env::var("CMF_DSV4_SPEC_TRACE").is_ok() {
            eprintln!("spec@{next_pos}: fed={fed:?} argmax={argmax:?} accepted={accepted}");
        }
        let t_fin = std::time::Instant::now();
        if !crate::dsv4::dsv4_spec_finish(
            g,
            layers,
            &cfg,
            st,
            txn,
            accepted,
            &fed,
            &self.inv_freq,
            self.pool.as_deref(),
        ) {
            tracing::warn!("dsv4: the speculative rollback failed — the state is suspect");
            return None;
        }
        if std::env::var("CMF_DSV4_SPEC_TIME").is_ok() {
            eprintln!(
                "finish(k={accepted}): {:.1} ms",
                t_fin.elapsed().as_secs_f64() * 1e3
            );
        }
        *accepted_ctr += accepted - 1;
        // Captures per accepted token: device targets photographed by the
        // batch, host targets from the verify's own walk. The last one
        // becomes the new tip's draft input; every one owes the ring an
        // entry for its position.
        let (hc, dim) = (cfg.hc_mult, cfg.dim);
        // Complete-chain layers are photographed by the fused submission;
        // partial device layers overwrite that slot after exact host cold-
        // expert correction.  Thus every target in the contiguous device
        // prefix has a valid per-token capture.
        let dev_caps: Vec<usize> = targets
            .iter()
            .copied()
            .filter(|&t| t < spec_gpu_end)
            .collect();
        let mut caps_all = vec![0.0f32; dev_caps.len() * b * hc * dim];
        if !crate::gpu_wgpu::dsv4_spec_cap_read_all(b, dev_caps.len(), hc * dim, &mut caps_all) {
            return None;
        }
        for t in 0..accepted {
            let tip = t + 1 == accepted;
            for (slot, &tl) in targets.iter().enumerate() {
                if let Some(di) = dev_caps.iter().position(|&d| d == tl) {
                    let lo = (di * b + t) * hc * dim;
                    crate::dsv4::dspark_capture(
                        &caps_all[lo..lo + hc * dim],
                        &cfg,
                        slot,
                        &mut ds.main_hidden,
                    );
                } else if tip
                    && crate::dsv4::dspark_peek_slot(slot, dim, {
                        let lo = slot * dim;
                        &mut ds.main_hidden[lo..lo + dim]
                    })
                {
                    // The tip's host-layer captures are the walk's own
                    // per-layer notes — exact. (The walk that ran last ended
                    // on exactly this token, on both the accept-all and the
                    // rollback path.)
                } else {
                    // Intermediate tokens: the post-tail state stands in for
                    // the per-layer capture on host targets below the last
                    // layer. Ring-entry quality only; the tip is exact.
                    crate::dsv4::dspark_capture(
                        &walked[t * hc * dim..(t + 1) * hc * dim],
                        &cfg,
                        slot,
                        &mut ds.main_hidden,
                    );
                }
            }
            crate::dsv4::dspark_ring_append(
                g,
                &self.dsv4_mtp,
                &cfg,
                ds,
                next_pos + t,
                self.pool.as_deref(),
            );
        }
        let row = logits_all[(accepted - 1) * cfg.vocab..accepted * cfg.vocab].to_vec();
        self.graph_logits = Some(row);
        // The speculative loop never runs the probe, so the trunk tally has
        // no other place to cycle. Armed only when someone asked for the
        // dump; the host tail is the only tallying path here, which is
        // precisely the population a partial pack would serve.
        if std::env::var("CMF_DSV4_TRUNK_PICK_DUMP").is_ok() {
            crate::dsv4::trunk_freq_note(&crate::dsv4::pick_tally_take());
            crate::dsv4::pick_tally_arm();
        }
        if std::env::var("CMF_DSV4_SPEC_TIME").is_ok() {
            eprintln!(
                "spec_step total {:.1} ms (k={accepted})",
                t_all.elapsed().as_secs_f64() * 1e3
            );
        }
        Some((fed[1..accepted].to_vec(), next_pos + accepted))
    }

    fn dspark_probe(&mut self, position: usize, token_id: u32) {
        if self.dsv4_mtp.is_empty() || !Self::draft_probe() {
            return;
        }
        // What the trunk just routed to, for this token.
        let trunk_now = crate::dsv4::pick_tally_take();
        crate::dsv4::trunk_freq_note(&trunk_now);
        if !trunk_now.is_empty() {
            self.dspark_trunk_picks.push(trunk_now);
            let keep = crate::dsv4::dspark_block();
            if self.dspark_trunk_picks.len() > keep {
                self.dspark_trunk_picks.remove(0);
            }
        }
        // Grade whatever is waiting: the token just decoded sits at
        // `position`, so it answers the draft made at `position - 1 - i`.
        for p in std::mem::take(&mut self.dspark_pending) {
            let Some(i) = position.checked_sub(p.0 + 1) else {
                continue;
            };
            let mut p = p;
            if i < p.1.len() {
                if p.2 && p.1[i] == token_id {
                    p.3 = i + 1;
                } else {
                    p.2 = false;
                }
                if i + 1 < p.1.len() {
                    self.dspark_pending.push(p);
                    continue;
                }
            }
            self.dspark_hist.push(p.3);
            self.dspark_real.push(token_id);
        }
        let Some(b) = &mut self.dsv4 else { return };
        let (g, layers, cfg) = (&b.0, &b.1, b.2);
        let n_layers = layers.len();
        if self.dspark.is_none() {
            let t = crate::dsv4::dspark_targets(&self.dsv4_mtp, &cfg, n_layers);
            if t.is_empty() {
                return;
            }
            eprintln!(
                "DSpark: capture from layers {t:?}, block {}",
                crate::dsv4::dspark_block()
            );
            crate::dsv4::dspark_arm(&t, cfg.dim);
            self.dspark = Some(crate::dsv4::DsparkState::new(
                self.dsv4_mtp.len(),
                &cfg,
                t.len(),
            ));
        }
        let ds = self.dspark.as_mut().unwrap();
        if !crate::dsv4::dspark_take(&mut ds.main_hidden) {
            return; // this token ran on a path that captures nothing
        }
        let mut conf = Vec::new();
        crate::dsv4::pick_tally_arm();
        // The trunk has already consumed the adaptive VRAM budget. Until the
        // draft owns an explicit bounded device pack, its tensors are an
        // out-of-core CPU/disk tier by contract: never let per-op probes try
        // to squeeze another multi-gigabyte MTP expert cache onto the card.
        let draft_started = std::time::Instant::now();
        #[cfg(feature = "gpu")]
        let gpu_draft = crate::dsv4::dspark_gpu_on();
        #[cfg(not(feature = "gpu"))]
        let gpu_draft = false;
        let props = if gpu_draft {
            #[cfg(feature = "gpu")]
            {
                let kv_id = b.3.kv_id;
                match crate::dsv4::dspark_pack_get(&self.dsv4_mtp, &cfg) {
                    Some(pk) => crate::dsv4::dspark_draft_gpu(
                        g,
                        &self.dsv4_mtp,
                        &cfg,
                        ds,
                        pk,
                        kv_id,
                        token_id,
                        position,
                        self.pool.as_deref(),
                        &mut conf,
                    ),
                    None => Vec::new(),
                }
            }
            #[cfg(not(feature = "gpu"))]
            Vec::new()
        } else {
            crate::gpu::cpu_scope(|| {
                crate::dsv4::dspark_draft(
                    g,
                    &self.dsv4_mtp,
                    &cfg,
                    ds,
                    token_id,
                    position,
                    self.pool.as_deref(),
                    &mut conf,
                )
            })
        };
        self.dspark_draft_ns += draft_started.elapsed().as_nanos();
        let draft_picks = crate::dsv4::pick_tally_take();
        crate::dsv4::dspark_freq_note(&draft_picks);
        // Re-arm for the NEXT trunk token; the probe runs after the forward,
        // so this is the only place that can.
        crate::dsv4::pick_tally_arm();
        if !props.is_empty() {
            // Two ratios, side by side: what a batched verify over the trunk
            // would read against what it asks for, and the same for the
            // draft's three stages. Near 1.0 means a batch amortises nothing.
            let (tu, tt) = {
                let flat: Vec<(usize, Vec<usize>)> = self
                    .dspark_trunk_picks
                    .iter()
                    .flat_map(|v| v.iter().cloned())
                    .collect();
                // Per layer, across the window of tokens.
                let mut per: std::collections::HashMap<usize, Vec<usize>> =
                    std::collections::HashMap::new();
                for (li, picks) in flat {
                    per.entry(li).or_default().extend(picks);
                }
                let n = per.len().max(1);
                let mut u = 0usize;
                let mut t = 0usize;
                for (_, v) in per {
                    t += v.len();
                    u += v.iter().collect::<std::collections::HashSet<_>>().len();
                }
                (u / n, t / n)
            };
            let (du, dt) = crate::dsv4::tally_unique(&draft_picks);
            self.dspark_exp.push((tu, tt, du, dt));
            self.dspark_pending.push((position, props, true, 0));
        }
        if self.dspark_hist.len() >= 8 && self.dspark_hist.len() % 8 == 0 {
            let n = self.dspark_hist.len() as f32;
            let mean: f32 = self.dspark_hist.iter().sum::<usize>() as f32 / n;
            let block = crate::dsv4::dspark_block();
            let mut at = vec![0usize; block + 1];
            for &k in &self.dspark_hist {
                at[k] += 1;
            }
            // Prefix survival: S_i = P(the first i positions all held).
            let mut surv = Vec::with_capacity(block);
            for i in 1..=block {
                let k = at[i..].iter().sum::<usize>() as f32 / n;
                surv.push(format!("{k:.2}"));
            }
            let distinct = self
                .dspark_real
                .iter()
                .collect::<std::collections::HashSet<_>>()
                .len();
            let (tu, tt, du, dt) = self.dspark_exp.iter().fold((0, 0, 0, 0), |a, b| {
                (a.0 + b.0, a.1 + b.1, a.2 + b.2, a.3 + b.3)
            });
            let m = self.dspark_exp.len().max(1);
            eprintln!(
                "DSpark: {} drafts, {mean:.2} of {block} accepted on average \
                 (tokens per pass {:.2}), distribution {at:?}, survival [{}]",
                self.dspark_hist.len(),
                mean + 1.0,
                surv.join(" ")
            );
            eprintln!(
                "DSpark: {distinct} distinct tokens of {} (degeneracy), \
                 trunk experts {}/{} per layer over {block} tokens, \
                 draft {}/{} per block, draft {:.2} ms/block",
                self.dspark_real.len(),
                tu / m,
                tt / m,
                du / m,
                dt / m,
                self.dspark_draft_ns as f64 / self.dspark_exp.len().max(1) as f64 / 1e6
            );
        }
    }

    fn forward_layers_upto(
        &mut self,
        hidden: &[f32],
        position: usize,
        task_mask: Option<&TaskMask>,
        upto: Option<usize>,
    ) -> Vec<f32> {
        // In-process multi-GPU: each segment runs pinned to its card,
        // and the only thing crossing the boundary is one hidden vector
        // that never leaves this address space. Same layer split the
        // network mode does, minus the second process, the socket, the
        // serialization and the dir_hash handshake.
        if let Some(plan) = self.gpu_plan.clone() {
            if upto.is_none() && plan.len() > 1 {
                let mut h = hidden.to_vec();
                for &(dev, from, upto_incl) in plan.iter() {
                    h = crate::gpu::with_device(dev, || {
                        self.forward_layers_span(&h, position, task_mask, from, Some(upto_incl))
                    });
                }
                return h;
            }
        }
        self.forward_layers_span(hidden, position, task_mask, 0, upto)
    }

    /// Split this pipeline's layer stack across local GPUs: segment i
    /// runs on `devices[i]`. Contiguous and even by layer count — the
    /// VRAM-weighted planner is the next step, and an uneven card pair
    /// is why it will be needed. `None` clears the plan.
    pub fn set_gpu_plan(&mut self, devices: Option<&[usize]>) -> Result<(), String> {
        self.set_gpu_plan_at(devices, None)
    }

    /// The same, with an explicit first boundary (`--peer-split`): card
    /// 0 takes layers `[0..at)`, the rest split what remains. Uneven
    /// cards, or an attention-heavy head, are why this knob exists.
    pub fn set_gpu_plan_at(
        &mut self,
        devices: Option<&[usize]>,
        at: Option<usize>,
    ) -> Result<(), String> {
        let Some(devs) = devices.filter(|d| d.len() > 1) else {
            self.gpu_plan = None;
            return Ok(());
        };
        self.split_supported()?;
        let n = self.num_layers;
        if devs.len() > n {
            return Err(format!("{} devices for {n} layers", devs.len()));
        }
        if let Some(k) = at {
            if k == 0 || k >= n {
                return Err(format!("split at {k}: the model has {n} layers"));
            }
            if devs.len() == 2 {
                self.gpu_plan = Some(std::sync::Arc::new(vec![
                    (devs[0], 0, k - 1),
                    (devs[1], k, n - 1),
                ]));
                return Ok(());
            }
            return Err(format!(
                "an explicit split point takes exactly 2 devices, got {}",
                devs.len()
            ));
        }
        let per = n.div_ceil(devs.len());
        let mut plan = Vec::with_capacity(devs.len());
        let mut from = 0usize;
        for &d in devs {
            if from >= n {
                break;
            }
            let upto = (from + per - 1).min(n - 1);
            plan.push((d, from, upto));
            from = upto + 1;
        }
        self.gpu_plan = Some(std::sync::Arc::new(plan));
        Ok(())
    }

    /// The active in-process split, if any: (device, first layer, last).
    pub fn gpu_plan(&self) -> Option<Vec<(usize, usize, usize)>> {
        self.gpu_plan.as_ref().map(|p| p.as_ref().clone())
    }

    /// Layer span [from ..= upto] (upto None = last layer): the building
    /// block the network pipeline-split rides on. `from > 0` skips the
    /// arch escape hatches (the pub `forward_span` refuses those archs
    /// first) and the whole-token graph — the plain per-layer loop is
    /// the canonical executor for a partial stack.
    fn embryo_qtensor_f32(t: &QTensor) -> Vec<f32> {
        if let Some(x) = t.as_f32() {
            return x.to_vec();
        }
        let mut out = vec![0.0; t.rows() * t.cols()];
        for r in 0..t.rows() {
            t.row_f32(r, &mut out[r * t.cols()..(r + 1) * t.cols()]);
        }
        out
    }

    fn embryo_resident_eligible(&self) -> bool {
        fn served(t: &QTensor) -> bool {
            t.as_f32().is_some() || t.q8_2f_codes().is_some()
        }
        // One mixer family per file: vmf_phase (kind 0/1) or
        // gated_delta_net (kind 4); the anchors are full (2) or bounded (3).
        if (self.vmf_cfg.is_none() && self.gdn_cfg.is_none())
            || self.num_layers != self.physical_layers
            || self.loop_final_norm
            || self.weights.layers.len() != self.num_layers
            || self.head_clusters.is_none()
            || self.final_softcap.is_some()
            || self.logit_multiplier.is_some()
            || self.attn_softcap != 0.0
            || self.mtp.is_some()
            || self.per_token_stack()
            || self.dsv4.is_some()
            || self.dsv41.is_some()
            || self.dory.is_some()
            || self.qwen4_exp.is_some()
            // Dynamic routing swaps FFN weights mid-sequence under the
            // packed graph; a blend has no single overlay. A STATIC skill
            // (`from_model_with_skill`) is fine: the pack reads the live
            // `weights.layers[*].ffn`, i.e. the skill's tensors, and a
            // later `set_active_skill` change drops the pack
            // (`invalidate_for_weight_change`).
            || self.dyn_router.is_some()
            || self.dyn_phi_layer.is_some()
            || self.dyn_blend_loaded
            || self.o1_cfg.is_some()
            || self.swa.is_some()
            || self.sliding_layers.is_some()
            || self.global_attn.is_some()
            || self.attention_heads_per_layer.is_some()
            || self.attn_v_norm
            || self
                .kv_cache
                .layers
                .iter()
                .any(|l| l.mode != crate::kv_cache::KvMode::F32)
            || self.rope_scale != 1.0
            || self.rope_scale_local != 1.0
            || self.attn_scale != 1.0 / (self.head_dim as f32).sqrt()
            || self.hidden_size == 0
            || self.hidden_size > 1024
            || self.intermediate_size > 1024
            || self.num_heads == 0
            || self.num_kv_heads == 0
            || self.num_heads % self.num_kv_heads != 0
            || self.num_heads.saturating_mul(self.head_dim) > 1024
            || self.num_kv_heads.saturating_mul(self.head_dim) > 1024
            || self.vocab_size == 0
            || self.kv_cache.max_seq_len == 0
            || self.rotary_dim == 0
            || self.rotary_dim > self.head_dim
            || self.rotary_dim % 2 != 0
            || self.inv_freq.len() < self.rotary_dim / 2
        {
            return false;
        }
        // The resident shaders read f32 or f16 values, or q8_2f codes through
        // the same formula as the CPU path. Other quantized files keep the
        // ordinary executor: dequantizing a Q4 tensor into the packed buffer
        // would silently change the operator relative to the CPU quantized
        // path. Measured consequence (RTX PRO 4000, S4 bounded export requantized
        // with `cortiq requant --quant q4tp-quantize`): `eligible=false`,
        // the generic wgpu whole-token graph refuses too, and the per-op
        // path decodes at ~73 tok/s against ~200 tok/s on the CPU q4tp path.
        if self.weights.lm_head.q8_2f_codes().is_some() && !self.embryo_wide_candidate(true) {
            return false;
        }
        if !served(&self.weights.lm_head)
            || !served(&self.weights.embed_tokens)
            || self.weights.lm_head.rows() < self.vocab_size
            || self.weights.lm_head.cols() != self.hidden_size
            || self.weights.embed_tokens.rows() < self.vocab_size
            || self.weights.embed_tokens.cols() != self.hidden_size
            || self.weights.final_norm.len() != self.hidden_size
        {
            return false;
        }
        if let Some(cfg) = self.vmf_cfg {
            if cfg.num_heads.saturating_mul(cfg.nphase) > 1024
                || cfg.num_heads.saturating_mul(cfg.nphase.saturating_add(1)) > 1024
                || cfg.num_heads.saturating_mul(cfg.value_head_dim) > 1024
                || cfg.state_len() == 0
            {
                return false;
            }
        }
        if let Some(g) = self.gdn_cfg {
            // The resident GDN kernels (gpu_wgpu.rs `embryo_core_gdn_*`):
            // fused projection ≤ 2048 rows, nv·dv ≤ 1024, dk ≤ 128 lanes,
            // dv ≤ 256 lanes in vec4 rows, SiLU output gate (the Embryo
            // export), same rms eps as the stack.
            if g.num_v_heads == 0
                || g.num_k_heads == 0
                || g.num_v_heads % g.num_k_heads != 0
                || g.key_head_dim == 0
                || g.key_head_dim > 128
                || g.value_head_dim == 0
                || g.value_head_dim > 256
                || g.value_head_dim % 4 != 0
                || g.conv_kernel == 0
                || g.num_v_heads > 512
                || g.num_v_heads.saturating_mul(g.value_head_dim) > 1024
                || g.conv_dim() > 2048
                || g.conv_dim() % 4 != 0
                || g.hidden_size != self.hidden_size
                || g.output_gate_sigmoid
                || g.rms_eps != self.rms_eps
                || g.state_len() == 0
            {
                return false;
            }
        }
        let mut full_seen = false;
        for lw in &self.weights.layers {
            if lw.attn_out_norm.is_some() || lw.ffn_out_norm.is_some() || lw.layer_scale.is_some() {
                return false;
            }
            match &lw.attn {
                AttnKind::LinearGdn(w) => {
                    let Some(g) = self.gdn_cfg else {
                        return false;
                    };
                    let (nv, dv, kk) = (g.num_v_heads, g.value_head_dim, g.conv_kernel);
                    if w.in_proj_qkv.rows() != g.conv_dim()
                        || w.in_proj_qkv.cols() != self.hidden_size
                        || !served(&w.in_proj_qkv)
                        || w.in_proj_z.rows() != nv * dv
                        || w.in_proj_z.cols() != self.hidden_size
                        || !served(&w.in_proj_z)
                        || w.in_proj_a.rows() != nv
                        || w.in_proj_a.cols() != self.hidden_size
                        || !served(&w.in_proj_a)
                        || w.in_proj_b.rows() != nv
                        || w.in_proj_b.cols() != self.hidden_size
                        || !served(&w.in_proj_b)
                        || w.conv1d.len() != g.conv_dim() * kk
                        || w.a_log.len() != nv
                        || w.dt_bias.len() != nv
                        || w.norm.len() != dv
                        || w.out_proj.rows() != self.hidden_size
                        || w.out_proj.cols() != nv * dv
                        || !served(&w.out_proj)
                    {
                        return false;
                    }
                }
                AttnKind::Linear(w) => {
                    let Some(cfg) = self.vmf_cfg else {
                        return false;
                    };
                    if w.thq.rows() != cfg.num_heads * cfg.nphase
                        || w.thq.cols() != self.hidden_size
                        || !served(&w.thq)
                        || w.thk.rows() != cfg.num_heads * cfg.nphase
                        || w.thk.cols() != self.hidden_size
                        || !served(&w.thk)
                        || w.v_proj.rows() != cfg.num_heads * cfg.value_head_dim
                        || w.v_proj.cols() != self.hidden_size
                        || !served(&w.v_proj)
                        || w.out_proj.rows() != self.hidden_size
                        || w.out_proj.cols() != cfg.num_heads * cfg.value_head_dim
                        || !served(&w.out_proj)
                        || w.decay.len() != cfg.num_heads * 2 * cfg.nphase
                    {
                        return false;
                    }
                    if let Some((kg, kb)) = &w.k_gate {
                        if kg.rows() != cfg.num_heads
                            || kg.cols() != self.hidden_size
                            || !served(&kg)
                            || kb.len() != cfg.num_heads
                        {
                            return false;
                        }
                    }
                    if let Some(conv) = &w.conv {
                        if conv.len() % self.hidden_size != 0 || conv.len() / self.hidden_size < 2 {
                            return false;
                        }
                    }
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } => {
                    if full_seen
                        || q_norm.is_some()
                        || k_norm.is_some()
                        || *output_gate
                        || softplus_gate.is_some()
                        || bias.is_some()
                        || !served(&wq)
                        || !served(&wk)
                        || !served(&wv)
                        || !served(&wo)
                        || wq.rows() != self.num_heads * self.head_dim
                        || wk.rows() != self.num_kv_heads * self.head_dim
                        || wv.rows() != self.num_kv_heads * self.head_dim
                        || wq.cols() != self.hidden_size
                        || wk.cols() != self.hidden_size
                        || wv.cols() != self.hidden_size
                        || wo.rows() != self.hidden_size
                        || wo.cols() != self.num_heads * self.head_dim
                    {
                        return false;
                    }
                    full_seen = true;
                }
                AttnKind::Bounded(w) => {
                    // The resident bounded attend walks S + W keys in
                    // 256-lane tiles (online softmax), any window the format
                    // allows; per-group windows come from header word 22.
                    let Some(ac) = self.anchor_core.as_ref() else {
                        return false;
                    };
                    if self.bounded_rope.is_none()
                        || w.window != ac.window
                        || w.sink != ac.sink
                        || w.group_windows != ac.group_windows
                        || w.window == 0
                        || w.sink_k.len() != self.num_kv_heads * w.sink * self.head_dim
                        || w.sink_v.len() != self.num_kv_heads * w.sink * self.head_dim
                        || !served(&w.wq)
                        || !served(&w.wk)
                        || !served(&w.wv)
                        || !served(&w.wo)
                        || w.wq.rows() != self.num_heads * self.head_dim
                        || w.wk.rows() != self.num_kv_heads * self.head_dim
                        || w.wv.rows() != self.num_kv_heads * self.head_dim
                        || w.wq.cols() != self.hidden_size
                        || w.wk.cols() != self.hidden_size
                        || w.wv.cols() != self.hidden_size
                        || w.wo.rows() != self.hidden_size
                        || w.wo.cols() != self.num_heads * self.head_dim
                    {
                        return false;
                    }
                }
                _ => return false,
            }
            match &lw.ffn {
                FfnKind::Dense(d) => {
                    if d.act != Act::Silu
                        || !d.segs.is_empty()
                        || !served(&d.gate_proj)
                        || !served(&d.up_proj)
                        || !served(&d.down_proj)
                        || d.gate_proj.rows() != self.intermediate_size
                        || d.gate_proj.cols() != self.hidden_size
                        || d.up_proj.rows() != self.intermediate_size
                        || d.up_proj.cols() != self.hidden_size
                        || d.down_proj.rows() != self.hidden_size
                        || d.down_proj.cols() != self.intermediate_size
                    {
                        return false;
                    }
                }
                FfnKind::Moe(m) => {
                    if m.resonance.is_none()
                        || m.top_k != 1
                        || m.router_sigmoid
                        || !m.norm_topk_prob
                        || m.expert_bias.is_some()
                        || m.routed_scaling != 1.0
                        || m.route_tau.is_some()
                        || m.shared.is_none()
                        || m.mask.is_some()
                        || m.per_expert_scale.is_some()
                        || m.router_input_norm
                        || m.experts.is_empty()
                        || m.experts.len() > 8
                    {
                        return false;
                    }
                    let r = m.resonance.as_ref().unwrap();
                    if r.mu.len() != m.experts.len() * self.hidden_size
                        || r.bias.len() != m.experts.len()
                        || r.u.len() != m.experts.len() * r.k * self.hidden_size
                        || r.k > 128
                    {
                        return false;
                    }
                    let Some((shared, gate)) = &m.shared else {
                        return false;
                    };
                    if gate.is_some() || shared.act != Act::Silu || !shared.segs.is_empty() {
                        return false;
                    }
                    if !served(&shared.gate_proj)
                        || !served(&shared.up_proj)
                        || !served(&shared.down_proj)
                        || shared.gate_proj.rows() != self.intermediate_size
                        || shared.gate_proj.cols() != self.hidden_size
                        || shared.up_proj.rows() != self.intermediate_size
                        || shared.up_proj.cols() != self.hidden_size
                        || shared.down_proj.rows() != self.hidden_size
                        || shared.down_proj.cols() != self.intermediate_size
                    {
                        return false;
                    }
                    for e in &m.experts {
                        if e.act != Act::Silu
                            || !e.segs.is_empty()
                            || !served(&e.gate_proj)
                            || !served(&e.up_proj)
                            || !served(&e.down_proj)
                            || e.gate_proj.rows() != self.intermediate_size
                            || e.gate_proj.cols() != self.hidden_size
                            || e.up_proj.rows() != self.intermediate_size
                            || e.up_proj.cols() != self.hidden_size
                            || e.down_proj.rows() != self.hidden_size
                            || e.down_proj.cols() != self.intermediate_size
                        {
                            return false;
                        }
                    }
                }
                FfnKind::DenseMoe(_) => return false,
            }
            if lw.input_norm.len() != self.hidden_size || lw.post_norm.len() != self.hidden_size {
                return false;
            }
        }
        if full_seen && self.anchor_core.is_some() {
            return false;
        }
        full_seen || self.num_layers > 0
    }

    /// The resident Embryo graph is the owner of this pipeline's forward:
    /// the same gate `forward_layers_span` applies before handing a token
    /// to `forward_embryo_graph` (both graph phases on, the explicit
    /// opt-in, a wgpu device, no earlier refusal, an eligible stack).
    fn embryo_resident_wanted(&self) -> bool {
        crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode)
            && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill)
            && matches!(
                std::env::var("CMF_EMBRYO_RESIDENT").as_deref(),
                Ok("1") | Ok("parallel")
            )
            && crate::gpu::enabled_here()
            && !self.graph_refused()
            && self.embryo_resident_eligible()
    }

    /// Chunked prefill on the resident graph: `ids` from `start` in
    /// chunks of `EMBRYO_CHUNK_MAX`, one submit each, projections/FFN as
    /// chunk GEMMs and the recurrent layers walked in time on the device.
    /// Returns the last position's logits when the whole span ran there.
    /// `None` = refused before any device work (the per-position path
    /// takes the span).  `CMF_EMBRYO_CHUNK=0` keeps the per-position
    /// prefill (A/B and the parity reference).
    fn embryo_prefill_chunked(&mut self, ids: &[u32], start: usize) -> Option<Vec<f32>> {
        if ids.len() < 2
            || std::env::var("CMF_EMBRYO_CHUNK").as_deref() == Ok("0")
            || !self.embryo_resident_wanted()
        {
            return None;
        }
        let model = self.ensure_embryo_graph()?;
        let cmax = std::env::var("CMF_EMBRYO_CHUNK")
            .ok()
            .and_then(|v| v.parse::<usize>().ok())
            .filter(|&v| v >= 1)
            .unwrap_or(crate::gpu::EMBRYO_CHUNK_MAX)
            .min(crate::gpu::EMBRYO_CHUNK_MAX);
        let hs = self.hidden_size;
        let n = ids.len();
        let mut pos = start;
        let mut last = None;
        let mut rows = Vec::with_capacity(cmax * hs);
        while pos < n {
            let end = (pos + cmax).min(n);
            rows.clear();
            for &id in &ids[pos..end] {
                rows.extend_from_slice(&self.embed_single(id));
            }
            let mut lg = Vec::new();
            if !crate::gpu::forward_embryo_graph_chunk(
                &model,
                self.graph_kv_id,
                &rows,
                pos,
                end - pos,
                &mut lg,
            ) {
                if pos == start {
                    if std::env::var("CMF_EMBRYO_DBG").as_deref() == Ok("1") {
                        eprintln!("embryo-dbg: chunk prefill refused at position {pos}");
                    }
                    return None;
                }
                // The device sequence advanced through the earlier chunks;
                // a host continuation would mix two owners of the state.
                // Fail this sequence alone, leaving no stale state or key.
                self.kv_cache.clear();
                self.clear_history();
                crate::gpu::graph_kv_reset(self.graph_kv_id);
                panic!(
                    "resident Embryo chunk prefill refused at position {pos}; refusing an in-flight host fallback"
                );
            }
            last = Some(lg);
            pos = end;
        }
        if std::env::var("CMF_EMBRYO_DBG").as_deref() == Ok("1") {
            eprintln!(
                "embryo-dbg: chunk prefill {} ids from {start} in {} submits (chunk {cmax})",
                n - start,
                (n - start).div_ceil(cmax)
            );
        }
        last
    }

    /// Can this file run the wide token path? GDN mixers, bounded anchors, and
    /// rows and columns that fit the kernels' four-row, eight-column grid.
    fn embryo_wide_candidate(&self, q8: bool) -> bool {
        if self.embryo_wide_refused
            || std::env::var("CMF_EMBRYO_WIDE").as_deref() == Ok("0")
            || !crate::gpu::embryo_wide_ready(q8)
        {
            return false;
        }
        let Some(g) = self.gdn_cfg else {
            return false;
        };
        let (hidden, inter, hd) = (self.hidden_size, self.intermediate_size, self.head_dim);
        let (nv, nk, dk, dv) = (g.num_v_heads, g.num_k_heads, g.key_head_dim, g.value_head_dim);
        let (q, kv) = (self.num_heads, self.num_kv_heads);
        // A q8_2f row is read 16 codes at a time, an f16 row 8 values at a time.
        let step = if q8 { 16 } else { 8 };
        let geometry = hidden % step == 0
            && hidden <= 1024
            && inter % step == 0
            && inter <= 1024
            && self.vocab_size % 4 == 0
            && self.head_clusters.as_ref().is_some_and(|c| {
                let nc = c.len() / hidden.max(1);
                // A workgroup holds a cluster's rows.
                nc > 0 && nc <= 256 && self.vocab_size % nc == 0 && self.vocab_size / nc <= 256
            })
            && dk % 4 == 0
            && dv % 4 == 0
            && (nv * dv) % step == 0
            && nv * dv <= 1024
            && nv <= 508
            && nk > 0
            && nv % nk == 0
            && g.conv_dim() % 4 == 0
            && g.conv_dim() <= 2048
            && hd % 4 == 0
            && (q * hd) % step == 0
            && q * hd <= 1024
            && kv > 0
            && q % kv == 0
            && (kv * hd) % 4 == 0
            && (self.rotary_dim / 2) % 4 == 0;
        if !geometry {
            return false;
        }
        self.weights.layers.iter().all(|lw| {
            matches!(lw.attn, AttnKind::Bounded(_) | AttnKind::LinearGdn(_))
                && match &lw.ffn {
                    FfnKind::Moe(m) => m.resonance.as_ref().is_some_and(|r| m.experts.len() * (r.k + 1) <= 256) && m.shared.is_some(),
                    FfnKind::Dense(_) => true,
                    FfnKind::DenseMoe(_) => false,
                }
        })
    }

    fn ensure_embryo_graph(&mut self) -> Option<std::sync::Arc<crate::gpu::EmbryoGraphModel>> {
        if self.embryo_graph.is_none() && self.embryo_resident_eligible() {
            const UMAX: u32 = u32::MAX;
            const HEADER: usize = crate::gpu::EMBRYO_META_HEADER;
            const REC: usize = 64;
            struct Pack {
                data: Vec<f32>,
                /// The wide token path: matrices in their packed form in `mats`.
                wide: bool,
                q8: bool,
                mats: Vec<u8>,
                /// q8_2f: (codes, row scales, column field) of each matrix; its
                /// word in the layer record is its index in the meta after the layers.
                table: Vec<u32>,
                table_base: u32,
                refused: bool,
            }
            impl Pack {
                fn put(&mut self, x: &[f32]) -> u32 {
                    if x.is_empty() {
                        return u32::MAX;
                    }
                    // The wide kernels read the small tensors as vec4
                    if self.wide {
                        self.data.resize(self.data.len().next_multiple_of(4), 0.0);
                    }
                    let off = self.data.len();
                    self.data.extend_from_slice(x);
                    off as u32
                }
                /// A matrix a token reads in full.
                fn mat(&mut self, t: &QTensor) -> u32 {
                    if !self.wide {
                        return self.put(&Pipeline::embryo_qtensor_f32(t));
                    }
                    if self.q8 {
                        let Some((q, rows, cols)) = t.q8_2f_codes() else {
                            self.refused = true;
                            return 0;
                        };
                        self.mats.resize(self.mats.len().next_multiple_of(16), 0);
                        let off = self.mats.len() as u32;
                        self.mats.extend_from_slice(&q[..t.rows() * t.cols()]);
                        let (rs, cs) = (self.put(rows), self.put(cols));
                        let e = self.table_base + self.table.len() as u32;
                        self.table.extend_from_slice(&[off, rs, cs]);
                        return e;
                    }
                    self.mats.resize(self.mats.len().next_multiple_of(16), 0);
                    let off = self.mats.len() / 2;
                    for v in Pipeline::embryo_qtensor_f32(t) {
                        let h = cortiq_core::quant::f32_to_f16(v);
                        self.refused |= cortiq_core::quant::f16_to_f32(h).to_bits() != v.to_bits();
                        self.mats.extend_from_slice(&h.to_le_bytes());
                    }
                    off as u32
                }
            }
            // The mixer family of the file: vmf_phase geometry fills the
            // phase header words, gated_delta_net fills words 24..29.  A
            // file has exactly one linear core, so at most one is live.
            let vmf = self.vmf_cfg;
            let gdn = self.gdn_cfg;
            // A file of q8_2f matrices or of matrices exact in f16 runs the wide path.
            let q8 = self.weights.lm_head.q8_2f_codes().is_some();
            let wide = self.embryo_wide_candidate(q8);
            let mut pack = Pack {
                data: Vec::new(),
                wide,
                q8,
                mats: Vec::new(),
                table: Vec::new(),
                table_base: (HEADER + self.num_layers * REC) as u32,
                refused: false,
            };
            let mut meta = vec![0u32; HEADER];
            meta[0] = self.hidden_size as u32;
            meta[1] = self.intermediate_size as u32;
            meta[2] = self.vocab_size as u32;
            meta[3] = self.num_layers as u32;
            meta[4] = vmf.map(|c| c.num_heads).unwrap_or(0) as u32;
            meta[5] = vmf.map(|c| c.nphase).unwrap_or(0) as u32;
            meta[6] = vmf.map(|c| c.value_head_dim).unwrap_or(0) as u32;
            if let Some(g) = gdn {
                meta[24] = g.num_v_heads as u32;
                meta[25] = g.num_k_heads as u32;
                meta[26] = g.key_head_dim as u32;
                meta[27] = g.value_head_dim as u32;
                meta[28] = g.conv_kernel as u32;
                meta[29] = g.conv_dim() as u32;
            }
            meta[7] = self.num_heads as u32;
            meta[8] = self.num_kv_heads as u32;
            meta[9] = self.head_dim as u32;
            meta[10] = self.kv_cache.max_seq_len as u32;
            let clusters = self.head_clusters.as_ref().unwrap();
            let cluster_count = clusters.len() / self.hidden_size;
            if clusters.len() % self.hidden_size != 0
                || cluster_count == 0
                || cluster_count > 1024
                || self.vocab_size % cluster_count != 0
                || self.weights.lm_head.rows() < self.vocab_size
                || self.weights.final_norm.len() != self.hidden_size
            {
                return None;
            }
            meta[11] = cluster_count as u32;
            meta[12] = (self.vocab_size / cluster_count) as u32;
            meta[13] = vmf.map(|c| c.state_len()).unwrap_or(0) as u32;
            meta[16] = self.rotary_dim as u32;
            meta[17] = matches!(self.norm_style, NormStyle::Gemma) as u32;
            meta[19] = (self.rms_eps as f32).to_bits();
            let max_conv = self
                .weights
                .layers
                .iter()
                .filter_map(|lw| match &lw.attn {
                    AttnKind::Linear(w) => w.conv.as_ref().map(|v| v.len() / self.hidden_size),
                    _ => None,
                })
                .max()
                .unwrap_or(1);
            // One state slot per recurrent layer: the phase state plus its
            // hidden-wide conv ring, or the GDN record `[conv ring | S]`
            // (`GdnCfg::state_len`).  A file carries one mixer family, so
            // the stride is exactly that family's record and the device
            // state buffer equals the header's recurrent bytes.
            let phase_stride = vmf
                .map(|c| c.state_len() + max_conv.saturating_sub(1) * self.hidden_size)
                .unwrap_or(0);
            let gdn_stride = gdn.map(|g| g.state_len()).unwrap_or(0);
            let state_stride = phase_stride.max(gdn_stride);
            // Bounded genome: the KV plane of an anchor is its ring
            // `[kvh][W][hd]` K + V, and only anchors own one.  Legacy full
            // anchors keep the `max_seq` planes indexed by layer.
            let bounded = self.anchor_core.clone();
            let (anchor_window, anchor_sink) = bounded
                .as_ref()
                .map(|ac| (ac.window, ac.sink))
                .unwrap_or((0, 0));
            let kv_stride = if bounded.is_some() {
                2usize
                    .saturating_mul(self.num_kv_heads)
                    .saturating_mul(anchor_window)
                    .saturating_mul(self.head_dim)
            } else {
                2usize
                    .saturating_mul(self.num_kv_heads)
                    .saturating_mul(self.kv_cache.max_seq_len)
                    .saturating_mul(self.head_dim)
            };
            meta[14] = state_stride as u32;
            meta[15] = kv_stride as u32;
            meta[18] = anchor_window as u32;
            meta[20] = anchor_sink as u32;
            // Scores, weights and the key list of each head fit the wide scratch plane.
            pack.refused |= pack.wide
                && 3 * self.num_heads * (anchor_window + anchor_sink + 3) + 256 > 65_536;
            meta[21] = match &self.bounded_rope {
                // The wide path rotates by the absolute position: no table.
                _ if pack.wide => UMAX,
                Some(rope) => {
                    // [W][half] cos then [W][half] sin, one contiguous table.
                    let off = pack.put(&rope.cos);
                    let _ = pack.put(&rope.sin);
                    off
                }
                None => UMAX,
            };
            // swa_sink_v2: one window per KV group (f32 in the pack; exact
            // for any window the format allows); UMAX = every group `W`.
            meta[22] = match bounded.as_ref().filter(|ac| !ac.group_windows.is_empty()) {
                Some(ac) => {
                    let gw: Vec<f32> = ac.group_windows.iter().map(|&w| w as f32).collect();
                    pack.put(&gw)
                }
                None => UMAX,
            };
            let mut full_seen = false;
            let mut bounded_seen = 0usize;
            // Recurrent state slots belong to mixer layers only (phase or
            // GDN): an anchor owns a ring, not a state stride, so the
            // device state buffer is exactly the header's recurrent bytes.
            let mut phase_seen = 0usize;
            let mut gdn_seen = 0usize;
            for (li, lw) in self.weights.layers.iter().enumerate() {
                let base = meta.len();
                meta.resize(base + REC, UMAX);
                meta[base] = match &lw.attn {
                    AttnKind::Linear(w) if w.phase_delta => 1,
                    AttnKind::Linear(_) => 0,
                    AttnKind::Full { .. } => 2,
                    AttnKind::Bounded(_) => 3,
                    AttnKind::LinearGdn(_) => 4,
                    _ => UMAX,
                };
                meta[base + 1] = pack.put(&lw.input_norm);
                meta[base + 2] = pack.put(&lw.post_norm);
                meta[base + 25] = match &lw.attn {
                    AttnKind::Linear(_) => {
                        let off = ((phase_seen + gdn_seen) * state_stride) as u32;
                        phase_seen += 1;
                        off
                    }
                    AttnKind::LinearGdn(_) => {
                        let off = ((phase_seen + gdn_seen) * state_stride) as u32;
                        gdn_seen += 1;
                        off
                    }
                    _ => UMAX,
                };
                match &lw.attn {
                    AttnKind::LinearGdn(w) => {
                        // Layer record words 56..63 + 29, as the resident
                        // kernels read them (gpu_wgpu.rs `embryo_core_gdn_*`).
                        meta[base + 56] = pack.mat(&w.in_proj_qkv);
                        meta[base + 57] = pack.mat(&w.in_proj_z);
                        meta[base + 58] = pack.mat(&w.in_proj_a);
                        meta[base + 59] = pack.mat(&w.in_proj_b);
                        meta[base + 60] = pack.put(&w.conv1d);
                        meta[base + 61] = pack.put(&w.a_log);
                        meta[base + 62] = pack.put(&w.dt_bias);
                        meta[base + 63] = pack.put(&w.norm);
                        meta[base + 29] = pack.mat(&w.out_proj);
                        meta[base + 24] = 0;
                    }
                    AttnKind::Linear(w) => {
                        meta[base + 3] = pack.mat(&w.thq);
                        meta[base + 4] = pack.mat(&w.thk);
                        meta[base + 5] = pack.mat(&w.v_proj);
                        meta[base + 6] = pack.mat(&w.out_proj);
                        let decay: Vec<f32> = w.decay.iter().map(|&x| x as f32).collect();
                        meta[base + 7] = pack.put(&decay);
                        if let Some((kg, kb)) = &w.k_gate {
                            meta[base + 8] = pack.mat(&kg);
                            meta[base + 9] = pack.put(kb);
                        }
                        if let Some(conv) = &w.conv {
                            meta[base + 10] = pack.put(conv);
                            meta[base + 24] = (conv.len() / self.hidden_size) as u32;
                        } else {
                            meta[base + 24] = 0;
                        }
                    }
                    AttnKind::Full { wq, wk, wv, wo, .. } => {
                        full_seen = true;
                        meta[base + 11] = pack.mat(&wq);
                        meta[base + 12] = pack.mat(&wk);
                        meta[base + 13] = pack.mat(&wv);
                        meta[base + 14] = pack.mat(&wo);
                        meta[base + 26] = (li * kv_stride) as u32;
                    }
                    AttnKind::Bounded(w) => {
                        meta[base + 11] = pack.mat(&w.wq);
                        meta[base + 12] = pack.mat(&w.wk);
                        meta[base + 13] = pack.mat(&w.wv);
                        meta[base + 14] = pack.mat(&w.wo);
                        // Ring slot of this anchor (anchors only, packed).
                        meta[base + 26] = (bounded_seen * kv_stride) as u32;
                        meta[base + 27] = pack.put(&w.sink_k);
                        meta[base + 28] = pack.put(&w.sink_v);
                        bounded_seen += 1;
                    }
                    _ => return None,
                }
                match &lw.ffn {
                    FfnKind::Dense(d) => {
                        meta[base + 15] = 0;
                        meta[base + 16] = 0;
                        meta[base + 21] = pack.mat(&d.gate_proj);
                        meta[base + 22] = pack.mat(&d.up_proj);
                        meta[base + 23] = pack.mat(&d.down_proj);
                    }
                    FfnKind::Moe(m) => {
                        let r = m.resonance.as_ref().unwrap();
                        let (shared, _) = m.shared.as_ref().unwrap();
                        meta[base + 15] = 1;
                        meta[base + 16] = m.experts.len() as u32;
                        meta[base + 17] = pack.put(&r.mu);
                        meta[base + 18] = pack.put(&r.u);
                        meta[base + 19] = pack.put(&r.bias);
                        meta[base + 20] = r.k as u32;
                        // Word 30: the growth shell as the runtime applies
                        // it now (`+inf` on trunk rows, the stored finite
                        // shell on grown rows, all `+inf` under
                        // `CMF_GROWTH_SHELL=off`), followed by one `−∞`
                        // sentinel at index E the kernel writes as the
                        // score of an expert outside its shell — WGSL has
                        // no infinity literal, so the value travels as
                        // data (`embryo_core_route_finalize`).
                        let mut shell = r.effective_shell(m.experts.len());
                        shell.push(f32::NEG_INFINITY);
                        meta[base + 30] = pack.put(&shell);
                        meta[base + 21] = pack.mat(&shared.gate_proj);
                        meta[base + 22] = pack.mat(&shared.up_proj);
                        meta[base + 23] = pack.mat(&shared.down_proj);
                        for (e, ex) in m.experts.iter().enumerate() {
                            meta[base + 32 + e * 3] =
                                pack.mat(&ex.gate_proj);
                            meta[base + 33 + e * 3] =
                                pack.mat(&ex.up_proj);
                            meta[base + 34 + e * 3] =
                                pack.mat(&ex.down_proj);
                        }
                    }
                    FfnKind::DenseMoe(_) => return None,
                }
            }
            if !full_seen && self.num_layers == 0 {
                return None;
            }
            let mut lm_head = Vec::new();
            let mut lm_head_packed = Vec::new();
            if wide && q8 {
                let parts = self.weights.lm_head.q8_2f_codes();
                if let Some((q, rows, cols)) = parts {
                    lm_head_packed = q[..self.weights.lm_head.rows() * self.weights.lm_head.cols()].to_vec();
                    let (rs, cs) = (pack.put(rows), pack.put(cols));
                    meta[30] = pack.table_base + pack.table.len() as u32;
                    pack.table.extend_from_slice(&[0, rs, cs]);
                }
                meta.extend_from_slice(&pack.table);
            } else if wide {
                for v in Self::embryo_qtensor_f32(&self.weights.lm_head) {
                    let h = cortiq_core::quant::f32_to_f16(v);
                    pack.refused |= cortiq_core::quant::f16_to_f32(h).to_bits() != v.to_bits();
                    lm_head_packed.extend_from_slice(&h.to_le_bytes());
                }
            } else {
                lm_head = Self::embryo_qtensor_f32(&self.weights.lm_head);
            }
            if pack.refused {
                self.embryo_wide_refused = true;
                return self.ensure_embryo_graph();
            }
            let id = {
                static NEXT: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(1);
                NEXT.fetch_add(1, std::sync::atomic::Ordering::Relaxed)
            };
            let model = crate::gpu::EmbryoGraphModel {
                id,
                hidden: self.hidden_size,
                intermediate: self.intermediate_size,
                vocab: self.vocab_size,
                layers: self.num_layers,
                phase_heads: vmf.map(|c| c.num_heads).unwrap_or(0),
                nphase: vmf.map(|c| c.nphase).unwrap_or(0),
                phase_dv: vmf.map(|c| c.value_head_dim).unwrap_or(0),
                anchor_q_heads: self.num_heads,
                anchor_kv_heads: self.num_kv_heads,
                anchor_head_dim: self.head_dim,
                rotary_dim: self.rotary_dim,
                rope_freq: if wide { self.inv_freq[..self.rotary_dim / 2].to_vec() } else { Vec::new() },
                max_seq: self.kv_cache.max_seq_len,
                cluster_count,
                cluster_size: self.vocab_size / cluster_count,
                phase_state_len: vmf.map(|c| c.state_len()).unwrap_or(0),
                state_stride,
                kv_stride,
                norm_gemma: matches!(self.norm_style, NormStyle::Gemma),
                phase_mass: vmf.map(|c| c.phase_mass).unwrap_or(0.0),
                weights: pack.data,
                meta,
                lm_head,
                wide,
                wide_q8: wide && q8,
                mats: pack.mats,
                lm_head_packed,
                clusters: clusters.as_ref().clone(),
                final_norm: self.weights.final_norm.clone(),
                inv_freq: self.inv_freq.as_ref().clone(),
                bounded: bounded.is_some(),
                kv_layers: if bounded.is_some() {
                    bounded_seen
                } else {
                    self.num_layers
                },
                state_layers: phase_seen + gdn_seen,
                anchor_window,
                anchor_sink,
                phase_layers: phase_seen,
                gdn_layers: gdn_seen,
                gdn_heads: gdn.map(|g| g.num_v_heads).unwrap_or(0),
                gdn_k_heads: gdn.map(|g| g.num_k_heads).unwrap_or(0),
                gdn_dk: gdn.map(|g| g.key_head_dim).unwrap_or(0),
                gdn_dv: gdn.map(|g| g.value_head_dim).unwrap_or(0),
                gdn_kk: gdn.map(|g| g.conv_kernel).unwrap_or(0),
            };
            self.embryo_graph = Some(std::sync::Arc::new(model));
        }
        self.embryo_graph.clone()
    }

    fn forward_layers_span(
        &mut self,
        hidden: &[f32],
        position: usize,
        task_mask: Option<&TaskMask>,
        from: usize,
        upto: Option<usize>,
    ) -> Vec<f32> {
        #[cfg(target_os = "macos")]
        let _metal_pager_token_prof = crate::gpu_metal::MoePagerTokenScope::new(
            position,
            from,
            upto.map_or(self.num_layers, |u| u.saturating_add(1)),
        );
        debug_assert!(
            from == 0
                || (self.dsv4.is_none()
                    && self.dsv41.is_none()
                    && self.qwen4_exp.is_none()
                    && !self.per_token_stack())
        );
        // Every plain forward — the whole-token Metal graph (`q1_graph_gpu`
        // wraps the GDN owners zero-copy and reallocates them on a size
        // change) and the CPU layer loop (reads/swaps `linear_state`) —
        // must see the previous speculative commit's asynchronous replay
        // complete. One mutex probe when nothing is pending.
        #[cfg(target_os = "macos")]
        if !crate::gpu_metal::wait_replay() {
            self.fail_metal_graph("the pending async replay failed before a plain forward");
            return vec![0.0; self.hidden_size];
        }
        if let Some(b) = &mut self.qwen4_exp {
            let _ = (task_mask, upto);
            let token_id = hidden.first().copied().unwrap_or(0.0) as u32;
            let mut logits = Vec::new();
            crate::qwen4_exp::forward_token(
                &b.0,
                &b.1,
                &b.2,
                &mut b.3,
                token_id,
                position,
                &self.inv_freq,
                self.pool.as_deref(),
                &mut logits,
                true,
            );
            self.graph_logits = Some(logits);
            return vec![0.0; self.hidden_size];
        }
        // DeepSeek-V4 runs its own stack: the state is hc_mult copies, and
        // the forward returns LOGITS, not a hidden — the head is inside it
        // (the final fold sits between the last layer and the norm). The
        // token id rides in `hidden[0]`, written by embed_single, because
        // the hash layers route by id rather than by content.
        if let Some(b) = &mut self.dsv4 {
            let _ = (task_mask, upto);
            let token_id = hidden.first().copied().unwrap_or(0.0) as u32;
            let (g, layers, cfg, st) = (&b.0, &b.1, b.2, &mut b.3);
            st.pos = position;
            let mut logits = Vec::new();
            crate::dsv4::forward_token(
                g,
                layers,
                &cfg,
                st,
                token_id,
                &self.inv_freq,
                self.pool.as_deref(),
                &mut logits,
            );
            self.graph_logits = Some(logits);
            self.dspark_probe(position, token_id);
            // The caller expects a hidden; the logits went out of band, as
            // with the fused lm_head path.
            return vec![0.0; self.hidden_size];
        }
        // Dory owns its complete stack and emits logits out of band.
        if self.dory.is_some() {
            let _ = (task_mask, upto);
            let token_id = hidden.first().copied().unwrap_or(0.0) as u32;
            let lg = self.dory_forward(&[token_id], position, crate::dory::Want::Last);
            self.graph_logits = Some(lg);
            return vec![0.0; self.hidden_size];
        }
        // DeepSeek-V4.1 owns its complete stack and emits logits out of band.
        if let Some(b) = &mut self.dsv41 {
            let _ = (task_mask, upto);
            let token_id = hidden.first().copied().unwrap_or(0.0) as u32;
            let mut logits = Vec::new();
            crate::dsv41::forward_token(
                &b.0,
                &b.1,
                &b.2,
                &mut b.3,
                token_id,
                position,
                self.pool.as_deref(),
                &mut logits,
            );
            self.graph_logits = Some(logits);
            return vec![0.0; self.hidden_size];
        }
        // Gemma-3n runs its own stack (4 AltUp replicas don't fit this
        // loop); `hidden` is the extended embedding from embed_single.
        // Gemma-4 E-series: same hand-off — its dual-geometry attention
        // with shared-KV tail layers and the PLE injection live in
        // `g4e_forward`.
        if let Some(b) = &self.g4e {
            let _ = (task_mask, upto);
            return crate::g4e::g4e_forward(
                &b.0,
                &b.1,
                hidden,
                position,
                &mut self.kv_cache.layers,
                self.num_heads,
                self.num_kv_heads,
                self.pool.as_deref(),
            );
        }
        if let Some(b) = &self.g3n {
            let _ = (task_mask, upto);
            return crate::g3n::g3n_forward(
                &b.0,
                &b.1,
                hidden,
                position,
                &mut self.kv_cache.layers,
                self.num_heads,
                self.num_kv_heads,
                self.head_dim,
                self.pool.as_deref(),
            );
        }
        // Cortiq Embryo owns a separate resident graph: phase recurrent
        // state, resonance routing, the GQA anchor KV and hierarchical head
        // all execute in one Vulkan submit. It is limited to a complete
        // unmasked stack; spans and task masks retain the exact host path.
        // `CMF_EMBRYO_DBG=1` names the gate that keeps a token off the
        // resident graph — every refusal below is otherwise silent.
        if from == 0
            && upto.is_none()
            && task_mask.is_none()
            && self.anchor_core.is_some()
            && std::env::var("CMF_EMBRYO_DBG").as_deref() == Ok("1")
        {
            static ONCE: std::sync::Once = std::sync::Once::new();
            ONCE.call_once(|| {
                eprintln!(
                    "embryo-dbg: graph_on decode={} prefill={} resident_env={:?} enabled_here={} \
                     unsupported={} eligible={}",
                    crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode),
                    crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill),
                    std::env::var("CMF_EMBRYO_RESIDENT").ok(),
                    crate::gpu::enabled_here(),
                    self.graph_refused(),
                    self.embryo_resident_eligible(),
                );
            });
        }
        if from == 0
            && upto.is_none()
            && task_mask.is_none()
            // Embryo's recurrent/KV state has no host import path.  Do not
            // seed it for a prefill-only graph and then silently decode from
            // an empty CPU cache; both phases must select the resident owner.
            && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Decode)
            && crate::gpu::wgpu_graph_on(crate::gpu::GraphPhase::Prefill)
            // This whole-token Embryo path remains explicitly opt-in.
            // `CMF_GPU_WGPU_GRAPH=1` still enables the mature generic graph,
            // but must not silently select this model-specific resident path.
            && matches!(
                std::env::var("CMF_EMBRYO_RESIDENT").as_deref(),
                Ok("1") | Ok("parallel")
            )
            && crate::gpu::enabled_here()
            && !self.graph_refused()
            // Sequence owner: past position zero the device continues only
            // a sequence it holds. A host-owned sequence (the graph refused
            // at its start, or its prefix was prefilled on the host) keeps
            // the host path to its end — never a device attempt at p > 0
            // over an empty device image.
            && (position == 0 || self.device_sequence_position().is_some())
            && self.embryo_resident_eligible()
            && let Some(model) = self.ensure_embryo_graph()
        {
            let mut lg = Vec::new();
            if crate::gpu::forward_embryo_graph(&model, self.graph_kv_id, hidden, position, &mut lg)
            {
                self.graph_logits = Some(lg);
                return vec![0.0; self.hidden_size];
            }
            if std::env::var("CMF_EMBRYO_DBG").as_deref() == Ok("1") {
                eprintln!("embryo-dbg: forward_embryo_graph refused at position {position}");
            }
            // The refusal is THIS pipeline's: falling through once is safe
            // at position zero (the host owns the sequence from here),
            // while a refusal at a later position of a device-owned
            // sequence would mix a host KV/state path with a partial
            // device sequence.
            self.mark_graph_refused();
            if position != 0 {
                // Fail this sequence alone and leave nothing stale behind:
                // no reuse key, no host or device state for the next
                // request on this slot to "extend".
                self.kv_cache.clear();
                self.clear_history();
                crate::gpu::graph_kv_reset(self.graph_kv_id);
                panic!(
                    "resident Embryo graph refused at position {position}; refusing an in-flight host fallback"
                );
            }
        }
        let mut h = hidden.to_vec();
        // Ripple's value residual reads this position's embedding row in every layer.
        // A later span of the same position (a stack split across cards)
        // keeps the row its first span stored.
        if self.value_blend.is_some() {
            if from == 0 {
                self.vres_e0.clear();
                self.vres_e0.extend_from_slice(hidden);
            }
            assert!(
                self.vres_e0.len() == hidden.len(),
                "value residual: a layer span past the first layer has no embedding row"
            );
        }
        // MiMo-V2 expert placement: decided before the graph or the per-op
        // arena can claim the budget the expert bank needs.
        self.mimo_moe_prepare();
        let _mimo_q8 = self
            .mimo_moe
            .is_on()
            .then(crate::qtensor::enter_full_gpu_q8_scope);
        // Split borrows: copy scalars / clone handles so the per-layer
        // cfg does not hold `&self` while the KV cache is `&mut`.
        let (nh, _nkv, _hd, hs, _rd, eps) = (
            self.num_heads,
            self.num_kv_heads,
            self.head_dim,
            self.hidden_size,
            self.rotary_dim,
            self.rms_eps,
        );
        let pool = self.pool.clone();
        // Opt-in wgpu token-graph attention (discrete Vulkan/DX12): the whole
        // attention sub-block runs resident in one submit. Off by default.
        // Whole-token wgpu graph: eligibility + arbitration.
        //  - explicit CMF_GPU_WGPU_GRAPH forces it on/off;
        //  - discrete adapters (4090: decode 76 -> 137 tok/s) and GDN
        //    hybrids (recurrent state device-resident, no CPU twin to
        //    race) TRUST it;
        //  - integrated/mobile adapters RACE it against the normal path
        //    at generation granularity (gpu::graph_race_*) — tiled
        //    mobile GPUs can turn the ~300-dispatch graph into seconds
        //    per token, while a fast phone GPU keeps its win.
        let graph_env = std::env::var("CMF_GPU_WGPU_GRAPH").ok();
        let graph_on = match graph_env.as_deref() {
            Some("0") => false,
            Some("prefill") => false, // decode keeps the per-op path
            Some(_) => true,
            // Unset: same discrete-only default as every other graph
            // site. "Is the GPU on" used to stand in here — which made
            // the 0.2 tok/s whole-token graph race-eligible on mobile
            // adapters and cost 12-14× on first tokens (cmfmobile
            // TUNING.md); integrated GPUs keep the per-op probe path.
            None => crate::gpu::wgpu_graph_default(),
        };
        let graph_trusted =
            graph_env.is_some() || crate::gpu::wgpu_graph_default() || self.gdn_cfg.is_some();
        let race_eligible =
            graph_on && upto.is_none() && task_mask.is_none() && from == 0 && !self.graph_refused();
        let mut tail_start = 0usize;
        if race_eligible && crate::gpu::graph_race_use_graph(graph_trusted) {
            let t_graph = std::time::Instant::now();
            let mut lg = Vec::new();
            let mut gl = 0usize;
            let built = self.try_token_graph_wgpu(hidden, position, &mut lg, &mut gl);
            let declined = built.is_none();
            let built = match built {
                Some(Ok(hh)) => Some(hh),
                Some(Err(())) => {
                    // O(1) state was admitted before the device failure; the
                    // CPU mirrors are stale by construction.  Clear the whole
                    // sequence and stop rather than walking that stale state.
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    tracing::error!("token graph failed after admission; sequence state cleared");
                    return vec![0.0; self.hidden_size];
                }
                None => None,
            };
            // Past the transient guards (o1 still collecting, a softcap)
            // a refusal is about the weights and will never change —
            // remember it instead of walking every layer again next
            // token.
            if declined && !self.o1_active() && self.attn_softcap == 0.0 {
                self.mark_graph_refused();
            }
            graph_note(built.is_some(), gl, self.num_layers);
            if let Some(hh) = built {
                let dur = t_graph.elapsed();
                if std::env::var("CMF_GRAPH_PROF").is_ok() {
                    eprintln!("graph-call: {:.2} ms total", dur.as_secs_f64() * 1000.0);
                }
                if gl > 0 && gl < self.num_layers {
                    // Device prefix: the graph ran layers 0..gl and handed
                    // back the boundary hidden — the loop below owns the
                    // tail. The prefix layers' KV/state advanced on the
                    // device; the tail's advances on the host below. One
                    // boundary crossing per token.
                    h = hh;
                    tail_start = gl;
                } else if graph_trusted || !crate::gpu::graph_race_first_token_hopeless(dur) {
                    if !graph_trusted {
                        crate::gpu::graph_race_record(true, dur);
                    }
                    if !lg.is_empty() {
                        // Graph produced logits (final-norm + lm_head folded in) —
                        // pad/cap to vocab and hand them to the sampler directly.
                        lg.resize(self.vocab_size, 0.0);
                        if let Some(c) = self.final_softcap {
                            softcap_in_place(&mut lg, c, self.pool.as_deref());
                        }
                        self.graph_logits = Some(lg);
                    }
                    return hh;
                }
                // Hopeless first graph token: discard it and fall through
                // to the normal path. Safe exactly here — the prompt KV is
                // still CPU-owned (chunked prefill), so recomputing this
                // position is exact; the mirror's extra row is never read
                // (the race just settled on the normal path).
            }
        }
        // KIMI-LINEAR HAS NO SPLIT BUG. The 2.6× reported from the
        // model rotation (12.2 tok/s on one card against 4.6 on two)
        // was a single measurement of a model whose arm arbitration is
        // borderline, and it did not survive repetition. Three runs an
        // arm, same binary, back to back:
        //   probe on : 1 GPU 9.5 / 5.7 / 5.9   2 GPU 7.8 / 13.0 / 13.3
        //   pinned   : 1 GPU 5.6 / 5.3 / 5.2   2 GPU 3.5 / 4.2 / 3.4
        // With the arms pinned the split costs about 1.45×, which is
        // what a layer split costs. With the probe free, TWO CARDS RUN
        // FASTER — because for this model the CPU arm wins some op
        // classes and the probe finds that.
        //
        // Two things do stand, and both are measured. The token graph
        // builds NOTHING here (`covered 0 of 14 layers [0..14)`), so
        // every layer walks per-op on either arm — that is where the
        // headroom is, not in the split. And this model's benchmark is
        // unusable without `CMF_GPU_PROBE=0`: the arbitration alone
        // moves it by more than 2×.
        //
        // Span runs (network split): the graph covers exactly [from..=upto]
        // — one submit per SEGMENT per token. No race: its state is global
        // and calibrated on full stacks, so spans take the graph only where
        // it is trusted by default (discrete adapters / CMF_GPU_WGPU_GRAPH).
        let span = from > 0 || upto.is_some();
        if span && graph_on && task_mask.is_none() && graph_trusted {
            let upto_excl = upto.map_or(self.num_layers, |u| u + 1);
            let mut lg = Vec::new();
            let mut gl = 0usize;
            let span_res =
                self.try_token_graph_wgpu_span(hidden, position, &mut lg, from, upto_excl, &mut gl);
            let span_res = match span_res {
                Some(Ok(hh)) => Some(hh),
                Some(Err(())) => {
                    self.clear_sequence_state();
                    self.graph_failed
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    self.cancel
                        .store(true, std::sync::atomic::Ordering::Relaxed);
                    tracing::error!(
                        "span token graph failed after admission; sequence state cleared"
                    );
                    return vec![0.0; self.hidden_size];
                }
                None => None,
            };
            graph_note(span_res.is_some(), gl, upto_excl - from);
            if std::env::var("CMF_GPU_DEBUG").is_ok() {
                // How much of the span the graph actually covered. A
                // prefix of nothing means every layer walks per-op and
                // the split's extra cost is elsewhere.
                static SEEN: std::sync::atomic::AtomicU32 = std::sync::atomic::AtomicU32::new(0);
                if SEEN.fetch_add(1, std::sync::atomic::Ordering::Relaxed) < 4 {
                    eprintln!(
                        "span graph: covered {gl} of {} layers [{from}..{upto_excl}) res={}",
                        upto_excl - from,
                        span_res.is_some()
                    );
                }
            }
            if let Some(hh) = span_res {
                if gl == upto_excl - from {
                    if !lg.is_empty() {
                        lg.resize(self.vocab_size, 0.0);
                        if let Some(c) = self.final_softcap {
                            softcap_in_place(&mut lg, c, self.pool.as_deref());
                        }
                        self.graph_logits = Some(lg);
                    }
                    crate::gpu::set_layer(-1);
                    return hh;
                }
                // Partial device prefix of the span: CPU owns the tail.
                h = hh;
                tail_start = from + gl;
            }
        }
        // Layers the host is about to run whose device mirror moved ahead
        // of the host cache (a device prefix that shrank since the prompt,
        // a batched-prefill prefix longer than this token's): bring their
        // rows over first. One comparison per layer when nothing lags.
        let t_race_cpu = (race_eligible && !graph_trusted).then(std::time::Instant::now);

        // A partial graph is an explicit GPU-prefix / CPU-tail split. Keep
        // the tail PURE host-side: letting its QTensor hooks re-enter the
        // residency arena streams every omitted layer through Vulkan and the
        // driver's freed-allocation cache can grow to the full model size
        // (25.4 GiB observed with a 14 GiB budget on Granite 30B Q8_2F).
        // With a MiMo expert bank the tail is not a whole-layer host
        // stream: its experts run from the bank (never the arena) and its
        // projections stay per-op on the device, which the bank's placement
        // left room for.
        let host_tail = tail_start > from;
        let _host_tail = (host_tail && !self.mimo_moe.is_on()).then(crate::gpu::enter_cpu_scope);
        let automatic_gpu_prefix = self.automatic_gpu_prefix();

        let _prof_layers = crate::cpuprof::time(crate::cpuprof::Slot::Layers);
        #[cfg(target_os = "macos")]
        let mut gpu_skip_until = 0usize;
        for li in tail_start.max(from)..self.num_layers {
            let _capacity_tail = automatic_gpu_prefix
                .filter(|&prefix| li >= prefix && !self.mimo_moe.is_dynamic(li, host_tail))
                .map(|_| crate::gpu::enter_cpu_scope());
            crate::gpu::set_layer(li as i64); // layer-split GPU/CPU (CMF_GPU_LAYERS)
            if let Some(u) = upto {
                if li > u {
                    break;
                }
            }
            if let Some(mask) = task_mask {
                if !mask.layer_alive(li) {
                    continue; // dead layer: residual pass-through
                }
            }
            // MiniMax's dynamic tail: attention + pooled MoE of this layer as
            // ONE device frame (single-layer graph call), cold experts on
            // the host. Any decline falls through to the ordinary host
            // layer; a post-admission device failure stops the sequence.
            if host_tail && task_mask.is_none() {
                match self.m3_pooled_layer(li, position, &mut h) {
                    Ok(true) => {
                        crate::gpu::set_layer(-1);
                        continue;
                    }
                    Ok(false) => {}
                    Err(()) => {
                        self.clear_sequence_state();
                        self.graph_failed
                            .store(true, std::sync::atomic::Ordering::Relaxed);
                        self.cancel
                            .store(true, std::sync::atomic::Ordering::Relaxed);
                        tracing::error!(
                            "pooled tail token graph failed after admission; sequence state cleared"
                        );
                        return vec![0.0; self.hidden_size];
                    }
                }
            }
            // Whole-block q1 token graph: a run of consecutive q1
            // layers — GDN and full attention — executes with one sync
            // per CPU attend instead of per op (macOS/Metal).
            #[cfg(target_os = "macos")]
            {
                if li < gpu_skip_until {
                    continue;
                }
                if task_mask.is_none() {
                    let end = self.q1_graph_gpu(li, upto, position, &mut h);
                    if self.graph_failed.load(std::sync::atomic::Ordering::Relaxed) {
                        // The graph may have mutated device state before a
                        // command-buffer error. Never continue with a CPU
                        // tail or read a stale host mirror after admission.
                        return vec![0.0; self.hidden_size];
                    }
                    if end > li {
                        gpu_skip_until = end;
                        // Looped Transformer: the graph stopped at a loop
                        // boundary — apply final norm before the next iteration.
                        if self.is_loop_end(end - 1) && end < self.num_layers {
                            h = inference::rms_norm(
                                &h,
                                &self.weights.final_norm,
                                self.rms_eps,
                                self.norm_style,
                            );
                        }
                        continue;
                    }
                }
            }

            if task_mask.is_none() {
                match self.mimo_graph_layer_rows(li, &mut h, &[position]) {
                    crate::gpu::BatchGraphOutcome::Completed => continue,
                    crate::gpu::BatchGraphOutcome::Failed => return vec![0.0; self.hidden_size],
                    crate::gpu::BatchGraphOutcome::Declined => {}
                }
            }
            #[cfg(feature = "gpu")]
            self.pull_lagging_host_kv(li, li + 1, position);
            // SenseNova-Loop mHC: the attention reads the routed branch of
            // the streams.
            let mhc_attn = self.mhc_layer(li).then(|| self.mhc_pre(li, false, &mut h));
            let lw = &self.weights.layers[self.phys_layer(li)];
            if let Ok(tp) = std::env::var("CMF_TRACE_POS") {
                if tp.parse::<usize>().ok() == Some(position) {
                    let n: f32 = h.iter().map(|x| x * x).sum::<f32>().sqrt();
                    eprintln!(
                        "TRACE pos {position} layer {li}: |h| = {n:.6} h0 {:.6} h1 {:.6}",
                        h[0], h[1]
                    );
                }
            }
            // Norm into the pipeline scratch — the returning rms_norm
            // allocated twice per layer per token (roadmap §3 P0).
            let prof = crate::cpuprof::time(crate::cpuprof::Slot::Norms);
            inference::rms_norm_into(
                &h,
                &lw.input_norm,
                self.rms_eps,
                self.norm_style,
                &mut self.ws.n1,
            );
            drop(prof);
            // The row V projects, when the layer blends the embedding into it.
            let vres = match self.layer_value_blend(li) {
                Some(blend) => {
                    vres_lerp(&self.vres_e0, &self.ws.n1, blend, &mut self.vres_in);
                    true
                }
                None => false,
            };

            let attn_out = match &lw.attn {
                AttnKind::Mla(w) => {
                    let inv_freq_l = self.layer_inv_freq(li);
                    let rs = self.layer_rope_scale(li);
                    let eps = self.rms_eps;
                    let pool = self.pool.clone();
                    mla_attention(
                        w,
                        &self.ws.n1,
                        &mut self.kv_cache.layers[li],
                        position,
                        &inv_freq_l,
                        rs,
                        eps,
                        pool.as_deref(),
                    )
                }
                AttnKind::Linear(w) => {
                    let cfg = self.vmf_cfg.expect("linear layer without vmf_cfg");
                    vmf_phase_forward(
                        &self.ws.n1,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::Kda(w) => {
                    let cfg = self.kda_cfg.expect("kda layer without kda_cfg");
                    crate::linear_core::kda_forward(
                        &self.ws.n1,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::LinearGdn(w) => {
                    let cfg = self.gdn_cfg.expect("gdn layer without gdn_cfg");
                    gdn_forward(
                        &self.ws.n1,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::ShortConv(w) => {
                    let cfg = self
                        .short_conv_cfg
                        .expect("short-conv layer without short_conv_cfg");
                    short_conv_forward(
                        &self.ws.n1,
                        w,
                        &cfg,
                        &mut self.kv_cache.layers[li].linear_state,
                        self.pool.as_deref(),
                    )
                }
                AttnKind::Bounded(w) => {
                    // Natively bounded anchor: insert into the ring, attend
                    // over sinks ∪ window. No position, nothing appended.
                    let rope = self
                        .bounded_rope
                        .clone()
                        .expect("bounded layer without an installed rotation table");
                    let cfg = crate::bounded::BoundedAttnCfg {
                        num_heads: self.num_heads,
                        num_kv_heads: self.num_kv_heads,
                        head_dim: self.head_dim,
                        hidden_size: hs,
                        scale: self.attn_scale,
                        rope: &rope,
                        pool: pool.as_deref(),
                    };
                    crate::bounded::bounded_attention(
                        &self.ws.n1,
                        w,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    )
                }
                AttnKind::Full { wq, wk, wv, wo, .. } if self.dash.is_some() => {
                    let (nh_l, hd_l) = (self.num_heads, self.head_dim);
                    let mut ao = vec![0f32; nh_l * hd_l];
                    let dash = self.dash.as_mut().expect("guarded");
                    crate::uocr::attention_host(
                        dash,
                        li,
                        &self.ws.n1,
                        wq,
                        wk,
                        wv,
                        &mut self.kv_cache.layers[li],
                        position,
                        nh_l,
                        hd_l,
                        self.rms_eps as f32,
                        pool.as_deref(),
                        &mut ao,
                    );
                    let mut out = vec![0f32; hs];
                    wo.matvec(&ao, &mut out, pool.as_deref());
                    out
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } if self.kv_cache.layers[li].o1_sealed() => {
                    // O(1) override: decode on the sealed Nyström state
                    // instead of the growing KV cache.
                    let inv_freq_l = self.layer_inv_freq(li);
                    let (nkv_l, hd_l, rd_l) = self.layer_geom(li);
                    let cfg = QwenAttnCfg {
                        mrope: None,
                        num_heads: self.layer_num_heads(li),
                        num_kv_heads: nkv_l,
                        head_dim: hd_l,
                        hidden_size: hs,
                        position,
                        inv_freq: &inv_freq_l,
                        rotary_dim: rd_l,
                        scale: self.attn_scale,
                        softcap: self.attn_softcap,
                        window: None,
                        v_norm: self.attn_v_norm,
                        qk_norm_after_rope: self.qk_norm_after_rope,
                        gate_sigmoid: self.proj_gate_sigmoid,
                        q_norm: q_norm.as_deref(),
                        k_norm: k_norm.as_deref(),
                        output_gate: *output_gate,
                        softplus_gate: softplus_gate
                            .as_ref()
                            .map(|(gate, per_head)| (gate, *per_head)),
                        rope_scale: self.layer_rope_scale(li),
                        bias: bias
                            .as_ref()
                            .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                        rms_eps: eps,
                        norm_style: self.norm_style,
                        pool: pool.as_deref(),
                        v_head_dim: self.layer_v_dim(li),
                        value_in: vres.then(|| self.vres_in.as_slice()),
                    };
                    attention::qwen_attention_nystrom(
                        &self.ws.n1,
                        wq,
                        wk,
                        wv,
                        wo,
                        &mut self.kv_cache.layers[li],
                        &cfg,
                    )
                }
                AttnKind::Full {
                    wq,
                    wk,
                    wv,
                    wo,
                    q_norm,
                    k_norm,
                    output_gate,
                    softplus_gate,
                    bias,
                } => 'attn: {
                    // wgpu token-graph attention (opt-in): whole sub-block in
                    // one submit, device K/V mirror. q1 only, no gate/bias/mask.
                    // Its kernel has no window, sink or narrow-V slot and
                    // one mirror geometry: such models stay on the CPU attend.
                    let dropin_reason =
                        graph_on.then(|| self.graph_attn_decline_reason()).flatten();
                    if let Some(reason) = dropin_reason {
                        self.note_graph_decline("wgpu attn dropin", reason);
                    }
                    if graph_on
                        && dropin_reason.is_none()
                        && !*output_gate
                        && softplus_gate.is_none()
                        && self.attention_heads_per_layer.is_none()
                        && bias.is_none()
                        && task_mask.is_none()
                    {
                        let inv_freq_l = self.layer_inv_freq(li);
                        let (nkv_l, hd_l, rd_l) = self.layer_geom(li);
                        let gemma = self.norm_style == cortiq_core::NormStyle::Gemma;
                        if let (Some((gm, qi)), Some((_, ki)), Some((_, vi)), Some((_, oi))) = (
                            wq.mapped_q1(),
                            wk.mapped_q1(),
                            wv.mapped_q1(),
                            wo.mapped_q1(),
                        ) {
                            let gm = gm.clone();
                            let mut out = vec![0f32; hs];
                            let cache = &self.kv_cache.layers[li];
                            if crate::gpu::attn_dropin(
                                &gm,
                                self.graph_kv_id,
                                li,
                                &self.ws.n1,
                                qi,
                                ki,
                                vi,
                                oi,
                                q_norm.as_deref(),
                                k_norm.as_deref(),
                                self.qk_norm_after_rope,
                                &inv_freq_l,
                                nh,
                                nkv_l,
                                hd_l,
                                rd_l,
                                hs,
                                position,
                                self.kv_cache.max_seq_len,
                                gemma,
                                eps as f32,
                                cache.k_heads(),
                                cache.v_heads(),
                                &mut out,
                            ) {
                                break 'attn out;
                            }
                        }
                    }
                    let masked = task_mask
                        .map(|m| m.head_flags(li, self.num_heads).iter().any(|&a| !a))
                        .unwrap_or(false);
                    let f32_view = (wq.as_f32(), wk.as_f32(), wv.as_f32(), wo.as_f32());
                    // The masked kernel knows one pipeline-wide geometry and
                    // RoPE table, no window and no sink.
                    let plain = self.layer_attn_plain(li);
                    match (masked, f32_view) {
                        // Historical masked path (f32 slices; the loader
                        // keeps masked models in f32).
                        (true, (Some(q), Some(k), Some(v), Some(o))) if plain => {
                            let active_heads = task_mask.unwrap().head_flags(li, self.num_heads);
                            attention::multi_head_attention(
                                &self.ws.n1,
                                q,
                                k,
                                v,
                                o,
                                &mut self.kv_cache.layers[li],
                                self.num_heads,
                                self.num_kv_heads,
                                self.head_dim,
                                self.hidden_size,
                                position,
                                &active_heads,
                                &self.inv_freq,
                            )
                        }
                        (masked, _) => {
                            if masked {
                                tracing::warn!(
                                    "layer {li}: head mask on quantized weights or on a \
                                     window/sink/per-layer-geometry layer not supported \
                                     yet — executing dense"
                                );
                            }
                            let inv_freq_l = self.layer_inv_freq(li);
                            let (nkv_l, hd_l, rd_l) = self.layer_geom(li);
                            let cfg = QwenAttnCfg {
                                mrope: self.prompt_mrope.as_deref().zip(self.mrope_sections).map(|(pos, sections)| attention::MropeView { base: 0, pos, sections }),
                                num_heads: self.layer_num_heads(li),
                                num_kv_heads: nkv_l,
                                head_dim: hd_l,
                                hidden_size: hs,
                                position,
                                inv_freq: &inv_freq_l,
                                rotary_dim: rd_l,
                                scale: self.attn_scale,
                                softcap: self.attn_softcap,
                                window: self.layer_window(li),
                                v_norm: self.attn_v_norm,
                                qk_norm_after_rope: self.qk_norm_after_rope,
                                gate_sigmoid: self.proj_gate_sigmoid,
                                q_norm: q_norm.as_deref(),
                                k_norm: k_norm.as_deref(),
                                output_gate: *output_gate,
                                softplus_gate: softplus_gate
                                    .as_ref()
                                    .map(|(gate, per_head)| (gate, *per_head)),
                                rope_scale: self.layer_rope_scale(li),
                                bias: bias
                                    .as_ref()
                                    .map(|(a, b, c)| (a.as_slice(), b.as_slice(), c.as_slice())),
                                rms_eps: eps,
                                norm_style: self.norm_style,
                                pool: pool.as_deref(),
                                v_head_dim: self.layer_v_dim(li),
                                value_in: vres.then(|| self.vres_in.as_slice()),
                            };
                            attention::qwen_attention(
                                &self.ws.n1,
                                wq,
                                wk,
                                wv,
                                wo,
                                &mut self.kv_cache.layers[li],
                                &cfg,
                            )
                        }
                    }
                }
            };
            // Gemma sandwich norm: normalize the attention branch before
            // it joins the residual stream.
            let attn_out = match &self.weights.layers[self.phys_layer(li)].attn_out_norm {
                Some(w) => inference::rms_norm(&attn_out, w, self.rms_eps, self.norm_style),
                None => attn_out,
            };
            let mhc_ffn = match mhc_attn {
                Some(c) => {
                    // mHC: fold the attention output in, route the FFN's
                    // branch, and norm that.
                    self.mhc_post(li, false, &attn_out, &c, &mut h);
                    let cf = self.mhc_pre(li, true, &mut h);
                    let lw = &self.weights.layers[self.phys_layer(li)];
                    inference::rms_norm_into(&h, &lw.post_norm, self.rms_eps, self.norm_style, &mut self.ws.p1);
                    Some(cf)
                }
                None => {
                    let lw = &self.weights.layers[self.phys_layer(li)];
                    let prof = crate::cpuprof::time(crate::cpuprof::Slot::Norms);
                    inference::add_rmsnorm_fused_into(
                        &mut h,
                        &attn_out,
                        &lw.post_norm,
                        self.rms_eps,
                        self.norm_style,
                        &mut self.ws.p1,
                    );
                    drop(prof);
                    None
                }
            };
            let lw = &self.weights.layers[self.phys_layer(li)];
            let mut attn_out = attn_out;
            attention::recycle_buf(&mut attn_out);
            let post_normed = &self.ws.p1;

            let ffn_masked = task_mask
                .map(|m| m.ffn_active_count(li) < self.intermediate_size)
                .unwrap_or(false);
            // One masked dense CONTRACT, dispatched by cost. The
            // activation-zeroing arm (the batched sweep's, validated
            // against the replica to 0.8%) computes the FULL fused FFN
            // and zeroes the dead — right whenever most neurons live.
            // The sparse arm reads ONLY active rows and down columns —
            // per-row dots are slower per element than the fused kernel,
            // so it pays only once the mask is deep enough. The 0.5
            // crossover is first-principles (fused kernels run ~2x the
            // per-row dot throughput); a shallow specialist (95% alive)
            // stays fused, a --target-sparsity bake flips arms on its
            // own weight.
            let ffn_out = match (ffn_masked, &lw.ffn) {
                // A defragged tube layer answers its own mask: the core
                // always runs, each tube runs when its bit is on, and
                // the tubes that are off are never read from the mmap.
                (_, FfnKind::Dense(d)) if !d.segs.is_empty() => {
                    let row = task_mask
                        .and_then(|tm| tm.ffn_masks.get(li))
                        .map(|v| v.as_slice());
                    tube_ffn(d, post_normed, 1, self.pool.as_deref(), row)
                }
                (true, FfnKind::Dense(d)) => {
                    let tm = task_mask.unwrap();
                    let alive = tm.ffn_active_count(li);
                    let deep = alive * 2 <= self.intermediate_size;
                    if deep && d.down_proj.sparse_col_ok() && !d.gate_proj.has_prism_contract() {
                        let active = tm.ffn_active_indices(li);
                        sparse_ffn_quant(
                            d,
                            post_normed,
                            &active,
                            self.hidden_size,
                            self.pool.as_deref(),
                        )
                    } else if deep
                        && let (Some(g), Some(u), Some(dn)) = (
                            d.gate_proj.as_f32(),
                            d.up_proj.as_f32(),
                            d.down_proj.as_f32(),
                        )
                    {
                        let active = tm.ffn_active_indices(li);
                        inference::sparse_ffn_forward(
                            post_normed,
                            g,
                            u,
                            dn,
                            self.hidden_size,
                            self.intermediate_size,
                            &active,
                            self.pool.as_deref(),
                        )
                    } else {
                        let row = tm.ffn_masks.get(li).map(|v| v.as_slice());
                        dense_ffn_batch(d, post_normed, 1, self.pool.as_deref(), row)
                    }
                }
                (true, FfnKind::Moe(m)) => {
                    // MoE is sparse by expert selection; a task mask
                    // narrows the ROUTABLE set via its expert fields
                    // (spec §5) when it carries them.
                    let allowed = task_mask.and_then(|tm| tm.expert_flags(li, m.experts.len()));
                    ffn_forward(
                        &lw.ffn,
                        post_normed,
                        self.pool.as_deref(),
                        allowed.as_deref(),
                    )
                }
                (true, FfnKind::DenseMoe(dm)) => dense_moe_ffn(
                    dm,
                    post_normed,
                    &h,
                    self.rms_eps,
                    self.norm_style,
                    self.pool.as_deref(),
                ),
                (false, _) => match &lw.ffn {
                    FfnKind::DenseMoe(dm) => dense_moe_ffn(
                        dm,
                        post_normed,
                        &h,
                        self.rms_eps,
                        self.norm_style,
                        self.pool.as_deref(),
                    ),
                    FfnKind::Moe(m)
                        if task_mask.is_none()
                            && host_tail
                            && li >= tail_start
                            && crate::minicpm_tail::MiniCpmTail::is_requested_target(m) =>
                    {
                        moe_ffn_minicpm_tail(
                            &mut self.minicpm_tail,
                            li,
                            self.num_layers,
                            m,
                            post_normed,
                            self.pool.as_deref(),
                        )
                    }
                    FfnKind::Moe(m)
                        if task_mask.is_none() && self.mimo_moe.is_dynamic(li, host_tail) =>
                    {
                        moe_ffn_banked(&mut self.mimo_moe, li, m, post_normed, self.pool.as_deref())
                    }
                    _ => {
                        let allowed = match (&lw.ffn, task_mask) {
                            (FfnKind::Moe(m), Some(tm)) => tm.expert_flags(li, m.experts.len()),
                            _ => None,
                        };
                        ffn_forward(
                            &lw.ffn,
                            post_normed,
                            self.pool.as_deref(),
                            allowed.as_deref(),
                        )
                    }
                },
            };
            let ffn_out = match &self.weights.layers[self.phys_layer(li)].ffn_out_norm {
                Some(w) => inference::rms_norm(&ffn_out, w, self.rms_eps, self.norm_style),
                None => ffn_out,
            };
            match mhc_ffn {
                Some(c) => self.mhc_post(li, true, &ffn_out, &c, &mut h),
                None => {
                    for (i, &f) in ffn_out.iter().enumerate() {
                        h[i] += f;
                    }
                }
            }
            let mut ffn_out = ffn_out;
            attention::recycle_buf(&mut ffn_out);

            // Gemma-4: the layer output is scaled by a learned scalar.
            if let Some(sc) = self.weights.layers[self.phys_layer(li)].layer_scale {
                for v in h.iter_mut() {
                    *v *= sc;
                }
            }
            // CMF_LAYER_DUMP: this position's hidden after layer li.
            if self.layer_dump.is_some() {
                self.dump_layer_row(position, li, &h);
            }

            // Looped Transformer: apply final norm at the end of each loop iteration.
            // Nanbeige 4.2: after layer 21 (virtual), apply norm before looping back to layer 0.
            if self.is_loop_end(li) && li + 1 < self.num_layers {
                h = inference::rms_norm(
                    &h,
                    &self.weights.final_norm,
                    self.rms_eps,
                    self.norm_style,
                );
            }

            // Dynamic routing φ capture (on-policy): the
            // EMA of the post-residual hidden at the router's phi_layer,
            // updated as the context evolves during decode.
            if self.dyn_phi_layer == Some(li) {
                self.update_dyn_phi(&h);
            }
        }
        crate::gpu::set_layer(-1); // layers done — lm_head outside layer-split
        if let Some(t) = t_race_cpu {
            crate::gpu::graph_race_record(false, t.elapsed());
        }

        h
    }

    /// EMA of φ at the router layer (rolling, weight 0.2 = ~5-token
    /// horizon). First observation seeds it exactly.
    fn update_dyn_phi(&mut self, h: &[f32]) {
        const A: f32 = 0.2;
        if self.dyn_phi_ema.len() != h.len() {
            self.dyn_phi_ema = vec![0.0; h.len()];
            self.dyn_phi_seen = 0;
        }
        if self.dyn_phi_seen == 0 {
            self.dyn_phi_ema.copy_from_slice(h);
        } else {
            for (e, &v) in self.dyn_phi_ema.iter_mut().zip(h) {
                *e = (1.0 - A) * *e + A * v;
            }
        }
        self.dyn_phi_seen += 1;
    }

    /// Current router φ (EMA at phi_layer); empty until first capture.
    pub fn dyn_phi(&self) -> &[f32] {
        &self.dyn_phi_ema
    }

    /// Enable/disable φ capture at the router layer, reset the EMA.
    pub fn set_dyn_phi_layer(&mut self, layer: Option<usize>) {
        self.dyn_phi_layer = layer;
        self.dyn_phi_ema.clear();
        self.dyn_phi_seen = 0;
    }

    /// Skills eligible for dynamic switching: (index, id, phi_layer).
    pub fn dynamic_skills(&self) -> Vec<(usize, String, usize)> {
        let Some(model) = &self.model else {
            return Vec::new();
        };
        model
            .header
            .skills
            .iter()
            .enumerate()
            .filter_map(|(i, sk)| {
                // A v2 record routes only through the request-level
                // backbone-gated decision (its status and gate are
                // checked there), never per token.
                if sk.is_v2() {
                    return None;
                }
                let ok = matches!(self.dyn_skill_layers.get(i), Some(Some(_)));
                let sel = sk.selection.as_ref()?;
                (ok).then(|| (i, sk.id.clone(), sel.phi_layer))
            })
            .collect()
    }

    /// Index of the currently overlaid skill (None = backbone).
    pub fn active_skill(&self) -> Option<usize> {
        self.dyn_active
    }

    /// Enable dynamic per-token skill routing: build the hysteresis
    /// router from the container's routable skills, start φ capture at
    /// their (shared) phi_layer. Returns the number of routable skills
    /// (0 = nothing to route; router stays off). Idempotent.
    pub fn enable_dynamic_routing(&mut self) -> usize {
        use crate::swarm::{DynRouter, RoutableSkill};
        let Some(model) = self.model.clone() else {
            return 0;
        };
        // Router policy v2 (spec §9.4) routes per REQUEST: the backbone is
        // the default and only the backbone-gated decision may pick a
        // skill. A per-token switch would bypass that gate (and change
        // the O(1) state mid-sequence), so the hysteresis router never
        // runs on such a file; the caller keeps the request-level
        // decision.
        if let Some(r) = &model.header.router {
            tracing::warn!(
                "dynamic routing disabled: this file declares router policy '{}' with \
                 granularity \"{}\" — the request-level decision applies instead",
                r.policy,
                r.granularity
            );
            return 0;
        }
        // Format-v2 skill records (bit SKILLS_V2) without a router policy:
        // their status/gate contract ("auto-routing requires active +
        // measured") lives in the backbone-gated decision only — the
        // hysteresis router would switch into a quarantined record
        // (fail-open). Refuse the whole file, not just its v2 records.
        if model.required_features & cortiq_core::format::features::SKILLS_V2 != 0
            || model.header.skills.iter().any(|s| s.is_v2())
        {
            tracing::warn!(
                "dynamic routing disabled: this file carries format-v2 skill records \
                 (SKILLS_V2) — they route per request through a router policy only"
            );
            return 0;
        }
        // A blend materialized f32 working tensors into the layers; there
        // is no single skill index to revert from → refuse (honest).
        if self.dyn_blend_loaded {
            tracing::warn!("dynamic routing unavailable on a blend-loaded pipeline");
            return 0;
        }
        // A statically-overlaid skill that is NOT FFN-eligible can't be
        // cheaply reverted at generation start → refuse rather than
        // silently keep it overlaid.
        if let Some(a) = self.dyn_active {
            if !matches!(self.dyn_skill_layers.get(a), Some(Some(_))) {
                tracing::warn!("loaded skill is not FFN-eligible — dynamic routing unavailable");
                return 0;
            }
        }
        let hidden = self.hidden_size;
        let mut skills = Vec::new();
        for (idx, id, _phi) in self.dynamic_skills() {
            if let Some(sel) = model.header.skills[idx].selection.as_ref() {
                if let Some(rs) = RoutableSkill::from_descriptor(idx, id, sel, hidden) {
                    skills.push(rs);
                }
            }
        }
        if skills.is_empty() {
            return 0;
        }
        // Skills should share a phi_layer; warn (not fail) if they don't.
        let phi = skills[0].phi_layer;
        if skills.iter().any(|s| s.phi_layer != phi) {
            tracing::warn!("routable skills disagree on phi_layer; using {phi}");
        }
        let n = skills.len();
        self.set_dyn_phi_layer(Some(phi));
        self.dyn_router = Some(DynRouter::new(skills));
        n
    }

    /// Human-readable switch log from the last dynamic-routed generation.
    pub fn route_switches(&self) -> Vec<(usize, Option<String>, Option<String>)> {
        self.dyn_router
            .as_ref()
            .map(|r| r.switches.clone())
            .unwrap_or_default()
    }

    /// LM head: hidden → logits [vocab_size]. The dominant matvec of
    /// every decode step — row-parallel on the worker pool.
    fn lm_head_forward(&self, hidden: &[f32]) -> Vec<f32> {
        let _mimo_q8 = self
            .mimo_moe
            .is_on()
            .then(crate::qtensor::enter_full_gpu_q8_scope);
        let rows = self.weights.lm_head.rows();
        let mut logits = attention::take_buf(rows.min(self.vocab_size));
        // Banked MiMo uses the same exact projection family for the
        // plain/draft head and the batched verification head. Read both
        // scale planes in-place instead of preparing per-op scale buffers.
        let served = self.mimo_moe.is_on()
            && crate::gpu::mimo_q8_short_enabled()
            && rows == self.vocab_size
            && !self.weights.lm_head.has_prism_contract()
            && self
                .weights
                .lm_head
                .graph_weight()
                .is_some_and(|(model, idx, kind, _)| {
                    kind == 7
                        && crate::gpu::q82_short_rows(
                            model,
                            idx,
                            hidden,
                            1,
                            rows,
                            self.hidden_size,
                            &mut logits,
                        )
                });
        if !served {
            self.weights
                .lm_head
                .matvec(hidden, &mut logits, self.pool.as_deref());
        }
        logits.resize(self.vocab_size, 0.0);
        if let Some(m) = self.logit_multiplier {
            for l in logits.iter_mut() {
                *l *= m;
            }
        }
        if let Some(c) = self.final_softcap {
            softcap_in_place(&mut logits, c, self.pool.as_deref());
        }
        if let Some(cm) = self.head_clusters.as_ref() {
            self.hierarchical_head_logprobs(hidden, cm, &mut logits);
        }
        logits
    }

    /// Two-level head (Cortiq Embryo): in place, logits[v] ← log p(v) =
    /// (lc[c] − lse(lc)) + (logit[v] − lse over v's cluster block), c = v / S.
    fn hierarchical_head_logprobs(&self, hidden: &[f32], cm: &[f32], logits: &mut [f32]) {
        let h = hidden.len();
        let ncl = cm.len() / h.max(1);
        if ncl == 0 || logits.len() % ncl != 0 {
            return;
        }
        let cs = logits.len() / ncl;
        // cluster logits + log-softmax
        let mut lc = vec![0.0f32; ncl];
        for c in 0..ncl {
            let row = &cm[c * h..(c + 1) * h];
            let mut s = 0.0f32;
            for j in 0..h {
                s += row[j] * hidden[j];
            }
            lc[c] = s;
        }
        let mx = lc.iter().cloned().fold(f32::NEG_INFINITY, f32::max);
        let lse: f32 = mx + lc.iter().map(|v| (v - mx).exp()).sum::<f32>().ln();
        for c in 0..ncl {
            let blk = &mut logits[c * cs..(c + 1) * cs];
            let bm = blk.iter().cloned().fold(f32::NEG_INFINITY, f32::max);
            let bl: f32 = bm + blk.iter().map(|v| (v - bm).exp()).sum::<f32>().ln();
            let add = lc[c] - lse - bl;
            for v in blk.iter_mut() {
                *v += add;
            }
        }
    }

    /// Prefill `ids` and return the next-token logits — what the model
    /// would predict next, WITHOUT committing to generation (introspection
    /// for `cortiq explain`). Clears and repopulates the KV cache; leaves
    /// the active overlay untouched.
    pub fn prefill_next_logits(&mut self, ids: &[u32], task_mask: Option<&TaskMask>) -> Vec<f32> {
        #[cfg(target_os = "macos")]
        crate::gpu_metal::set_io_namespace(self.graph_kv_id);
        self.clear_sequence_state();
        // This helper is used by the pooled classification endpoint, where
        // every request is a fresh sequence. The shared reset also clears the
        // wgpu token graph's device-side recurrent state.
        crate::gpu::graph_race_begin_generation();
        if task_mask.is_none() {
            self.o1_begin();
        }
        let mut hidden = vec![0.0f32; self.hidden_size];
        for (pos, &id) in ids.iter().enumerate() {
            let emb = self.embed_single(id);
            hidden = self.forward_layers(&emb, pos, task_mask);
        }
        if let Err(err) = self.o1_seal_checked() {
            self.o1_fail(err);
        }
        // Stacks that own their head (V4, V4.1, Qwen3.8-Flash-Next, GLM-5)
        // return a zero hidden and hand the logits out of band.
        if let Some(logits) = self.graph_logits.take() {
            return logits;
        }
        inference::rms_norm_into(
            &hidden,
            &self.weights.final_norm,
            self.rms_eps,
            self.norm_style,
            &mut self.ws.n1,
        );
        self.lm_head_forward(&self.ws.n1)
    }
}

/// Convenience: deterministic tiny pipeline for tests.
pub fn create_test_pipeline(
    hidden_size: usize,
    intermediate_size: usize,
    num_heads: usize,
    num_kv_heads: usize,
    head_dim: usize,
    num_layers: usize,
    vocab_size: usize,
) -> Pipeline {
    // Small pseudo-random weights: constant weights make attention
    // degenerate and hide indexing bugs.
    let synth = |n: usize, salt: usize| -> Vec<f32> {
        (0..n)
            .map(|i| (((i * 31 + salt * 17 + 7) % 97) as f32 / 97.0 - 0.5) * 0.2)
            .collect()
    };
    let qt = |rows: usize, cols: usize, salt: usize| -> QTensor {
        QTensor::from_f32(synth(rows * cols, salt), rows, cols)
    };
    let layer_weights: Vec<LayerWeights> = (0..num_layers)
        .map(|li| LayerWeights {
            input_norm: vec![1.0; hidden_size],
            post_norm: vec![1.0; hidden_size],
            attn_out_norm: None,
            ffn_out_norm: None,
            layer_scale: None,
            ffn: FfnKind::Dense(DenseFfn {
                gate_proj: qt(intermediate_size, hidden_size, li * 10 + 5),
                up_proj: qt(intermediate_size, hidden_size, li * 10 + 6),
                down_proj: qt(hidden_size, intermediate_size, li * 10 + 7),
                act: Act::Silu,
                down_t: None,
                segs: Vec::new(),
            }),
            attn: AttnKind::Full {
                bias: None,
                wq: qt(num_heads * head_dim, hidden_size, li * 10 + 1),
                wk: qt(num_kv_heads * head_dim, hidden_size, li * 10 + 2),
                wv: qt(num_kv_heads * head_dim, hidden_size, li * 10 + 3),
                wo: qt(hidden_size, num_heads * head_dim, li * 10 + 4),
                q_norm: None,
                k_norm: None,
                output_gate: false,
                softplus_gate: None,
            },
        })
        .collect();

    Pipeline::new(
        Tokenizer::byte_level(),
        PipelineWeights {
            embed_tokens: qt(vocab_size, hidden_size, 100),
            layers: layer_weights,
            lm_head: qt(vocab_size, hidden_size, 200),
            final_norm: vec![1.0; hidden_size],
        },
        hidden_size,
        intermediate_size,
        num_heads,
        num_kv_heads,
        head_dim,
        num_layers,
        num_layers, // physical_layers = num_layers (non-looped)
        false,      // loop_final_norm
        vocab_size,
        1e-6,
        10_000.0,
        NormStyle::Qwen,
        4096,
        SamplerConfig {
            seed: Some(42),
            ..Default::default()
        },
    )
}

/// Batched dense-FFN: gate/up/down via matmat (element-wise the same
/// math as b × dense_ffn — the same dot kernels).
/// One mask bit, LSB-first per byte — `TaskMask::ffn_active_indices`'s
/// convention.
#[inline]
fn mask_bit(row: &[u8], j: usize) -> bool {
    (row.get(j >> 3).copied().unwrap_or(0) >> (j & 7)) & 1 != 0
}

/// Zero the CLOSED neurons' activations in a [rows × inter] panel — the
/// masked-inference fast path's whole trick: full fused quant compute,
/// then the mask lands on the ACTIVATIONS, which is arithmetically the
/// pruned network without touching a quantized weight byte. Whole open
/// bytes (0xFF = 8 open neurons) skip in one test.
/// `CMF_FFN_MASK_GAIN` — Patent 12 FIG. 4, variance-preserving
/// rescaling: truncation removes a share of the layer's output energy,
/// so the survivors are scaled up to put the variance back where the
/// downstream norm expects it. A scalar here; per layer it is
/// `sqrt(total energy / kept energy)`.
fn mask_gain() -> f32 {
    static G: std::sync::OnceLock<f32> = std::sync::OnceLock::new();
    *G.get_or_init(|| {
        std::env::var("CMF_FFN_MASK_GAIN")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(1.0)
    })
}

fn zero_masked_cols(g: &mut [f32], rows: usize, inter: usize, row: &[u8]) {
    // With CMF_FFN_MEANFILL a closed neuron contributes its average
    // instead of nothing — same bytes read, one constant restored.
    let fill = meanfill().and_then(|(i, v)| {
        let li = crate::gpu::cur_layer();
        (*i == inter && li >= 0).then(|| &v[li as usize * inter..(li as usize + 1) * inter])
    });
    for r in 0..rows {
        let base = r * inter;
        for (bi, &byte) in row.iter().enumerate() {
            if byte == 0xFF {
                continue;
            }
            let j0 = bi * 8;
            for bit in 0..8 {
                let j = j0 + bit;
                if j < inter && byte & (1 << bit) == 0 {
                    g[base + j] = fill.map_or(0.0, |f| f[j]);
                }
            }
        }
    }
    let gain = mask_gain();
    if gain != 1.0 {
        for v in g[..rows * inter].iter_mut() {
            *v *= gain;
        }
    }
}

/// True when neuron `i`'s bit is set (no mask = everything runs).
#[inline]
fn tube_bit(row: Option<&[u8]>, i: usize) -> bool {
    row.is_none_or(|r| mask_bit(r, i))
}

/// Every bit below `n` set — the common case for a tube file's CORE,
/// where only the tube bits vary per task.
fn all_bits_on(row: &[u8], n: usize) -> bool {
    (0..n).all(|i| mask_bit(row, i))
}

/// `CMF_TUBE_TOPK` — how many tubes a TOKEN may open (0 = the task mask
/// decides alone). This is the dense FFN read as a mixture: the tubes
/// are the experts a k-means over `gate_proj` rows found, and the token
/// picks among them. `CMF_TUBE_SCORE=gate` scores a tube by its own
/// gate (realizable: only `up`/`down` of the losers go unread),
/// `=oracle` scores by the true `silu(gate)·up` mass (the ceiling —
/// only `down` is saved, and the selection has read what it predicts).
fn tube_topk() -> usize {
    static K: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
    *K.get_or_init(|| {
        std::env::var("CMF_TUBE_TOPK")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(0)
    })
}

fn tube_score_oracle() -> bool {
    static O: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    *O.get_or_init(|| std::env::var("CMF_TUBE_SCORE").is_ok_and(|v| v == "oracle"))
}

/// The routed arm of `tube_ffn`: a token opens only its best `k` tubes.
/// At `b == 1` (decode) the losers are genuinely never read — that is
/// the speed. At `b > 1` (the scoring sweep) every tube is computed and
/// the losers' activations are zeroed instead: same arithmetic, so the
/// perplexity is the routed model's, measured without a per-token
/// gather in the middle of a GEMM.
fn tube_ffn_routed(
    d: &DenseFfn,
    xs: &[f32],
    b: usize,
    pool: Option<&Pool>,
    mask_row: Option<&[u8]>,
    k: usize,
) -> Vec<f32> {
    let hidden = d.down_proj.rows();
    let core = d.gate_proj.rows();
    let core_full = mask_row.is_none_or(|r| all_bits_on(r, core));
    let mut out = match (b, core_full, mask_row) {
        (1, true, _) => dense_ffn(d, xs, pool),
        (1, false, Some(row)) => dense_ffn_masked(d, xs, pool, row),
        (_, true, _) => dense_ffn_batch(d, xs, b, pool, None),
        (_, false, row) => dense_ffn_batch(d, xs, b, pool, row),
    };
    let cand: Vec<usize> = (0..d.segs.len())
        .filter(|&i| tube_bit(mask_row, d.segs[i].start))
        .collect();
    if cand.is_empty() {
        return out;
    }
    // gate (and, where the score or the batch needs it, up) per tube.
    // The SCORE is taken at the point the serving path could take it:
    // off the gate alone, or off the finished activation for the oracle.
    let oracle = tube_score_oracle();
    let mut acts: Vec<Vec<f32>> = Vec::with_capacity(cand.len());
    let mut scores = vec![0f32; b * cand.len()];
    for (ci, &i) in cand.iter().enumerate() {
        let seg = &d.segs[i];
        let w = seg.width;
        let mut g = vec![0.0f32; b * w];
        if b == 1 {
            seg.gate.matvec(xs, &mut g, pool);
        } else {
            seg.gate.matmat(xs, b, &mut g, pool);
        }
        for v in g.iter_mut() {
            *v = Act::Silu.combine(*v, 1.0);
        }
        if !oracle {
            for t in 0..b {
                scores[t * cand.len() + ci] =
                    g[t * w..(t + 1) * w].iter().map(|v| v * v).sum::<f32>();
            }
        }
        if oracle || b > 1 {
            let mut u = vec![0.0f32; b * w];
            if b == 1 {
                seg.up.matvec(xs, &mut u, pool);
            } else {
                seg.up.matmat(xs, b, &mut u, pool);
            }
            for (a, &v) in g.iter_mut().zip(u.iter()) {
                *a *= v;
            }
            if oracle {
                for t in 0..b {
                    scores[t * cand.len() + ci] =
                        g[t * w..(t + 1) * w].iter().map(|v| v * v).sum::<f32>();
                }
            }
        }
        acts.push(g);
    }
    // per-token scores and the winners
    let keep = k.min(cand.len());
    let mut scratch: Vec<f32> = Vec::new();
    for t in 0..b {
        let mut sc: Vec<(f32, usize)> = (0..cand.len())
            .map(|ci| (scores[t * cand.len() + ci], ci))
            .collect();
        sc.sort_unstable_by(|x, y| y.0.total_cmp(&x.0));
        let mut alive = vec![false; cand.len()];
        for &(_, ci) in sc.iter().take(keep) {
            alive[ci] = true;
        }
        if b > 1 {
            for (ci, a) in acts.iter_mut().enumerate() {
                if !alive[ci] {
                    let w = d.segs[cand[ci]].width;
                    a[t * w..(t + 1) * w].fill(0.0);
                }
            }
        } else {
            // decode: finish only the winners — the losers' up/down
            // (and, with the gate score, everything but their gate)
            // are never touched.
            for (ci, &i) in cand.iter().enumerate() {
                if !alive[ci] {
                    continue;
                }
                let seg = &d.segs[i];
                let w = seg.width;
                let g = &mut acts[ci];
                if !tube_score_oracle() {
                    scratch.clear();
                    scratch.resize(w, 0.0);
                    seg.up.matvec(xs, &mut scratch, pool);
                    for (a, &v) in g.iter_mut().zip(scratch.iter()) {
                        *a *= v;
                    }
                }
                let mut acc = vec![0.0f32; hidden];
                seg.down.matvec(g, &mut acc, pool);
                for (o, a) in out.iter_mut().zip(&acc) {
                    *o += *a;
                }
            }
        }
    }
    if b > 1 {
        for (ci, &i) in cand.iter().enumerate() {
            let seg = &d.segs[i];
            let mut acc = vec![0.0f32; b * hidden];
            seg.down.matmat(&acts[ci], b, &mut acc, pool);
            for (o, a) in out.iter_mut().zip(&acc) {
                *o += *a;
            }
        }
    }
    out
}

/// FFN of a defragged tube layer: the always-on core plus the tubes the
/// task mask switches on. Each tube is a normal tensor triple, so the
/// same kernels run it and an inactive tube's bytes are never read —
/// that is the whole point of the defrag (a scattered mask cannot skip
/// bytes; a contiguous one is just a smaller matrix).
fn tube_ffn(
    d: &DenseFfn,
    xs: &[f32],
    b: usize,
    pool: Option<&Pool>,
    mask_row: Option<&[u8]>,
) -> Vec<f32> {
    if tube_topk() > 0 {
        return tube_ffn_routed(d, xs, b, pool, mask_row, tube_topk());
    }
    let hidden = d.down_proj.rows();
    let core = d.gate_proj.rows();
    let core_full = mask_row.is_none_or(|r| all_bits_on(r, core));
    let mut out = match (b, core_full, mask_row) {
        (1, true, _) => dense_ffn(d, xs, pool),
        (1, false, Some(row)) => dense_ffn_masked(d, xs, pool, row),
        (_, true, _) => dense_ffn_batch(d, xs, b, pool, None),
        (_, false, row) => dense_ffn_batch(d, xs, b, pool, row),
    };
    TUBE_SCRATCH.with(|sc| {
        let mut sc = sc.borrow_mut();
        let [g, u, acc] = &mut *sc;
        for seg in &d.segs {
            if !tube_bit(mask_row, seg.start) {
                continue;
            }
            let w = seg.width;
            g.resize(b * w, 0.0);
            if b == 1
                && d.act == Act::Silu
                && QTensor::matvec_silu_mul(&seg.gate, &seg.up, xs, g, pool)
            {
                // g holds silu(gate)·up.
            } else {
                u.resize(b * w, 0.0);
                if b == 1 {
                    QTensor::matvec_many([&seg.gate, &seg.up], xs, [g, u], pool);
                } else {
                    seg.gate.matmat(xs, b, g, pool);
                    seg.up.matmat(xs, b, u, pool);
                }
                for i in 0..b * w {
                    g[i] = d.act.combine(g[i], u[i]);
                }
            }
            acc.resize(b * hidden, 0.0);
            acc.fill(0.0);
            if b == 1 {
                seg.down.matvec(g, acc, pool);
            } else {
                seg.down.matmat(g, b, acc, pool);
            }
            for (o, a) in out.iter_mut().zip(acc.iter()) {
                *o += *a;
            }
        }
        out
    })
}

thread_local! {
    /// gate / up / down-accumulator scratch for the tube loop — a tube
    /// runs once per layer per token, and a fresh Vec each time is a
    /// malloc per tube per layer per token.
    static TUBE_SCRATCH: std::cell::RefCell<[Vec<f32>; 3]> =
        const { std::cell::RefCell::new([Vec::new(), Vec::new(), Vec::new()]) };
}

/// An expert's tubes (`mlp.experts.{e}.*_proj.tube1.weight`: its hot neurons at eight
/// bits, their rows zero in the expert's own triple) added to `out` with the expert's
/// routing weight. The MoE paths compute the triple themselves; this is the rest.
pub(crate) fn expert_tubes_add(d: &DenseFfn, x: &[f32], weight: f32, out: &mut [f32], pool: Option<&Pool>) {
    if d.segs.is_empty() {
        return;
    }
    TUBE_SCRATCH.with(|sc| {
        let mut sc = sc.borrow_mut();
        let [g, u, acc] = &mut *sc;
        for seg in &d.segs {
            let w = seg.width;
            g.resize(w, 0.0);
            if !(d.act == Act::Silu && QTensor::matvec_silu_mul(&seg.gate, &seg.up, x, g, pool)) {
                u.resize(w, 0.0);
                QTensor::matvec_many([&seg.gate, &seg.up], x, [g, u], pool);
                for i in 0..w {
                    g[i] = d.act.combine(g[i], u[i]);
                }
            }
            acc.resize(out.len(), 0.0);
            acc.fill(0.0);
            seg.down.matvec(g, acc, pool);
            for (o, a) in out.iter_mut().zip(acc.iter()) {
                *o += weight * *a;
            }
        }
    });
}

/// The shared expert's weight on one token: σ of its gate, or 1 without one.
pub(crate) fn shared_expert_weight(gate: Option<&QTensor>, x: &[f32], pool: Option<&Pool>) -> f32 {
    gate.map_or(1.0, |gate| {
        let mut gl = [0.0f32; 1];
        gate.matvec(x, &mut gl, pool);
        1.0 / (1.0 + (-gl[0]).exp())
    })
}

/// The shared expert's tubes (`mlp.shared_expert.*_proj.tube1.weight`, `hot-bake
/// --shared-q8`: the whole expert at eight bits) added to `out` with its weight.
pub(crate) fn shared_tubes_add(m: &MoeFfn, x: &[f32], out: &mut [f32], pool: Option<&Pool>) {
    if let Some((se, gate)) = &m.shared
        && !se.segs.is_empty()
    {
        let g = shared_expert_weight(gate.as_ref(), x, pool);
        expert_tubes_add(se, x, g, out, pool);
    }
}

/// CMF_PREFILL_PROF: cumulative ns of the batched walk's attention and
/// FFN halves (all layers, all chunks).
static PREFILL_SPLIT: [std::sync::atomic::AtomicU64; 2] = [
    std::sync::atomic::AtomicU64::new(0),
    std::sync::atomic::AtomicU64::new(0),
];

/// The wgpu side of `CMF_PREFILL_PROF`: q|k|v GEMMs' enqueue and readback
/// wait, the chunk attend's readback wait (ms, cumulative) and the int8
/// GEMMs the `zi_mm` route took.
fn wgpu_prefill_counters() -> (f64, f64, f64, u64) {
    #[cfg(feature = "gpu")]
    {
        use std::sync::atomic::Ordering::Relaxed;
        let ms = |a: &std::sync::atomic::AtomicU64| a.load(Relaxed) as f64 / 1e6;
        (
            ms(&crate::gpu_wgpu::GEMM_MANY_NS[0]),
            ms(&crate::gpu_wgpu::GEMM_MANY_NS[1]),
            ms(&crate::gpu_wgpu::CHUNK_ATTEND_WAIT_NS),
            crate::gpu_wgpu::ZI_GEMM_CALLS.load(Relaxed),
        )
    }
    #[cfg(not(feature = "gpu"))]
    (0.0, 0.0, 0.0, 0)
}

/// The wgpu prefill mirror attend's outcome counters
/// (`gpu_wgpu::MIRROR_EVENTS`).
fn wgpu_mirror_counters() -> [u64; 6] {
    #[cfg(feature = "gpu")]
    {
        crate::gpu_wgpu::MIRROR_EVENTS
            .each_ref()
            .map(|a| a.load(std::sync::atomic::Ordering::Relaxed))
    }
    #[cfg(not(feature = "gpu"))]
    [0; 6]
}

fn prefill_prof_on() -> bool {
    static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    *ON.get_or_init(|| std::env::var_os("CMF_PREFILL_PROF").is_some())
}

/// Accumulate the dense FFN activations which feed the down projection.
///
/// MTP calibration intentionally calls this independently of the trunk's
/// `FFN_PROBE` TLS recorder: an MTP sidecar can use a different FFN width,
/// and borrowing the trunk's layer-numbered accumulator would silently turn
/// draft statistics into trunk proxies.  The caller owns the execution scope
/// (the public MTP probe uses `gpu::cpu_scope`) and supplies one accumulator
/// per actual MTP FFN channel.
pub(crate) fn accumulate_dense_ffn_activation_mass(
    d: &DenseFfn,
    xs: &[f32],
    b: usize,
    pool: Option<&Pool>,
    mass: &mut [f64],
    squared_mass: &mut [f64],
) -> Result<(), String> {
    let inter = d.gate_proj.rows();
    let hidden = d.gate_proj.cols();
    if mass.len() != inter || squared_mass.len() != inter {
        return Err(format!(
            "MTP FFN probe: accumulator widths ({}, {}) != gate width {inter}",
            mass.len(),
            squared_mass.len()
        ));
    }
    if d.up_proj.rows() != inter
        || d.up_proj.cols() != hidden
        || d.down_proj.cols() != inter
        || d.down_proj.rows() != hidden
    {
        return Err("MTP FFN probe: inconsistent dense FFN shapes".into());
    }
    if !d.segs.is_empty() {
        return Err("MTP FFN probe: tube-segmented draft FFNs are not supported".into());
    }
    if xs.len() != b.saturating_mul(hidden) {
        return Err(format!(
            "MTP FFN probe: {} input values for {b} × {hidden} rows",
            xs.len()
        ));
    }
    if b == 0 {
        return Ok(());
    }
    let mut gate = vec![0.0f32; b * inter];
    let mut up = vec![0.0f32; b * inter];
    d.gate_proj.matmat(xs, b, &mut gate, pool);
    d.up_proj.matmat(xs, b, &mut up, pool);
    for row in 0..b {
        for i in 0..inter {
            let a = d.act.combine(gate[row * inter + i], up[row * inter + i]);
            let a = a as f64;
            mass[i] += a.abs();
            squared_mass[i] += a * a;
        }
    }
    Ok(())
}

fn dense_ffn_batch(
    d: &DenseFfn,
    xs: &[f32],
    b: usize,
    pool: Option<&Pool>,
    mask_row: Option<&[u8]>,
) -> Vec<f32> {
    let inter = d.gate_proj.rows();
    let hidden = d.down_proj.rows();
    // Fused on-device SwiGLU when the device is in play: three separate
    // `matmat` calls are three round trips per layer, and the gate/up
    // panels (b × inter — 22 MB each at a 512-token chunk) cross the bus
    // twice for nothing. The kernel already existed for the image DiT;
    // the LLM prefill was simply never wired to it. A task mask needs the
    // activations on the host between the halves, so it keeps the CPU
    // arm below.
    // SiLU/GELU have device arms everywhere they are admitted.  MiniMax
    // M3's frozen OAI contract has an additional WGPU-only arm; callers on
    // native Metal still get an honest decline from `q4_ffn_act` rather than
    // an accidental SiLU evaluation.
    let fused_act = d.act.wgpu_graph_act();
    if mask_row.is_none()
        && fused_act.is_some()
        && b >= 32
        && crate::gpu::enabled_here()
        && !crate::gpu::mm_killed()
        // The refit pass needs this layer's activations on the host; the
        // fused chain keeps them on the device. Refusing it here costs
        // one round trip and keeps every GEMM on the card — the
        // alternative was running the whole calibration on the CPU.
        && refit_dir().is_none()
        // Same for the mass/hit probes. The accumulator at the bottom of
        // this function only sees `g` when `g` came back to the host, so
        // a fused batch would leave it summing nothing — a probe that
        // reports zeros rather than failing, which is worse.
        && !ffn_probe_active()
        // GPTQ calibration folds every projection's input on the host
        // (`QTensor::matmat`); the fused chain would hand gate/up/down
        // their inputs on the card and leave the FFN uncalibrated.
        && !crate::gptq_capture::capturing()
    {
        if let (Some((model, w1)), Some((_, w3)), Some((_, w2))) = (
            d.gate_proj.mapped_q4t(),
            d.up_proj.mapped_q4t(),
            d.down_proj.mapped_q4t(),
        ) {
            let mut out = vec![0.0f32; b * hidden];
            let act = fused_act.expect("checked above");
            if crate::gpu::q4_ffn_act(
                model, w1, w3, w2, xs, b, hidden, inter, false, act, &mut out,
            ) {
                return out;
            }
        }
        // The q4tp twin (same kernel family, scale from the row ladder) —
        // the DiT has run it in production since the pipeline containers;
        // the LLM prefill was simply never wired to it, so a q4tp model's
        // prefill panels stayed on the CPU.
        if let (Some((model, w1)), Some((_, w3)), Some((_, w2))) = (
            d.gate_proj.mapped_q4tp(),
            d.up_proj.mapped_q4tp(),
            d.down_proj.mapped_q4tp(),
        ) {
            let mut out = vec![0.0f32; b * hidden];
            let act = fused_act.expect("checked above");
            if crate::gpu::q4_ffn_act(model, w1, w3, w2, xs, b, hidden, inter, true, act, &mut out)
            {
                return out;
            }
        }
        // Every other device codec — int8, or gate/up and down in different
        // codecs: the three GEMMs with the panels kept on the card. Without
        // it a q8_2f prefill read both b·inter panels home, folded them on
        // one host thread, and sent the result back for down.
        // CMF_FFN_KEEP=0 keeps the per-GEMM path (A/B).
        if let (true, Some((model, w1)), Some((_, w3)), Some((_, w2))) = (
            std::env::var("CMF_FFN_KEEP").as_deref() != Ok("0"),
            d.gate_proj.mapped_device_gemm(),
            d.up_proj.mapped_device_gemm(),
            d.down_proj.mapped_device_gemm(),
        ) {
            let mut out = vec![0.0f32; b * hidden];
            let act = fused_act.expect("checked above");
            if crate::gpu::ffn_act_keep(model, w1, w3, w2, xs, b, hidden, inter, act, &mut out) {
                return out;
            }
        }
    }
    let mut g = vec![0.0f32; b * inter];
    d.gate_proj.matmat(xs, b, &mut g, pool);
    let mut u = vec![0.0f32; b * inter];
    d.up_proj.matmat(xs, b, &mut u, pool);
    if gate_topk() > 0 && d.act == Act::Silu {
        for t in 0..b {
            let row = &mut g[t * inter..(t + 1) * inter];
            for v in row.iter_mut() {
                *v = Act::Silu.combine(*v, 1.0);
            }
            keep_top_k(row, gate_topk());
        }
        for i in 0..b * inter {
            g[i] *= u[i];
        }
    } else {
        combine_pooled(d.act, &mut g[..b * inter], &u[..b * inter], pool);
    }
    if let Some(row) = mask_row {
        zero_masked_cols(&mut g, b, inter, row);
    }
    if oracle_topk() > 0 {
        for t in 0..b {
            keep_top_k(&mut g[t * inter..(t + 1) * inter], oracle_topk());
        }
    }
    let mut out = vec![0.0f32; b * hidden];
    d.down_proj.matmat(&g, b, &mut out, pool);
    if refit_dir().is_some() {
        let li = crate::gpu::cur_layer();
        if li >= 0 {
            refit_accumulate(li as usize, &g, b, inter, &out, hidden, pool);
        }
    }
    // The DTG-MA probe, on the batched path: one prefill sweep gives the
    // same per-neuron statistic the per-position probe does, and on a 27B
    // that is minutes instead of hours.
    FFN_PROBE.with(|pr| {
        if let Some(acc) = pr.borrow_mut().as_mut() {
            let li = crate::gpu::cur_layer();
            if li < 0 {
                return;
            }
            let Some(row) = acc.get_mut(li as usize) else {
                return;
            };
            let (sq, topk) = (probe_sq(), probe_topk().min(inter));
            let mut mag: Vec<f32> = Vec::new();
            for t in 0..b {
                let gr = &g[t * inter..(t + 1) * inter];
                if topk > 0 {
                    // The hit count of the per-position probe: a position's
                    // `topk` loudest neurons each get one.
                    mag.clear();
                    mag.extend(gr.iter().map(|v| v.abs()));
                    let (_, kth, _) = mag.select_nth_unstable_by(topk - 1, |a, b| {
                        b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal)
                    });
                    let thr = *kth;
                    for (a, &v) in row.iter_mut().zip(gr) {
                        if v.abs() >= thr {
                            *a += 1.0;
                        }
                    }
                    continue;
                }
                for (a, &v) in row.iter_mut().zip(gr) {
                    *a += if sq {
                        (v as f64) * (v as f64)
                    } else {
                        (v as f64).abs()
                    };
                }
            }
        }
    });
    out
}

/// Batched MoE-FFN: router batched, positions are GROUPED by expert —
/// an expert's weights are read once for all its positions in the chunk
/// (the main prefill-GEMM win on MoE: 960MB/token of 35B experts).
/// Accumulate per-channel activation energy for `CMF_RMS_TRACE`.
fn accumulate_act(m: &MoeFfn, xs: &[f32], b: usize) {
    static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    static DUMP: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    let on = *ON.get_or_init(|| std::env::var("CMF_RMS_TRACE").is_ok());
    let dump = *DUMP.get_or_init(|| std::env::var("CMF_ACT_DUMP").is_ok());
    if (!on && !dump) || b == 0 {
        return;
    }
    let hidden = xs.len() / b;
    if on {
        let mut acc = m.act_sq.borrow_mut();
        if acc.len() < hidden {
            acc.resize(hidden, 0.0);
        }
        for t in 0..b {
            let row = &xs[t * hidden..(t + 1) * hidden];
            for (a, &v) in acc.iter_mut().zip(row) {
                *a += (v as f64) * (v as f64);
            }
        }
    }
    if dump {
        // Cap the capture: the covariance needs a few thousand rows, and a
        // whole prefill of every layer would be gigabytes for no extra rank.
        let cap: usize = std::env::var("CMF_ACT_DUMP_ROWS")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(4096);
        let mut rows = m.act_rows.borrow_mut();
        if rows.len() < cap * hidden {
            let take = b.min((cap * hidden - rows.len()) / hidden.max(1));
            rows.extend_from_slice(&xs[..take * hidden]);
        }
    }
}

/// Send-able cursor over a Vec-of-Vecs: each pool worker writes only its
/// own slots (disjoint by construction in the caller).
#[derive(Clone, Copy)]
struct SendVecs(*mut Vec<f32>);
unsafe impl Send for SendVecs {}
unsafe impl Sync for SendVecs {}
impl SendVecs {
    #[inline]
    fn at(self, i: usize) -> *mut Vec<f32> {
        unsafe { self.0.add(i) }
    }
}

fn moe_ffn_batch(
    m: &MoeFfn,
    xs: &[f32],
    b: usize,
    hidden: usize,
    pool: Option<&Pool>,
    allowed: Option<&[bool]>,
) -> Vec<f32> {
    accumulate_act(m, xs, b);
    let ne = m.experts.len();
    let mut logits = vec![0.0f32; b * ne];
    match &m.resonance {
        Some(r) => {
            let hdim = xs.len() / b.max(1);
            for bi in 0..b {
                r.scores(
                    &xs[bi * hdim..(bi + 1) * hdim],
                    &mut logits[bi * ne..(bi + 1) * ne],
                );
            }
        }
        None => m.router.matmat(xs, b, &mut logits, pool),
    }

    // Assignments: expert → [(position, weight)] — same routing as
    // moe_ffn, per position (see `moe_route`).
    let mut assign: Vec<Vec<(usize, f32)>> = vec![Vec::new(); ne];
    {
        let mut st = m.stats.borrow_mut();
        if st.len() < ne {
            st.resize(ne, 0);
        }
        for bi in 0..b {
            let (idx, p, wsum) = moe_route(&logits[bi * ne..(bi + 1) * ne], m, allowed);
            for &e in &idx {
                st[e] += 1;
                assign[e].push((bi, p[e] / wsum));
            }
        }
    }

    let mut out = vec![0.0f32; b * hidden];
    let cols = m.experts[0].gate_proj.cols();
    let run_expert = |d: &DenseFfn, list: &[(usize, f32)], out: &mut [f32]| {
        let sb = list.len();
        let mut sub = vec![0.0f32; sb * cols];
        for (k, &(bi, _)) in list.iter().enumerate() {
            sub[k * cols..(k + 1) * cols].copy_from_slice(&xs[bi * cols..(bi + 1) * cols]);
        }
        let eo = dense_ffn_batch(d, &sub, sb, pool, None);
        for (k, &(bi, w)) in list.iter().enumerate() {
            for i in 0..hidden {
                out[bi * hidden + i] += w * eo[k * hidden + i];
            }
        }
    };
    // Routed experts: the panels are TINY (b·top_k spread over every
    // expert — a few positions each), so a pool dispatch per expert is
    // pure barrier cost. Invert the parallelism: workers take WHOLE
    // experts (serial math inside), then one deterministic scatter in
    // expert order — the exact accumulation order the serial loop had.
    let active: Vec<usize> = (0..ne).filter(|&e| !assign[e].is_empty()).collect();
    if pool.is_some() && active.len() >= 8 {
        let mut panels: Vec<Vec<f32>> = vec![Vec::new(); active.len()];
        {
            let panel_ptr = SendVecs(panels.as_mut_ptr());
            // Capture only the expert table: `m` itself carries RefCell
            // stats and must not cross the pool boundary.
            let experts = &m.experts;
            let (active_r, assign_r) = (&active, &assign);
            let inherit_cpu = crate::gpu::inherit_cpu_scope();
            let run = |start: usize, end: usize| {
                let _cpu_scope = inherit_cpu();
                // Native Metal: the per-op device helpers (`q4tp_ffn`,
                // `q8_matmat`, …) stage through size-keyed shared io
                // buffers and are not re-entrant — two workers whose experts
                // drew the same row count wrote one buffer at once, so a
                // Mellum2.1 prompt came out different on every run. The
                // workers keep whole experts on the CPU there; the device
                // prefill is the MoE chunk graph.
                #[cfg(target_os = "macos")]
                let _metal_cpu = crate::gpu::enter_cpu_scope();
                for ai in start..end {
                    let e = active_r[ai];
                    let list = &assign_r[e];
                    let sb = list.len();
                    let mut sub = vec![0.0f32; sb * cols];
                    for (k, &(bi, _)) in list.iter().enumerate() {
                        sub[k * cols..(k + 1) * cols]
                            .copy_from_slice(&xs[bi * cols..(bi + 1) * cols]);
                    }
                    // SAFETY: each worker owns a disjoint panels[ai].
                    unsafe {
                        *panel_ptr.at(ai) = dense_ffn_batch(&experts[e], &sub, sb, None, None);
                    }
                }
            };
            match pool {
                Some(p) => p.run_rows(active.len(), &run),
                None => run(0, active.len()),
            }
        }
        for (ai, &e) in active.iter().enumerate() {
            for (k, &(bi, w)) in assign[e].iter().enumerate() {
                let eo = &panels[ai][k * hidden..(k + 1) * hidden];
                for i in 0..hidden {
                    out[bi * hidden + i] += w * eo[i];
                }
            }
        }
    } else {
        for &e in &active {
            run_expert(&m.experts[e], &assign[e], &mut out);
        }
    }
    if let Some((se, gate)) = &m.shared {
        let all: Vec<(usize, f32)> = if let Some(gate) = gate {
            let mut gl = vec![0.0f32; b];
            gate.matmat(xs, b, &mut gl, pool);
            (0..b)
                .map(|bi| (bi, 1.0 / (1.0 + (-gl[bi]).exp())))
                .collect()
        } else {
            (0..b).map(|bi| (bi, 1.0)).collect()
        };
        run_expert(se, &all, &mut out);
    }
    out
}

/// Decode-exact multi-token MoE — the MiMo speculative verify's FFN. Row
/// `r` of the result is bit-identical to `moe_ffn(m, x_r)` on the CPU
/// (`moe_ffn_cpu` → `moe_ffn_cpu_batched`): router matvec per row, the same
/// routing, the same int8 gate/up/SiLU and down terms
/// (`QTensor::moe_gate_up_rows` / `moe_down_rows`), and the row's experts
/// summed in ITS route order from 0. What the rows share is the weight
/// traffic: each routed expert is read once for every row that picked it.
/// (`moe_ffn_batch`, the prompt path, groups the same way but sums in
/// expert-index order and runs blocked kernels on wide groups — close, not
/// bit-equal to decode.) Any layer the kernels do not cover, or a device
/// that could answer `moe_ffn` itself, walks `moe_ffn` row by row.
fn moe_ffn_rows_exact(
    m: &MoeFfn,
    xs: &[f32],
    b: usize,
    hidden: usize,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let mut out = vec![0.0f32; b * hidden];
    let per_row = |out: &mut [f32]| {
        for r in 0..b {
            let o = moe_ffn(m, &xs[r * hidden..(r + 1) * hidden], pool, None);
            out[r * hidden..(r + 1) * hidden].copy_from_slice(&o);
        }
    };
    let covered = !crate::gpu::enabled_here()
        && moe_batch_enabled()
        && m.shared.is_none()
        && m.resonance.is_none()
        && FFN_PROBE.with(|pr| pr.borrow().is_none())
        && m.experts.iter().all(|d| d.act == Act::Silu);
    if !covered {
        per_row(&mut out);
        return out;
    }
    let ne = m.experts.len();
    // Routing, row by row, exactly as `moe_ffn`.
    let mut routes: Vec<(Vec<usize>, Vec<f32>)> = Vec::with_capacity(b);
    for r in 0..b {
        let x = &xs[r * hidden..(r + 1) * hidden];
        accumulate_act(m, x, 1);
        let mut logits = vec![0.0f32; ne];
        m.router.matvec(x, &mut logits, pool);
        let (idx, p, wsum) = moe_route(&logits, m, None);
        {
            let mut st = m.stats.borrow_mut();
            if st.len() < ne {
                st.resize(ne, 0);
            }
            for &e in &idx {
                st[e] += 1;
            }
        }
        let w: Vec<f32> = idx
            .iter()
            .map(|&e| p[e] / wsum * m.per_expert_scale.as_ref().map_or(1.0, |v| v[e]))
            .collect();
        routes.push((idx, w));
    }
    if routes.iter().any(|(idx, _)| idx.is_empty()) {
        per_row(&mut out);
        return out;
    }
    // Group the (row, expert) picks by expert, in first-seen order.
    let mut experts: Vec<usize> = Vec::new();
    let mut groups: Vec<Vec<usize>> = Vec::new();
    for (r, (idx, _)) in routes.iter().enumerate() {
        for &e in idx {
            match experts.iter().position(|&x| x == e) {
                Some(g) => groups[g].push(r),
                None => {
                    experts.push(e);
                    groups.push(vec![r]);
                }
            }
        }
    }
    let n_pairs: usize = groups.iter().map(|g| g.len()).sum();
    let inter = m.experts[experts[0]].gate_proj.rows();
    let pairs: Vec<(&QTensor, &QTensor)> = experts
        .iter()
        .map(|&e| (&m.experts[e].gate_proj, &m.experts[e].up_proj))
        .collect();
    let mut gs: Vec<Vec<f32>> = (0..n_pairs).map(|_| vec![0f32; inter]).collect();
    if !QTensor::moe_gate_up_rows(&pairs, &groups, xs, &mut gs, pool) {
        per_row(&mut out);
        return out;
    }
    let downs: Vec<&QTensor> = experts.iter().map(|&e| &m.experts[e].down_proj).collect();
    let lens: Vec<usize> = groups.iter().map(|g| g.len()).collect();
    let mut ds: Vec<Vec<f32>> = (0..n_pairs).map(|_| vec![0f32; hidden]).collect();
    if !QTensor::moe_down_rows(&downs, &lens, &gs, &mut ds, pool) {
        per_row(&mut out);
        return out;
    }
    // Where each (row, expert) term landed in the flat pair list.
    let mut slot = std::collections::HashMap::with_capacity(n_pairs);
    let mut p = 0usize;
    for (g, &e) in experts.iter().enumerate() {
        for &r in &groups[g] {
            slot.insert((r, e), p);
            p += 1;
        }
    }
    for (r, (idx, w)) in routes.iter().enumerate() {
        let terms: Vec<(&[f32], f32)> = idx
            .iter()
            .zip(w)
            .map(|(&e, &we)| (ds[slot[&(r, e)]].as_slice(), we))
            .collect();
        let row = &mut out[r * hidden..(r + 1) * hidden];
        for (i, dst) in row.iter_mut().enumerate() {
            // `moe_down_many`'s per-row sum: from 0, in route order.
            let mut acc = 0f32;
            for (d, we) in &terms {
                acc += we * d[i];
            }
            *dst = acc;
        }
    }
    out
}

/// Gemma's final-logit soft-capping, `c·tanh(x/c)`, over a whole vocab row —
/// element for element the serial expression, split across the pool: at a
/// 262k vocab the serial `tanh` pass was ~5 ms of a 36 ms decode token.
/// Ripple's value residual: the rows V projects, `torch.lerp(e0, normed, blend)` term for term
/// (the two forms torch picks between at a weight of one half).
pub(crate) fn vres_lerp(e0: &[f32], normed: &[f32], blend: f32, out: &mut Vec<f32>) {
    debug_assert_eq!(e0.len(), normed.len());
    out.clear();
    if blend < 0.5 {
        out.extend(e0.iter().zip(normed).map(|(&e, &n)| e + blend * (n - e)));
    } else {
        out.extend(e0.iter().zip(normed).map(|(&e, &n)| n - (n - e) * (1.0 - blend)));
    }
}

pub(crate) fn softcap_in_place(v: &mut [f32], c: f32, pool: Option<&Pool>) {
    match pool {
        Some(p) if v.len() >= 1 << 15 => {
            let base = v.as_mut_ptr() as usize;
            p.run_rows(v.len(), &|s, e| {
                // SAFETY: run_rows hands out disjoint [s, e) ranges of `v`,
                // which outlives the (blocking) dispatch.
                let sl =
                    unsafe { std::slice::from_raw_parts_mut((base as *mut f32).add(s), e - s) };
                for x in sl {
                    *x = c * (*x / c).tanh();
                }
            });
        }
        _ => {
            for x in v.iter_mut() {
                *x = c * (*x / c).tanh();
            }
        }
    }
}

thread_local! {
    /// gate/up activation scratch for the dense FFN paths (single uses
    /// two slots, the fused pair all four) — these were fresh
    /// intermediate-size Vecs on every layer of every token.
    static FFN_SCRATCH: std::cell::RefCell<[Vec<f32>; 4]> =
        const { std::cell::RefCell::new([Vec::new(), Vec::new(), Vec::new(), Vec::new()]) };
}

/// Dense SwiGLU FFN through QTensor matvecs (any storage).
fn dense_ffn(d: &DenseFfn, x: &[f32], pool: Option<&Pool>) -> Vec<f32> {
    // Per-token sparsity, when the file was built for it: gate first,
    // then only the chosen neurons' up/down rows leave the mmap.
    if gate_topk() > 0
        && let Some(out) = dense_ffn_dynamic(d, x, pool, gate_topk())
    {
        return out;
    }
    // Whole-FFN GPU submit (этап 4.2 increment): gate → silu·up → down
    // chained in ONE command buffer with the intermediate activations
    // resident on the device — 3 per-op polls become 1 per layer. The
    // moe_block backend already implements exactly this chain; a dense
    // FFN is one expert with weight 1. Runtime probe: the chain still
    // pays one submit+poll per layer — alternate it against the pure-CPU
    // FFN and keep whichever is faster on this machine.
    // q1 FFNs offload at any practical size: the q1 CPU kernel is
    // compute-bound, so the UMA threshold logic does not apply — the
    // probe measures and decides either way.
    // The fused GPU block has no descriptor-aware Prism path: it would either
    // consume an unrotated activation or decline after inspecting the mixed
    // q2tp/q4tp tensors.  Do not let that structural refusal enter the FFN
    // probe's CPU_ONLY scope; the ordinary body below dispatches each matrix
    // through QTensor::matvec, which owns the signed FWHT + affine q2tp route.
    let prism_body = d.gate_proj.has_prism_contract()
        || d.up_proj.has_prism_contract()
        || d.down_proj.has_prism_contract();
    if !prism_body
        && crate::gpu::enabled_here()
        && (d.gate_proj.rows() >= crate::gpu::min_rows() || d.gate_proj.is_q1())
    {
        let arm = if d.gate_proj.is_q1() && crate::gpu::q1_force() {
            crate::gpu::ProbeArm::Gpu
        } else {
            crate::gpu::probe_arm(crate::gpu::OpClass::Ffn)
        };
        match arm {
            crate::gpu::ProbeArm::Gpu => {
                let t0 = std::time::Instant::now();
                if let Some(out) = dense_ffn_gpu(d, x, pool) {
                    crate::gpu::probe_record(crate::gpu::OpClass::Ffn, true, t0.elapsed());
                    return out;
                }
                // Declined: no timing exists, so say so. Silence here is
                // what left `ffn` undecided for 9000 calls and cost a
                // failed device attempt on half of them.
                crate::gpu::probe_note_decline(crate::gpu::OpClass::Ffn);
            }
            crate::gpu::ProbeArm::CpuTimed => {
                let t0 = std::time::Instant::now();
                let out = crate::gpu::cpu_scope(|| dense_ffn_cpu(d, x, pool));
                crate::gpu::probe_record(crate::gpu::OpClass::Ffn, false, t0.elapsed());
                return out;
            }
            crate::gpu::ProbeArm::Cpu => {
                return crate::gpu::cpu_scope(|| dense_ffn_cpu(d, x, pool));
            }
        }
    }
    dense_ffn_cpu(d, x, pool)
}

/// `g[i] = act.combine(g[i], u[i])`, spread over the pool from 8192
/// elements: elementwise, so the same bits as the serial loop. An exact
/// GELU is one `erf` an element — 1.3 M a layer for a 128-row chunk of
/// Spark-X2.6, 10 240 a decode step — and the main thread paid them alone
/// while the workers waited for the down projection.
fn combine_pooled(act: Act, g: &mut [f32], u: &[f32], pool: Option<&Pool>) {
    debug_assert_eq!(g.len(), u.len());
    match pool {
        Some(p) if g.len() >= 8192 => {
            let gp = crate::pool::SendMut::new(g.as_mut_ptr());
            p.run_rows(g.len(), &|start, end| {
                for i in start..end {
                    // SAFETY: each worker owns elements [start, end).
                    unsafe {
                        let v = gp.at(i);
                        *v = act.combine(*v, u[i]);
                    }
                }
            });
        }
        _ => {
            for (gv, &uv) in g.iter_mut().zip(u) {
                *gv = act.combine(*gv, uv);
            }
        }
    }
}

/// The pure-CPU dense-FFN body (also the fallback of every GPU refusal).
fn dense_ffn_cpu(d: &DenseFfn, x: &[f32], pool: Option<&Pool>) -> Vec<f32> {
    let inter = d.gate_proj.rows();
    FFN_SCRATCH.with(|s| {
        let mut s = s.borrow_mut();
        let [g, u, ..] = &mut *s;
        g.resize(inter, 0.0);
        // Fused gate+up+silu: one dispatch, no separate silu pass.
        // Falls back to matvec_many + silu loop for unsupported dtypes.
        if gate_topk() > 0 {
            // Gate first, select, and only then pay for `up`: the
            // measurement arm computes both and zeroes the losers, which
            // is the same arithmetic.
            u.resize(inter, 0.0);
            QTensor::matvec_many([&d.gate_proj, &d.up_proj], x, [g, u], pool);
            for i in 0..inter {
                g[i] = Act::Silu.combine(g[i], 1.0);
            }
            keep_top_k(g, gate_topk());
            for i in 0..inter {
                g[i] *= u[i];
            }
        } else if d.act == Act::Silu && {
            let _prof = crate::cpuprof::time(crate::cpuprof::Slot::FfnGateUp);
            QTensor::matvec_silu_mul(&d.gate_proj, &d.up_proj, x, g, pool)
        } {
            // g now holds silu(gate)·up directly.
        } else if d.act.clamp_limit() > 0.0 && {
            let _prof = crate::cpuprof::time(crate::cpuprof::Slot::FfnGateUp);
            QTensor::matvec_silu_mul_limited(&d.gate_proj, &d.up_proj, x, g, d.act.clamp_limit(), pool)
        } {
            // g holds silu(min(gate, limit))·clamp(up).
        } else {
            u.resize(inter, 0.0);
            // Multi-matrix job: gate+up under one pool dispatch.
            let _prof = crate::cpuprof::time(crate::cpuprof::Slot::FfnGateUp);
            QTensor::matvec_many([&d.gate_proj, &d.up_proj], x, [g, u], pool);
            let _c = crate::cpuprof::time(crate::cpuprof::Slot::FfnCombine);
            combine_pooled(d.act, &mut g[..inter], &u[..inter], pool);
        }
        // DTG-MA bake probe (Patent 2): accumulate this layer's
        // per-neuron activation mass while a probe pass is active.
        // `CMF_FFN_PROBE_TOPK=k` switches the statistic from mass to a
        // HIT COUNT — how many tokens rank the neuron in their own top
        // k. Mass asks "how loud is this neuron overall", the count
        // asks "how often does this task actually need it", and the two
        // rank neurons differently whenever a few tokens are loud.
        FFN_PROBE.with(|pr| {
            if let Some(acc) = pr.borrow_mut().as_mut() {
                let li = crate::gpu::cur_layer();
                if li >= 0 {
                    if let Some(row) = acc.get_mut(li as usize) {
                        match probe_topk() {
                            0 if probe_sq() => {
                                for (a, &v) in row.iter_mut().zip(g.iter()) {
                                    *a += (v as f64) * (v as f64);
                                }
                            }
                            0 if probe_signed() => {
                                for (a, &v) in row.iter_mut().zip(g.iter()) {
                                    *a += v as f64;
                                }
                            }
                            0 => {
                                for (a, &v) in row.iter_mut().zip(g.iter()) {
                                    *a += (v as f64).abs();
                                }
                            }
                            k => {
                                let n = g.len();
                                let k = k.min(n);
                                let mut mag: Vec<f32> = g.iter().map(|v| v.abs()).collect();
                                let (_, kth, _) = mag.select_nth_unstable_by(k - 1, |a, b| {
                                    b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal)
                                });
                                let thr = *kth;
                                for (a, &v) in row.iter_mut().zip(g.iter()) {
                                    if v.abs() >= thr {
                                        *a += 1.0;
                                    }
                                }
                            }
                        }
                    }
                }
            }
        });
        MOE_PROBE.with(|pr| {
            if let Some(pr) = pr.borrow_mut().as_mut()
                && let Some((e, w)) = pr.cur
            {
                let li = crate::gpu::cur_layer();
                if li >= 0
                    && let Some(row) = pr.acc.get_mut(li as usize)
                    && let Some(cell) = row.get_mut(e * pr.inter..(e + 1) * pr.inter)
                {
                    for (a, &v) in cell.iter_mut().zip(g.iter()) {
                        let s = (w * v) as f64;
                        *a += s * s;
                    }
                }
            }
        });
        if oracle_topk() > 0 {
            keep_top_k(g, oracle_topk());
        }
        {
            let li = crate::gpu::cur_layer();
            if li >= 0 {
                adump_row(li as usize, g);
            }
        }
        let mut out = attention::take_buf(d.down_proj.rows());
        let _prof = crate::cpuprof::time(crate::cpuprof::Slot::FfnDown);
        d.down_proj.matvec(g, &mut out, pool);
        out
    })
}

/// Online accumulators for the AWNP refit of a narrowed FFN.
///
/// The refit needs `Gss = A_SᵀA_S` and `YA = YᵀA_S` per layer, where `A_S`
/// are the calibration activations of the KEPT neurons and `Y` the full
/// FFN output. Both are small enough to hold; the thing that is not is
/// the activations they are built from — a 27B layer would dump a
/// gigabyte per thousand tokens. So they are accumulated as the
/// calibration runs and written once at the end.
///
/// `CMF_FFN_REFIT=<dir>` holds `support.<L>.u32` (a u32 count then the
/// kept indices) for every layer to accumulate; `CMF_FFN_REFIT_FROM/TO`
/// bound the layer span so the accumulators fit in RAM.
pub struct RefitAcc {
    pub support: Vec<u32>,
    pub gss: Vec<f32>,
    pub ya: Vec<f32>,
    pub hidden: usize,
    pub tokens: u64,
    /// Activations staged transposed ([ns, t] and [hidden, t]) until the
    /// batch is worth a GEMM. The product costs `ns²` to move and add
    /// REGARDLESS of how many tokens went into it, so folding 16 chunks
    /// into one call cuts that cost 16× — it was 15 TB of traffic per
    /// calibration pass at one call per 256 tokens.
    pub buf_g: Vec<f32>,
    pub buf_o: Vec<f32>,
    pub buf_t: usize,
}

/// The product buffer is SHARED across layers — one 473 MB allocation,
/// not one per layer (that was 30 GB of nothing on a 64-layer model).
/// It lives under the same lock as the accumulators.
type RefitState = (std::collections::HashMap<usize, RefitAcc>, Vec<f32>);

static REFIT: std::sync::OnceLock<Option<(String, std::sync::Mutex<RefitState>)>> =
    std::sync::OnceLock::new();

/// Is an FFN probe accumulator installed on this thread? The fused GPU
/// FFN must decline while one is, or the probe silently measures zero.
fn ffn_probe_active() -> bool {
    FFN_PROBE.with(|p| p.borrow().is_some())
}

fn refit_dir() -> Option<&'static (String, std::sync::Mutex<RefitState>)> {
    REFIT
        .get_or_init(|| {
            std::env::var("CMF_FFN_REFIT").ok().map(|d| {
                (
                    d,
                    std::sync::Mutex::new((std::collections::HashMap::new(), Vec::new())),
                )
            })
        })
        .as_ref()
}

/// Accumulate one prefill panel into the layer's refit statistics.
fn refit_accumulate(
    li: usize,
    g: &[f32],
    b: usize,
    inter: usize,
    out: &[f32],
    hidden: usize,
    pool: Option<&Pool>,
) {
    let Some((dir, map)) = refit_dir() else {
        return;
    };
    static SPAN: std::sync::OnceLock<(usize, usize)> = std::sync::OnceLock::new();
    let (from, to) = *SPAN.get_or_init(|| {
        let g = |k: &str, d: usize| {
            std::env::var(k)
                .ok()
                .and_then(|v| v.parse().ok())
                .unwrap_or(d)
        };
        (
            g("CMF_FFN_REFIT_FROM", 0),
            g("CMF_FFN_REFIT_TO", usize::MAX),
        )
    });
    if li < from || li > to {
        return;
    }
    let mut guard = map.lock().unwrap();
    let (map, shared) = &mut *guard;
    let acc = match map.entry(li) {
        std::collections::hash_map::Entry::Occupied(e) => e.into_mut(),
        std::collections::hash_map::Entry::Vacant(e) => {
            let path = format!("{dir}/support.{li}.u32");
            let Ok(bytes) = std::fs::read(&path) else {
                eprintln!("refit: no {path} — layer {li} skipped");
                return;
            };
            let n = u32::from_le_bytes(bytes[0..4].try_into().unwrap()) as usize;
            let support: Vec<u32> = bytes[4..4 + n * 4]
                .chunks_exact(4)
                .map(|c| u32::from_le_bytes([c[0], c[1], c[2], c[3]]))
                .collect();
            eprintln!(
                "refit: layer {li} support {n} ({:.0} MB of accumulator)",
                (n * n + hidden * n) as f64 * 4.0 / 1e6
            );
            e.insert(RefitAcc {
                gss: vec![0.0; n * n],
                ya: vec![0.0; hidden * n],
                buf_g: Vec::new(),
                buf_o: Vec::new(),
                buf_t: 0,
                support,
                hidden,
                tokens: 0,
            })
        }
    };
    let ns = acc.support.len();
    // Stage this chunk transposed; the GEMM fires once the batch is full.
    let cap = refit_batch();
    if acc.buf_g.is_empty() {
        acc.buf_g = vec![0.0; ns * cap];
        acc.buf_o = vec![0.0; hidden * cap];
    }
    let take = b.min(cap - acc.buf_t);
    for t in 0..take {
        let col = acc.buf_t + t;
        for (j, &n) in acc.support.iter().enumerate() {
            acc.buf_g[j * cap + col] = g[t * inter + n as usize];
        }
        for h in 0..hidden {
            acc.buf_o[h * cap + col] = out[t * hidden + h];
        }
    }
    acc.buf_t += take;
    acc.tokens += take as u64;
    if acc.buf_t < cap {
        return;
    }
    let bt = acc.buf_t;
    acc.buf_t = 0;
    // The GEMM WRITES its C (it zeroes the accumulators it uses), so the
    // chunk product lands in scratch and is added on — the one thing that
    // silently turns a Gram over 13 000 tokens into a Gram over 256.
    // Both products are `C[n, m] += X[n, b] · Yᵀ[b, m]` with X and Y
    // stored row-major [·, b] — exactly `gemm_nt_f32`'s shape, so the
    // card does them when it is up (this is the whole calibration's
    // cost: O(|S|²) per token, 2.9 PFLOP for a 27B pass). The tiled CPU
    // loop stays as the fallback. Neither accumulates, so the product
    // lands in scratch and is added on.
    let RefitAcc {
        gss,
        ya,
        buf_g,
        buf_o,
        ..
    } = acc;
    let need = (ns * ns).max(hidden * ns);
    if shared.len() < need {
        shared.resize(need, 0.0);
    }
    let scratch = &mut shared[..];
    let _ = bt;
    if crate::gpu::gemm_nt_f32_transient(buf_g, buf_g, &mut scratch[..ns * ns], ns, cap, ns) {
        add_into(gss, &scratch[..ns * ns], pool);
        if crate::gpu::gemm_nt_f32_transient(
            buf_o,
            buf_g,
            &mut scratch[..hidden * ns],
            hidden,
            cap,
            ns,
        ) {
            add_into(ya, &scratch[..hidden * ns], pool);
        } else {
            accum_outer_t(ya, hidden, ns, cap, buf_o, buf_g, pool);
        }
    } else {
        accum_outer_t(gss, ns, ns, cap, buf_g, buf_g, pool);
        accum_outer_t(ya, hidden, ns, cap, buf_o, buf_g, pool);
    }
    // No zeroing: the batch is always filled exactly (cap is a multiple
    // of the prefill chunk), and a memset of 178 MB a layer would cost
    // more than the GEMM.
}

/// `CMF_FFN_REFIT_BATCH` — tokens staged before each GEMM (default 4096).
fn refit_batch() -> usize {
    static B: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
    *B.get_or_init(|| {
        std::env::var("CMF_FFN_REFIT_BATCH")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(4096)
    })
}

/// `c[m, n] += Σ_t left[m, t]·right[n, t]` — both operands transposed,
/// the CPU fallback for the staged batch.
fn accum_outer_t(
    c: &mut [f32],
    m: usize,
    n: usize,
    b: usize,
    left: &[f32],
    right: &[f32],
    pool: Option<&Pool>,
) {
    let ptr = SendMut(c.as_mut_ptr());
    let body = |i: usize| {
        let ptr = &ptr;
        let row = unsafe { std::slice::from_raw_parts_mut(ptr.0.add(i * n), n) };
        for t in 0..b {
            let a = left[i * b + t];
            if a == 0.0 {
                continue;
            }
            for (j, o) in row.iter_mut().enumerate() {
                *o += a * right[j * b + t];
            }
        }
    };
    match pool {
        Some(p) if m > 1 => p.run_rows(m, &|s, e| {
            for i in s..e {
                body(i);
            }
        }),
        _ => {
            for i in 0..m {
                body(i);
            }
        }
    }
}

/// `dst += src`, spread over the pool — at 118 M floats a layer this is
/// not a loop to leave on one core.
fn add_into(dst: &mut [f32], src: &[f32], pool: Option<&Pool>) {
    let n = dst.len().min(src.len());
    match pool {
        Some(p) if n >= 1 << 16 => {
            let ptr = SendMut(dst.as_mut_ptr());
            let f = |s: usize, e: usize| {
                let ptr = &ptr;
                for blk in s..e {
                    let (a, b) = (blk * 4096, ((blk + 1) * 4096).min(n));
                    for i in a..b {
                        unsafe { *ptr.0.add(i) += src[i] };
                    }
                }
            };
            p.run_rows(n.div_ceil(4096), &f);
        }
        _ => {
            for (d, v) in dst.iter_mut().zip(&src[..n]) {
                *d += *v;
            }
        }
    }
}

/// `c[m, n] += Σ_t left[t, m]·right[t, n]`, with `left` stored [m, t] and
/// `right` [t, n]. Tiled over the rows of `c` so a tile stays in cache
/// while each token's `right` row streams past it once, and parallel
/// over tiles.
fn accum_outer(
    c: &mut [f32],
    m: usize,
    n: usize,
    b: usize,
    left: &[f32],
    right: &[f32],
    pool: Option<&Pool>,
) {
    const TILE: usize = 32;
    let tiles = m.div_ceil(TILE);
    let cp = SendMut(c.as_mut_ptr());
    let body = |ti: usize| {
        let cp = &cp;
        let i0 = ti * TILE;
        let i1 = (i0 + TILE).min(m);
        for t in 0..b {
            let r = &right[t * n..t * n + n];
            for i in i0..i1 {
                let a = left[i * b + t];
                if a == 0.0 {
                    continue;
                }
                // SAFETY: tiles partition c's rows; workers never overlap.
                let row = unsafe { std::slice::from_raw_parts_mut(cp.0.add(i * n), n) };
                for (o, v) in row.iter_mut().zip(r) {
                    *o += a * *v;
                }
            }
        }
    };
    match pool {
        Some(p) if tiles > 1 => p.run_rows(tiles, &|s, e| {
            for ti in s..e {
                body(ti);
            }
        }),
        _ => {
            for ti in 0..tiles {
                body(ti);
            }
        }
    }
}

/// Write what the calibration accumulated: `gss.<L>.f32` and `ya.<L>.f32`.
pub fn refit_flush() -> usize {
    let Some((dir, map)) = refit_dir() else {
        return 0;
    };
    let guard = map.lock().unwrap();
    let mut n = 0;
    for (li, acc) in guard.0.iter() {
        // A silently truncated write here is a Gram that reshapes to
        // nothing an hour later — say it out loud instead.
        let w = |name: &str, v: &[f32]| {
            let path = format!("{dir}/{name}.{li}.f32");
            let bytes: Vec<u8> = v.iter().flat_map(|x| x.to_le_bytes()).collect();
            match std::fs::write(&path, &bytes) {
                Ok(()) => {}
                Err(e) => eprintln!(
                    "refit: FAILED to write {path} ({} MB): {e}",
                    bytes.len() / 1_000_000
                ),
            }
        };
        w("gss", &acc.gss);
        w("ya", &acc.ya);
        println!(
            "refit L{li}: {} support, {} tokens, hidden {}",
            acc.support.len(),
            acc.tokens,
            acc.hidden
        );
        n += 1;
    }
    n
}

/// `CMF_FFN_ADUMP=<prefix>` — append every probed token's FFN activation
/// row to `<prefix>.<layer>.f16`. The co-activation record: which
/// neurons fire together, which is what a tube has to group if a token
/// is ever going to open one tube instead of sixteen.
fn adump_row(li: usize, g: &[f32]) {
    use std::io::Write as _;
    static FILES: std::sync::OnceLock<
        Option<(
            String,
            std::sync::Mutex<std::collections::HashMap<usize, std::fs::File>>,
        )>,
    > = std::sync::OnceLock::new();
    let Some((prefix, map)) = FILES
        .get_or_init(|| {
            std::env::var("CMF_FFN_ADUMP")
                .ok()
                .map(|p| (p, std::sync::Mutex::new(std::collections::HashMap::new())))
        })
        .as_ref()
    else {
        return;
    };
    // `CMF_FFN_ADUMP_FROM/_TO` narrow the dump to a layer span, so a big
    // calibration run fits on disk in a few passes instead of one.
    static SPAN: std::sync::OnceLock<(usize, usize)> = std::sync::OnceLock::new();
    let (from, to) = *SPAN.get_or_init(|| {
        let g = |k: &str, d: usize| {
            std::env::var(k)
                .ok()
                .and_then(|v| v.parse().ok())
                .unwrap_or(d)
        };
        (
            g("CMF_FFN_ADUMP_FROM", 0),
            g("CMF_FFN_ADUMP_TO", usize::MAX),
        )
    });
    if li < from || li > to {
        return;
    }
    let mut map = map.lock().unwrap();
    let f = map.entry(li).or_insert_with(|| {
        std::fs::File::create(format!("{prefix}.{li}.f16")).expect("adump file")
    });
    let mut bytes = Vec::with_capacity(g.len() * 2);
    for v in g {
        bytes.extend_from_slice(&cortiq_core::quant::f32_to_f16(*v).to_le_bytes());
    }
    let _ = f.write_all(&bytes);
}

/// `CMF_FFN_ORACLE_TOPK` — keep only the k largest |silu(g)·u| of each
/// token and zero the rest. Not a serving mode: it is the CEILING of
/// contextual sparsity — what a per-token router would be chasing —
/// measured by cheating, since the selection reads the very activations
/// it would have to predict.
fn oracle_topk() -> usize {
    if exact_mtp_calibration_active() {
        return 0;
    }
    static K: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
    *K.get_or_init(|| {
        std::env::var("CMF_FFN_ORACLE_TOPK")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(0)
    })
}

/// `CMF_FFN_GATE_TOPK` — the REALIZABLE cousin of the oracle: rank the
/// neurons by their gate alone (which the kernel has computed anyway
/// before it reads `up`), keep the k best, and drop the rest. Every
/// dropped neuron's `up` row and `down` column stay unread, so this is
/// the sparsity a serving path can actually take without a router.
fn gate_topk() -> usize {
    if exact_mtp_calibration_active() {
        return 0;
    }
    static K: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
    *K.get_or_init(|| {
        std::env::var("CMF_FFN_GATE_TOPK")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(0)
    })
}

/// `CMF_FFN_GATE_BLOCK` — select in blocks of B neurons instead of one
/// by one. A scattered per-neuron choice cannot be read efficiently (a
/// row at a time, no prefetch runway); a block of 32 is a contiguous
/// 32-row slab of `up` and of the transposed `down`, which the ordinary
/// kernels stream. The question the measurement answers is what the
/// block costs in quality.
fn gate_block() -> usize {
    static B: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
    *B.get_or_init(|| {
        std::env::var("CMF_FFN_GATE_BLOCK")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(1)
    })
}

/// Zero all but the `k` largest BLOCKS (by summed square) of a row.
fn keep_top_blocks(g: &mut [f32], keep_n: usize, block: usize) {
    let n = g.len();
    let nb = n.div_ceil(block);
    let kb = (keep_n.div_ceil(block)).clamp(1, nb);
    if kb >= nb {
        return;
    }
    let mut score: Vec<f32> = (0..nb)
        .map(|b| {
            g[b * block..((b + 1) * block).min(n)]
                .iter()
                .map(|v| v * v)
                .sum::<f32>()
        })
        .collect();
    let mut ord = score.clone();
    let (_, kth, _) = ord.select_nth_unstable_by(kb - 1, |a, b| {
        b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal)
    });
    let thr = *kth;
    for b in 0..nb {
        if score[b] < thr {
            g[b * block..((b + 1) * block).min(n)].fill(0.0);
        }
    }
    score.clear();
}

/// Zero all but the `k` largest magnitudes of one token's activation row.
fn keep_top_k(g: &mut [f32], k: usize) {
    if gate_block() > 1 {
        return keep_top_blocks(g, k, gate_block());
    }
    let n = g.len();
    if k == 0 || k >= n {
        return;
    }
    let mut mag: Vec<f32> = g.iter().map(|v| v.abs()).collect();
    let (_, kth, _) = mag.select_nth_unstable_by(k - 1, |a, b| {
        b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal)
    });
    let thr = *kth;
    for v in g.iter_mut() {
        if v.abs() < thr {
            *v = 0.0;
        }
    }
}

/// `CMF_FFN_PROBE_SQ` — accumulate Σa², so the dump divided by the token
/// count and square-rooted is the RMS activation trace Patent 12 weights
/// its matrices by.
fn probe_sq() -> bool {
    static S: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    *S.get_or_init(|| std::env::var("CMF_FFN_PROBE_SQ").is_ok())
}

/// `CMF_FFN_PROBE_SIGNED` — accumulate the SIGNED activation sum
/// instead of its magnitude: what a dropped neuron contributes ON
/// AVERAGE, which is the bias a narrowed FFN can add back for free.
fn probe_signed() -> bool {
    static S: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    *S.get_or_init(|| std::env::var("CMF_FFN_PROBE_SIGNED").is_ok())
}

/// `CMF_FFN_MEANFILL=<file>` — a masked-out neuron contributes its MEAN
/// activation instead of zero (`u32 layers, u32 inter, f32[…]`, the mass
/// dump layout, holding per-neuron means). Dropping a neuron outright
/// also drops its average contribution, which shifts the layer output by
/// a constant; filling the mean back is one add per layer and costs no
/// bytes off the bus. This is the measurement arm — in a tube file the
/// same correction ships as a per-task bias vector.
fn meanfill() -> Option<&'static (usize, Vec<f32>)> {
    static M: std::sync::OnceLock<Option<(usize, Vec<f32>)>> = std::sync::OnceLock::new();
    M.get_or_init(|| {
        let p = std::env::var("CMF_FFN_MEANFILL").ok()?;
        let b = std::fs::read(&p).ok()?;
        let inter = u32::from_le_bytes(b[4..8].try_into().ok()?) as usize;
        let vals: Vec<f32> = b[8..]
            .chunks_exact(4)
            .map(|c| f32::from_le_bytes([c[0], c[1], c[2], c[3]]))
            .collect();
        eprintln!("meanfill: {} value(s), inter {inter}", vals.len());
        Some((inter, vals))
    })
    .as_ref()
}

/// `CMF_FFN_PROBE_TOPK` — 0 (default) = accumulate mass, k>0 = count
/// how often a neuron lands in a token's top k.
fn probe_topk() -> usize {
    static K: std::sync::OnceLock<usize> = std::sync::OnceLock::new();
    *K.get_or_init(|| {
        std::env::var("CMF_FFN_PROBE_TOPK")
            .ok()
            .and_then(|v| v.parse().ok())
            .unwrap_or(0)
    })
}

thread_local! {
    /// DTG-MA activation probe: per-layer per-neuron Σ|silu(g)·u|
    /// accumulator, alive only during `Pipeline::probe_ffn_mass`.
    static FFN_PROBE: std::cell::RefCell<Option<Vec<Vec<f64>>>> =
        const { std::cell::RefCell::new(None) };
}

/// Hot-neuron probe of a MoE layer's routed experts (`cortiq hot-probe --experts`):
/// per layer, per expert and neuron, Σ (w·act)² over the tokens the router sent
/// there, `w` the expert's final weight — what the neuron's down column sees.
pub(crate) struct MoeProbe {
    /// `[layer][expert · inter + neuron]`; a layer without experts keeps an empty row.
    acc: Vec<Vec<f64>>,
    inter: usize,
    /// The routed expert `dense_ffn` is running for, and its weight; `None`
    /// outside the routed loop (the shared expert is not probed).
    cur: Option<(usize, f32)>,
}

thread_local! {
    /// Alive only during `Pipeline::probe_moe_mass`.
    static MOE_PROBE: std::cell::RefCell<Option<MoeProbe>> = const { std::cell::RefCell::new(None) };
}

fn moe_probe_active() -> bool {
    MOE_PROBE.with(|p| p.borrow().is_some())
}

/// Per-token structured sparsity, paid for in bytes.
///
/// The gate is the cheapest third of an FFN and it already says which
/// neurons matter: `silu(gate)` near zero means the neuron contributes
/// nothing whatever `up` says. So compute every gate, keep the `k`
/// loudest, and read ONLY those neurons' `up` rows and `down` rows —
/// the latter needs `down_proj` stored transposed, otherwise a neuron's
/// down weights are a strided column and "reading only those" costs a
/// full cache line each.
///
/// Returns `None` when the file has no transposed `down` (the caller
/// then runs the ordinary dense path).
fn dense_ffn_dynamic(d: &DenseFfn, x: &[f32], pool: Option<&Pool>, k: usize) -> Option<Vec<f32>> {
    // The scatter path reads individual rows/columns and cannot express the
    // per-matrix signed FWHT boundary.  Let the descriptor-aware dense path
    // handle Prism files rather than silently running an unrotated sparse
    // approximation.
    if d.gate_proj.has_prism_contract()
        || d.up_proj.has_prism_contract()
        || d.down_proj.has_prism_contract()
    {
        return None;
    }
    let dt = d.down_t.as_ref()?;
    let inter = d.gate_proj.rows();
    let hidden = dt.cols();
    if k == 0 || k >= inter || d.act != Act::Silu {
        return None;
    }
    DYN_SCRATCH.with(|sc| {
        let mut sc = sc.borrow_mut();
        let DynScratch {
            g,
            mag,
            live,
            parts,
        } = &mut *sc;
        g.resize(inter, 0.0);
        d.gate_proj.matvec(x, g, pool);
        for v in g.iter_mut() {
            *v = inference::silu(*v);
        }
        // The k-th largest |silu(gate)| is the threshold; ties keep more,
        // which is the safe side.
        mag.clear();
        mag.extend(g.iter().map(|v| v.abs()));
        let (_, kth, _) = mag.select_nth_unstable_by(k - 1, |a, b| {
            b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal)
        });
        let thr = *kth;
        live.clear();
        live.extend((0..inter as u32).filter(|&n| g[n as usize].abs() >= thr));
        let mut out = vec![0.0f32; hidden];
        match pool {
            Some(p) if live.len() >= 64 => {
                let nw = p.n_workers() + 1;
                parts.clear();
                parts.resize(nw * hidden, 0.0);
                let ptr = SendMut(parts.as_mut_ptr());
                let n = live.len();
                let live_ref: &[u32] = live;
                let g_ref: &[f32] = g;
                p.run(&|w, workers| {
                    let chunk = n.div_ceil(workers);
                    let (s, e) = (w * chunk, ((w + 1) * chunk).min(n));
                    if s >= e {
                        return;
                    }
                    WORKER_SCRATCH.with(|ws| {
                        let mut ws = ws.borrow_mut();
                        let [scratch, acc] = &mut *ws;
                        scratch.resize(hidden.max(x.len()), 0.0);
                        acc.clear();
                        acc.resize(hidden, 0.0);
                        for (o, &nrm) in live_ref[s..e].iter().enumerate() {
                            // One neuron of runway: the next row's lines
                            // start moving while this one is multiplied.
                            if let Some(&nx) = live_ref[s..e].get(o + 1) {
                                d.up_proj.prefetch_row(nx as usize);
                                dt.prefetch_row(nx as usize);
                            }
                            let idx = nrm as usize;
                            let up = d.up_proj.row_dot(idx, x, scratch);
                            let a = g_ref[idx] * up;
                            if a != 0.0 {
                                dt.add_row_scaled(idx, a, acc, scratch);
                            }
                        }
                        for (j, v) in acc.iter().enumerate() {
                            unsafe { *ptr.at(w * hidden + j) = *v };
                        }
                    });
                });
                for w in 0..nw {
                    for (j, o) in out.iter_mut().enumerate() {
                        *o += parts[w * hidden + j];
                    }
                }
            }
            _ => {
                WORKER_SCRATCH.with(|ws| {
                    let mut ws = ws.borrow_mut();
                    let [scratch, _acc] = &mut *ws;
                    scratch.resize(hidden.max(x.len()), 0.0);
                    for &nrm in live.iter() {
                        let idx = nrm as usize;
                        let up = d.up_proj.row_dot(idx, x, scratch);
                        let a = g[idx] * up;
                        if a != 0.0 {
                            dt.add_row_scaled(idx, a, &mut out, scratch);
                        }
                    }
                });
            }
        }
        Some(out)
    })
}

/// Caller-side scratch of the dynamic path — one allocation per thread,
/// not one per layer per token (that alone cost a third of the decode).
struct DynScratch {
    g: Vec<f32>,
    mag: Vec<f32>,
    live: Vec<u32>,
    parts: Vec<f32>,
}

thread_local! {
    static DYN_SCRATCH: std::cell::RefCell<DynScratch> = const {
        std::cell::RefCell::new(DynScratch {
            g: Vec::new(),
            mag: Vec::new(),
            live: Vec::new(),
            parts: Vec::new(),
        })
    };
    /// Pool-worker scratch: the row buffer and this worker's partial sum.
    static WORKER_SCRATCH: std::cell::RefCell<[Vec<f32>; 2]> =
        const { std::cell::RefCell::new([Vec::new(), Vec::new()]) };
}

/// `dense_ffn_cpu` with a per-visit mask landing on the activations —
/// the masked-inference fast path's decode arm. Full fused quant
/// compute, closed neurons zeroed before down: arithmetically the
/// pruned network, no dequant, no weight bytes touched.
fn dense_ffn_masked(d: &DenseFfn, x: &[f32], pool: Option<&Pool>, mask_row: &[u8]) -> Vec<f32> {
    let inter = d.gate_proj.rows();
    FFN_SCRATCH.with(|s| {
        let mut s = s.borrow_mut();
        let [g, u, ..] = &mut *s;
        g.resize(inter, 0.0);
        if d.act == Act::Silu && QTensor::matvec_silu_mul(&d.gate_proj, &d.up_proj, x, g, pool) {
            // g holds silu(gate)·up.
        } else {
            u.resize(inter, 0.0);
            QTensor::matvec_many([&d.gate_proj, &d.up_proj], x, [g, u], pool);
            for i in 0..inter {
                g[i] = d.act.combine(g[i], u[i]);
            }
        }
        zero_masked_cols(g, 1, inter, mask_row);
        let mut out = attention::take_buf(d.down_proj.rows());
        d.down_proj.matvec(g, &mut out, pool);
        out
    })
}

/// Dense FFN as one GPU submission via the MoE block path (single
/// expert, weight 1.0): gate → silu·up → down chained in one command
/// buffer, intermediate activations device-resident. None → weights
/// not q8-mapped in the primary shard / over the VRAM budget / backend
/// refusal → honest CPU path.
fn dense_ffn_gpu(d: &DenseFfn, x: &[f32], _pool: Option<&Pool>) -> Option<Vec<f32>> {
    if d.gate_proj.has_prism_contract()
        || d.up_proj.has_prism_contract()
        || d.down_proj.has_prism_contract()
    {
        return None;
    }
    // The GPU block applies the standard graph activations plus the exact
    // MiniMax-M3 OAI contract; any other activation stays on the CPU.
    d.act.moe_job_graph_contract()?;
    // Threshold: tiny FFNs are not worth a submission (q1 excepted —
    // see the caller's gate).
    if d.gate_proj.rows() < crate::gpu::min_rows() && !d.gate_proj.is_q1() {
        return None;
    }
    let mut jobs: Vec<crate::gpu::MoeJob> = Vec::with_capacity(1);
    let mut model_ref = None;
    moe_push_job(d, x, 1.0, &mut jobs, &mut model_ref)?;
    let model = model_ref?;
    let hidden = jobs[0].down.1;
    let mut out = attention::take_buf(hidden);
    if crate::gpu::moe_block(&model, &jobs, &mut out) {
        Some(out)
    } else {
        let mut out = out;
        attention::recycle_buf(&mut out);
        None
    }
}

/// q8-mapped primary-shard tensor parts for a GPU job: q8_2f carries
/// its column field, q8_row runs with empty col slices (the backend
/// skips the multiply). Shared by the MoE block and the dense-FFN
/// single-job path.
#[allow(clippy::type_complexity)]
#[allow(clippy::type_complexity)]
pub(crate) fn moe_parts(
    t: &QTensor,
) -> Option<(
    &std::sync::Arc<cortiq_core::CmfModel>,
    usize,
    usize,
    usize,
    &[f32],
    &[f32],
    bool,
    bool,
    bool,
)> {
    match t {
        QTensor::Mapped {
            model,
            idx,
            dtype: dt @ (cortiq_core::TensorDtype::Q8_2f | cortiq_core::TensorDtype::Q8Row),
            rows,
            cols,
            row_scale,
            col_field,
            ..
        } if (*dt == cortiq_core::TensorDtype::Q8Row) || !col_field.is_empty() => Some((
            model, *idx, *rows, *cols, row_scale, col_field, false, false, false,
        )),
        // q1: tile-embedded scales — empty rs/col slices, raw xs.
        QTensor::Mapped {
            model,
            idx,
            dtype: cortiq_core::TensorDtype::Q1,
            rows,
            cols,
            ..
        } => Some((
            model,
            *idx,
            *rows,
            *cols,
            &[][..],
            &[][..],
            true,
            false,
            false,
        )),
        // q4_tiled: 18-byte tiles with embedded f16 scales — raw xs.
        QTensor::Mapped {
            model,
            idx,
            dtype: cortiq_core::TensorDtype::Q4Tiled,
            rows,
            cols,
            ..
        } => Some((
            model,
            *idx,
            *rows,
            *cols,
            &[][..],
            &[][..],
            false,
            true,
            false,
        )),
        // q4tp: same raw-xs contract, different stride and scale plane.
        QTensor::Mapped {
            model,
            idx,
            dtype: cortiq_core::TensorDtype::Q4TiledP,
            rows,
            cols,
            ..
        } => Some((
            model,
            *idx,
            *rows,
            *cols,
            &[][..],
            &[][..],
            false,
            true,
            false,
        )),
        // q2tp: the 2-bit expert plane of the mixed profile — q4 family
        // for stride bookkeeping, flagged q2 so the trio validation can
        // demand a q4tp down.
        QTensor::Mapped {
            model,
            idx,
            dtype: cortiq_core::TensorDtype::Q2TiledP,
            rows,
            cols,
            ..
        } => Some((
            model,
            *idx,
            *rows,
            *cols,
            &[][..],
            &[][..],
            false,
            true,
            true,
        )),
        _ => None,
    }
}

/// The routed experts of a MoE layer as the Metal chunk prefill takes
/// them: f32 router rows and every expert's q4tp (gate, up, down) tensor
/// indices, uniform SiLU shapes. Only the plain routed form — no shared
/// expert, no per-expert scale, no resonance or τ router, no router input
/// norm; the batched host walk keeps the rest. The routing itself stays the
/// host's (`moe_route`), so mask and selection bias need nothing here.
#[cfg(target_os = "macos")]
#[allow(clippy::type_complexity)]
fn chunk_moe_parts(
    m: &MoeFfn,
    hidden: usize,
) -> Option<(&[f32], Vec<(usize, usize, usize)>, bool)> {
    // Only a shared expert of its own width, without a gate: it adds to the
    // routed mix (`ChunkMoe::detached`).
    if m.shared.as_ref().is_some_and(|(s, g)| {
        g.is_some()
            || m.experts.is_empty()
            || s.gate_proj.rows() == m.experts[0].gate_proj.rows()
            || !(s.gate_proj.q8_2f_parts().is_some() || s.gate_proj.q4tp_parts().is_some())
            || !(s.up_proj.q8_2f_parts().is_some() || s.up_proj.q4tp_parts().is_some())
            || !(s.down_proj.q8_2f_parts().is_some() || s.down_proj.q4tp_parts().is_some())
    }) || m.per_expert_scale.is_some()
        || m.resonance.is_some()
        || m.route_tau.is_some()
        || m.router_input_norm
        || m.experts.is_empty()
        || m.top_k == 0
        || std::env::var("CMF_RMS_TRACE").is_ok()
        || std::env::var("CMF_ACT_DUMP").is_ok()
        || std::env::var("CMF_METAL_MOE_PREFILL").as_deref() == Ok("0")
    {
        return None;
    }
    let (rf, rr, rc) = m.router.f32_parts()?;
    if rr != m.experts.len() || rc != hidden {
        return None;
    }
    let inter = m.experts[0].gate_proj.rows();
    // All-q8_2f experts (Mellum2.1 q8_2f) ride the `moe_q8` GEMMs;
    // `CMF_METAL_MOE_Q8=0` keeps them on the host walk.
    let q8 = crate::gpu_metal::moe_q8::enabled() && m.experts[0].gate_proj.q8_2f_parts().is_some();
    let experts = m
        .experts
        .iter()
        .map(|e| {
            if e.act != Act::Silu
                || !e.segs.is_empty()
                || e.gate_proj.rows() != inter
                || e.up_proj.rows() != inter
                || e.down_proj.cols() != inter
                || e.gate_proj.cols() != hidden
                || e.down_proj.rows() != hidden
            {
                return None;
            }
            if q8 {
                let q8i = |t: &QTensor| t.q8_2f_parts().map(|p| p.0);
                return Some((q8i(&e.gate_proj)?, q8i(&e.up_proj)?, q8i(&e.down_proj)?));
            }
            Some((
                e.gate_proj.mapped_q4tp()?.1,
                e.up_proj.mapped_q4tp()?.1,
                e.down_proj.mapped_q4tp()?.1,
            ))
        })
        .collect::<Option<Vec<_>>>()?;
    Some((rf, experts, q8))
}

/// Map a MoE onto the Metal token graph's contract: f32 router, a
/// shared expert (gated — Qwen — or ungated at weight 1 — DeepSeek-V3 /
/// HunYuan hy_v3), softmax or sigmoid scores with an optional selection
/// bias and routed scale, experts uniformly q4tp (or the mixed profile:
/// q2tp gate/up over a q4tp down). τ routers, masks, per-expert scales
/// and Gemma's router-input norm refuse here — those semantics stay on
/// the CPU path.
/// Map Flint's released ragged MoE into the native page graph.  This stays
/// separate from `metal_moe_graph_parts`: its six routed slots are Q2TP and
/// 512-wide, while its ungated shared SwiGLU is Q4TP and 1024-wide.  Feeding
/// the shared tuple into the uniform jobs descriptor would make the shader
/// use the routed stride on a different payload.
#[cfg(target_os = "macos")]
fn metal_flint_moe_graph_parts(
    m: &MoeFfn,
    hidden: usize,
    scratch_key: usize,
) -> Option<crate::gpu::GpuFlintMoe<'_>> {
    use std::sync::Arc;

    const HIDDEN: usize = 2_048;
    const ROUTED_INTER: usize = 512;
    const SHARED_INTER: usize = 1_024;
    const EXPERTS: usize = 256;
    const TOP_K: usize = 6;

    if hidden != HIDDEN || !strict_flint_metal_pager_candidate(m) {
        return None;
    }
    let routed0 = m.experts.first()?;
    let (model, _) = routed0.gate_proj.mapped_q2tp()?;
    let (router, router_rows, router_cols) = m.router.f32_parts()?;
    if router_rows != EXPERTS || router_cols != HIDDEN {
        return None;
    }
    if m.expert_bias.as_ref().is_some_and(|b| b.len() != EXPERTS) {
        return None;
    }
    let same_q2 = |t: &QTensor| -> Option<usize> {
        let (owner, idx) = t.mapped_q2tp()?;
        Arc::ptr_eq(&owner, &model).then_some(idx)
    };
    let same_q4 = |t: &QTensor| -> Option<usize> {
        let (owner, idx) = t.mapped_q4tp()?;
        Arc::ptr_eq(&owner, &model).then_some(idx)
    };
    let routed = |e: &DenseFfn| -> Option<(usize, usize, usize)> {
        if e.act != Act::Silu
            || !e.segs.is_empty()
            || e.gate_proj.rows() != ROUTED_INTER
            || e.gate_proj.cols() != HIDDEN
            || e.up_proj.rows() != ROUTED_INTER
            || e.up_proj.cols() != HIDDEN
            || e.down_proj.rows() != HIDDEN
            || e.down_proj.cols() != ROUTED_INTER
        {
            return None;
        }
        Some((
            same_q2(&e.gate_proj)?,
            same_q2(&e.up_proj)?,
            same_q4(&e.down_proj)?,
        ))
    };
    let shared = |e: &DenseFfn| -> Option<(usize, usize, usize)> {
        if e.act != Act::Silu
            || !e.segs.is_empty()
            || e.gate_proj.rows() != SHARED_INTER
            || e.gate_proj.cols() != HIDDEN
            || e.up_proj.rows() != SHARED_INTER
            || e.up_proj.cols() != HIDDEN
            || e.down_proj.rows() != HIDDEN
            || e.down_proj.cols() != SHARED_INTER
        {
            return None;
        }
        Some((
            same_q4(&e.gate_proj)?,
            same_q4(&e.up_proj)?,
            same_q4(&e.down_proj)?,
        ))
    };
    let experts = m.experts.iter().map(routed).collect::<Option<Vec<_>>>()?;
    if experts.len() != EXPERTS {
        return None;
    }
    let (shared_ffn, shared_gate) = m.shared.as_ref()?;
    if shared_gate.is_some() {
        return None;
    }
    Some(crate::gpu::GpuFlintMoe {
        router,
        bias: m.expert_bias.as_deref(),
        experts,
        scratch_key,
        shared: shared(shared_ffn)?,
        top_k: m.top_k,
        norm_topk: m.norm_topk_prob,
        route_scale: m.routed_scaling,
        sigmoid: m.router_sigmoid,
        sigmoid_denom_eps: m.sigmoid_denom_eps,
    })
}

#[cfg(target_os = "macos")]
fn metal_moe_graph_parts(m: &MoeFfn, hidden: usize) -> Option<crate::gpu::GpuMoe<'_>> {
    if m.router_input_norm
        || m.route_tau.is_some()
        || m.mask.is_some()
        || m.per_expert_scale.is_some()
        || m.experts.is_empty()
        || m.top_k == 0
        || m.resonance.is_some()
    {
        return None;
    }
    // An ungated shared expert of its own width stays out of the jobs ladder:
    // it runs after the routed mix (`GpuMoe::detached`).
    let detached = m.shared.as_ref().filter(|(s, g)| {
        g.is_none() && !m.router_sigmoid && s.gate_proj.rows() != m.experts[0].gate_proj.rows()
    });
    // Without a shared expert the select kernel fills the k routed jobs
    // only (flag 32). Measured on Mellum2.1's softmax router; the sigmoid /
    // biased routers without one (LFM2-MoE) keep the CPU path until they
    // are measured too.
    let (sh, sg) = match &m.shared {
        Some((sh, sg)) if detached.is_none() => (Some(sh), sg.as_ref()),
        _ if !m.router_sigmoid && m.expert_bias.is_none() => (None, None),
        _ => return None,
    };
    let (rf, rr, rc) = m.router.f32_parts()?;
    if rr != m.experts.len() || rc != hidden {
        return None;
    }
    let shared_gated = sg.is_some();
    let sf = match sg {
        Some(sg) => {
            let (sf, sr, sc) = sg.f32_parts()?;
            if sr * sc != hidden {
                return None;
            }
            sf
        }
        // Ungated: the router's first row stands in for the gate matvec
        // (its logit is never read — the kernel pins weight 1).
        None => &rf[..hidden],
    };
    if let Some(b) = &m.expert_bias {
        if b.len() != m.experts.len() {
            return None;
        }
    }
    let inter = m.experts[0].gate_proj.rows();
    // The first expert's gate decides the profile; every trio (shared
    // included) must agree — the jobs ladder flips ONE kernel for all.
    let gu_q2 = m.experts[0].gate_proj.mapped_q2tp().is_some();
    // All-q8_2f routed experts (Mellum2.1 q8_2f: no shared expert, the
    // contract they were measured on) take the `moe_q8` kernels;
    // `CMF_METAL_MOE_Q8=0` keeps them off the graph (per-op path).
    let q8 = crate::gpu_metal::moe_q8::enabled()
        && (m.shared.is_none() || detached.is_some())
        && m.experts[0].gate_proj.q8_2f_parts().is_some();
    let trio = |e: &DenseFfn| -> Option<(usize, usize, usize)> {
        if e.act != Act::Silu
            || e.gate_proj.rows() != inter
            || e.gate_proj.cols() != hidden
            || e.up_proj.rows() != inter
            || e.up_proj.cols() != hidden
            || e.down_proj.rows() != hidden
            || e.down_proj.cols() != inter
        {
            return None;
        }
        if q8 {
            let q8i = |t: &QTensor| t.q8_2f_parts().map(|p| p.0);
            return Some((q8i(&e.gate_proj)?, q8i(&e.up_proj)?, q8i(&e.down_proj)?));
        }
        let pick = |t: &QTensor| -> Option<usize> {
            if gu_q2 {
                t.mapped_q2tp().map(|(_, i)| i)
            } else {
                t.mapped_q4tp().map(|(_, i)| i)
            }
        };
        Some((
            pick(&e.gate_proj)?,
            pick(&e.up_proj)?,
            e.down_proj.mapped_q4tp().map(|(_, i)| i)?,
        ))
    };
    let experts = m.experts.iter().map(trio).collect::<Option<Vec<_>>>()?;
    let shared = match sh {
        Some(sh) => Some(trio(sh)?),
        None => None,
    };
    let detached = match detached {
        Some((s, _)) => Some([
            s.gate_proj.metal_graph_parts()?,
            s.up_proj.metal_graph_parts()?,
            s.down_proj.metal_graph_parts()?,
        ]),
        None => None,
    };
    Some(crate::gpu::GpuMoe {
        router: rf,
        sgate: sf,
        experts,
        shared,
        n_exp: m.experts.len(),
        top_k: m.top_k,
        inter,
        norm_topk: m.norm_topk_prob,
        route_scale: m.routed_scaling,
        gu_q2,
        q8,
        sigmoid: m.router_sigmoid,
        sigmoid_denom_eps: m.sigmoid_denom_eps,
        bias: m.expert_bias.as_deref(),
        shared_gated,
        detached,
    })
}

/// `CMF_FORCE_IDS=<file>` (diagnostics): decode step n commits the n-th
/// whitespace-separated token id of the file instead of sampling, while the
/// logits are still computed (and dumped by `CMF_LOGIT_DUMP_ALL`) — one
/// backend teacher-forced along another's greedy sequence, so top-1
/// agreement can be counted past a near-tie divergence.
fn forced_ids_at(step: usize) -> Option<u32> {
    static IDS: std::sync::OnceLock<Vec<u32>> = std::sync::OnceLock::new();
    IDS.get_or_init(|| {
        std::env::var("CMF_FORCE_IDS")
            .ok()
            .and_then(|p| std::fs::read_to_string(p).ok())
            .map(|s| {
                s.split_whitespace()
                    .filter_map(|t| t.parse().ok())
                    .collect()
            })
            .unwrap_or_default()
    })
    .get(step)
    .copied()
}

/// Build one gate/up/down GPU job from three tensors. `moe_push_job` is the
/// DenseFfn-shaped caller; architectures that keep their experts in their own
/// structs (DeepSeek-V4) come here directly.
pub(crate) fn moe_push_job_parts<'a>(
    gate: &'a QTensor,
    up: &'a QTensor,
    down: &'a QTensor,
    x: &[f32],
    w: f32,
    swiglu_limit: f32,
    jobs: &mut Vec<crate::gpu::MoeJob<'a>>,
    model_ref: &mut Option<std::sync::Arc<cortiq_core::CmfModel>>,
) -> Option<()> {
    use crate::qtensor::prescale;
    let (gm, gi, gr, gc, grs, gcf, gq1, gq4, gq2) = moe_parts(gate)?;
    let (_, ui, ur, uc, urs, ucf, uq1, uq4, uq2) = moe_parts(up)?;
    let (_, di, dr, dc, drs, dcf, dq1, dq4, dq2) = moe_parts(down)?;
    if gq1 != uq1 || uq1 != dq1 || gq4 != uq4 || uq4 != dq4 || gq2 != uq2 {
        return None; // mixed-dtype trio — honest CPU path
    }
    // The 2-bit profile is gate/up q2tp over a PLAIN q4tp down; any other
    // 2-bit arrangement stays on the CPU.
    if gq2 && (dq2 || !dq4 || down.mapped_q4tp().is_none()) {
        return None;
    }
    if !gq2 && dq2 {
        return None;
    }
    model_ref.get_or_insert_with(|| gm.clone());
    let dt = |cf: &[f32]| {
        if cf.is_empty() {
            cortiq_core::TensorDtype::Q8Row
        } else {
            cortiq_core::TensorDtype::Q8_2f
        }
    };
    jobs.push(crate::gpu::MoeJob {
        gate: (gi, gr, gc, grs),
        up: (ui, ur, uc, urs),
        down: (di, dr, dc, drs),
        xs_gate: prescale(x, gcf, dt(gcf)).into_owned(),
        xs_up: prescale(x, ucf, dt(ucf)).into_owned(),
        down_col: dcf,
        w,
        q1: gq1,
        q4t: gq4 && !gq2 && gate.mapped_q4tp().is_none(),
        q4tp: gq4 && (gq2 || gate.mapped_q4tp().is_some()),
        gu_q2: gq2,
        swiglu_limit,
        act: 0,
    });
    Some(())
}

/// Build one gate/up/down GPU job (see `moe_parts`).
fn moe_push_job<'a>(
    d: &'a DenseFfn,
    x: &[f32],
    w: f32,
    jobs: &mut Vec<crate::gpu::MoeJob<'a>>,
    model_ref: &mut Option<std::sync::Arc<cortiq_core::CmfModel>>,
) -> Option<()> {
    use crate::qtensor::prescale;
    // The block's act(gate)·up pass takes an exact device contract.  For
    // ordinary SiLU/GELU this is a zero clamp; MiniMax M3 contributes its
    // dedicated OAI marker and frozen 7.0 source limit.  Anything without a
    // device contract stays on the CPU.
    let (graph_act, swiglu_limit) = d.act.moe_job_graph_contract()?;
    let act = graph_act.code();
    let (gm, gi, gr, gc, grs, gcf, gq1, gq4, gq2) = moe_parts(&d.gate_proj)?;
    let (_, ui, ur, uc, urs, ucf, uq1, uq4, uq2) = moe_parts(&d.up_proj)?;
    let (_, di, dr, dc, drs, dcf, dq1, dq4, dq2) = moe_parts(&d.down_proj)?;
    if gq1 != uq1 || uq1 != dq1 || gq4 != uq4 || uq4 != dq4 || gq2 != uq2 {
        return None; // mixed-dtype trio — honest CPU path
    }
    if gq2 && (dq2 || !dq4 || d.down_proj.mapped_q4tp().is_none()) {
        return None;
    }
    if !gq2 && dq2 {
        return None;
    }
    model_ref.get_or_insert_with(|| gm.clone());
    let gdt = if gcf.is_empty() {
        cortiq_core::TensorDtype::Q8Row
    } else {
        cortiq_core::TensorDtype::Q8_2f
    };
    let udt = if ucf.is_empty() {
        cortiq_core::TensorDtype::Q8Row
    } else {
        cortiq_core::TensorDtype::Q8_2f
    };
    jobs.push(crate::gpu::MoeJob {
        gate: (gi, gr, gc, grs),
        up: (ui, ur, uc, urs),
        down: (di, dr, dc, drs),
        xs_gate: prescale(x, gcf, gdt).into_owned(),
        xs_up: prescale(x, ucf, udt).into_owned(),
        down_col: dcf,
        w,
        q1: gq1,
        q4t: gq4 && !gq2 && d.gate_proj.mapped_q4tp().is_none(),
        q4tp: gq4 && (gq2 || d.gate_proj.mapped_q4tp().is_some()),
        gu_q2: gq2,
        swiglu_limit,
        act,
    });
    Some(())
}

/// Sparse dense-FFN directly on QUANTIZED weights (mask × mmap): reads
/// ONLY the active neurons' gate/up rows and down columns from the mmap
/// — no full-matrix dequant, no f32 model copy. This is what lets a
/// masked big model run at quantized RSS (the historical mask path
/// forced the whole model to f32). Semantics identical to the f32
/// sparse path within quant tolerance.
fn sparse_ffn_quant(
    d: &DenseFfn,
    x: &[f32],
    active: &[u16],
    hidden: usize,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let n = active.len();
    let inter = d.gate_proj.rows();
    let mut act = vec![0.0f32; n];
    // Scratch is needed if EITHER projection is group-packed (q4/vbit);
    // gate/up normally share a dtype but sizing on both is robust.
    let need_scratch = !(d.gate_proj.sparse_col_ok() && d.up_proj.sparse_col_ok());
    let compute = |ai: usize| -> f32 {
        let idx = active[ai] as usize;
        if idx >= inter {
            return 0.0; // defensive parity with the f32 sparse path
        }
        let mut s = if need_scratch {
            vec![0.0f32; hidden]
        } else {
            Vec::new()
        };
        let gate = d.gate_proj.row_dot(idx, x, &mut s);
        let up = d.up_proj.row_dot(idx, x, &mut s);
        d.act.combine(gate, up)
    };
    match pool {
        Some(p) if n >= 256 => {
            let ptr = SendMut(act.as_mut_ptr());
            p.run(&|widx, nw| {
                let chunk = n.div_ceil(nw);
                let (s, e) = (widx * chunk, ((widx + 1) * chunk).min(n));
                for ai in s..e {
                    unsafe { *ptr.at(ai) = compute(ai) };
                }
            });
        }
        _ => {
            for (ai, a) in act.iter_mut().enumerate() {
                *a = compute(ai);
            }
        }
    }
    // Scatter through active down columns (reads only those columns).
    let mut out = vec![0.0f32; hidden];
    for (ai, &idx) in active.iter().enumerate() {
        let w = act[ai];
        if w.abs() >= 1e-12 && (idx as usize) < inter {
            d.down_proj.add_col_scaled(idx as usize, w, &mut out);
        }
    }
    out
}

/// Test-only re-export of the private sparse-quant FFN (mask × mmap gate).
#[doc(hidden)]
pub fn sparse_ffn_quant_for_test(
    d: &DenseFfn,
    x: &[f32],
    active: &[u16],
    hidden: usize,
) -> Vec<f32> {
    sparse_ffn_quant(d, x, active, hidden, None)
}

/// Dequantize a DenseFfn's three matrices to f32 (transient; only the
/// q4/vbit-masked fallback uses it — the memory-lean path is
/// sparse_ffn_quant). Reuses row_f32 row-by-row.
fn dequant_dense_f32(d: &DenseFfn) -> (Vec<f32>, Vec<f32>, Vec<f32>) {
    let deq = |t: &QTensor| -> Vec<f32> {
        let (rows, cols) = (t.rows(), t.cols());
        let mut out = vec![0.0f32; rows * cols];
        for r in 0..rows {
            t.row_f32(r, &mut out[r * cols..(r + 1) * cols]);
        }
        out
    };
    (deq(&d.gate_proj), deq(&d.up_proj), deq(&d.down_proj))
}

/// Pointer wrapper for the worker-pool scatter (same pattern as qtensor).
struct SendMut(*mut f32);
unsafe impl Send for SendMut {}
unsafe impl Sync for SendMut {}
impl SendMut {
    #[inline]
    // Deliberate unsynchronized scatter: pool workers write disjoint indices
    // in parallel, so returning `&mut` from `&self` is intentional here.
    #[allow(clippy::mut_from_ref)]
    unsafe fn at(&self, i: usize) -> &mut f32 {
        unsafe { &mut *self.0.add(i) }
    }
}

/// Router → (selected experts in torch.topk order, per-expert score
/// vector, normalizer). The final weight of expert `e` is `p[e] / wsum`.
///
/// Two regimes share this. Qwen: softmax over ALL experts, top-k of the
/// probabilities, optional renorm — `router_sigmoid=false`, no bias,
/// scale 1 → bit-identical to the historical path. LFM2-MoE /
/// DeepSeek-V3 `noaux_tc`: per-expert sigmoid scores, an optional
/// selection bias (top-k CHOICE only; weights stay unbiased), an
/// architecture-specified renorm floor and a routed scale.  The ordinary
/// loader contract is `1e-6`; Flint and MiniMax M3.1 preserve their
/// reference runtime's selected-score `sum + 1e-20`.
pub(crate) fn moe_route(
    logits: &[f32],
    m: &MoeFfn,
    allowed: Option<&[bool]>,
) -> (Vec<usize>, Vec<f32>, f32) {
    moe_route_with_eps(logits, m, allowed, m.sigmoid_denom_eps)
}

/// Router implementation with an explicit sigmoid renormalization floor.
///
/// Flint and MiniMax M3.1 reference runtimes compute
/// `sum(selected_scores) + 1e-20` in FP32. Using the generic 1e-6 floor is
/// not a harmless tolerance difference when all logits are very negative: it
/// collapses the routed branch toward zero instead of normalizing the selected
/// experts. Keeping the epsilon parameter here avoids changing the established
/// Qwen/LFM2 contract while allowing each architecture to preserve its own
/// numerical semantics.
pub(crate) fn moe_route_with_eps(
    logits: &[f32],
    m: &MoeFfn,
    allowed: Option<&[bool]>,
    sigmoid_denom_eps: f32,
) -> (Vec<usize>, Vec<f32>, f32) {
    let ne = logits.len();
    // Expert restriction: the static env mask (CMF_MOE_MASK) AND the
    // active task mask's expert fields (spec §5) both narrow the
    // candidate set; selection happens over the admitted experts only.
    // With norm_topk the kept weights renormalize below; without it
    // the excluded mass is honestly dropped.
    let admit = |e: usize| {
        m.mask.as_ref().is_none_or(|mk| mk[e])
            && allowed.is_none_or(|a| a.get(e).copied().unwrap_or(false))
    };
    // The resonance router (spec §9.5.1) selects by the RAW score: the
    // trainer (`resonance_winner`) and the resident graph
    // (`embryo_core_route_pick`) take the first maximum of the scores
    // and run the winner with weight 1.0. Selecting through the softmax
    // instead is not the same decision: `exp(l − max)` rounds two scores
    // closer than 2^-25 (possible below |score| 0.25) to the same 1.0, and
    // the lower index would take a token whose score is strictly smaller
    // — the trainer's trace and the graph would disagree with this path.
    // `−∞` (outside the shell) never wins; with no finite admitted expert
    // the generic path below degrades to uniform. The winner's
    // probability is 1.0 by construction (a one-hot `p`), so its
    // renormalized weight is `routed_scaling` on both norm_topk settings.
    if m.resonance.is_some() && m.top_k == 1 {
        let mut best: Option<usize> = None;
        for e in (0..ne).filter(|&e| admit(e)) {
            let l = logits[e];
            if l == f32::NEG_INFINITY || l.is_nan() {
                continue;
            }
            if best.is_none_or(|b| l > logits[b]) {
                best = Some(e);
            }
        }
        if let Some(b) = best {
            let mut p = vec![0.0f32; ne];
            p[b] = 1.0;
            return (vec![b], p, 1.0 / m.routed_scaling);
        }
    }
    // A `−∞` logit (a grown expert outside its shell, `Resonance::scores`)
    // takes probability 0 on both paths: sigmoid(−∞) = 0, exp(−∞ − max) = 0
    // — top-1 is the best FINITE expert, its renormalized weight exactly
    // 1.0. Every expert at −∞ cannot happen (trunk experts have no shell);
    // should it, the softmax would be NaN, so it degrades to uniform.
    let p: Vec<f32> = if m.router_sigmoid {
        logits.iter().map(|&l| 1.0 / (1.0 + (-l).exp())).collect()
    } else {
        let mx = logits.iter().cloned().fold(f32::NEG_INFINITY, f32::max);
        if mx == f32::NEG_INFINITY {
            vec![1.0 / ne.max(1) as f32; ne]
        } else {
            let mut e: Vec<f32> = logits.iter().map(|&l| (l - mx).exp()).collect();
            let s: f32 = e.iter().sum();
            for v in &mut e {
                *v /= s;
            }
            e
        }
    };
    let mut idx: Vec<usize> = (0..ne).filter(|&e| admit(e)).collect();
    // Descending by selection score, lower index wins ties (torch.topk).
    match &m.expert_bias {
        Some(b) => idx.sort_unstable_by(|&x, &y| {
            (p[y] + b[y])
                .partial_cmp(&(p[x] + b[x]))
                .unwrap()
                .then(x.cmp(&y))
        }),
        None => idx.sort_unstable_by(|&x, &y| p[y].partial_cmp(&p[x]).unwrap().then(x.cmp(&y))),
    }
    idx.truncate(m.top_k);
    // Adaptive τ-routing: trim the tail experts once the kept mass is
    // enough. wsum below renormalizes over the KEPT set, so the output
    // stays a proper weighted average.
    if let Some(tau) = m.route_tau {
        let total: f32 = idx.iter().map(|&e| p[e]).sum();
        if total > 0.0 {
            let mut acc = 0.0f32;
            let mut keep = idx.len();
            for (i, &e) in idx.iter().enumerate() {
                acc += p[e];
                if acc >= tau * total {
                    keep = i + 1;
                    break;
                }
            }
            idx.truncate(keep);
        }
    }
    let wsum: f32 = if m.norm_topk_prob {
        let s: f32 = idx.iter().map(|&e| p[e]).sum();
        // Sigmoid routers use their architecture's reference floor; the
        // softmax path's probs already sum near 1, so it stays exactly as
        // before.
        (if m.router_sigmoid {
            s + sigmoid_denom_eps
        } else {
            s
        }) / m.routed_scaling
    } else {
        1.0 / m.routed_scaling
    };
    (idx, p, wsum)
}

/// See the call site: one `layer:e1,e2,…` line per routed token.
fn moe_trace(idx: &[usize]) {
    moe_trace_at(crate::gpu::cur_layer() as i32, idx)
}

/// The same, for callers that know their layer (DSV4 owns its layers and
/// never sets the pipeline's current-layer marker).
pub(crate) fn moe_trace_at(li: i32, idx: &[usize]) {
    use std::io::Write;
    static F: std::sync::OnceLock<Option<std::sync::Mutex<std::fs::File>>> =
        std::sync::OnceLock::new();
    let Some(f) = F.get_or_init(|| {
        let p = std::env::var("CMF_MOE_TRACE").ok()?;
        Some(std::sync::Mutex::new(
            std::fs::OpenOptions::new()
                .create(true)
                .append(true)
                .open(p)
                .ok()?,
        ))
    }) else {
        return;
    };
    let ids: Vec<String> = idx.iter().map(|e| e.to_string()).collect();
    let _ = writeln!(f.lock().unwrap(), "{li}:{}", ids.join(","));
}

/// MoE FFN: router → top-k experts (see `moe_route`). Only selected
/// experts' pages are touched in mmap.
pub(crate) fn moe_ffn(
    m: &MoeFfn,
    x: &[f32],
    pool: Option<&Pool>,
    allowed: Option<&[bool]>,
) -> Vec<f32> {
    let r = moe_ffn_route(m, x, pool, allowed);
    moe_ffn_experts(m, x, &r, pool)
}

/// One token's host route through a MoE layer: the chosen experts in
/// selection order, the per-expert scores and the normalizer (see
/// `moe_route`), plus the raw router logits.
pub(crate) struct MoeRoute {
    pub idx: Vec<usize>,
    pub p: Vec<f32>,
    pub wsum: f32,
    pub logits: Vec<f32>,
}

/// The routing half of `moe_ffn`, shared by every executor of the chosen
/// experts (the host/per-op path below and the MiMo dynamic device cache,
/// `crate::mimo_moe`): activation accounting, router logits, `moe_route`,
/// the selection statistics and the `CMF_MOE_TRACE` line — so switching
/// executors can never change which experts a token gets.
pub(crate) fn moe_ffn_route(
    m: &MoeFfn,
    x: &[f32],
    pool: Option<&Pool>,
    allowed: Option<&[bool]>,
) -> MoeRoute {
    accumulate_act(m, x, 1);
    let ne = m.experts.len();
    let mut logits = vec![0.0f32; ne];
    match &m.resonance {
        Some(r) => r.scores(x, &mut logits),
        None => m.router.matvec(x, &mut logits, pool),
    }
    let (idx, p, wsum) = moe_route(&logits, m, allowed);
    {
        let mut st = m.stats.borrow_mut();
        if st.len() < ne {
            st.resize(ne, 0);
        }
        for &e in &idx {
            st[e] += 1;
        }
    }
    // `CMF_MOE_TRACE=<file>`: append one line per (layer, token) with the
    // selected expert ids. The cumulative `stats` above answer "which
    // experts are popular"; a residency design needs the question they
    // cannot answer — whether CONSECUTIVE tokens reuse experts (the
    // temporal locality an LRU cache lives on, FreeToken §4).
    moe_trace(&idx);
    MoeRoute {
        idx,
        p,
        wsum,
        logits,
    }
}

/// Flint's released mixed MoE profile has a native-Metal selected-expert
/// pager with a different numerical contract from the generic CPU probe:
/// the pager keeps activations in f32, whereas the fast host arm normally
/// uses its A8W8 activation path.  Timing those two approximations against
/// one another can make the probe reject the exact pager even when it is the
/// faster exact-f32 implementation.  Keep this gate deliberately narrower
/// than the pager itself; the pager revalidates every selected tuple before
/// it binds a no-copy view and an honest refusal still takes the CPU path.
#[cfg(target_os = "macos")]
fn strict_flint_metal_pager_candidate(m: &MoeFfn) -> bool {
    const HIDDEN: usize = 2_048;
    const ROUTED_INTER: usize = 512;
    const SHARED_INTER: usize = 1_024;
    const EXPERTS: usize = 256;
    const TOP_K: usize = 6;

    let Some(routed) = m.experts.first() else {
        return false;
    };
    let Some((model, _)) = routed.gate_proj.mapped_q2tp() else {
        return false;
    };
    let Some((shared, shared_gate)) = &m.shared else {
        return false;
    };
    if shared_gate.is_some()
        || model.header.arch.arch_name != "flint"
        || model.header.arch.prism_hadamard.is_some()
        || model.header.arch.hidden_size != HIDDEN
        || m.experts.len() != EXPERTS
        || m.top_k != TOP_K
        || !m.router_sigmoid
        || !m.norm_topk_prob
        || m.sigmoid_denom_eps.to_bits() != (1e-20f32).to_bits()
        || m.routed_scaling.to_bits() != 1.0f32.to_bits()
        || m.route_tau.is_some()
        || m.mask.is_some()
        || m.per_expert_scale.is_some()
        || m.router_input_norm
        || m.resonance.is_some()
        || !m.grown.is_empty()
    {
        return false;
    }

    let routed_q2 = routed.act == Act::Silu
        && routed.segs.is_empty()
        && routed.gate_proj.rows() == ROUTED_INTER
        && routed.gate_proj.cols() == HIDDEN
        && routed.up_proj.rows() == ROUTED_INTER
        && routed.up_proj.cols() == HIDDEN
        && routed.down_proj.rows() == HIDDEN
        && routed.down_proj.cols() == ROUTED_INTER
        && routed.up_proj.mapped_q2tp().is_some()
        && routed.down_proj.mapped_q4tp().is_some();
    let shared_q4 = shared.act == Act::Silu
        && shared.segs.is_empty()
        && shared.gate_proj.rows() == SHARED_INTER
        && shared.gate_proj.cols() == HIDDEN
        && shared.up_proj.rows() == SHARED_INTER
        && shared.up_proj.cols() == HIDDEN
        && shared.down_proj.rows() == HIDDEN
        && shared.down_proj.cols() == SHARED_INTER
        && shared.gate_proj.mapped_q4tp().is_some()
        && shared.up_proj.mapped_q4tp().is_some()
        && shared.down_proj.mapped_q4tp().is_some();
    routed_q2 && shared_q4
}

/// The expert half of `moe_ffn`: run a route's experts on the per-op GPU
/// block or the host.
pub(crate) fn moe_ffn_experts(
    m: &MoeFfn,
    x: &[f32],
    r: &MoeRoute,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let (idx, p, wsum) = (&r.idx, &r.p, r.wsum);
    // D5: the whole layer MoE block in one GPU command buffer (experts — the
    // same mmap via a no-copy buffer; intermediate activations on the GPU).
    // MoE owns a separate probe class from dense FFN: its selected-span pager
    // has materially different residency and latency costs.
    if crate::gpu::enabled_here() {
        #[cfg(target_os = "macos")]
        if crate::gpu_metal::enabled() && strict_flint_metal_pager_candidate(m) {
            // Do not compare the pager's exact-f32 result with the CPU's
            // optional A8W8 activation approximation.  The strict pager is
            // the validated Flint path; if a directory/view/device check
            // declines, preserve the existing CPU fallback rather than
            // leaving the probe in a half-sampled state.
            return moe_ffn_gpu(m, x, &idx, &p, wsum, pool).unwrap_or_else(|| {
                crate::gpu::cpu_scope(|| moe_ffn_cpu(m, x, &idx, &p, wsum, pool))
            });
        }
        match crate::gpu::probe_arm(crate::gpu::OpClass::Moe) {
            crate::gpu::ProbeArm::Gpu => {
                let t0 = std::time::Instant::now();
                if let Some(out) = moe_ffn_gpu(m, x, &idx, &p, wsum, pool) {
                    crate::gpu::probe_record(crate::gpu::OpClass::Moe, true, t0.elapsed());
                    return out;
                }
                crate::gpu::probe_note_decline(crate::gpu::OpClass::Moe);
            }
            crate::gpu::ProbeArm::CpuTimed => {
                let t0 = std::time::Instant::now();
                let out = crate::gpu::cpu_scope(|| moe_ffn_cpu(m, x, &idx, &p, wsum, pool));
                crate::gpu::probe_record(crate::gpu::OpClass::Moe, false, t0.elapsed());
                return out;
            }
            crate::gpu::ProbeArm::Cpu => {
                return crate::gpu::cpu_scope(|| moe_ffn_cpu(m, x, &idx, &p, wsum, pool));
            }
        }
    }
    moe_ffn_cpu(m, x, &idx, &p, wsum, pool)
}

/// One MiniCPM CPU-tail MoE through its opt-in dynamic bank, or through the
/// same-route host fallback.  The route is formed exactly once so statistics,
/// tracing, and model semantics remain owned by `moe_ffn_route`.
fn moe_ffn_minicpm_tail(
    slot: &mut crate::minicpm_tail::MiniCpmTail,
    li: usize,
    total_layers: usize,
    m: &MoeFfn,
    x: &[f32],
    pool: Option<&Pool>,
) -> Vec<f32> {
    let route = moe_ffn_route(m, x, pool, None);
    match slot.forward(li, m, x, &route, pool, total_layers) {
        Some(out) => out,
        // A cache refusal must be observationally identical to the generic
        // CPU-tail path. The surrounding host-tail scope already disables the
        // per-op arena, so do not introduce a float-activation policy change
        // merely because this explicit opt-in cache declined a model/layout.
        None => moe_ffn_experts(m, x, &route, pool),
    }
}

/// One MoE token through the MiMo expert bank (`crate::mimo_moe`), or —
/// when the bank does not serve it — through the host path with the SAME
/// route, so the routing statistics and `CMF_MOE_TRACE` see it once.
fn moe_ffn_banked(
    slot: &mut crate::mimo_moe::Slot,
    li: usize,
    m: &MoeFfn,
    x: &[f32],
    pool: Option<&Pool>,
) -> Vec<f32> {
    let t0 = std::time::Instant::now();
    let r = moe_ffn_route(m, x, pool, None);
    slot.note_route(t0.elapsed().as_nanos() as u64);
    match slot.forward(li, m, x, &r, pool) {
        Some(out) => out,
        None => crate::qtensor::float_activations_scope(|| {
            crate::gpu::cpu_scope(|| moe_ffn_experts(m, x, &r, pool))
        }),
    }
}

/// Verify rows share a bank frame; routing and fallback are decode's.
fn moe_ffn_banked_rows(
    slot: &mut crate::mimo_moe::Slot,
    li: usize,
    m: &MoeFfn,
    xs: &[f32],
    b: usize,
    hidden: usize,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let t0 = std::time::Instant::now();
    let routes: Vec<_> = xs
        .chunks_exact(hidden)
        .map(|x| moe_ffn_route(m, x, pool, None))
        .collect();
    slot.note_route(t0.elapsed().as_nanos() as u64);
    if let Some(out) = slot.forward_rows(li, m, xs, &routes, pool) {
        return out;
    }
    let mut out = Vec::with_capacity(b * hidden);
    for (x, r) in xs.chunks_exact(hidden).zip(&routes) {
        let row = slot.forward(li, m, x, r, pool).unwrap_or_else(|| {
            // A failed bank must not stream missing experts into the arena.
            crate::qtensor::float_activations_scope(|| {
                crate::gpu::cpu_scope(|| moe_ffn_experts(m, x, r, pool))
            })
        });
        out.extend(row);
    }
    out
}

/// One-shot report of whether the whole-token wgpu graph actually formed.
/// A refusal silently reverts to the per-op path, which is how a model can
/// look "GPU-accelerated" while every layer walks the host.  A device prefix
/// is tracked separately because it still pays a host boundary for the tail.
fn graph_note(built: bool, layers_run: usize, total_layers: usize) {
    use std::sync::atomic::{AtomicBool, Ordering};
    if built {
        GRAPH_TOK_OK.fetch_add(1, Ordering::Relaxed);
        if total_layers > 0 && layers_run < total_layers {
            GRAPH_TOK_PREFIX.fetch_add(1, Ordering::Relaxed);
        } else {
            GRAPH_TOK_FULL.fetch_add(1, Ordering::Relaxed);
        }
    } else {
        GRAPH_TOK_MISS.fetch_add(1, Ordering::Relaxed);
    }
    static SAID: AtomicBool = AtomicBool::new(false);
    if !SAID.swap(true, Ordering::Relaxed) {
        if built {
            tracing::info!("wgpu whole-token graph: ACTIVE");
        } else {
            tracing::warn!("wgpu whole-token graph refused — per-op path");
        }
    }
}

/// Whole-token graph outcomes, process-wide: a benchmark that claims a
/// GPU number while MISS climbs is measuring the CPU — the honest-bench
/// contract makes that an error, not a footnote.
pub static GRAPH_TOK_OK: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static GRAPH_TOK_MISS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
/// Graph calls that returned a hidden after running only a leading device
/// prefix.  These are valid hybrid executions but must not be reported as a
/// full GPU graph in benchmark evidence.
pub static GRAPH_TOK_PREFIX: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
/// Graph calls that covered the complete requested layer span.
pub static GRAPH_TOK_FULL: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);

/// Native Metal TokenGraph completion counters. These are incremented only
/// after checked command-buffer completion and successful readback, so a
/// fused-head NLL report can prove the route rather than infer it from env.
pub static METAL_GRAPH_TOK_OK: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static METAL_GRAPH_HEAD_OK: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static METAL_GRAPH_HEAD_MISS: std::sync::atomic::AtomicU64 =
    std::sync::atomic::AtomicU64::new(0);
pub static METAL_GRAPH_LAYERS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static METAL_GRAPH_ERRORS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
/// Ordinary native-Metal rows-prefill admissions and completed rows.  These
/// counters are separate from TokenGraph token/head counts so a batch NLL
/// receipt cannot accidentally claim serial execution as batched.
pub static METAL_PREFILL_CHUNKS: std::sync::atomic::AtomicU64 =
    std::sync::atomic::AtomicU64::new(0);
pub static METAL_PREFILL_ROWS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static METAL_PREFILL_HEAD_ROWS: std::sync::atomic::AtomicU64 =
    std::sync::atomic::AtomicU64::new(0);
pub static METAL_PREFILL_ERRORS: std::sync::atomic::AtomicU64 =
    std::sync::atomic::AtomicU64::new(0);

/// `CMF_MOE_BATCH=0` restores the per-expert serial loop — the A/B lever
/// for the batched kernel, and how its bit-identity is checked.
fn moe_batch_enabled() -> bool {
    static ON: std::sync::OnceLock<bool> = std::sync::OnceLock::new();
    *ON.get_or_init(|| std::env::var("CMF_MOE_BATCH").as_deref() != Ok("0"))
}

/// Two-dispatch CPU MoE: every routed expert (and the shared one) fused
/// into one gate/up/SiLU dispatch and one down dispatch, instead of two
/// pool barriers per expert. Bit-identical to the serial loop below —
/// see `moe_gate_up_many` / `moe_down_many`. `None` = the batched kernel
/// does not cover this layer, walk the serial path.
fn moe_ffn_cpu_batched(
    m: &MoeFfn,
    x: &[f32],
    idx: &[usize],
    p: &[f32],
    wsum: f32,
    pool: Option<&Pool>,
) -> Option<Vec<f32>> {
    if idx.is_empty() || !moe_batch_enabled() {
        return None;
    }
    // The bake probe reads per-neuron activation mass out of the
    // single-expert path; batching would skip it. Rare and offline —
    // hand those runs to the serial loop.
    if FFN_PROBE.with(|pr| pr.borrow().is_some()) || moe_probe_active() {
        return None;
    }
    let n = idx.len() + usize::from(m.shared.is_some());
    let mut pairs = Vec::with_capacity(n);
    let mut downs = Vec::with_capacity(n);
    let mut ws = Vec::with_capacity(n);
    for &e in idx {
        let d = &m.experts[e];
        if d.act != Act::Silu {
            return None;
        }
        pairs.push((&d.gate_proj, &d.up_proj));
        downs.push(&d.down_proj);
        ws.push(p[e] / wsum * m.per_expert_scale.as_ref().map_or(1.0, |v| v[e]));
    }
    // The shared expert goes last, matching the serial loop's order —
    // the f32 accumulation order is part of the bit-identity claim.
    if let Some((se, gate)) = &m.shared {
        if se.act != Act::Silu {
            return None;
        }
        let g = gate.as_ref().map_or(1.0, |gate| {
            let mut gl = [0.0f32; 1];
            gate.matvec(x, &mut gl, pool);
            1.0 / (1.0 + (-gl[0]).exp())
        });
        pairs.push((&se.gate_proj, &se.up_proj));
        downs.push(&se.down_proj);
        ws.push(g);
    }
    let inter = pairs[0].0.rows();
    let mut gs: Vec<Vec<f32>> = (0..pairs.len()).map(|_| vec![0f32; inter]).collect();
    if !QTensor::moe_gate_up_many(&pairs, x, &mut gs, pool) {
        return None;
    }
    let mut out = attention::take_buf(x.len());
    if !QTensor::moe_down_many(&downs, &gs, &ws, &mut out, pool) {
        attention::recycle_buf(&mut out);
        return None;
    }
    Some(out)
}

/// Exact CPU completion for the routed experts a dynamic device cache did
/// not contain. The weights are already the router's final normalized mix.
/// Keeping this independent of `MoeFfn` makes the job `Sync`: its routing
/// statistics live in a `RefCell`, while the immutable expert tensors can be
/// evaluated safely in parallel with the GPU's resident subset.
/// Pooled-tail stage timers, reported per token by the bench JSON
/// (`m3_span_ms_per_tok`, `m3_cold_ms_per_tok`, `m3_arm_ms_per_tok`).
pub static M3_SPAN_NS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static M3_COLD_NS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static M3_ARM_NS: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static M3_COLD_N: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);
pub static M3_COLD_DEV_N: std::sync::atomic::AtomicU64 = std::sync::atomic::AtomicU64::new(0);

pub(crate) fn moe_cold_experts_cpu(
    experts: &[(&DenseFfn, f32)],
    x: &[f32],
    pool: Option<&Pool>,
) -> Vec<f32> {
    moe_cold_experts_cpu_with(experts, x, pool, true)
}

/// [`moe_cold_experts_cpu`] with the experts' tubes (`expert_tubes_add`) optional: the
/// Flash-Next device path computes every winner's tube on the card.
pub(crate) fn moe_cold_experts_cpu_with(
    experts: &[(&DenseFfn, f32)],
    x: &[f32],
    pool: Option<&Pool>,
    tubes: bool,
) -> Vec<f32> {
    let mut out = attention::take_buf(x.len());
    if experts.is_empty() {
        return out;
    }
    let pairs: Vec<_> = experts
        .iter()
        .map(|(e, _)| (&e.gate_proj, &e.up_proj))
        .collect();
    let downs: Vec<_> = experts.iter().map(|(e, _)| &e.down_proj).collect();
    let weights: Vec<_> = experts.iter().map(|(_, w)| *w).collect();
    let inter = experts[0].0.gate_proj.rows();
    let mut activations: Vec<Vec<f32>> = (0..experts.len()).map(|_| vec![0.0; inter]).collect();
    // The batched gate/up kernels implement PLAIN SiLU only (their legacy
    // helper passes limit 0 and no activation code). MiniMax's SwiGLU-OAI
    // (alpha 1.702, shifted up) must take the per-expert path that reads
    // each tensor's own activation — otherwise every cold expert computes
    // silu and the residual walks away from the reference (measured: the
    // pooled tail shipped cos 0.047 hidden while the resident path was
    // bit-close).
    let silu_only = experts
        .iter()
        .all(|(e, _)| matches!(e.act, crate::pipeline::Act::Silu));
    if silu_only
        && QTensor::moe_gate_up_many(&pairs, x, &mut activations, pool)
        && QTensor::moe_down_many(&downs, &activations, &weights, &mut out, pool)
    {
        if tubes {
            for &(expert, weight) in experts {
                expert_tubes_add(expert, x, weight, &mut out, pool);
            }
        }
        return out;
    }
    out.fill(0.0);
    for &(expert, weight) in experts {
        if tubes {
            expert_tubes_add(expert, x, weight, &mut out, pool);
        }
        let mut one = dense_ffn(expert, x, pool);
        for (o, v) in out.iter_mut().zip(&one) {
            *o += weight * v;
        }
        attention::recycle_buf(&mut one);
    }
    out
}

/// Cold part of a short bank batch. Share each expert's weight stream
/// across its tokens, but reduce contributions in each token's route order.
/// On an unsupported CPU/layout, retain the single-token cold kernels.
pub(crate) fn moe_cold_experts_rows_cpu(
    jobs: &[Vec<(&DenseFfn, f32)>],
    xs: &[f32],
    hidden: usize,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let mut out = vec![0.0; xs.len()];
    let mut experts: Vec<&DenseFfn> = Vec::new();
    let mut groups: Vec<Vec<usize>> = Vec::new();
    let mut terms = vec![Vec::new(); jobs.len()];
    for (r, row) in jobs.iter().enumerate() {
        for &(e, w) in row {
            let g = match experts.iter().position(|&d| std::ptr::eq(d, e)) {
                Some(g) => g,
                None => {
                    experts.push(e);
                    groups.push(Vec::new());
                    groups.len() - 1
                }
            };
            terms[r].push((g, groups[g].len(), w));
            groups[g].push(r);
        }
    }
    if experts.is_empty() {
        return out;
    }
    let pairs: Vec<_> = experts.iter().map(|e| (&e.gate_proj, &e.up_proj)).collect();
    let downs: Vec<_> = experts.iter().map(|e| &e.down_proj).collect();
    let lens: Vec<_> = groups.iter().map(Vec::len).collect();
    let count: usize = lens.iter().sum();
    let mut acts = vec![vec![0.0; experts[0].gate_proj.rows()]; count];
    let mut ds = vec![vec![0.0; hidden]; count];
    if QTensor::moe_gate_up_rows(&pairs, &groups, xs, &mut acts, pool)
        && QTensor::moe_down_rows(&downs, &lens, &acts, &mut ds, pool)
    {
        let mut offset = 0;
        let offsets: Vec<_> = lens
            .iter()
            .map(|&n| {
                let start = offset;
                offset += n;
                start
            })
            .collect();
        for (r, terms) in terms.iter().enumerate() {
            for &(g, slot, w) in terms {
                for (o, &v) in out[r * hidden..(r + 1) * hidden]
                    .iter_mut()
                    .zip(&ds[offsets[g] + slot])
                {
                    *o += w * v;
                }
            }
        }
    } else {
        for (r, jobs) in jobs.iter().enumerate() {
            if !jobs.is_empty() {
                let mut row = moe_cold_experts_cpu(jobs, &xs[r * hidden..(r + 1) * hidden], pool);
                out[r * hidden..(r + 1) * hidden].copy_from_slice(&row);
                attention::recycle_buf(&mut row);
            }
        }
    }
    out
}

/// The pure-CPU MoE expert loop (also the fallback of every GPU refusal).
fn moe_ffn_cpu(
    m: &MoeFfn,
    x: &[f32],
    idx: &[usize],
    p: &[f32],
    wsum: f32,
    pool: Option<&Pool>,
) -> Vec<f32> {
    if let Some(mut out) = moe_ffn_cpu_batched(m, x, idx, p, wsum, pool) {
        for &e in idx {
            let w = p[e] / wsum * m.per_expert_scale.as_ref().map_or(1.0, |v| v[e]);
            expert_tubes_add(&m.experts[e], x, w, &mut out, pool);
        }
        shared_tubes_add(m, x, &mut out, pool);
        return out;
    }
    let mut out = attention::take_buf(x.len());
    for &e in idx {
        let w = p[e] / wsum * m.per_expert_scale.as_ref().map_or(1.0, |v| v[e]);
        MOE_PROBE.with(|pr| {
            if let Some(pr) = pr.borrow_mut().as_mut() {
                pr.cur = Some((e, w));
            }
        });
        let mut eo = dense_ffn(&m.experts[e], x, pool);
        MOE_PROBE.with(|pr| {
            if let Some(pr) = pr.borrow_mut().as_mut() {
                pr.cur = None;
            }
        });
        for i in 0..out.len() {
            out[i] += w * eo[i];
        }
        attention::recycle_buf(&mut eo);
        expert_tubes_add(&m.experts[e], x, w, &mut out, pool);
    }
    if let Some((se, gate)) = &m.shared {
        let mut so = dense_ffn(se, x, pool);
        let g = gate.as_ref().map_or(1.0, |gate| {
            let mut gl = [0.0f32; 1];
            gate.matvec(x, &mut gl, pool);
            1.0 / (1.0 + (-gl[0]).exp())
        });
        for i in 0..out.len() {
            out[i] += g * so[i];
        }
        attention::recycle_buf(&mut so);
        expert_tubes_add(se, x, g, &mut out, pool);
    }
    out
}

/// DeepSeek-V2 MLA forward, expand-to-MHA form (see `AttnKind::Mla`):
/// per token the latent expands to every head's K/V and the ordinary
/// cache + grouped attend do the rest. K head layout is [rope | nope]
/// (rotary_dim = qk_rope rotates the shared rope key and each q head's
/// prefix); V rows are zero-padded to the K head_dim inside the cache
/// and the pad is sliced off before O. Attention importance is not
/// accumulated for MLA yet (no eviction interplay).
#[allow(clippy::too_many_arguments)]
pub(crate) fn mla_attention(
    w: &MlaWeights,
    normed: &[f32],
    cache: &mut crate::kv_cache::LayerKvCache,
    position: usize,
    inv_freq: &[f32],
    rope_scale: f32,
    eps: f64,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let (nh, dr, dn, dv, lora) = (w.nh, w.qk_rope, w.qk_nope, w.v_dim, w.lora);
    let hd = dr + dn;
    let mut q = vec![0.0f32; nh * hd];
    match (&w.q_a, &w.q_a_norm) {
        (Some(qa), Some(qn)) => {
            let mut t = vec![0.0f32; qa.rows()];
            qa.matvec(normed, &mut t, pool);
            let tn = inference::rms_norm(&t, qn, eps, NormStyle::Qwen);
            w.q_proj.matvec(&tn, &mut q, pool);
        }
        _ => w.q_proj.matvec(normed, &mut q, pool),
    }
    let mut ca = vec![0.0f32; lora + dr];
    w.kv_a.matvec(normed, &mut ca, pool);
    let (c_lat, k_rope) = ca.split_at_mut(lora);
    let latn = inference::rms_norm(c_lat, &w.kv_a_norm, eps, NormStyle::Qwen);
    let mut kvb = vec![0.0f32; nh * (dn + dv)];
    w.kv_b.matvec(&latn, &mut kvb, pool);
    if !w.nope {
        attention::rope_rotate_scaled(k_rope, position, inv_freq, rope_scale);
    }
    for h in 0..nh {
        if !w.nope {
            attention::rope_rotate_scaled(
                &mut q[h * hd..h * hd + dr],
                position,
                inv_freq,
                rope_scale,
            );
        }
    }
    let mut k = vec![0.0f32; nh * hd];
    let mut v = vec![0.0f32; nh * hd];
    for h in 0..nh {
        k[h * hd..h * hd + dr].copy_from_slice(k_rope);
        k[h * hd + dr..(h + 1) * hd].copy_from_slice(&kvb[h * (dn + dv)..h * (dn + dv) + dn]);
        v[h * hd..h * hd + dv].copy_from_slice(&kvb[h * (dn + dv) + dn..(h + 1) * (dn + dv)]);
    }
    cache.append(&k, &v, &vec![true; nh]);
    let (ao, mut imp) = attention::attend_all_heads(&q, cache, nh, 1, hd, w.scale, None, 0.0);
    attention::recycle_buf(&mut imp);
    let mut ov = vec![0.0f32; nh * dv];
    for h in 0..nh {
        ov[h * dv..(h + 1) * dv].copy_from_slice(&ao[h * hd..h * hd + dv]);
    }
    let mut out = vec![0.0f32; w.o_proj.rows()];
    w.o_proj.matvec(&ov, &mut out, pool);
    out
}

/// Gemma-4 dual-branch FFN (spec: see `FfnKind::DenseMoe`). The dense
/// branch reads the pre-FFN-normed activation; the router and the
/// expert branch read the RAW residual — the router through a
/// scale-less rms norm (its constant gain is folded into the weights),
/// the experts through `pre_norm_2`. CPU path; GPU graphs refuse the
/// layer kind honestly.
fn dense_moe_ffn(
    dm: &DenseMoeFfn,
    x_normed: &[f32],
    h_raw: &[f32],
    eps: f64,
    norm_style: NormStyle,
    pool: Option<&Pool>,
) -> Vec<f32> {
    let mut d = dense_ffn(&dm.dense, x_normed, pool);
    d = inference::rms_norm(&d, &dm.post_norm_1, eps, norm_style);
    let m = &dm.moe;
    let ne = m.experts.len();
    let mut logits = vec![0.0f32; ne];
    if m.router_input_norm {
        let ss: f32 = h_raw.iter().map(|v| v * v).sum::<f32>() / h_raw.len() as f32;
        let inv = 1.0 / (ss + eps as f32).sqrt();
        let xr: Vec<f32> = h_raw.iter().map(|v| v * inv).collect();
        m.router.matvec(&xr, &mut logits, pool);
    } else {
        m.router.matvec(h_raw, &mut logits, pool);
    }
    let (idx, p, wsum) = moe_route(&logits, m, None);
    {
        let mut st = m.stats.borrow_mut();
        if st.len() < ne {
            st.resize(ne, 0);
        }
        for &e in &idx {
            st[e] += 1;
        }
    }
    let x2 = inference::rms_norm(h_raw, &dm.pre_norm_2, eps, norm_style);
    let mo = moe_ffn_cpu(m, &x2, &idx, &p, wsum, pool);
    let mo = inference::rms_norm(&mo, &dm.post_norm_2, eps, norm_style);
    for (di, mi) in d.iter_mut().zip(&mo) {
        *di += mi;
    }
    d
}

/// Building the MoE-layer GPU jobs: all selected experts (+shared) must
/// be q8_2f-Mapped from the primary mapping; otherwise None → CPU path.
/// One-shot report of why the MoE GPU block refused. A silent `?` here
/// sends every expert to the CPU with nothing in the logs to say so —
/// which is exactly how a q4tp MoE model looked "GPU-accelerated" while
/// running entirely on the host.
fn moe_gpu_refused(why: &'static str) {
    use std::sync::atomic::{AtomicBool, Ordering};
    static SAID: AtomicBool = AtomicBool::new(false);
    if !SAID.swap(true, Ordering::Relaxed) {
        tracing::warn!("MoE GPU block refused ({why}) — experts run on the CPU");
    }
}

fn moe_ffn_gpu(
    m: &MoeFfn,
    x: &[f32],
    idx: &[usize],
    p: &[f32],
    wsum: f32,
    pool: Option<&Pool>,
) -> Option<Vec<f32>> {
    use crate::gpu::MoeJob;

    let mut jobs: Vec<MoeJob> = Vec::with_capacity(idx.len() + 1);
    let mut model_ref = None;
    for &e in idx {
        if moe_push_job(&m.experts[e], x, p[e] / wsum, &mut jobs, &mut model_ref).is_none() {
            moe_gpu_refused("push_job(expert)");
            return None;
        }
    }
    if let Some((se, gate)) = &m.shared {
        let g = gate.as_ref().map_or(1.0, |gate| {
            let mut gl = [0.0f32; 1];
            gate.matvec(x, &mut gl, pool);
            1.0 / (1.0 + (-gl[0]).exp())
        });
        if moe_push_job(se, x, g, &mut jobs, &mut model_ref).is_none() {
            moe_gpu_refused("push_job(shared)");
            return None;
        }
    }
    let Some(model) = model_ref else {
        moe_gpu_refused("no model_ref");
        return None;
    };
    let hidden = jobs[0].down.1;
    let mut out = vec![0.0f32; hidden];
    if crate::gpu::moe_block(&model, &jobs, &mut out) {
        // The block knows no tubes (`hot-bake --experts`): the winners' and the
        // shared expert's come here, as the CPU paths add them.
        for &e in idx {
            expert_tubes_add(&m.experts[e], x, p[e] / wsum, &mut out, pool);
        }
        shared_tubes_add(m, x, &mut out, pool);
        Some(out)
    } else {
        moe_gpu_refused("gpu::moe_block");
        None
    }
}

/// Single-position FFN dispatch.
fn ffn_forward(
    ffn: &FfnKind,
    x: &[f32],
    pool: Option<&Pool>,
    experts_allowed: Option<&[bool]>,
) -> Vec<f32> {
    match ffn {
        FfnKind::Dense(d) if !d.segs.is_empty() => tube_ffn(d, x, 1, pool, None),
        FfnKind::Dense(d) => dense_ffn(d, x, pool),
        FfnKind::Moe(m) => moe_ffn(m, x, pool, experts_allowed),
        // Dual-branch layers need the raw residual — their callers
        // dispatch dense_moe_ffn directly; the auxiliary paths that land
        // here (MTP draft, o1 replay) do not co-occur with gemma-4 MoE.
        FfnKind::DenseMoe(_) => unreachable!("DenseMoe dispatches via dense_moe_ffn"),
    }
}

/// Fused two-position FFN: gate/up/down streamed once (dense). MoE
/// falls back to two singles — expert sets differ per position, there
/// is nothing to fuse.
fn ffn_forward_pair(
    ffn: &FfnKind,
    x1: &[f32],
    x2: &[f32],
    pool: Option<&Pool>,
    experts_allowed: Option<&[bool]>,
) -> (Vec<f32>, Vec<f32>) {
    let d = match ffn {
        // A tube layer has nothing to fuse across the pair — the tubes
        // are separate matrices; two singles are the honest path.
        FfnKind::Dense(d) if !d.segs.is_empty() => {
            return (
                tube_ffn(d, x1, 1, pool, None),
                tube_ffn(d, x2, 1, pool, None),
            );
        }
        FfnKind::Dense(d) => d,
        FfnKind::Moe(m) => {
            return (
                moe_ffn(m, x1, pool, experts_allowed),
                moe_ffn(m, x2, pool, experts_allowed),
            );
        }
        FfnKind::DenseMoe(_) => unreachable!("DenseMoe dispatches via dense_moe_ffn"),
    };
    let inter = d.gate_proj.rows();
    FFN_SCRATCH.with(|s| {
        let mut s = s.borrow_mut();
        let [g1, g2, u1, u2] = &mut *s;
        g1.resize(inter, 0.0);
        g2.resize(inter, 0.0);
        u1.resize(inter, 0.0);
        u2.resize(inter, 0.0);
        // Multi-matrix pair job: gate+up under one pool dispatch
        // (o1s = lane-1 outputs across tensors, o2s = lane-2).
        QTensor::matvec2_many(
            [&d.gate_proj, &d.up_proj],
            x1,
            x2,
            [g1.as_mut_slice(), u1.as_mut_slice()],
            [g2.as_mut_slice(), u2.as_mut_slice()],
            pool,
        );
        for i in 0..inter {
            g1[i] = d.act.combine(g1[i], u1[i]);
            g2[i] = d.act.combine(g2[i], u2[i]);
        }
        let mut o1 = attention::take_buf(d.down_proj.rows());
        let mut o2 = attention::take_buf(d.down_proj.rows());
        d.down_proj.matvec2(g1, g2, &mut o1, &mut o2, pool);
        (o1, o2)
    })
}

#[cfg(test)]
mod tests {
    use std::ffi::OsString;
    use std::sync::Mutex;

    // Environment switches are process-global. Keep the speculative-path
    // tests serialized and restore every prior value even during unwinding.
    static MTP_ENV_LOCK: Mutex<()> = Mutex::new(());

    struct ScopedTestEnv {
        previous: Vec<(&'static str, Option<OsString>)>,
    }

    impl ScopedTestEnv {
        fn set(vars: &[(&'static str, Option<&'static str>)]) -> Self {
            let previous = vars
                .iter()
                .map(|(name, _)| (*name, std::env::var_os(name)))
                .collect();
            for &(name, value) in vars {
                unsafe {
                    match value {
                        Some(value) => std::env::set_var(name, value),
                        None => std::env::remove_var(name),
                    }
                }
            }
            Self { previous }
        }
    }

    impl Drop for ScopedTestEnv {
        fn drop(&mut self) {
            for (name, value) in self.previous.drain(..).rev() {
                unsafe {
                    match value {
                        Some(value) => std::env::set_var(name, value),
                        None => std::env::remove_var(name),
                    }
                }
            }
        }
    }

    #[test]
    fn tail_repeat_counts_the_copied_stretch() {
        assert_eq!(tail_repeat(&[]), 0);
        assert_eq!(tail_repeat(&[5]), 0);
        assert_eq!(tail_repeat(&[1, 2, 3, 4]), 0);
        // the last three repeat the first three
        assert_eq!(tail_repeat(&[1, 2, 3, 9, 1, 2, 3]), 3);
        // the longest repeat wins over a later, shorter one
        assert_eq!(tail_repeat(&[1, 2, 3, 4, 8, 3, 4, 7, 1, 2, 3, 4]), 4);
        // a repeat reaching the start of the sequence
        assert_eq!(tail_repeat(&[1, 2, 1, 2]), 2);
        let long: Vec<u32> = (0..40).chain(0..40).collect();
        assert_eq!(tail_repeat(&long), 32);
    }

    /// The chain's depth on wgpu follows the device's own round prices: a
    /// card whose verify climbs with its rows comes back from five drafts
    /// to three on the same acceptance that keeps a flat card at five.
    #[test]
    fn wgpu_spec_depth_follows_the_round_prices() {
        // RTX 2000 Ada, Qwen3.8-27B Turbo: rounds of 2..5 drafts, ms
        let steep = [0.0, 100.5, 111.3, 126.3, 144.6, 0.0, 0.0];
        let hold = [0.90, 0.85, 0.80, 0.60, 0.60, 0.60, 0.60];
        assert_eq!(wgpu_spec_depth(&hold, &steep, 5, 2, 5), Some(3));
        // the depth in turn stays while no other is 4 % better
        assert_eq!(wgpu_spec_depth(&hold, &steep, 4, 2, 5), Some(4));
        let flat = [0.0, 0.0, 60.0, 62.0, 64.0, 0.0, 0.0];
        assert_eq!(wgpu_spec_depth(&[0.9; 7], &flat, 3, 2, 5), Some(5));
        // an untimed depth is priced on the line through the two nearest
        let two = [0.0, 0.0, 111.3, 126.3, 0.0, 0.0, 0.0];
        assert_eq!(wgpu_spec_depth(&[0.5; 7], &two, 4, 2, 5), Some(2));
        // one timed depth says nothing of the slope
        assert_eq!(wgpu_spec_depth(&hold, &[0.0, 0.0, 111.3, 0.0, 0.0, 0.0, 0.0], 3, 2, 5), None);
    }

    #[test]
    fn dflash_round_values_price_a_round_of_each_drafter() {
        // the block holds all seven of its drafts, the chain its first only
        let after: Vec<u32> = (10..30).collect();
        let seq: Vec<u32> = (100..140).collect();
        let block: Vec<u32> = (10..17).collect();
        let chain: Vec<u32> = vec![10, 99, 99, 99, 99, 99, 99];
        let starts: Vec<DflashStart<'_>> =
            (0..40).map(|_| DflashStart { seq: &seq, after: &after, block: &block, chain: &chain }).collect();
        let v = dflash_round_values(&starts);
        let (b, c) = v[39];
        // a block seven deep: eight tokens for a round of seven drafts and the block's own price
        assert_eq!(b, (8.0, METAL_ROUND_COST[6] + DFLASH_ROUND_DRAFT));
        // the chain has settled at one draft, which holds
        assert_eq!(c, (2.0, METAL_ROUND_COST[0]));
        assert!(b.0 / b.1 > c.0 / c.1);
    }

    #[test]
    fn lookup_continues_a_repeated_stretch() {
        // 1 2 3 4 5 6 7 | 9 9 | 2 3 4 → the stretch 2 3 4 was followed by 5 6 7
        let seq = [1, 2, 3, 4, 5, 6, 7, 9, 9, 2, 3, 4];
        assert_eq!(lookup_continuation(&seq, 3, 3), &[5, 6, 7]);
        assert_eq!(lookup_continuation(&seq, 3, 2), &[5, 6]);
        // a repeat shorter than asked gives nothing
        assert!(lookup_continuation(&seq, 4, 3).is_empty());
        // the longest repeat wins over a later, shorter one
        let seq = [5, 2, 3, 4, 8, 0, 3, 4, 7, 0, 5, 2, 3, 4];
        assert_eq!(lookup_continuation(&seq, 2, 1), &[8]);
        // of equal ones the latest
        let seq = [2, 3, 4, 8, 0, 2, 3, 4, 7, 0, 2, 3, 4];
        assert_eq!(lookup_continuation(&seq, 2, 1), &[7]);
        // a period continues through the tail itself
        let seq = [1, 2, 1, 2, 1, 2];
        assert_eq!(lookup_continuation(&seq, 3, 4), &[1, 2]);
        assert!(lookup_continuation(&[1, 2, 3], 3, 2).is_empty());
        assert!(lookup_continuation(&[], 1, 2).is_empty());
    }

    #[test]
    fn metal_spec_depth_follows_what_the_chain_holds() {
        // before any round: two drafts
        assert_eq!(metal_spec_depth(&SPEC_HOLD_PRIOR), 2);
        // a second draft that seldom holds is not worth its verify
        assert_eq!(metal_spec_depth(&[0.6, 0.15, 0.5, 0.5, 0.5, 0.5, 0.5]), 1);
        // predictable text fills the GEMM tile
        assert_eq!(metal_spec_depth(&[0.97; 7]), 7);
        // rounds of two drafts that both hold reach for a longer chain
        let mut h = SPEC_HOLD_PRIOR;
        let mut k = metal_spec_depth(&h);
        let mut rounds = 0;
        while k == 2 && rounds < 200 {
            spec_hold_update(&mut h, k, 2);
            k = metal_spec_depth(&h);
            rounds += 1;
        }
        assert!(k > 2 && rounds < 60, "depth {k} after {rounds} rounds");
        // ... and come back once the longer chain shows that a third never holds
        let mut back = 0;
        while k > 2 && back < 200 {
            spec_hold_update(&mut h, k, 2);
            k = metal_spec_depth(&h);
            back += 1;
        }
        assert!(k == 2 && back < 10, "depth {k} after {back} rounds");
        // most rounds of such text stay at two drafts
        let mut deep = 0;
        for _ in 0..400 {
            let k = metal_spec_depth(&h);
            deep += (k > 2) as usize;
            spec_hold_update(&mut h, k, 2);
        }
        assert!(deep < 40, "{deep} of 400 rounds went deeper");
        // a chain that holds one draft in two rounds of three, two in one of three: never deeper
        let mut h = SPEC_HOLD_PRIOR;
        for i in 0..300 {
            let k = metal_spec_depth(&h);
            assert!(k <= 2, "depth {k} at round {i}");
            spec_hold_update(&mut h, k, (i % 3).min(k));
        }
    }

    #[test]
    fn mtp_draft_shortlist_masks_unevaluated_vocab_rows() {
        use super::pad_mtp_draft_logits;

        let mut logits = vec![-3.0, -1.0, -2.0];
        pad_mtp_draft_logits(&mut logits, 6);
        assert_eq!(&logits[..3], &[-3.0, -1.0, -2.0]);
        assert!(logits[3..].iter().all(|&x| x == f32::NEG_INFINITY));
        assert_eq!(
            logits
                .iter()
                .enumerate()
                .max_by(|(_, a), (_, b)| a.total_cmp(b))
                .map(|(i, _)| i),
            Some(1),
            "an unevaluated row cannot win an all-negative shortlist"
        );
    }

    #[test]
    fn speculative_trial_fast_exits_after_three_zero_acceptance_rounds() {
        use super::{Pipeline, SpecMon, SpecTrial};

        let mut mon = SpecMon::default();
        let start = std::time::Instant::now();
        mon.round(1.0, 1);
        let first = Pipeline::spec_trial_round(
            SpecTrial::Spec {
                t0: start,
                gen0: 0,
                rounds: 0,
            },
            &mut mon,
            1,
        );
        assert!(matches!(first, SpecTrial::Spec { rounds: 1, .. }));

        // Two empty rounds in a row happen to a good head: the trial goes on.
        mon.round(1.0, 1);
        let second = Pipeline::spec_trial_round(first, &mut mon, 2);
        assert!(
            matches!(second, SpecTrial::Spec { rounds: 2, .. }),
            "two empty rounds are not evidence enough to leave the drafts"
        );
        mon.round(1.0, 1);
        let third = Pipeline::spec_trial_round(second, &mut mon, 3);
        assert!(
            matches!(third, SpecTrial::Plain { gen0: 3, .. }),
            "three verifier-tip-only rounds must stop the losing MTP trial"
        );
        // A plain decision on three rounds is tried again soon.
        assert_eq!(mon.recheck_plain_at(3), 3 + super::SPEC_RECHECK_THIN);

        // One successful draft resets the streak, so a viable head retains
        // the normal five-round measurement budget.
        let mut viable = SpecMon::default();
        viable.round(1.0, 1);
        viable.round(1.0, 2);
        let continued = Pipeline::spec_trial_round(
            SpecTrial::Spec {
                t0: start,
                gen0: 0,
                rounds: 1,
            },
            &mut viable,
            3,
        );
        assert!(matches!(continued, SpecTrial::Spec { rounds: 2, .. }));
    }

    #[test]
    fn fresh_mtp_request_does_not_inherit_full_head_streak() {
        let mut p = spark_test_pipeline(None);
        let head_rows = 248_070;
        p.draft_full_streak = 7;
        assert_eq!(p.draft_head_rows(head_rows), head_rows);

        p.reset_fresh_mtp_draft_state();
        assert_eq!(
            p.draft_head_rows(head_rows),
            super::Pipeline::draft_vocab_rows(head_rows),
            "a fresh request returns to its configured shortlist"
        );

        // A high-id first token of the NEW request still restores the
        // full-head protection immediately.
        p.note_draft_id(u32::MAX);
        assert_eq!(p.draft_head_rows(head_rows), head_rows);
    }

    #[test]
    fn native_metal_batch_spec_defaults_on_over_a_q4tp_trunk() {
        use super::graph_spec_wanted_by_policy;

        // A default-eligible (q4tp trunk) native Metal model drafts unless
        // told not to; any value other than 0/1 means the default there.
        assert!(graph_spec_wanted_by_policy(None, true, false, false, true));
        assert!(graph_spec_wanted_by_policy(
            Some("anything-but-1"),
            true,
            false,
            false,
            true,
        ));
        // A trunk outside the default (not q4tp) stays plain until asked.
        assert!(!graph_spec_wanted_by_policy(None, false, false, false, true));
        assert!(!graph_spec_wanted_by_policy(
            Some("anything-but-1"),
            false,
            false,
            false,
            true,
        ));
        assert!(graph_spec_wanted_by_policy(
            Some("1"),
            false,
            true,
            false,
            true,
        ));
        assert!(!graph_spec_wanted_by_policy(
            Some("0"),
            true,
            false,
            false,
            true,
        ));

        // Do not regress the established discrete/wgpu policy while closing
        // the native-Metal quality gate.
        assert!(graph_spec_wanted_by_policy(None, true, false, false, false));
        assert!(graph_spec_wanted_by_policy(
            Some("legacy-force"),
            false,
            true,
            true,
            false,
        ));
    }

    #[test]
    fn encoder_hidden_states_are_normalized_and_reusable() {
        let mut p = super::create_test_pipeline(8, 12, 2, 1, 4, 2, 32);
        let ids = [1, 7, 11, 19];

        let first = p.encode_hidden_states(&ids).expect("encoder forward");
        let second = p
            .encode_hidden_states(&ids)
            .expect("reusable encoder forward");
        assert_eq!(first.len(), ids.len() * 8);
        assert!(first.iter().all(|v| v.is_finite()));
        assert_eq!(
            first, second,
            "encoder forward must start from a fresh state"
        );

        // An encoder call must not leave stale KV/GDN state behind for the
        // regular generative API sharing the same Pipeline implementation.
        assert!(p.forward_ids(&ids, None).is_ok());
    }

    /// The 0.7.6 prefill-chunk rule: a plain dense stack wholly on a
    /// discrete card reads the prompt in wide chunks on x86; every other
    /// case keeps the width it had (the GDN-hybrid, MoE and DeepSeek paths
    /// were tuned on hardware not measured for this change).
    #[test]
    fn prefill_chunk_rule_widens_only_dense_on_discrete() {
        use super::{ChunkHost, ChunkStackFacts, DISCRETE_DENSE_PREFILL_CHUNK, prefill_chunk_rule};
        let dense_card = ChunkStackFacts {
            plain_dense: true,
            discrete: true,
            gpu_on: true,
            ..Default::default()
        };
        assert!(dense_card.dense_on_discrete());
        // The bug: a dense Llama on a Vulkan RTX 3090 got 48.
        assert_eq!(
            prefill_chunk_rule(None, ChunkHost::Other, dense_card.dense_on_discrete()),
            DISCRETE_DENSE_PREFILL_CHUNK
        );
        assert!(DISCRETE_DENSE_PREFILL_CHUNK > 48);
        for (label, facts) in [
            (
                "GDN hybrid / MoE / DeepSeek stack",
                ChunkStackFacts {
                    plain_dense: false,
                    ..dense_card
                },
            ),
            (
                "integrated GPU",
                ChunkStackFacts {
                    discrete: false,
                    ..dense_card
                },
            ),
            (
                "CPU only",
                ChunkStackFacts {
                    gpu_on: false,
                    discrete: false,
                    ..dense_card
                },
            ),
            (
                "capacity split",
                ChunkStackFacts {
                    capacity_split: true,
                    ..dense_card
                },
            ),
            (
                "multi-GPU plan",
                ChunkStackFacts {
                    multi_gpu: true,
                    ..dense_card
                },
            ),
            (
                "O(1) layers",
                ChunkStackFacts {
                    o1: true,
                    ..dense_card
                },
            ),
        ] {
            assert!(!facts.dense_on_discrete(), "{label}");
            assert_eq!(
                prefill_chunk_rule(None, ChunkHost::Other, facts.dense_on_discrete()),
                48,
                "{label} keeps the historical x86 chunk"
            );
        }
        // Other hosts are untouched whatever the model.
        for dense in [false, true] {
            assert_eq!(prefill_chunk_rule(None, ChunkHost::Macos, dense), 512);
            assert_eq!(prefill_chunk_rule(None, ChunkHost::Aarch64, dense), 256);
        }
        // CMF_PREFILL_CHUNK still wins everywhere (and is clamped to ≥ 1).
        for host in [ChunkHost::Macos, ChunkHost::Aarch64, ChunkHost::Other] {
            for dense in [false, true] {
                assert_eq!(prefill_chunk_rule(Some(48), host, dense), 48);
                assert_eq!(prefill_chunk_rule(Some(0), host, dense), 1);
            }
        }
    }

    #[test]
    fn kv_reuse_plan_pulls_rows_decode_wrote_only_on_the_device() {
        use super::{ReuseLayer, ReusePlan, kv_reuse_plan};
        let full = |host_rows, device_rows| ReuseLayer {
            full: true,
            host_rows,
            device_rows,
            device_state: false,
        };
        // Turn 1: 300-token prompt prefilled on the host, 40 tokens decoded
        // by the wgpu graph into the device mirror only. Turn 2 reuses 339.
        assert_eq!(
            kv_reuse_plan(339, &[full(300, Some(339)), full(300, Some(339))]),
            ReusePlan::Pull(vec![(0, 300, 339), (1, 300, 339)])
        );
        // CPU / Metal: the host owner already holds every forwarded row.
        assert_eq!(kv_reuse_plan(339, &[full(339, None)]), ReusePlan::Ready);
        // A mirror past the prefix is fine for the host (it gets rewound).
        assert_eq!(
            kv_reuse_plan(339, &[full(339, Some(345))]),
            ReusePlan::Ready
        );
        // GPU prefix / CPU tail: only the device layers lag.
        assert_eq!(
            kv_reuse_plan(339, &[full(300, Some(339)), full(339, None)]),
            ReusePlan::Pull(vec![(0, 300, 339)])
        );
        // The device cannot supply the missing rows: never continue.
        assert_eq!(
            kv_reuse_plan(339, &[full(300, Some(320))]),
            ReusePlan::Fresh
        );
        assert_eq!(kv_reuse_plan(339, &[full(300, None)]), ReusePlan::Fresh);
        assert_eq!(kv_reuse_plan(339, &[full(350, None)]), ReusePlan::Fresh);
        // A recurrent state advanced on the device cannot be handed to a
        // host prefill (it is not rewindable and the host copy is stale).
        let conv = |device_state| ReuseLayer {
            full: false,
            host_rows: 0,
            device_rows: None,
            device_state,
        };
        assert_eq!(
            kv_reuse_plan(339, &[conv(true), full(300, Some(339))]),
            ReusePlan::Fresh
        );
        assert_eq!(
            kv_reuse_plan(339, &[conv(false), full(339, None)]),
            ReusePlan::Ready
        );
    }

    #[test]
    fn nll_graph_policy_scopes_only_the_fused_head() {
        for (label, unmasked, prefer_graph, native_metal, want_graph, want_head) in [
            // A Vulkan/Wgpu hidden-only graph remains the quality route.
            ("vulkan graph", true, true, false, true, false),
            // Native Metal adds the strict fused graph-head contract.
            ("native Metal graph", true, true, true, true, true),
            // Masked NLL and the explicit non-graph fallback remain unchanged.
            ("masked", false, true, false, false, false),
            ("graph disabled", true, false, true, false, false),
        ] {
            let (graph_quality, graph_head_required) =
                super::nll_graph_policy(unmasked, prefer_graph, native_metal);
            assert_eq!(graph_quality, want_graph, "{label}: graph quality");
            assert_eq!(graph_head_required, want_head, "{label}: fused head");
        }
    }

    #[test]
    fn mtp_prefill_pair_boundaries_skip_only_final_prompt_row() {
        assert_eq!(mtp_prefill_pair_count(0, 128, 256), 128);
        assert_eq!(mtp_prefill_pair_count(128, 256, 256), 127);
        assert_eq!(mtp_prefill_pair_count(0, 256, 256), 255);
        assert_eq!(mtp_prefill_pair_count(256, 256, 256), 0);
        assert_eq!(mtp_prefill_pair_count(300, 320, 256), 0);
    }

    #[test]
    fn cancel_flag_stops_generation() {
        let mut p = create_test_pipeline(16, 32, 2, 2, 8, 2, 32);
        // Set before the call: the prefill loops honour it, the run
        // returns immediately with the cancelled reason and no tokens.
        p.cancel.store(true, std::sync::atomic::Ordering::Relaxed);
        let r = p.generate_from_ids(&[1, 2, 3], 8, None, None).unwrap();
        assert_eq!(r.finish_reason, "cancelled");
        assert!(
            r.token_ids.is_empty(),
            "no tokens after cancel: {:?}",
            r.token_ids
        );
        assert_eq!(p.kv_cache.seq_len(), 0);
        assert!(p.kv_history.is_empty());
        assert!(!p.graph_want_logits);
        assert!(p.graph_logits.is_none());
        // Flag auto-cleared: the next call generates normally.
        let r2 = p.generate_from_ids(&[1, 2, 3], 4, None, None).unwrap();
        assert_ne!(r2.finish_reason, "cancelled");
    }
    use super::*;

    #[test]
    fn minimax_m3_arch_selects_checked_oai_activation_only() {
        // Keep this fixture minimal: `Act::from_arch_full` needs only the
        // architecture id and activation name, while serde supplies stable
        // defaults for unrelated CMF fields.
        let arch = |arch_name: &str, hidden_act: &str| {
            serde_json::from_value::<cortiq_core::ModelArch>(serde_json::json!({
                "arch_name": arch_name,
                "hidden_size": 8,
                "intermediate_size": 16,
                "num_layers": 1,
                "num_attention_heads": 1,
                "num_kv_heads": 1,
                "head_dim": 8,
                "vocab_size": 16,
                "layer_types": ["FullAttention"],
                "rms_norm_eps": 1e-6,
                "max_position_embeddings": 16,
                "hidden_act": hidden_act
            }))
            .expect("minimal architecture")
        };
        let minimax = arch("minimax_m3_vl", "swigluoai");
        assert_eq!(
            Act::from_arch_full(&minimax),
            Act::SwiGluOai {
                alpha: 1.702,
                limit: 7.0,
            }
        );

        // The same spelling must not turn into MiniMax math on a generic
        // model.  Only the source-validated M3 architecture owns it.
        let unrelated = arch("qwen2", "swigluoai");
        assert_eq!(Act::from_arch_full(&unrelated), Act::Silu);

        // Conversely, an M3-tagged header with a normal activation keeps the
        // normal path; this prevents the architecture id from overriding the
        // explicit serialized contract.
        let non_oai = arch("minimax_m3_vl", "gelu");
        assert_eq!(Act::from_arch_full(&non_oai), Act::Gelu);
    }

    #[test]
    fn minimax_swiglu_oai_act_matches_scalar_contract() {
        let act = Act::swiglu_oai(1.702, 7.0);
        let got = act.combine(10.0, -10.0);
        let expected = crate::inference::swiglu_oai(10.0, -10.0, 1.702, 1.0, Some(7.0));
        assert!((got - expected).abs() < 1e-6);
        assert_eq!(act.graph_act(), None, "no inexact generic graph fallback");
        assert_eq!(
            act.wgpu_graph_act(),
            Some(crate::gpu::GraphAct::SwiGluOaiM3),
            "the WGPU-only arm accepts only the frozen M3 constants"
        );
        assert_eq!(
            Act::swiglu_oai(1.701, 7.0).wgpu_graph_act(),
            None,
            "nearby OAI constants must not borrow MiniMax's kernel"
        );
        assert_eq!(
            act.moe_job_graph_contract(),
            Some((crate::gpu::GraphAct::SwiGluOaiM3, 7.0)),
            "the direct MoE path carries the frozen clamp with the marker"
        );
        assert_eq!(
            Act::swiglu_oai(1.702, 6.999).moe_job_graph_contract(),
            None,
            "a nearby clamp must not borrow MiniMax's device contract"
        );

        // `apply` is the gate half only; `combine` owns the up clamp and
        // +1 offset. The two must not accidentally collapse to ordinary SiLU.
        let gate_only = act.apply(-10.0);
        let expected_gate = -10.0 / (1.0 + (17.02f32).exp());
        assert!((gate_only - expected_gate).abs() < 1e-10);
    }

    #[test]
    fn explicit_sliding_schedule_selects_local_rope_profile() {
        // Mellum alternates three local 1,024-token layers with one global
        // YaRN layer.  An explicit schedule deliberately overrides the
        // cadence sentinel in `swa`, so test both RoPE table and scale
        // dispatch rather than merely checking that the metadata loaded.
        let mut p = create_test_pipeline(32, 64, 4, 1, 8, 4, 32);
        p.swa = Some((1024, usize::MAX));
        p.sliding_layers = Some(vec![true, true, true, false]);
        p.inv_freq = std::sync::Arc::new(vec![0.125; 4]);
        p.inv_freq_local = Some(std::sync::Arc::new(vec![0.25; 4]));
        p.rope_scale = 1.277_258_9;
        p.rope_scale_local = 1.0;

        for li in 0..3 {
            assert_eq!(p.layer_window(li), Some(1024), "local layer {li}");
            assert_eq!(p.layer_inv_freq(li).as_slice(), &[0.25; 4]);
            assert_eq!(p.layer_rope_scale(li), 1.0, "local layer {li}");
        }
        assert_eq!(p.layer_window(3), None);
        assert_eq!(p.layer_inv_freq(3).as_slice(), &[0.125; 4]);
        assert_eq!(p.layer_rope_scale(3), 1.277_258_9);
    }

    /// sparse_ffn_quant must equal a dense FFN where inactive neurons are
    /// zeroed (mask × mmap correctness). On F32 tensors this is EXACT —
    /// it validates the row_dot / add_col_scaled / scatter indexing, the
    /// bug-prone part. The q8 branches reuse the golden-tested linear
    /// The per-token sparse path reads a transposed `down`; it must
    /// agree with the arm that computes everything and zeroes the
    /// losers, or the speed measurement is measuring a different model.
    #[test]
    fn dynamic_ffn_equals_the_zeroing_arm() {
        let (hidden, inter) = (8usize, 32usize);
        let synth = |n: usize, salt: usize| -> Vec<f32> {
            (0..n)
                .map(|i| (((i * 29 + salt * 13 + 7) % 89) as f32 / 89.0 - 0.5) * 0.6)
                .collect()
        };
        let down = synth(hidden * inter, 3);
        let mut down_t = vec![0.0f32; inter * hidden];
        for r in 0..hidden {
            for c in 0..inter {
                down_t[c * hidden + r] = down[r * inter + c];
            }
        }
        let d = DenseFfn {
            gate_proj: QTensor::from_f32(synth(inter * hidden, 1), inter, hidden),
            up_proj: QTensor::from_f32(synth(inter * hidden, 2), inter, hidden),
            down_proj: QTensor::from_f32(down.clone(), hidden, inter),
            act: Act::Silu,
            down_t: Some(QTensor::from_f32(down_t, inter, hidden)),
            segs: Vec::new(),
        };
        let x = synth(hidden, 11);
        let k = 12usize;
        let got = dense_ffn_dynamic(&d, &x, None, k).expect("down_t present");
        // Reference: full compute, keep the k loudest |silu(gate)|.
        let mut g = vec![0.0f32; inter];
        d.gate_proj.matvec(&x, &mut g, None);
        let mut u = vec![0.0f32; inter];
        d.up_proj.matvec(&x, &mut u, None);
        for v in g.iter_mut() {
            *v = inference::silu(*v);
        }
        keep_top_k(&mut g, k);
        for i in 0..inter {
            g[i] *= u[i];
        }
        let mut want = vec![0.0f32; hidden];
        d.down_proj.matvec(&g, &mut want, None);
        for (a, b) in want.iter().zip(&got) {
            assert!((a - b).abs() < 1e-5, "dynamic {b} vs reference {a}");
        }
    }

    /// A tube layer is the same layer, re-cut. With every tube open the
    /// answer must equal the dense FFN over the concatenated neurons
    /// (the permutation is an identity on the layer's function); with a
    /// tube closed it must equal the dense FFN with those neurons
    /// zeroed — the mask semantics, now paid for in bytes not read.
    #[test]
    fn tube_ffn_open_equals_dense_and_closed_equals_masked() {
        let (hidden, core, tube) = (8usize, 12usize, 8usize);
        let inter = core + tube;
        let synth = |n: usize, salt: usize| -> Vec<f32> {
            (0..n)
                .map(|i| (((i * 41 + salt * 17 + 5) % 97) as f32 / 97.0 - 0.5) * 0.5)
                .collect()
        };
        let (g_all, u_all) = (synth(inter * hidden, 1), synth(inter * hidden, 2));
        let d_all = synth(hidden * inter, 3);
        // The dense layer, and the same weights cut into core + tube.
        let dense = DenseFfn {
            gate_proj: QTensor::from_f32(g_all.clone(), inter, hidden),
            up_proj: QTensor::from_f32(u_all.clone(), inter, hidden),
            down_proj: QTensor::from_f32(d_all.clone(), hidden, inter),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let rows =
            |v: &[f32], a: usize, b: usize| -> Vec<f32> { v[a * hidden..b * hidden].to_vec() };
        let cols = |v: &[f32], a: usize, b: usize| -> Vec<f32> {
            let mut o = Vec::with_capacity(hidden * (b - a));
            for r in 0..hidden {
                o.extend_from_slice(&v[r * inter + a..r * inter + b]);
            }
            o
        };
        let tubed = DenseFfn {
            down_t: None,
            gate_proj: QTensor::from_f32(rows(&g_all, 0, core), core, hidden),
            up_proj: QTensor::from_f32(rows(&u_all, 0, core), core, hidden),
            down_proj: QTensor::from_f32(cols(&d_all, 0, core), hidden, core),
            act: Act::Silu,
            segs: vec![FfnSeg {
                gate: QTensor::from_f32(rows(&g_all, core, inter), tube, hidden),
                up: QTensor::from_f32(rows(&u_all, core, inter), tube, hidden),
                down: QTensor::from_f32(cols(&d_all, core, inter), hidden, tube),
                start: core,
                width: tube,
            }],
        };
        let x = synth(hidden, 7);
        let want = dense_ffn(&dense, &x, None);
        let got = tube_ffn(&tubed, &x, 1, None, None);
        for (a, b) in want.iter().zip(&got) {
            assert!((a - b).abs() < 1e-5, "open tube: {a} vs {b}");
        }
        // Closed tube: bits on for the core, off for the tube.
        let mut bits = vec![0u8; inter.div_ceil(8)];
        for n in 0..core {
            bits[n / 8] |= 1 << (n % 8);
        }
        let closed = tube_ffn(&tubed, &x, 1, None, Some(&bits));
        let masked = dense_ffn_masked(&dense, &x, None, &bits);
        for (a, b) in masked.iter().zip(&closed) {
            assert!((a - b).abs() < 1e-5, "closed tube: {a} vs {b}");
        }
        // The batched arm must agree with the single-position one.
        let batch = tube_ffn(&tubed, &x, 1, None, Some(&bits));
        for (a, b) in closed.iter().zip(&batch) {
            assert_eq!(a, b, "batch arm disagrees with decode arm");
        }
    }

    /// scale, structurally identical to the matvec kernels.
    #[test]
    fn sparse_ffn_quant_equals_dense_with_inactive_zeroed() {
        let (hidden, inter) = (16usize, 40usize);
        let synth = |n: usize, salt: usize| -> Vec<f32> {
            (0..n)
                .map(|i| (((i * 37 + salt * 11 + 3) % 101) as f32 / 101.0 - 0.5) * 0.4)
                .collect()
        };
        let d = DenseFfn {
            gate_proj: QTensor::from_f32(synth(inter * hidden, 1), inter, hidden),
            up_proj: QTensor::from_f32(synth(inter * hidden, 2), inter, hidden),
            down_proj: QTensor::from_f32(synth(hidden * inter, 3), hidden, inter),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let x = synth(hidden, 9);
        // Active = every 3rd neuron.
        let active: Vec<u16> = (0..inter as u16).filter(|i| i % 3 == 0).collect();

        let sparse = sparse_ffn_quant(&d, &x, &active, hidden, None);

        // Reference: full dense FFN but g[i]=0 for inactive neurons.
        let mut g = vec![0.0f32; inter];
        d.gate_proj.matvec(&x, &mut g, None);
        let mut u = vec![0.0f32; inter];
        d.up_proj.matvec(&x, &mut u, None);
        let act_set: std::collections::HashSet<u16> = active.iter().copied().collect();
        for i in 0..inter {
            g[i] = if act_set.contains(&(i as u16)) {
                inference::silu(g[i]) * u[i]
            } else {
                0.0
            };
        }
        let mut reference = vec![0.0f32; hidden];
        d.down_proj.matvec(&g, &mut reference, None);

        let max_d = sparse
            .iter()
            .zip(&reference)
            .map(|(a, b)| (a - b).abs())
            .fold(0.0f32, f32::max);
        assert!(max_d < 1e-5, "sparse != dense-zeroed: max|Δ| = {max_d}");
    }

    /// Attach a synthetic MTP head. `inter` deliberately stays independent
    /// from the trunk width so calibration tests can catch a trunk-proxy bug.
    fn attach_test_mtp_width(p: &mut Pipeline, inter: usize) {
        let (h, inter, heads, kv, hd) = (
            p.hidden_size,
            inter,
            p.num_heads,
            p.num_kv_heads,
            p.head_dim,
        );
        let synth = |n: usize, salt: usize| -> Vec<f32> {
            (0..n)
                .map(|i| (((i * 29 + salt * 23 + 5) % 101) as f32 / 101.0 - 0.5) * 0.2)
                .collect()
        };
        let qt = |rows: usize, cols: usize, salt: usize| -> QTensor {
            QTensor::from_f32(synth(rows * cols, salt), rows, cols)
        };
        p.mtp = Some(MtpModule {
            enorm: vec![1.0; h],
            hnorm: vec![1.0; h],
            eh_proj: qt(h, 2 * h, 301),
            layer: LayerWeights {
                input_norm: vec![1.0; h],
                post_norm: vec![1.0; h],
                attn_out_norm: None,
                ffn_out_norm: None,
                layer_scale: None,
                ffn: FfnKind::Dense(DenseFfn {
                    gate_proj: qt(inter, h, 315),
                    up_proj: qt(inter, h, 316),
                    down_proj: qt(h, inter, 317),
                    act: Act::Silu,
                    down_t: None,
                    segs: Vec::new(),
                }),
                attn: AttnKind::Full {
                    bias: None,
                    wq: qt(heads * hd, h, 311),
                    wk: qt(kv * hd, h, 312),
                    wv: qt(kv * hd, h, 313),
                    wo: qt(h, heads * hd, 314),
                    q_norm: None,
                    k_norm: None,
                    output_gate: false,
                    softplus_gate: None,
                },
            },
            final_norm: vec![1.0; h],
            kv: crate::kv_cache::LayerKvCache::new(kv, hd),
        });
    }

    /// Attach a synthetic MTP head with the trunk's conventional width.
    fn attach_test_mtp(p: &mut Pipeline) {
        attach_test_mtp_width(p, p.intermediate_size);
    }

    #[test]
    fn canonical_mtp_ffn_probe_uses_draft_width_and_cleans_state() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 64);
        // This differs from the trunk FFN width (16). A result shaped like
        // the trunk probe would be a silent, dangerous compaction bug.
        attach_test_mtp_width(&mut p, 11);
        let ids = [3, 9, 4, 12, 7, 2];
        let trunk = p.probe_ffn_mass(&ids);
        assert_eq!(trunk[0].len(), p.intermediate_size);

        let got = p.probe_mtp_ffn(&ids).expect("canonical MTP probe");
        assert_eq!(got.len(), 1);
        assert_eq!(got[0].mass.len(), 11);
        assert_eq!(got[0].squared_mass.len(), 11);
        assert_eq!(got[0].observed_positions, ids.len() - 1);
        assert!(got[0].mass.iter().any(|&v| v > 0.0));
        assert!(got[0]
            .mass
            .iter()
            .zip(&got[0].squared_mass)
            .all(|(&m, &s)| m.is_finite() && s.is_finite() && m >= 0.0 && s >= 0.0));
        assert_eq!(p.kv_cache.seq_len(), 0, "probe must leave a fresh trunk");
        assert_eq!(p.mtp.as_ref().unwrap().kv.seq_len, 0, "and fresh MTP KV");

        // Force an error *after* the MTP attention has appended a draft KV
        // row. This proves the error path clears detached draft state, not
        // merely the easy invalid-token preflight branch.
        let h = p.hidden_size;
        let FfnKind::Dense(dense) = &mut p.mtp.as_mut().unwrap().layer.ffn else {
            panic!("synthetic MTP must be dense")
        };
        dense.segs.push(FfnSeg {
            gate: QTensor::from_f32(vec![0.0; h], 1, h),
            up: QTensor::from_f32(vec![0.0; h], 1, h),
            down: QTensor::from_f32(vec![0.0; h], h, 1),
            start: dense.gate_proj.rows(),
            width: 1,
        });
        let err = p.probe_mtp_ffn(&ids);
        assert!(err
            .unwrap_err()
            .contains("tube-segmented draft FFNs are not supported"));
        assert_eq!(p.kv_cache.seq_len(), 0);
        assert_eq!(p.mtp.as_ref().unwrap().kv.seq_len, 0);
    }

    #[test]
    fn speculative_equals_vanilla_greedy() {
        let _env_lock = MTP_ENV_LOCK.lock().unwrap_or_else(|e| e.into_inner());
        // Exercise the experimental host pair deterministically; the native
        // and wgpu batch graphs have independent coverage.
        let _env = ScopedTestEnv::set(&[
            ("CMF_GPU", Some("0")),
            ("CMF_GPU_WGPU_GRAPH", Some("0")),
            ("CMF_MTP_PAIR", Some("1")),
        ]);
        let run = |spec: bool| {
            let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
            p.sampler_config.temperature = 0.0;
            attach_test_mtp(&mut p);
            p.speculative = spec;
            let r = p.generate("abcdef", 12, None, None).unwrap();
            (r.token_ids, r.mtp_drafted, r.mtp_accepted)
        };
        let (vanilla, d0, _) = run(false);
        let (spec, d1, a1) = run(true);
        assert_eq!(d0, 0, "vanilla path must not draft");
        assert!(d1 > 0, "speculative path must draft");
        assert!(a1 <= d1, "accepted drafts cannot exceed proposals");
        assert_eq!(
            vanilla, spec,
            "speculative must reproduce the exact greedy sequence (accepted {a1}/{d1})"
        );
    }

    #[test]
    fn speculative_accepts_constant_oracle() {
        let _env_lock = MTP_ENV_LOCK.lock().unwrap_or_else(|e| e.into_inner());
        let _env = ScopedTestEnv::set(&[
            ("CMF_GPU", Some("0")),
            ("CMF_GPU_WGPU_GRAPH", Some("0")),
            ("CMF_MTP_PAIR", Some("1")),
        ]);
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.sampler_config.temperature = 0.0;
        p.sampler_config.repetition_penalty = 1.0;
        // Constant lm_head → every logit equal → both the main model and
        // the draft head argmax to token 0: acceptance must be 100%.
        p.weights.lm_head = QTensor::from_f32(vec![0.01; 64 * 8], 64, 8);
        attach_test_mtp(&mut p);
        p.speculative = true;
        let r = p.generate("abcd", 10, None, None).unwrap();
        assert!(r.mtp_drafted > 0);
        assert_eq!(
            r.mtp_accepted, r.mtp_drafted,
            "constant logits → every draft accepted"
        );
        // Ties resolve to the same token in both the main and draft
        // heads — the sequence is one repeated token.
        assert!(r.token_ids.windows(2).all(|w| w[0] == w[1]));
    }

    #[test]
    fn host_fused_mtp_pair_is_opt_in() {
        let _env_lock = MTP_ENV_LOCK.lock().unwrap_or_else(|e| e.into_inner());
        let _env = ScopedTestEnv::set(&[
            ("CMF_GPU", Some("0")),
            ("CMF_GPU_WGPU_GRAPH", Some("0")),
            ("CMF_MTP_PAIR", None),
        ]);
        let run = |spec: bool| {
            let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
            p.sampler_config.temperature = 0.0;
            attach_test_mtp(&mut p);
            p.speculative = spec;
            let r = p.generate("abcdef", 12, None, None).unwrap();
            (r.token_ids, r.mtp_drafted, r.mtp_accepted)
        };
        let (plain, d0, _) = run(false);
        let (guarded, d1, a1) = run(true);
        assert_eq!(d0, 0);
        assert_eq!(d1, 0, "host MTP pair must remain opt-in");
        assert_eq!(a1, 0);
        assert_eq!(guarded, plain, "the safe default is ordinary greedy decode");
    }

    #[test]
    fn empty_prompt_is_an_error_not_a_panic() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 260);
        let r = p.generate("", 4, None, None);
        assert!(r.is_err(), "empty prompt must be a clean error");
    }

    #[test]
    fn every_token_enters_kv_exactly_once() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
        // Greedy so no RNG variance; byte tokenizer → 3 prompt tokens.
        p.sampler_config.temperature = 0.0;
        let r = p.generate("abc", 2, None, None).unwrap();
        assert_eq!(r.prompt_tokens, 3);
        // prompt(3) + first sampled token forwarded before second logits:
        // step0 samples from prefill hidden (no extra forward), then
        // forwards t1 → cache 4; step1 samples, loop ends (max_tokens).
        assert_eq!(
            p.kv_cache.seq_len(),
            3 + r.tokens_generated - 1,
            "each token must be cached exactly once (v1 cached the last prompt token twice)"
        );
    }

    #[test]
    fn generation_is_reproducible_with_seed() {
        let run = || {
            let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
            p.generate("hello", 8, None, None).unwrap().token_ids
        };
        assert_eq!(run(), run());
    }

    #[test]
    fn resetting_sampler_restarts_the_seeded_stream() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
        let config = SamplerConfig {
            seed: Some(1234),
            ..SamplerConfig::default()
        };
        p.set_sampler_config(config.clone());
        let first = p.generate("hello", 8, None, None).unwrap().token_ids;
        p.set_sampler_config(config);
        let second = p.generate("hello", 8, None, None).unwrap().token_ids;
        assert_eq!(first, second);
    }

    #[test]
    fn eviction_bounds_the_cache() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 260);
        p.kv_cache.max_seq_len = 6;
        p.sampler_config.temperature = 0.0;
        let _ = p.generate("abcd", 12, None, None).unwrap();
        assert!(
            p.kv_cache.seq_len() <= 6 + 1,
            "cache must stay bounded by max_seq_len (got {})",
            p.kv_cache.seq_len()
        );
    }

    #[test]
    fn confidence_matches_tokens_and_is_a_probability() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.sampler_config.temperature = 0.0;
        p.sampler_config.repetition_penalty = 1.0;
        let r = p.generate("abcd", 10, None, None).unwrap();
        assert_eq!(
            r.token_confidence.len(),
            r.token_ids.len(),
            "one confidence per emitted token"
        );
        for &c in &r.token_confidence {
            assert!((0.0..=1.0).contains(&c), "confidence out of [0,1]: {c}");
        }
        // top1_prob is a valid softmax probability.
        let logits = [1.0f32, 3.0, 0.5, 3.0];
        let p0 = top1_prob_t(&logits, 1, 1.0);
        let p1 = top1_prob_t(&logits, 3, 1.0);
        assert!((p0 - p1).abs() < 1e-6, "equal logits → equal prob");
        assert!(p0 > 0.0 && p0 < 1.0);
        // Calibration temperature > 1 softens an over-confident peak.
        let sharp = top1_prob_t(&logits, 1, 1.0);
        let soft = top1_prob_t(&logits, 1, 2.0);
        assert!(soft < sharp, "higher temperature lowers peak confidence");
    }

    #[test]
    fn trace_is_opt_in_and_parallels_the_output() {
        // Off by default: the runtime is silent unless observation asked.
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.sampler_config.temperature = 0.0;
        p.sampler_config.repetition_penalty = 1.0;
        let r = p.generate("abcd", 10, None, None).unwrap();
        assert!(r.traces.is_empty(), "trace must be empty unless enabled");

        // On: exactly one row per emitted token, aligned with the output.
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.sampler_config.temperature = 0.0;
        p.sampler_config.repetition_penalty = 1.0;
        p.set_trace(true);
        let r = p.generate("abcd", 10, None, None).unwrap();
        assert_eq!(r.traces.len(), r.token_ids.len(), "one trace row per token");
        for (i, tr) in r.traces.iter().enumerate() {
            assert_eq!(tr.t, i, "trace index is sequential");
            assert_eq!(tr.token_id, r.token_ids[i], "trace token_id matches output");
            assert_eq!(
                tr.confidence, r.token_confidence[i],
                "trace confidence matches the confidence channel"
            );
            // No dynamic router in this pipeline → no skill, no coherence.
            assert!(tr.active_skill.is_none() && tr.recon.is_none() && !tr.switched);
        }
    }

    #[test]
    fn explain_prefill_logits_match_greedy_first_token() {
        // `cortiq explain` shows the next-token distribution from
        // prefill_next_logits; its argmax must equal what greedy generate
        // actually emits first — otherwise explain would lie.
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.sampler_config.temperature = 0.0;
        p.sampler_config.repetition_penalty = 1.0;
        let ids = p.tokenizer.encode("abcd");
        let logits = p.prefill_next_logits(&ids, None);
        let argmax = logits
            .iter()
            .enumerate()
            .max_by(|a, b| a.1.partial_cmp(b.1).unwrap())
            .unwrap()
            .0 as u32;
        let r = p.generate("abcd", 1, None, None).unwrap();
        assert_eq!(
            argmax, r.token_ids[0],
            "explain preview must match greedy emit"
        );
    }

    #[test]
    fn laguna_shared_expert_is_unconditionally_added() {
        let matrix = |values: Vec<f32>| QTensor::from_f32(values, 2, 2);
        let identity = || matrix(vec![1.0, 0.0, 0.0, 1.0]);
        let zero_dense = || DenseFfn {
            gate_proj: matrix(vec![0.0; 4]),
            up_proj: matrix(vec![0.0; 4]),
            down_proj: matrix(vec![0.0; 4]),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let shared = DenseFfn {
            gate_proj: identity(),
            up_proj: identity(),
            down_proj: identity(),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let x = [1.0, 2.0];
        let expected = dense_ffn(&shared, &x, None);
        let moe = MoeFfn {
            router: QTensor::from_f32(vec![0.0, 0.0], 1, 2),
            experts: vec![zero_dense()],
            top_k: 1,
            norm_topk_prob: true,
            router_sigmoid: true,
            sigmoid_denom_eps: 1e-6,
            expert_bias: None,
            routed_scaling: 1.0,
            route_tau: None,
            shared: Some((shared, None)),
            stats: std::cell::RefCell::new(Vec::new()),
            act_sq: std::cell::RefCell::new(Vec::new()),
            act_rows: std::cell::RefCell::new(Vec::new()),
            mask: None,
            per_expert_scale: None,
            router_input_norm: false,
            resonance: None,
            grown: Vec::new(),
        };
        let actual = moe_ffn_cpu(&moe, &x, &[0], &[0.0], 1.0, None);
        for (actual, expected) in actual.iter().zip(expected) {
            assert!((actual - expected).abs() < 1e-6);
        }
    }

    /// A tiny MiMo-V2-shaped stack (the M3 fixture): layers [full, sliding,
    /// sliding, full]; 4 Q heads over 1 (full) / 2 (sliding) KV heads;
    /// head_dim 8 with 4-wide V heads; partial rotary 4 at θ 1e7 (full) /
    /// 1e4 (sliding); window 3; learned sinks on the sliding layers; layer
    /// 0 a dense FFN, layers 1..3 sigmoid-routed MoE with a selection bias
    /// (4 experts, top-2, renormalized, no shared expert). Geometry and
    /// sinks go through the same `set_attn_geometry` / `set_layer_sinks`
    /// the loader calls.
    fn mimo_test_pipeline() -> Pipeline {
        let (hs, inter, nh, hd, vd, vocab) = (16usize, 24usize, 4usize, 8usize, 4usize, 64usize);
        let kvh = [1usize, 2, 2, 1];
        let synth = |n: usize, salt: usize| -> Vec<f32> {
            (0..n)
                .map(|i| (((i * 31 + salt * 17 + 7) % 97) as f32 / 97.0 - 0.5) * 0.4)
                .collect()
        };
        let qt = |rows: usize, cols: usize, salt: usize| {
            QTensor::from_f32(synth(rows * cols, salt), rows, cols)
        };
        let dense = |inter: usize, salt: usize| DenseFfn {
            gate_proj: qt(inter, hs, salt),
            up_proj: qt(inter, hs, salt + 1),
            down_proj: qt(hs, inter, salt + 2),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let layers: Vec<LayerWeights> = (0..4)
            .map(|li| LayerWeights {
                input_norm: vec![1.0; hs],
                post_norm: vec![1.0; hs],
                attn_out_norm: None,
                ffn_out_norm: None,
                layer_scale: None,
                ffn: if li == 0 {
                    FfnKind::Dense(dense(inter, 50))
                } else {
                    FfnKind::Moe(MoeFfn {
                        router: qt(4, hs, 60 + li),
                        experts: (0..4).map(|e| dense(8, 70 + li * 10 + e * 3)).collect(),
                        top_k: 2,
                        norm_topk_prob: true,
                        router_sigmoid: true,
                        sigmoid_denom_eps: 1e-6,
                        expert_bias: Some(vec![0.02, -0.03, 0.01, 0.0]),
                        routed_scaling: 1.0,
                        route_tau: None,
                        shared: None,
                        stats: std::cell::RefCell::new(Vec::new()),
                        act_sq: std::cell::RefCell::new(Vec::new()),
                        act_rows: std::cell::RefCell::new(Vec::new()),
                        mask: None,
                        per_expert_scale: None,
                        router_input_norm: false,
                        resonance: None,
                        grown: Vec::new(),
                    })
                },
                attn: AttnKind::Full {
                    wq: qt(nh * hd, hs, li * 10 + 1),
                    wk: qt(kvh[li] * hd, hs, li * 10 + 2),
                    wv: qt(kvh[li] * vd, hs, li * 10 + 3),
                    wo: qt(hs, nh * vd, li * 10 + 4),
                    q_norm: None,
                    k_norm: None,
                    output_gate: false,
                    softplus_gate: None,
                    bias: None,
                },
            })
            .collect();
        let mut p = Pipeline::new(
            Tokenizer::byte_level(),
            PipelineWeights {
                embed_tokens: qt(vocab, hs, 100),
                layers,
                lm_head: qt(vocab, hs, 200),
                final_norm: vec![1.0; hs],
            },
            hs,
            inter,
            nh,
            1, // header num_kv_heads (the full layers')
            hd,
            4,
            4,
            false,
            vocab,
            1e-6,
            1e7,
            NormStyle::Qwen,
            4096,
            SamplerConfig {
                seed: Some(7),
                ..Default::default()
            },
        );
        // Diagnostics stay off whatever the test environment exports.
        p.layer_dump = None;
        p.set_rotary(4, 1e7);
        p.sliding_layers = Some(vec![false, true, true, false]);
        p.swa = Some((3, usize::MAX));
        p.rotary_dim_local = Some(4);
        p.inv_freq_local = Some(std::sync::Arc::new(attention::rope_inv_freq(4, 1e4)));
        p.set_attn_geometry(Some(kvh.to_vec()), Some(vd)).unwrap();
        p.set_layer_sinks(1, vec![0.5, -1.0, 1.5, 0.0]).unwrap();
        p.set_layer_sinks(2, vec![-0.25, 2.0, 0.75, -1.5]).unwrap();
        p
    }

    #[test]
    fn mimo_embedded_prompt_uses_rows_and_never_reuses_token_only_kv() {
        let mut p = mimo_test_pipeline();
        p.speculative = false;
        p.ignore_eos = true;
        p.sampler_config.temperature = 0.0;
        p.sampler_config.repetition_penalty = 1.0;
        let a = vec![3, 5, 7, 9, 11, 13];
        let b = vec![4, 8, 12, 16, 20, 24];
        let rows: Vec<_> = b.iter().flat_map(|&id| p.embed_id(id)).collect();
        let expected = p.generate_from_ids(&b, 8, None, None).unwrap().token_ids;
        // Same placeholder IDs as an earlier request are not a cache key
        // for different media. The actual rows, not a re-embedding of a,
        // must determine the continuation.
        let actual = p
            .generate_from_embeds(&a, &rows, 8, None, None)
            .unwrap()
            .token_ids;
        assert_eq!(actual, expected);
        assert!(p.kv_history.is_empty());
        let mut extended = a.clone();
        extended.push(17);
        let after_media = p
            .generate_from_ids(&extended, 8, None, None)
            .unwrap()
            .token_ids;
        p.reset_session();
        let fresh = p
            .generate_from_ids(&extended, 8, None, None)
            .unwrap()
            .token_ids;
        assert_eq!(after_media, fresh);
        assert!(
            p.generate_from_embeds(&a, &rows[..rows.len() - 1], 1, None, None)
                .is_err()
        );
        // Force a real token-prefix reuse opportunity into the media call.
        // Those labels are unchanged, but their embeddings now describe a
        // different source sequence and every KV row must be rebuilt.
        p.reset_session();
        p.generate_from_ids(&a, 1, None, None).unwrap();
        let mut media_ids = p.kv_history.clone();
        assert!(!media_ids.is_empty());
        media_ids.extend_from_slice(&[19, 21, 23]);
        let source_ids: Vec<_> = (0..media_ids.len()).map(|i| b[i % b.len()]).collect();
        let source_rows: Vec<_> = source_ids.iter().flat_map(|&id| p.embed_id(id)).collect();
        let mut oracle = mimo_test_pipeline();
        oracle.speculative = false;
        oracle.ignore_eos = true;
        oracle.sampler_config.temperature = 0.0;
        oracle.sampler_config.repetition_penalty = 1.0;
        let expected = oracle
            .generate_from_ids(&source_ids, 8, None, None)
            .unwrap()
            .token_ids;
        assert_eq!(
            p.generate_from_embeds(&media_ids, &source_rows, 8, None, None)
                .unwrap()
                .token_ids,
            expected
        );
        assert!(p.kv_history.is_empty());
        let mut bad = rows;
        bad[0] = f32::NAN;
        assert!(p.generate_from_embeds(&a, &bad, 1, None, None).is_err());
    }

    fn f32_bits(v: &[f32]) -> Vec<u32> {
        v.iter().map(|x| x.to_bits()).collect()
    }

    /// M3 acceptance: on the MiMo-shaped stack the decode walk (one
    /// position at a time through `forward_layers`) and the batched
    /// prefill (`prefill_batch_span`, whole prompt and split in two
    /// chunks) give bit-identical logits at all 12 positions — per-layer
    /// KV heads, narrow V, sinks, the window and the biased sigmoid MoE all
    /// agree across the two walks.
    #[test]
    fn mimo_shaped_decode_matches_prefill_batch_bitwise() {
        let mut p = mimo_test_pipeline();
        let kv: Vec<usize> = p.kv_cache.layers.iter().map(|l| l.num_kv_heads).collect();
        assert_eq!(kv, vec![1, 2, 2, 1]);
        assert!(p.kv_cache.layers[0].sinks.is_none() && p.kv_cache.layers[3].sinks.is_none());
        assert!(p.kv_cache.layers[1].sinks.is_some() && p.kv_cache.layers[2].sinks.is_some());
        let ids: Vec<u32> = (0..12u32).map(|i| (i * 7 + 3) % 64).collect();
        let hs = p.hidden_size;
        let mut decode = Vec::new();
        for (pos, &id) in ids.iter().enumerate() {
            let e = p.embed_single(id);
            let h = p.forward_layers(&e, pos, None);
            decode.push(p.logits_from_hidden(&h));
        }
        for l in &p.kv_cache.layers {
            assert_eq!(l.seq_len, 12);
            // V rows are padded to head_dim inside the cache.
            assert_eq!(l.head_values(0).len(), 12 * 8);
        }
        assert!(decode.iter().flatten().all(|v| v.is_finite()));

        p.clear_sequence_state();
        let hb = p.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, p.num_layers);
        for pos in 0..ids.len() {
            let lg = p.logits_from_hidden(&hb[pos * hs..(pos + 1) * hs]);
            assert_eq!(
                f32_bits(&decode[pos]),
                f32_bits(&lg),
                "whole prompt, pos {pos}"
            );
        }

        p.clear_sequence_state();
        let a = p.prefill_batch_span(PrefillIn::Ids(&ids[..5]), 0, None, 0, p.num_layers);
        let b = p.prefill_batch_span(PrefillIn::Ids(&ids[5..]), 5, None, 0, p.num_layers);
        for pos in 0..ids.len() {
            let row = if pos < 5 {
                &a[pos * hs..(pos + 1) * hs]
            } else {
                &b[(pos - 5) * hs..(pos - 4) * hs]
            };
            let lg = p.logits_from_hidden(row);
            assert_eq!(
                f32_bits(&decode[pos]),
                f32_bits(&lg),
                "two chunks, pos {pos}"
            );
        }

        // The fixture is not degenerate: the sinks and the window each
        // change the answer.
        let last = |p: &mut Pipeline| {
            p.clear_sequence_state();
            let hb = p.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, p.num_layers);
            p.logits_from_hidden(&hb[11 * hs..12 * hs])
        };
        let base = last(&mut p);
        let mut no_sinks = mimo_test_pipeline();
        for l in &mut no_sinks.kv_cache.layers {
            l.sinks = None;
        }
        assert_ne!(
            f32_bits(&last(&mut no_sinks)),
            f32_bits(&base),
            "sinks are live"
        );
        let mut wide = mimo_test_pipeline();
        wide.swa = Some((64, usize::MAX));
        assert_ne!(
            f32_bits(&last(&mut wide)),
            f32_bits(&base),
            "window is live"
        );

        // Generation runs end to end on the same stack.
        p.clear_sequence_state();
        p.ignore_eos = true;
        let r = p.generate_from_ids(&ids, 4, None, None).unwrap();
        assert_eq!(r.token_ids.len(), 4);
    }

    /// A Spark-X2.5-shaped stack: layers 0..3 slide (window 6), layer 3
    /// is global, every attention carries the head-wise sigmoid g_proj gate.
    fn spark_test_pipeline(trim: Option<(usize, usize)>) -> Pipeline {
        let (hs, nh) = (16usize, 4usize);
        let mut p = create_test_pipeline(hs, 24, nh, 2, 8, 4, 64);
        p.layer_dump = None;
        p.swa = Some((6, 4));
        p.proj_gate_sigmoid = true;
        for (li, lw) in p.weights.layers.iter_mut().enumerate() {
            if let AttnKind::Full { softplus_gate, .. } = &mut lw.attn {
                let g: Vec<f32> = (0..nh * hs)
                    .map(|i| (((i * 29 + li * 7) % 83) as f32 / 83.0 - 0.5) * 0.8)
                    .collect();
                *softplus_gate = Some((QTensor::from_f32(g, nh, hs), true));
            }
        }
        p.swa_trim = trim;
        p
    }

    /// Trimming the sliding tails changes nothing but memory: the same
    /// prompt in uneven chunks, a decode walk, and fused pairs with a
    /// 2-row rollback give bit-identical hiddens with and without it,
    /// while the trimmed sliding layers stay bounded and the global layer
    /// keeps every row.
    #[test]
    fn swa_trim_pipeline_matches_untrimmed_bitwise() {
        let mut a = spark_test_pipeline(None);
        let mut b = spark_test_pipeline(Some((2, 4)));
        assert_eq!(
            (0..4).map(|li| b.layer_window(li)).collect::<Vec<_>>(),
            vec![Some(6), Some(6), Some(6), None]
        );
        let ids: Vec<u32> = (0..41u32).map(|i| (i * 11 + 5) % 64).collect();
        let mut pos = 0usize;
        for &n in [5usize, 13, 7, 16].iter().cycle() {
            if pos >= ids.len() {
                break;
            }
            let end = (pos + n).min(ids.len());
            let ha = a.prefill_batch_span(PrefillIn::Ids(&ids[pos..end]), pos, None, 0, 4);
            let hb = b.prefill_batch_span(PrefillIn::Ids(&ids[pos..end]), pos, None, 0, 4);
            assert_eq!(f32_bits(&ha), f32_bits(&hb), "prefill chunk at {pos}");
            pos = end;
        }
        for _ in 0..23 {
            let e = a.embed_single(((pos * 7) % 64) as u32);
            let ha = a.forward_layers(&e, pos, None);
            let hb = b.forward_layers(&e, pos, None);
            assert_eq!(f32_bits(&ha), f32_bits(&hb), "decode at {pos}");
            for li in 0..3 {
                assert!(b.kv_cache.layers[li].seq_len <= 12, "layer {li} bounded");
            }
            pos += 1;
        }
        for round in 0..9 {
            let (e1, e2) = (a.embed_single(round * 3 + 1), a.embed_single(round * 5 + 2));
            let (a1, a2) = a.forward_pair(&e1, &e2, pos);
            let (b1, b2) = b.forward_pair(&e1, &e2, pos);
            assert_eq!(f32_bits(&a1), f32_bits(&b1), "pair lane 1 round {round}");
            assert_eq!(f32_bits(&a2), f32_bits(&b2), "pair lane 2 round {round}");
            if round % 2 == 1 {
                // A rejected draft: both lanes roll back.
                for p in [&mut a, &mut b] {
                    for l in &mut p.kv_cache.layers {
                        l.truncate_last(2);
                    }
                }
            } else {
                pos += 2;
            }
        }
        let e = a.embed_single(9);
        let (ha, hb) = (
            a.forward_layers(&e, pos, None),
            b.forward_layers(&e, pos, None),
        );
        assert_eq!(f32_bits(&ha), f32_bits(&hb), "after the pairs");
        for li in 0..3 {
            let (la, lb) = (&a.kv_cache.layers[li], &b.kv_cache.layers[li]);
            assert!(lb.base() > 0, "layer {li} trimmed");
            assert_eq!(la.base(), 0);
            assert_eq!(lb.pos_len(), la.seq_len);
            assert_eq!(lb.head_keys(0), &la.head_keys(0)[lb.base() * 8..]);
        }
        let (ga, gb) = (&a.kv_cache.layers[3], &b.kv_cache.layers[3]);
        assert_eq!(
            (gb.base(), gb.seq_len),
            (0, ga.seq_len),
            "the global layer keeps all"
        );
        assert_eq!(b.kv_cache.seq_len(), a.kv_cache.seq_len());
        assert!(b.kv_cache.total_memory_bytes() < a.kv_cache.total_memory_bytes());
    }

    /// The network split's KvFetch hand-off on a trimmed stack: every
    /// layer shipped over the wire mid-sequence (the sliding ones as
    /// `FullTail`) into a fresh pipeline that never ran a position, which
    /// then decodes on — bit for bit what the untrimmed pipeline decodes.
    #[test]
    fn swa_trim_wire_handoff_continues_bitwise() {
        let mut a = spark_test_pipeline(None);
        let mut b = spark_test_pipeline(Some((2, 4)));
        let ids: Vec<u32> = (0..29u32).map(|i| (i * 13 + 7) % 64).collect();
        let ha = a.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, 4);
        let hb = b.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, 4);
        assert_eq!(f32_bits(&ha), f32_bits(&hb));
        let mut pos = ids.len();
        for _ in 0..5 {
            let e = a.embed_single(((pos * 5) % 64) as u32);
            assert_eq!(
                f32_bits(&a.forward_layers(&e, pos, None)),
                f32_bits(&b.forward_layers(&e, pos, None))
            );
            pos += 1;
        }
        let mut c = spark_test_pipeline(Some((2, 4)));
        for li in 0..4 {
            let bytes = b.kv_cache.layers[li].export_wire(false).unwrap();
            c.kv_cache.layers[li].import_wire(&bytes).unwrap();
        }
        assert!(c.kv_cache.layers[0].base() > 0, "a tail travelled");
        assert_eq!(c.kv_cache.seq_len(), pos);
        for step in 0..17 {
            let e = a.embed_single(((pos * 3 + 1) % 64) as u32);
            let ha = a.forward_layers(&e, pos, None);
            let hc = c.forward_layers(&e, pos, None);
            assert_eq!(
                f32_bits(&ha),
                f32_bits(&hc),
                "after the hand-off, step {step}"
            );
            pos += 1;
        }
        assert!(c.kv_cache.layers[0].seq_len <= 12, "the receiver trims on");
    }

    /// A synthetic MiMo draft stack for `mimo_test_pipeline` (the SWA
    /// geometry of its sliding layers: 2 KV heads, head 8 / V 4).  Widths
    /// are per-draft-layer so the MTP collector cannot accidentally borrow
    /// the trunk's `intermediate_size`.
    fn mimo_test_mtp_widths(widths: &[usize], gain: f32) -> mimo_mtp::MimoMtp {
        let (hs, nh, hd, vd, nkv) = (16usize, 4usize, 8usize, 4usize, 2usize);
        let synth = |len: usize, salt: usize| -> Vec<f32> {
            (0..len)
                .map(|i| (((i * 37 + salt * 13 + 3) % 89) as f32 / 89.0 - 0.5) * 0.6 * gain)
                .collect()
        };
        let qt = |rows: usize, cols: usize, salt: usize| {
            QTensor::from_f32(synth(rows * cols, salt), rows, cols)
        };
        let layers = widths
            .iter()
            .copied()
            .enumerate()
            .map(|(k, inter)| {
                let s = 500 + k * 40;
                let mut kv = crate::kv_cache::LayerKvCache::new(nkv, hd);
                kv.sinks = Some(vec![0.3, -0.7, 1.1, 0.0]);
                MtpModule {
                    enorm: vec![1.0; hs],
                    hnorm: vec![1.0; hs],
                    eh_proj: qt(hs, 2 * hs, s),
                    layer: LayerWeights {
                        input_norm: vec![1.0; hs],
                        post_norm: vec![1.0; hs],
                        attn_out_norm: None,
                        ffn_out_norm: None,
                        layer_scale: None,
                        attn: AttnKind::Full {
                            wq: qt(nh * hd, hs, s + 1),
                            wk: qt(nkv * hd, hs, s + 2),
                            wv: qt(nkv * vd, hs, s + 3),
                            wo: qt(hs, nh * vd, s + 4),
                            q_norm: None,
                            k_norm: None,
                            output_gate: false,
                            softplus_gate: None,
                            bias: None,
                        },
                        ffn: FfnKind::Dense(DenseFfn {
                            gate_proj: qt(inter, hs, s + 5),
                            up_proj: qt(inter, hs, s + 6),
                            down_proj: qt(hs, inter, s + 7),
                            act: Act::Silu,
                            down_t: None,
                            segs: Vec::new(),
                        }),
                    },
                    final_norm: vec![1.0; hs],
                    kv,
                }
            })
            .collect();
        mimo_mtp::MimoMtp::from_layers(layers)
    }

    fn mimo_test_mtp(n: usize, gain: f32) -> mimo_mtp::MimoMtp {
        mimo_test_mtp_widths(&vec![24; n], gain)
    }

    fn mimo_greedy(p: &mut Pipeline, ids: &[u32], n: usize, spec: bool) -> GenerateResult {
        p.clear_sequence_state();
        p.speculative = spec;
        p.ignore_eos = true;
        p.sampler_config.temperature = 0.0;
        p.generate_from_ids(ids, n, None, None).unwrap()
    }

    #[test]
    fn mimo_mtp_ffn_probe_tracks_each_independent_draft_width() {
        let mut p = mimo_test_pipeline();
        let widths = [7usize, 13, 29];
        assert_ne!(widths[0], p.intermediate_size);
        assert_ne!(widths[1], p.intermediate_size);
        assert_ne!(widths[2], p.intermediate_size);
        p.mimo_mtp = Some(mimo_test_mtp_widths(&widths, 1.0));
        let ids: Vec<u32> = (0..11).map(|i| (i * 9 + 5) % 64).collect();

        let trunk = p.probe_ffn_mass(&ids);
        assert!(trunk.iter().all(|v| v.len() == p.intermediate_size));
        let got = p.probe_mtp_ffn(&ids).expect("MiMo MTP probe");
        assert_eq!(got.len(), widths.len());
        for (k, (stat, &width)) in got.iter().zip(&widths).enumerate() {
            assert_eq!(stat.mass.len(), width, "draft layer {k}");
            assert_eq!(stat.squared_mass.len(), width, "draft layer {k}");
            assert_eq!(stat.observed_positions, ids.len() - k - 1);
            assert!(stat.mass.iter().any(|&v| v > 0.0), "draft layer {k}");
            assert!(stat
                .mass
                .iter()
                .zip(&stat.squared_mass)
                .all(|(&m, &s)| m.is_finite() && s.is_finite() && m >= 0.0 && s >= 0.0));
        }
        assert_eq!(p.kv_cache.seq_len(), 0, "probe leaves a fresh trunk");
        let st = p.mimo_mtp.as_ref().unwrap();
        assert!(st.layers.iter().all(|m| m.kv.seq_len == 0));

        // As above, reject only after a MiMo draft KV has been appended.
        // The detached multi-layer owner must still be reset on that error.
        let h = p.hidden_size;
        let FfnKind::Dense(dense) = &mut p.mimo_mtp.as_mut().unwrap().layers[0].layer.ffn else {
            panic!("synthetic MiMo MTP must be dense")
        };
        dense.segs.push(FfnSeg {
            gate: QTensor::from_f32(vec![0.0; h], 1, h),
            up: QTensor::from_f32(vec![0.0; h], 1, h),
            down: QTensor::from_f32(vec![0.0; h], h, 1),
            start: dense.gate_proj.rows(),
            width: 1,
        });
        assert!(p
            .probe_mtp_ffn(&ids)
            .unwrap_err()
            .contains("tube-segmented draft FFNs are not supported"));
        assert_eq!(p.kv_cache.seq_len(), 0);
        assert!(p
            .mimo_mtp
            .as_ref()
            .unwrap()
            .layers
            .iter()
            .all(|m| m.kv.seq_len == 0));
    }

    #[test]
    fn mimo_mtp_ffn_probe_chunking_preserves_teacher_forced_statistics() {
        fn collect(p: &mut Pipeline, ids: &[u32], rows: usize) -> Vec<MtpFfnProbe> {
            p.clear_sequence_state();
            let mut st = p.mimo_mtp.take().expect("synthetic MiMo draft");
            let _exact = ExactMtpCalibrationGuard::enter();
            let got = crate::gpu::cpu_scope(|| {
                let trunk = p.probe_trunk_rows(ids)?;
                p.mimo_mtp_ffn_probe_teacher_forced_with_chunk_rows(&mut st, ids, &trunk, rows)
            })
            .expect("teacher-forced MiMo probe");
            st.reset();
            p.mimo_mtp = Some(st);
            p.reset_mtp_probe_state();
            got
        }

        for post_norm_hidden in [false, true] {
            let ids: Vec<u32> = (0..263u32).map(|i| (i * 17 + 5) % 64).collect();
            let make = || {
                let mut p = mimo_test_pipeline();
                let mut st = mimo_test_mtp_widths(&[7, 13, 29], 1.0);
                st.post_norm_hidden = post_norm_hidden;
                p.mimo_mtp = Some(st);
                p
            };
            let mut full = make();
            let expected = collect(&mut full, &ids, usize::MAX);
            for rows in [1usize, 7, 128] {
                let mut chunked = make();
                let got = collect(&mut chunked, &ids, rows);
                assert_eq!(got.len(), expected.len(), "post={post_norm_hidden}, rows={rows}");
                for (layer, (got, expected)) in got.iter().zip(&expected).enumerate() {
                    assert_eq!(
                        got.observed_positions, expected.observed_positions,
                        "post={post_norm_hidden}, rows={rows}, layer={layer}"
                    );
                    assert_eq!(
                        got.mass.iter().map(|v| v.to_bits()).collect::<Vec<_>>(),
                        expected.mass.iter().map(|v| v.to_bits()).collect::<Vec<_>>(),
                        "post={post_norm_hidden}, rows={rows}, layer={layer} mass"
                    );
                    assert_eq!(
                        got.squared_mass
                            .iter()
                            .map(|v| v.to_bits())
                            .collect::<Vec<_>>(),
                        expected
                            .squared_mass
                            .iter()
                            .map(|v| v.to_bits())
                            .collect::<Vec<_>>(),
                        "post={post_norm_hidden}, rows={rows}, layer={layer} squared mass"
                    );
                }
            }
        }
    }

    /// The draft stack's incremental rounds (a few rows per layer, last
    /// round's provisional rows dropped) give exactly the teacher-forced
    /// table of one causal pass per layer over the whole sequence — the
    /// table `tools/mimo_ref.py mtp` computes for variant A: layer k, row
    /// j reads (x[j+k+1], norm(h_j)) at RoPE position j.
    #[test]
    fn mimo_mtp_incremental_rounds_equal_the_teacher_forced_table() {
        // Both readings of the backbone hidden: pre-final-norm (default)
        // and post-final-norm (`CMF_MIMO_MTP_HIDDEN=post`).
        for post in [false, true] {
            let mut p = mimo_test_pipeline();
            // A non-trivial final norm, so the two readings differ.
            p.weights.final_norm = (0..p.hidden_size).map(|i| 0.5 + 0.1 * i as f32).collect();
            let mut st0 = mimo_test_mtp(3, 1.0);
            st0.post_norm_hidden = post;
            p.mimo_mtp = Some(st0);
            let ids: Vec<u32> = (0..14u32).map(|i| (i * 11 + 5) % 64).collect();
            let hs = p.hidden_size;
            let hb = p.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, p.num_layers);
            p.mimo_note_rows(&hb, 0);
            let mut st = p.mimo_mtp.take().unwrap();
            // Incremental: one round per t through the decode path (later
            // tokens from `ids`, the probe's teacher forcing).
            let k = 3;
            let mut inc = Vec::new();
            for t in 0..ids.len() - k - 1 {
                inc.push(p.mimo_mtp_draft(&mut st, t, &ids, k));
            }
            // Reference: per layer, ONE batched causal pass over all rows
            // with fresh caches.
            let s = ids.len();
            let mut reference = vec![vec![0u32; k]; s - k - 1];
            let mut fresh = mimo_test_mtp(3, 1.0);
            for (layer, m) in fresh.layers.iter_mut().enumerate() {
                let n = s - layer - 1;
                let mut cats = vec![0.0f32; n * 2 * hs];
                for j in 0..n {
                    let e = p.embed_single(ids[j + layer + 1]);
                    let raw = &hb[j * hs..(j + 1) * hs];
                    let g = if post {
                        inference::rms_norm(raw, &p.weights.final_norm, p.rms_eps, p.norm_style)
                    } else {
                        raw.to_vec()
                    };
                    let (ce, ch) = cats[j * 2 * hs..(j + 1) * 2 * hs].split_at_mut(hs);
                    inference::rms_norm_into(&e, &m.enorm, p.rms_eps, p.norm_style, ce);
                    inference::rms_norm_into(&g, &m.hnorm, p.rms_eps, p.norm_style, ch);
                }
                let mut x = vec![0.0f32; n * hs];
                m.eh_proj.matmat(&cats, n, &mut x, None);
                p.mimo_mtp_block(m, &mut x, n, 0);
                for (t, row) in reference.iter_mut().enumerate() {
                    let y = inference::rms_norm(
                        &x[t * hs..(t + 1) * hs],
                        &m.final_norm,
                        p.rms_eps,
                        p.norm_style,
                    );
                    row[layer] = sampler::argmax(&p.lm_head_forward(&y));
                }
            }
            assert_eq!(inc, reference, "post_norm_hidden = {post}");
            // Not a degenerate table: the drafts vary.
            let distinct: std::collections::HashSet<u32> = inc.iter().flatten().copied().collect();
            assert!(distinct.len() > 3, "{inc:?}");
            // Each layer's cache ends holding rows up to the last round start.
            let last_t = ids.len() - k - 2;
            for m in &st.layers {
                assert_eq!(m.kv.seq_len, last_t + 1);
            }
        }
    }

    /// Greedy with the MiMo draft stack is the plain greedy stream, token
    /// for token — with the real draft layers (low acceptance) and with a
    /// drafter that is right most of the time (exercises accepted prefixes
    /// of every length, the KV truncation of the rejected rows and the
    /// logits hand-off to the loop top), under the default repetition
    /// penalty.
    #[test]
    fn mimo_speculative_greedy_equals_plain_greedy() {
        let _env_lock = MTP_ENV_LOCK.lock().unwrap_or_else(|e| e.into_inner());
        let _env = ScopedTestEnv::set(&[
            ("CMF_GPU", Some("0")),
            ("CMF_GPU_WGPU_GRAPH", Some("0")),
        ]);
        let ids: Vec<u32> = (0..9u32).map(|i| (i * 7 + 3) % 64).collect();
        let n = 24;
        let mut p = mimo_test_pipeline();
        let plain = mimo_greedy(&mut p, &ids, n, false);
        assert_eq!(plain.mtp_drafted, 0);
        assert_eq!(plain.token_ids.len(), n);
        let plain_kv = p.kv_cache.layers[0].seq_len;

        // Real draft layers.
        p.mimo_mtp = Some(mimo_test_mtp(3, 1.0));
        let spec = mimo_greedy(&mut p, &ids, n, true);
        assert!(spec.mtp_drafted > 0, "the round must draft");
        assert_eq!(spec.token_ids, plain.token_ids);
        assert_eq!(p.kv_cache.layers[0].seq_len, plain_kv);

        // A drafter reading the true continuation with every fifth token
        // wrong: accepted prefixes of 0..=3 all occur.
        let mut truth: Vec<u32> = ids.clone();
        truth.extend(&plain.token_ids);
        let mut noisy = truth.clone();
        for (i, t) in noisy.iter_mut().enumerate() {
            if i % 5 == 0 {
                *t = (*t + 1) % 64;
            }
        }
        let mut st = mimo_test_mtp(3, 1.0);
        st.draft_override = Some(noisy);
        p.mimo_mtp = Some(st);
        let spec = mimo_greedy(&mut p, &ids, n, true);
        assert_eq!(spec.token_ids, plain.token_ids);
        assert_eq!(p.kv_cache.layers[0].seq_len, plain_kv);
        let stats = p.mimo_mtp.as_ref().unwrap().stats.clone();
        assert_eq!(stats.accepted as usize, spec.mtp_accepted);
        assert!(spec.mtp_accepted > 0 && spec.mtp_accepted < spec.mtp_drafted);
        assert!(
            stats.accept_hist.iter().filter(|&&c| c > 0).count() >= 3,
            "{:?}",
            stats.accept_hist
        );
        assert!(stats.tokens_per_round() > 1.5, "{}", stats.line());

        // A perfect drafter: every draft accepted, rounds of K+1 tokens,
        // and the budget is never overrun.
        let mut st = mimo_test_mtp(3, 1.0);
        st.draft_override = Some(truth);
        p.mimo_mtp = Some(st);
        let spec = mimo_greedy(&mut p, &ids, n, true);
        assert_eq!(spec.token_ids, plain.token_ids);
        assert_eq!(spec.mtp_accepted, spec.mtp_drafted);
        assert_eq!(p.kv_cache.layers[0].seq_len, plain_kv);

        // CMF_MTP=0 path: the stack is attached but idle.
        let off = mimo_greedy(&mut p, &ids, n, false);
        assert_eq!(off.token_ids, plain.token_ids);
        assert_eq!(off.mtp_drafted, 0);
    }

    /// The wgpu graphs carry MiMo-V2's attention per layer (KV heads,
    /// narrow V, sinks, windows, two RoPE tables): no attention-level
    /// decline for it any more, and the geometry each layer hands the
    /// graph is exactly what the CPU attention reads for that layer. The
    /// descriptive reasons stay (the Metal graphs and the q1 dropin still
    /// decline on them), and what the per-layer geometry cannot express
    /// keeps a named wgpu decline.

    #[test]
    fn mimo_shaped_model_rides_the_wgpu_graph_geometry() {
        let p = mimo_test_pipeline();
        assert_eq!(
            p.graph_attn_decline_reason(),
            Some("per-layer KV head counts")
        );
        assert_eq!(p.wgpu_graph_attn_decline(), None);
        let g0 = p.graph_attn_geom(0).expect("full layer geometry");
        assert_eq!(
            (g0.nkv, g0.dv, g0.rd, g0.window, g0.sink.is_some()),
            (1, 4, 4, None, false)
        );
        assert_eq!(g0.invf, p.inv_freq.as_slice());
        let g1 = p.graph_attn_geom(1).expect("sliding layer geometry");
        assert_eq!((g1.nkv, g1.dv, g1.rd, g1.window), (2, 4, 4, Some(3)));
        assert_eq!(g1.sink, Some(&[0.5f32, -1.0, 1.5, 0.0][..]));
        assert_eq!(g1.invf, p.inv_freq_local.as_ref().unwrap().as_slice());
        assert_ne!(g0.invf, g1.invf, "two RoPE tables");
        let g3 = p.graph_attn_geom(3).expect("full layer geometry");
        assert_eq!((g3.nkv, g3.window, g3.sink.is_some()), (1, None, false));

        // No wgpu device in this process: the builders run and decline on
        // the (f32, unmapped) experts — never with an attention line.
        let emb = p.embed_single(3);
        let mut lg = Vec::new();
        assert!(
            p.try_token_graph_wgpu_steps(&emb, 0, &mut lg, 1, None, None, 0, p.num_layers)
                .is_none()
        );
        let mut hid = emb.clone();
        assert_eq!(
            p.try_batch_graph_wgpu(&mut hid, &[0], 1, None),
            crate::gpu::BatchGraphOutcome::Declined
        );
        assert_eq!(hid, emb, "a declined batch graph leaves the rows untouched");
        assert!(p.try_multi_burst(3, 0, 4).is_none());
        assert!(
            p.graph_declines().is_empty(),
            "no attention decline logged: {:?}",
            p.graph_declines()
        );
        // (No assertion on graph_prefill_preferred: with no attention
        // decline it follows the device — a test process that brought a
        // wgpu adapter up routes this resident MoE through the graph.)

        let plain = || create_test_pipeline(8, 16, 2, 1, 4, 2, 32);
        assert_eq!(plain().graph_attn_decline_reason(), None);
        assert_eq!(plain().wgpu_graph_attn_decline(), None);
        assert!(
            plain().graph_attn_geom(0).is_none(),
            "uniform models keep the historical arms"
        );
        let mut q = plain();
        q.set_layer_sinks(1, vec![0.25, -0.25]).unwrap();
        assert_eq!(
            q.graph_attn_decline_reason(),
            Some("learned attention sinks")
        );
        assert_eq!(
            q.graph_attn_geom(1).unwrap().sink,
            Some(&[0.25f32, -0.25][..])
        );
        let mut q = plain();
        q.set_attn_geometry(None, Some(2)).unwrap();
        assert_eq!(
            q.graph_attn_decline_reason(),
            Some("V heads narrower than Q/K heads")
        );
        assert_eq!(q.graph_attn_geom(0).unwrap().dv, 2);
        let mut q = plain();
        q.sliding_layers = Some(vec![true, false]);
        q.swa = Some((4, usize::MAX));
        assert_eq!(q.graph_attn_decline_reason(), Some("sliding-window layers"));
        assert_eq!(q.graph_attn_geom(0).unwrap().window, Some(4));
        assert_eq!(q.graph_attn_geom(1).unwrap().window, None);

        // YaRN's post-rotation amplitude factor rides the per-layer graph
        // geometry. It is intentionally not an angular scale folded into
        // `invf`: the WGPU RoPE kernel receives it separately.
        let mut q = mimo_test_pipeline();
        q.rope_scale = 2.0;
        q.rope_scale_local = 1.25;
        assert_eq!(q.wgpu_graph_attn_decline(), None);
        assert_eq!(q.graph_attn_geom(0).unwrap().rope_scale, 2.0);
        assert_eq!(q.graph_attn_geom(1).unwrap().rope_scale, 1.25);

        // A uniform YaRN model cannot yet pass the factor through the fused
        // RKV arm; decline safely instead of producing scale-1 output.
        let mut q = plain();
        q.rope_scale = 2.0;
        assert_eq!(
            q.wgpu_graph_attn_decline(),
            Some("scaled RoPE without per-layer geometry")
        );
    }

    /// The native q1 attention path has a narrower contract than the WGPU
    /// per-layer geometry graph, but it must not discard the exact Flint
    /// combination of uniform GQA + sliding windows + learned sinks.  The
    /// actual Metal kernel is covered independently with a direct sink
    /// softmax test; this is the pure admission test, with no model run.
    #[cfg(target_os = "macos")]
    #[test]
    fn metal_swa_admits_uniform_learned_sinks_for_q1_decode() {
        // rd=64 is in the native rope kernel's lane-pair contract; the
        // synthetic stack otherwise has the same uniform K/V geometry that
        // Flint needs for q1 (unlike the deliberately ragged MiMo fixture).
        let mut p = create_test_pipeline(256, 512, 4, 1, 64, 2, 64);
        p.swa = Some((16, usize::MAX));
        p.sliding_layers = Some(vec![true, true]);
        p.set_layer_sinks(0, vec![0.25, -0.5, 1.0, -1.25]).unwrap();
        p.set_layer_sinks(1, vec![-0.75, 0.5, 0.0, 1.5]).unwrap();

        assert_eq!(
            p.graph_attn_decline_reason(),
            Some("learned attention sinks")
        );
        let swa_graph = p.metal_graph_swa();
        assert!(swa_graph, "uniform sliding sink geometry must reach q1");
        let native_sink_attend = p.graph_attn_decline_reason() == Some("learned attention sinks")
            && (swa_graph || (p.swa.is_none() && p.sliding_layers.is_none()));
        assert!(
            native_sink_attend,
            "the q1 sink admission must follow the SWA door"
        );
        // The batched chunk softmax has no value-less sink column, so its
        // separate admission gate must keep this prompt on the host path.
        assert!(p.kv_cache.layers.iter().any(|l| l.sinks.is_some()));
    }

    #[test]
    fn mimo_verify_rewind_preserves_lagging_host_caches() {
        let mut p = mimo_test_pipeline();
        for (li, layer) in p.kv_cache.layers.iter_mut().enumerate() {
            let row = vec![0.0; layer.num_kv_heads * layer.head_dim];
            for _ in 0..if li == 0 { 2 } else { 12 } {
                layer.append(&row, &row, &[]);
            }
        }
        p.mimo_verify_rewind(9).unwrap();
        assert_eq!(p.kv_cache.layers[0].seq_len, 2);
        for layer in &p.kv_cache.layers[1..] {
            assert_eq!(layer.seq_len, 9);
        }
    }

    /// CMF_LAYER_DUMP: the decode walk and the batched prefill both write
    /// every (position, layer) hidden, the two sets agree byte for byte,
    /// and the last layer's file is the stack output.
    #[test]
    fn layer_dump_covers_every_position_and_layer_on_both_walks() {
        let dir = std::env::temp_dir().join(format!("cmf-layer-dump-{}", std::process::id()));
        let _ = std::fs::remove_dir_all(&dir);
        let mut p = mimo_test_pipeline();
        let hs = p.hidden_size;
        let ids = [5u32, 9, 11, 2, 40];
        p.layer_dump = Some(dir.join("decode"));
        for (pos, &id) in ids.iter().enumerate() {
            let e = p.embed_single(id);
            let _ = p.forward_layers(&e, pos, None);
        }
        p.clear_sequence_state();
        p.layer_dump = Some(dir.join("prefill"));
        let hb = p.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, p.num_layers);
        for pos in 0..ids.len() {
            for li in 0..p.num_layers {
                let name = format!("p{pos:06}_l{li:02}.f32");
                let a = std::fs::read(dir.join("decode").join(&name)).unwrap();
                let b = std::fs::read(dir.join("prefill").join(&name)).unwrap();
                assert_eq!(a.len(), hs * 4, "{name}");
                assert_eq!(a, b, "{name}");
            }
        }
        let last = std::fs::read(dir.join("prefill").join("p000004_l03.f32")).unwrap();
        let vals: Vec<f32> = last
            .chunks(4)
            .map(|c| f32::from_le_bytes(c.try_into().unwrap()))
            .collect();
        assert_eq!(f32_bits(&vals), f32_bits(&hb[4 * hs..5 * hs]));
        let _ = std::fs::remove_dir_all(&dir);
    }

    #[test]
    fn attn_geometry_and_sinks_are_validated() {
        let mut p = create_test_pipeline(8, 16, 4, 2, 4, 2, 32);
        assert!(
            p.set_attn_geometry(Some(vec![2]), None).is_err(),
            "one entry per layer"
        );
        assert!(
            p.set_attn_geometry(Some(vec![2, 3]), None).is_err(),
            "3 does not divide 4"
        );
        assert!(p.set_attn_geometry(Some(vec![2, 0]), None).is_err());
        assert!(p.set_attn_geometry(None, Some(0)).is_err());
        assert!(
            p.set_attn_geometry(None, Some(5)).is_err(),
            "V wider than the head"
        );
        p.set_attn_geometry(None, Some(4)).unwrap();
        assert_eq!(
            p.v_head_dim, None,
            "v_head_dim == head_dim is the uniform case"
        );
        p.set_layer_sinks(1, vec![0.1; 4]).unwrap();
        p.set_attn_geometry(Some(vec![1, 4]), None).unwrap();
        assert_eq!(p.kv_cache.layers[0].num_kv_heads, 1);
        assert_eq!(p.kv_cache.layers[1].num_kv_heads, 4);
        assert!(
            p.kv_cache.layers[1].sinks.is_some(),
            "a reshape keeps the layer's sinks"
        );
        assert_eq!(p.layer_geom(1).0, 4);
        assert!(
            p.set_layer_sinks(0, vec![0.0; 3]).is_err(),
            "one sink per Q head"
        );
        assert!(p.set_layer_sinks(7, vec![0.0; 4]).is_err());
        assert!(p.set_layer_sinks(0, vec![f32::NAN, 0.0, 0.0, 0.0]).is_err());
    }

    /// The O(1) Nyström state replaces a plain full-context softmax; it
    /// must never be armed on a sliding, sink or narrow-V layer.
    #[test]
    fn o1_is_never_armed_on_sink_window_or_narrow_v_layers() {
        let cfg = || {
            Some(crate::nystrom::O1Cfg {
                layers: crate::nystrom::O1Layers::All,
                m: 4,
                w: 8,
                sink: 2,
                rect: crate::nystrom::O1Rect::Aggregate,
            })
        };
        let mut p = mimo_test_pipeline();
        p.set_o1(cfg());
        assert!(!p.o1_active(), "every MiMo-shaped layer is ineligible");
        let mut q = create_test_pipeline(8, 16, 2, 1, 4, 3, 64);
        q.set_layer_sinks(1, vec![0.0, 0.0]).unwrap();
        q.sliding_layers = Some(vec![false, false, true]);
        q.swa = Some((4, usize::MAX));
        q.set_o1(cfg());
        assert_eq!(q.o1_flags, vec![true, false, false]);
    }

    #[test]
    fn o1_batch_transition_publishes_one_epoch_before_serial_handoff() {
        const B: usize = 19;
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
        p.set_o1(Some(crate::nystrom::O1Cfg {
            layers: crate::nystrom::O1Layers::All,
            m: 4,
            w: 8,
            sink: 2,
            rect: crate::nystrom::O1Rect::Aggregate,
        }));
        p.o1_begin_with_prefix(Some(B));
        let ids: Vec<u32> = (0..B as u32).collect();
        let _ = p.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, p.num_layers);

        assert_eq!(p.o1_epoch, 1, "all layers publish one completed transition");
        assert!(p.kv_cache.layers.iter().all(|l| l.o1_sealed()));
        let next = p.embed_single(B as u32);
        let _ = p.forward_layers(&next, B, None);
        assert_eq!(p.o1_epoch, 1, "sealed handoff must not republish the epoch");
    }

    /// A turbo file's exact rows are chosen across every far-field layer at the
    /// boundary. A batched chunk ending on it used to seal each layer as it
    /// finished, before the pipeline could choose, so no row stayed exact on the
    /// host path (LFM2 on Metal).
    #[test]
    fn o1_exact_rows_are_chosen_before_a_batched_boundary_seals() {
        const B: usize = 19;
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
        let cfg = crate::nystrom::O1Cfg {
            layers: crate::nystrom::O1Layers::All,
            m: 4,
            w: 8,
            sink: 2,
            rect: crate::nystrom::O1Rect::Aggregate,
        };
        p.set_o1(Some(cfg.clone()));
        p.o1_turbo = Some(O1Turbo {
            cfg,
            seal: B,
            exact: crate::dory::ExactRows { weights: std::sync::Arc::new(vec![1.0; 2 * 2]), budget: 3 },
        });
        p.o1_begin_with_prefix(Some(B));
        let ids: Vec<u32> = (0..B as u32).collect();
        let _ = p.prefill_batch_span(PrefillIn::Ids(&ids), 0, None, 0, p.num_layers);
        // The span's own completion chooses the rows and seals every layer.
        assert!(p.kv_cache.layers.iter().all(|l| l.o1_sealed()));
        let keep = p.kv_cache.layers[0].o1_keep.clone();
        assert_eq!(keep.len(), 3, "the budget of exact rows is spent");
        assert_eq!(keep, p.kv_cache.layers[1].o1_keep, "the same rows in every layer");
        assert!(keep.iter().all(|&r| (2..B - 8).contains(&r)), "never a sink or a window row");
    }

    #[test]
    fn o1_pair_transition_commits_scratch_before_epoch_publication() {
        const B: usize = 19;
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 2, 260);
        // Keep a real recurrent layer ahead of the Full O(1) layer so the
        // pair test observes the GDN lane-2 scratch swap at the same
        // boundary, rather than only exercising an artificial scratch vec.
        let gdn_cfg = crate::linear_core::GdnCfg {
            num_v_heads: 2,
            num_k_heads: 1,
            key_head_dim: 2,
            value_head_dim: 4,
            conv_kernel: 3,
            hidden_size: 8,
            rms_eps: 1e-6,
            output_gate_sigmoid: false,
        };
        let synth = |n: usize, salt: usize| -> Vec<f32> {
            (0..n)
                .map(|i| (((i * 13 + salt * 7) % 97) as f32 / 97.0 - 0.5) * 0.4)
                .collect()
        };
        let qt = |rows: usize, cols: usize, salt: usize| {
            crate::qtensor::QTensor::from_f32(synth(rows * cols, salt), rows, cols)
        };
        let c_dim = gdn_cfg.conv_dim();
        let vd = gdn_cfg.num_v_heads * gdn_cfg.value_head_dim;
        p.weights.layers[0].attn = AttnKind::LinearGdn(crate::linear_core::GdnWeights {
            in_proj_qkv: qt(c_dim, 8, 1),
            in_proj_z: qt(vd, 8, 2),
            in_proj_a: qt(gdn_cfg.num_v_heads, 8, 3),
            in_proj_b: qt(gdn_cfg.num_v_heads, 8, 4),
            conv1d: synth(c_dim * gdn_cfg.conv_kernel, 5),
            a_log: vec![0.2, 0.5],
            dt_bias: synth(gdn_cfg.num_v_heads, 6),
            norm: vec![1.0; gdn_cfg.value_head_dim],
            out_proj: qt(8, vd, 7),
        });
        p.gdn_cfg = Some(gdn_cfg);
        p.set_o1(Some(crate::nystrom::O1Cfg {
            layers: crate::nystrom::O1Layers::All,
            m: 4,
            w: 8,
            sink: 2,
            rect: crate::nystrom::O1Rect::Aggregate,
        }));
        p.o1_begin_with_prefix(Some(B));
        for pos in 0..B - 2 {
            let emb = p.embed_single(pos as u32);
            let _ = p.forward_layers(&emb, pos, None);
        }
        let lane1_state = p.kv_cache.layers[0].linear_state.clone();

        let e1 = p.embed_single((B - 2) as u32);
        let e2 = p.embed_single((B - 1) as u32);
        let _ = p.forward_pair(&e1, &e2, B - 2);

        assert_eq!(p.o1_epoch, 1, "pair crossing B publishes one epoch");
        assert!(
            p.kv_cache
                .layers
                .iter()
                .enumerate()
                .all(|(li, l)| !p.o1_flags[li] || l.o1_sealed())
        );
        assert!(!p.kv_cache.layers[0].linear_state.is_empty());
        assert_ne!(
            p.kv_cache.layers[0].linear_state, lane1_state,
            "real pair must commit GDN lane 2 before returning"
        );
        assert!(p.kv_cache.layers[0].linear_scratch.is_empty());
        let next = p.embed_single(B as u32);
        let _ = p.forward_layers(&next, B, None);
        assert_eq!(p.o1_epoch, 1, "serial continuation must reuse the epoch");
    }

    #[test]
    fn o1_error_observation_stays_terminal_until_reset() {
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.set_o1(Some(crate::nystrom::O1Cfg {
            layers: crate::nystrom::O1Layers::All,
            m: 4,
            w: 8,
            sink: 2,
            rect: crate::nystrom::O1Rect::Aggregate,
        }));
        p.o1_begin();
        p.kv_cache.layers[0].o1_abort("synthetic transition failure".into());

        assert!(p.o1_seal_checked().is_err());
        assert!(
            p.o1_seal_checked().is_err(),
            "retry must see the sticky error"
        );
        let k = vec![0.2f32; 4];
        let v = vec![0.3f32; 4];
        p.kv_cache.layers[0].append(&k, &v, &[]);
        assert_eq!(p.kv_cache.layers[0].seq_len, 0);

        p.reset_session();
        p.o1_begin();
        p.kv_cache.layers[0].append(&k, &v, &[]);
        assert_eq!(p.kv_cache.layers[0].seq_len, 1);
    }

    #[test]
    fn nll_graph_failure_is_terminal_and_request_is_reusable() {
        let ids = vec![1u32, 2, 3, 4, 5, 6];
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.graph_logits = Some(vec![123.0]);
        p.graph_want_logits = true;
        p.graph_failed
            .store(true, std::sync::atomic::Ordering::Relaxed);
        p.cancel.store(true, std::sync::atomic::Ordering::Relaxed);
        let err = p.nll_ids_from(&ids, 0).expect_err("prior graph failure");
        assert!(err.contains("before NLL"));
        assert!(p.graph_logits.is_none());
        assert!(!p.graph_want_logits);
        assert!(!p.graph_failed.load(std::sync::atomic::Ordering::Relaxed));
        assert!(!p.cancel.load(std::sync::atomic::Ordering::Relaxed));

        let mut fresh = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        let expected = fresh.nll_ids_from(&ids, 0).expect("fresh NLL");
        let actual = p.nll_ids_from(&ids, 0).expect("reused NLL");
        assert_eq!(actual.1, expected.1);
        assert!((actual.0 - expected.0).abs() < 1e-9);
    }

    #[test]
    fn nll_forward_failure_discards_partial_score_and_clears_sidechannels() {
        let ids = vec![1u32, 2, 3, 4, 5, 6];
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.nll_test_fail_at = Some(1);
        let err = p
            .nll_ids_from(&ids, 0)
            .expect_err("one-shot forward failure");
        assert!(err.contains("forward") || err.contains("score row"));
        assert!(!p.graph_failed.load(std::sync::atomic::Ordering::Relaxed));
        assert!(!p.graph_want_logits);
        assert!(p.graph_logits.is_none());
        assert!(p.kv_history.is_empty());

        let mut fresh = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        let expected = fresh.nll_ids_from(&ids, 0).expect("fresh NLL");
        let actual = p.nll_ids_from(&ids, 0).expect("reused NLL");
        assert_eq!(actual.1, expected.1);
        assert!((actual.0 - expected.0).abs() < 1e-9);
    }

    #[test]
    fn nll_serial_failure_before_first_row_is_reported() {
        let ids = vec![1u32, 2, 3, 4];
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.nll_test_force_serial = true;
        p.nll_test_fail_at = Some(0);
        let err = p.nll_ids_from(&ids, 0).expect_err("serial forward failure");
        assert!(err.contains("serial forward"));
        assert!(p.kv_history.is_empty());
        assert!(!p.graph_failed.load(std::sync::atomic::Ordering::Relaxed));
        assert!(!p.cancel.load(std::sync::atomic::Ordering::Relaxed));
    }

    #[test]
    fn ffn_probe_failure_discards_recorder_and_state() {
        let ids = vec![1u32, 2, 3, 4];
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.nll_test_fail_at = Some(0);
        let err = p
            .probe_ffn_mass_batch(&ids)
            .expect_err("probe forward failure");
        assert!(err.contains("NLL"));
        assert!(FFN_PROBE.with(|probe| probe.borrow().is_none()));
        assert!(p.kv_history.is_empty());
        assert!(!p.graph_failed.load(std::sync::atomic::Ordering::Relaxed));
    }

    #[test]
    fn nll_test_controls_are_pipeline_scoped() {
        let ids = vec![1u32, 2, 3, 4];
        let mut failing = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        let mut unaffected = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        failing.nll_test_force_serial = true;
        failing.nll_test_fail_at = Some(0);

        assert!(!failing.can_prefill_batched());
        assert!(unaffected.can_prefill_batched());
        let expected = unaffected
            .nll_ids_from(&ids, 0)
            .expect("unaffected pipeline remains usable");
        let err = failing
            .nll_ids_from(&ids, 0)
            .expect_err("failure injection belongs to failing pipeline");
        assert!(err.contains("serial forward"));
        assert!(failing.nll_test_fail_at.is_none());
        assert!(unaffected.can_prefill_batched());
        let actual = unaffected
            .nll_ids_from(&ids, 0)
            .expect("unaffected pipeline remains reusable");
        assert_eq!(actual.1, expected.1);
        assert!((actual.0 - expected.0).abs() < 1e-9);
    }

    #[test]
    fn forward_ids_failure_channel_is_terminal_and_reusable() {
        let ids = vec![1u32, 2, 3, 4, 5, 6];
        let mut p = create_test_pipeline(8, 16, 2, 1, 4, 1, 64);
        p.graph_logits = Some(vec![123.0]);
        p.graph_want_logits = true;
        p.graph_failed
            .store(true, std::sync::atomic::Ordering::Relaxed);
        p.cancel.store(true, std::sync::atomic::Ordering::Relaxed);

        let err = p
            .forward_ids(&ids, None)
            .expect_err("a failed forward must not become a valid head result");
        assert!(err.contains("forward_ids setup"));
        assert!(p.graph_logits.is_none());
        assert!(!p.graph_want_logits);
        assert!(!p.graph_failed.load(std::sync::atomic::Ordering::Relaxed));
        assert!(!p.cancel.load(std::sync::atomic::Ordering::Relaxed));
        assert_eq!(p.kv_cache.seq_len(), 0);

        let expected = create_test_pipeline(8, 16, 2, 1, 4, 1, 64)
            .forward_ids(&ids, None)
            .expect("fresh forward_ids");
        let actual = p
            .forward_ids(&ids, None)
            .expect("pipeline remains reusable after a failed forward");
        assert_eq!(actual.len(), expected.len());
        assert!(
            actual
                .iter()
                .zip(expected)
                .all(|(a, b)| (a - b).abs() < 1e-9)
        );
        assert_eq!(p.kv_cache.seq_len(), ids.len());
    }

    #[test]
    fn sigmoid_router_floor_is_explicit_per_architecture() {
        // Flint and MiniMax M3.1 reference runtimes use +1e-20, while the
        // generic LFM2-compatible path uses +1e-6. At low (but representable)
        // sigmoid scores, silently sharing the latter changes expert weights by
        // orders of magnitude and can make a routed layer look coherent while
        // discarding its expert contribution.
        let zero = || DenseFfn {
            gate_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            up_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            down_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let m = MoeFfn {
            router: QTensor::from_f32(vec![0.0; 4], 2, 2),
            experts: vec![zero(), zero()],
            top_k: 1,
            norm_topk_prob: true,
            router_sigmoid: true,
            sigmoid_denom_eps: 1e-20,
            expert_bias: None,
            routed_scaling: 2.5,
            route_tau: None,
            shared: None,
            stats: std::cell::RefCell::new(Vec::new()),
            act_sq: std::cell::RefCell::new(Vec::new()),
            act_rows: std::cell::RefCell::new(Vec::new()),
            mask: None,
            per_expert_scale: None,
            router_input_norm: false,
            resonance: None,
            grown: Vec::new(),
        };
        let logits = [-20.0f32, -20.0];
        let (_, p, flint_wsum) = moe_route(&logits, &m, None);
        let (_, _, minimax_wsum) = moe_route_with_eps(&logits, &m, None, 1e-20);
        let (_, _, legacy_wsum) = moe_route_with_eps(&logits, &m, None, 1e-6);
        let reference_expected = (p[0] + 1e-20) / m.routed_scaling;
        assert!((flint_wsum - reference_expected).abs() < 1e-15);
        assert_eq!(minimax_wsum.to_bits(), reference_expected.to_bits());
        assert!(legacy_wsum > minimax_wsum * 100.0);
    }

    #[test]
    fn resonance_scores_match_formula_and_stable_tie() {
        let r = Resonance {
            // Three descriptors, hidden=2, one projection row each.
            mu: vec![0.0, 0.0, 1.0, 0.0, 0.0, 1.0],
            u: vec![1.0, 0.0, 0.0, 1.0, 1.0, 1.0],
            k: 1,
            bias: vec![1.5, 0.5, 0.0],
            shell: Vec::new(),
        };
        let x = [1.0f32, 1.0];
        let mut got = vec![0.0; 3];
        r.scores(&x, &mut got);
        // Expert 0 and 1 are an exact score tie; the CPU top-1 contract uses
        // the lower index.  The values also check d² - (U·d)², not just tie
        // ordering.
        assert!((got[0] - 0.5).abs() < 1e-6);
        assert!((got[1] - 0.5).abs() < 1e-6);
        assert!(got[2].abs() < 1e-6);
        let best = got
            .iter()
            .enumerate()
            .max_by(|(ia, a), (ib, b)| a.partial_cmp(b).unwrap().then(ib.cmp(ia)))
            .map(|(i, _)| i);
        assert_eq!(best, Some(0));
        assert!(got.iter().all(|v| v.is_finite()));
    }

    /// The growth shell (spec §2): a grown expert whose reconstruction
    /// error lies outside its shell scores −∞, one inside keeps the exact
    /// resonance score, trunk rows (`+inf` shell) are bit-identical to the
    /// shell-less computation; the process-wide switch disables it.
    #[test]
    fn resonance_shell_masks_outside_keeps_inside_and_trunk_bits() {
        // hidden = 2, rank 1. Experts 0/1 = trunk (shell +inf); 2 and 3 =
        // grown, the same descriptor (μ = (0, 1), u = (1, 1)) with shells
        // 6.0 and 0.25. At x' = (3, 0): d = (3, −1), d² = 10, proj =
        // (3 − 1)² = 4, err = 6 exactly — on the boundary of expert 2's
        // shell (kept: the rule is strict `>`), outside expert 3's.
        let plain = Resonance {
            mu: vec![0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 1.0],
            u: vec![1.0, 0.0, 0.0, 1.0, 1.0, 1.0, 1.0, 1.0],
            k: 1,
            bias: vec![1.5, 0.5, 0.0, 0.0],
            shell: Vec::new(),
        };
        let shelled = Resonance {
            mu: plain.mu.clone(),
            u: plain.u.clone(),
            k: 1,
            bias: plain.bias.clone(),
            shell: vec![f32::INFINITY, f32::INFINITY, 6.0, 0.25],
        };
        assert!(!plain.has_shell());
        assert!(shelled.has_shell());
        let bits = |v: &[f32]| v.iter().map(|x| x.to_bits()).collect::<Vec<_>>();
        let (mut a, mut b) = (vec![0.0; 4], vec![0.0; 4]);
        set_growth_shell(Some(true));
        assert!(growth_shell_enabled());
        // x = (1, 1): the grown experts reconstruct it exactly (err 0):
        // inside both shells, every row the shell-less bits.
        let x = [1.0f32, 1.0];
        plain.scores(&x, &mut a);
        shelled.scores(&x, &mut b);
        assert_eq!(bits(&a), bits(&b), "inside every shell: unchanged");
        assert!(a[2] == 0.0 && a[3] == 0.0);
        // x' = (3, 0): expert 3 → −∞, expert 2 (err == shell) and the
        // trunk rows keep their exact bits.
        let xo = [3.0f32, 0.0];
        plain.scores(&xo, &mut a);
        shelled.scores(&xo, &mut b);
        assert_eq!(a[2], -6.0);
        assert_eq!(a[3], -6.0);
        assert_eq!(
            bits(&a[..3]),
            bits(&b[..3]),
            "trunk rows + the boundary row"
        );
        assert_eq!(b[3], f32::NEG_INFINITY, "outside the shell: −∞");
        assert_eq!(shelled.effective_shell(4), shelled.shell);
        // The switch (`CMF_GROWTH_SHELL=off` / `growth-eval --shell off`):
        // all +inf, the shell-less bits everywhere.
        set_growth_shell(Some(false));
        assert!(!growth_shell_enabled());
        assert_eq!(shelled.effective_shell(4), vec![f32::INFINITY; 4]);
        shelled.scores(&xo, &mut b);
        assert_eq!(bits(&a), bits(&b));
        set_growth_shell(None);
        // A shell vector shorter than the expert count masks nothing
        // beyond it (a legacy layer whose tail has no shell).
        let short = Resonance {
            shell: vec![f32::INFINITY, f32::INFINITY],
            ..shelled
        };
        set_growth_shell(Some(true));
        short.scores(&xo, &mut b);
        assert_eq!(bits(&a), bits(&b));
        set_growth_shell(None);
    }

    /// `moe_route` with −∞ logits (a grown expert outside its shell):
    /// top-1 is the best finite expert with weight exactly 1.0 on both
    /// the softmax and the sigmoid path; all −∞ degrades to uniform.
    #[test]
    fn moe_route_neg_inf_logits_pick_the_best_finite_expert_with_weight_one() {
        let zero = || DenseFfn {
            gate_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            up_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            down_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let moe = |sigmoid: bool| MoeFfn {
            router: QTensor::from_f32(vec![0.0; 8], 4, 2),
            experts: vec![zero(), zero(), zero(), zero()],
            top_k: 1,
            norm_topk_prob: true,
            router_sigmoid: sigmoid,
            sigmoid_denom_eps: 1e-6,
            expert_bias: None,
            routed_scaling: 1.0,
            route_tau: None,
            shared: None,
            stats: std::cell::RefCell::new(Vec::new()),
            act_sq: std::cell::RefCell::new(Vec::new()),
            act_rows: std::cell::RefCell::new(Vec::new()),
            mask: None,
            per_expert_scale: None,
            router_input_norm: false,
            resonance: None,
            grown: Vec::new(),
        };
        let logits = [-1.0f32, f32::NEG_INFINITY, -0.5, f32::NEG_INFINITY];
        for sigmoid in [false, true] {
            let m = moe(sigmoid);
            let (idx, p, wsum) = moe_route(&logits, &m, None);
            assert_eq!(idx, vec![2], "sigmoid {sigmoid}");
            assert_eq!(p[1], 0.0);
            assert_eq!(p[3], 0.0);
            assert!(p[2] > p[0] && p[0] > 0.0);
            assert!(p.iter().all(|v| v.is_finite()));
            let w = p[2] / wsum;
            if sigmoid {
                // The sigmoid renorm keeps its reference floor (+1e-6).
                assert!((w - 1.0).abs() < 1e-5, "sigmoid: weight {w}");
            } else {
                assert_eq!(
                    w, 1.0,
                    "softmax: the renormalized top-1 weight is exactly 1"
                );
            }
            // Masked experts stay masked even when they are the only ones
            // "admitted" by an allow-list that covers everything.
            let (idx, _, _) = moe_route(&logits, &m, Some(&[true, true, true, true]));
            assert_eq!(idx, vec![2]);
        }
        // A finite expert always beats −∞ whatever the bias / order.
        let m = moe(false);
        let (idx, _, _) = moe_route(
            &[
                f32::NEG_INFINITY,
                f32::NEG_INFINITY,
                f32::NEG_INFINITY,
                -9.0,
            ],
            &m,
            None,
        );
        assert_eq!(idx, vec![3]);
        // Every expert at −∞ (cannot happen on a grown file — trunk rows
        // have no shell): uniform, finite, lowest index.
        let (idx, p, wsum) = moe_route(&[f32::NEG_INFINITY; 4], &m, None);
        assert_eq!(idx, vec![0]);
        assert!(p.iter().all(|&v| v == 0.25));
        assert!(wsum.is_finite() && wsum > 0.0);
    }

    /// MiniMax-M3.1's DEVICE route (the pooled token-graph arm's exact
    /// flags: sigmoid scoring via n's high bit, +1e-20 floor,
    /// routed_scaling 2.0, selection bias on the CHOICE only) must match
    /// the host reference in experts, ORDER and weights — the check that
    /// caught the flags/slot collision.
    #[cfg(feature = "gpu")]
    #[test]
    fn minimax_device_route_matches_host_sigmoid_contract() {
        match crate::gpu_wgpu::selected_and_up() {
            None => {
                crate::gpu_wgpu::skip_or_fail(module_path!());
                return;
            }
            // Sibling unit tests in THIS process select wgpu by writing
            // `CMF_GPU` (the gpu_wgpu test module does it ~70 times), so on a
            // headless runner the variable is already set by the time this
            // test reads it — "requested" here is test pollution, not an
            // operator's ask, and the adapter genuinely does not exist in
            // this process. Same treatment as the gpu_wgpu tests themselves:
            // a visible skip, never a silent pass.
            Some(false) => {
                eprintln!(
                    "SKIPPED ({}): CMF_GPU names wgpu but no adapter came up in this process",
                    module_path!()
                );
                return;
            }
            Some(true) => {}
        }
        let n = 128usize;
        let top_k = 4usize;
        let logits: Vec<f32> = (0..n)
            .map(|i| ((i as f32 * 0.61).sin() * 3.4) + ((i % 23) as f32 * 0.13))
            .collect();
        let bias: Vec<f32> = (0..n).map(|i| ((i as f32 * 2.3).cos()) * 0.5).collect();
        let m = MoeFfn {
            router: QTensor::from_f32(vec![0.0; 4], 2, 2),
            experts: Vec::new(),
            top_k,
            norm_topk_prob: true,
            router_sigmoid: true,
            sigmoid_denom_eps: 1e-20,
            expert_bias: Some(bias.clone()),
            routed_scaling: 2.0,
            route_tau: None,
            shared: None,
            stats: std::cell::RefCell::new(Vec::new()),
            act_sq: std::cell::RefCell::new(Vec::new()),
            act_rows: std::cell::RefCell::new(Vec::new()),
            mask: None,
            per_expert_scale: None,
            router_input_norm: false,
            resonance: None,
            grown: Vec::new(),
        };
        let (ci, p, wsum) = moe_route_with_eps(&logits, &m, None, 1e-20);
        let cw: Vec<f32> = ci.iter().map(|&e| p[e] / wsum).collect();

        for shared in [Some(n as u32), None] {
            let mut gi = Vec::new();
            let mut gw = Vec::new();
            assert!(
                crate::gpu_wgpu::minimax_moe_route_for_test(
                    &logits,
                    Some(&bias),
                    top_k,
                    2.0,
                    shared,
                    &mut gi,
                    &mut gw,
                ),
                "the device did not come up — the test checked nothing"
            );
            let routed = if shared.is_some() { top_k } else { gi.len() };
            assert_eq!(
                &gi[..routed],
                &ci[..],
                "different experts or order (shared={shared:?})"
            );
            let d = cw
                .iter()
                .zip(&gw[..routed])
                .map(|(a, b)| (a - b).abs())
                .fold(0.0f32, f32::max);
            println!("minimax route shared={shared:?}: {ci:?} max|Δw|={d:.3e}");
            assert!(d < 1e-6, "the weights diverged by {d:.3e}");
            if let Some(s) = shared {
                assert_eq!(gi[top_k], s as usize, "shared pin slot");
                assert_eq!(gw[top_k], 1.0, "shared weight");
            }
        }
    }

    /// The pooled arm's COLD hand-back: `(expert, weight)` pairs for the
    /// picks the bank could not serve must carry the host's EXACT final
    /// weights — the device ships its resident sum, the host adds this on
    /// top of the same residual, so a weight drift compounds per layer.
    #[cfg(feature = "gpu")]
    #[test]
    fn minimax_device_cold_weights_match_host_contract() {
        match crate::gpu_wgpu::selected_and_up() {
            None => {
                crate::gpu_wgpu::skip_or_fail(module_path!());
                return;
            }
            // Sibling unit tests in THIS process select wgpu by writing
            // `CMF_GPU` (the gpu_wgpu test module does it ~70 times), so on a
            // headless runner the variable is already set by the time this
            // test reads it — "requested" here is test pollution, not an
            // operator's ask, and the adapter genuinely does not exist in
            // this process. Same treatment as the gpu_wgpu tests themselves:
            // a visible skip, never a silent pass.
            Some(false) => {
                eprintln!(
                    "SKIPPED ({}): CMF_GPU names wgpu but no adapter came up in this process",
                    module_path!()
                );
                return;
            }
            Some(true) => {}
        }
        let n = 128usize;
        let top_k = 4usize;
        let logits: Vec<f32> = (0..n)
            .map(|i| ((i as f32 * 0.61).sin() * 3.4) + ((i % 23) as f32 * 0.13))
            .collect();
        let bias: Vec<f32> = (0..n).map(|i| ((i as f32 * 2.3).cos()) * 0.5).collect();
        let m = MoeFfn {
            router: QTensor::from_f32(vec![0.0; 4], 2, 2),
            experts: Vec::new(),
            top_k,
            norm_topk_prob: true,
            router_sigmoid: true,
            sigmoid_denom_eps: 1e-20,
            expert_bias: Some(bias.clone()),
            routed_scaling: 2.0,
            route_tau: None,
            shared: None,
            stats: std::cell::RefCell::new(Vec::new()),
            act_sq: std::cell::RefCell::new(Vec::new()),
            act_rows: std::cell::RefCell::new(Vec::new()),
            mask: None,
            per_expert_scale: None,
            router_input_norm: false,
            resonance: None,
            grown: Vec::new(),
        };
        let (ci, p, wsum) = moe_route_with_eps(&logits, &m, None, 1e-20);
        assert_eq!(ci.len(), top_k);

        // Every pick resident → no cold pairs at all.
        let resident: Vec<u32> = (0..n).map(|e| e as u32).collect();
        let mut cold = Vec::new();
        let mut idx = Vec::new();
        let mut dw = Vec::new();
        assert!(crate::gpu_wgpu::minimax_moe_route_cold_for_test(
            &logits,
            Some(&bias),
            top_k,
            2.0,
            &resident,
            n as u32,
            &mut cold,
            &mut idx,
            &mut dw,
        ));
        assert!(cold.is_empty(), "fully resident bank: {cold:?}");
        // With subset+pin together: routed slots carry the FLAT remap value
        // (here identity = the expert id), weights the host contract, and
        // the pinned shared keeps weight 1 — this exact combination is what
        // the pooled arm runs with.
        for (r, &e) in ci.iter().enumerate() {
            assert_eq!(idx[r] as usize, e, "resident slot mapping r={r}");
            let host = p[e] / wsum;
            let d = (dw[r] - host).abs();
            assert!(
                d <= 1e-6 * host.abs().max(1.0),
                "resident weight r={r} expert {e}: device={:.9e} host={host:.9e}",
                dw[r]
            );
        }
        assert_eq!(idx[top_k] as usize, n, "shared pin slot");
        assert_eq!(dw[top_k], 1.0, "shared weight");

        // Make exactly two of the CHOSEN picks cold.
        let mut remap = resident.clone();
        remap[ci[0]] = u32::MAX;
        remap[ci[2]] = u32::MAX;
        let mut cold = Vec::new();
        let mut idx2 = Vec::new();
        let mut dw2 = Vec::new();
        assert!(crate::gpu_wgpu::minimax_moe_route_cold_for_test(
            &logits,
            Some(&bias),
            top_k,
            2.0,
            &remap,
            n as u32,
            &mut cold,
            &mut idx2,
            &mut dw2,
        ));
        // The resident picks of the partial bank still carry exact weights.
        // A COLD rank is a placeholder the device writes as slot 0 / weight
        // 0.0 — its real (id, weight) pair rides in `cold` — so weight zero
        // is what marks it, not the slot value: reading the placeholder as
        // a resident expert compared 0.0 against p[0]/wsum and failed with
        // Δ=2.552e-1. The test logits keep every sigmoid score strictly
        // positive, so a resident pick can never weigh exactly zero.
        let mut resident_weight_checked = 0usize;
        for (r, &slot) in idx2.iter().enumerate().take(top_k) {
            if dw2[r] == 0.0 {
                continue; // cold rank: placeholder, not an expert id
            }
            let e = slot as usize;
            assert!(e < n && remap[e] != u32::MAX, "resident slot {e} escaped the remap");
            let host = p[e] / wsum;
            let d = (dw2[r] - host).abs();
            assert!(
                d <= 1e-6 * host.abs().max(1.0),
                "partial-bank resident weight expert {e}: Δ={d:.3e}"
            );
            resident_weight_checked += 1;
        }
        assert_eq!(resident_weight_checked, 2, "exactly two resident peaks out of four");
        println!("partial bank: checked {resident_weight_checked} resident weights");
        assert_eq!(dw2.get(top_k).copied(), Some(1.0), "shared weight under subset");
        let mut ids: Vec<usize> = cold.iter().map(|&(e, _)| e).collect();
        ids.sort_unstable();
        let mut want = vec![ci[0], ci[2]];
        want.sort_unstable();
        assert_eq!(ids, want, "the cold experts diverged: {cold:?} versus {want:?}");
        for &(e, w) in &cold {
            let host = p[e] / wsum;
            let d = (w - host).abs();
            println!("cold expert {e}: device={w:.9e} host={host:.9e} Δ={d:.3e}");
            assert!(d <= 1e-6 * host.abs().max(1.0), "cold weight of expert {e}: Δ={d:.3e}");
        }
    }

    /// The resonance router (top-1) selects by the raw score as the
    /// trainer and the graph do — not by softmax probabilities, where two
    /// scores closer than 2^-25 collapse to the same `exp(l − max) = 1.0`
    /// and the LOWER index wins a token whose score is strictly smaller.
    #[test]
    fn resonance_route_picks_the_raw_argmax_not_the_softmax_tie() {
        let zero = || DenseFfn {
            gate_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            up_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            down_proj: QTensor::from_f32(vec![0.0; 4], 2, 2),
            act: Act::Silu,
            down_t: None,
            segs: Vec::new(),
        };
        let moe = |resonant: bool, norm_topk: bool| MoeFfn {
            router: QTensor::from_f32(vec![0.0; 6], 3, 2),
            experts: vec![zero(), zero(), zero()],
            top_k: 1,
            norm_topk_prob: norm_topk,
            router_sigmoid: false,
            sigmoid_denom_eps: 1e-6,
            expert_bias: None,
            routed_scaling: 1.0,
            route_tau: None,
            shared: None,
            stats: std::cell::RefCell::new(Vec::new()),
            act_sq: std::cell::RefCell::new(Vec::new()),
            act_rows: std::cell::RefCell::new(Vec::new()),
            mask: None,
            per_expert_scale: None,
            router_input_norm: false,
            resonance: resonant.then(|| Resonance {
                mu: vec![0.0; 6],
                u: Vec::new(),
                k: 0,
                bias: vec![0.0; 3],
                shell: Vec::new(),
            }),
            grown: Vec::new(),
        };
        // lo = −0.1, hi = the next f32 towards zero: hi − lo = 2^-27 <
        // 2^-25, so exp(lo − hi) rounds to exactly 1.0 — a softmax tie.
        let lo = -0.1f32;
        let hi = f32::from_bits(lo.to_bits() - 1);
        assert!(hi > lo && hi - lo < 2f32.powi(-25));
        assert_eq!((lo - hi).exp(), 1.0, "the tie this test is about");
        // The gated MoE (softmax) path: the tie hands the token to index 0.
        let (idx, _, _) = moe_route(&[lo, hi], &moe(false, true), None);
        assert_eq!(
            idx,
            vec![0],
            "softmax tie → lower index (the gated contract)"
        );
        // The resonance path: the strictly larger raw score wins, weight
        // exactly 1.0 with and without norm_topk.
        for norm in [true, false] {
            let m = moe(true, norm);
            let (idx, p, wsum) = moe_route(&[lo, hi, f32::NEG_INFINITY], &m, None);
            assert_eq!(idx, vec![1], "norm_topk {norm}");
            assert_eq!(p, vec![0.0, 1.0, 0.0]);
            assert_eq!(p[1] / wsum, 1.0);
            // An exact tie: the first maximum (as `resonance_winner` and
            // `embryo_core_route_pick`).
            let (idx, _, _) = moe_route(&[hi, hi, lo], &m, None);
            assert_eq!(idx, vec![0]);
            // `−∞` never wins; the admitted set is honoured.
            let (idx, _, _) = moe_route(&[f32::NEG_INFINITY, lo, hi], &m, None);
            assert_eq!(idx, vec![2]);
            let (idx, p, wsum) = moe_route(&[lo, hi, hi], &m, Some(&[true, false, false]));
            assert_eq!(idx, vec![0]);
            assert_eq!(p[0] / wsum, 1.0);
            // Every admitted expert at −∞: the generic path's uniform
            // fallback (lowest index, finite weights).
            let (idx, p, wsum) = moe_route(&[f32::NEG_INFINITY; 3], &m, None);
            assert_eq!(idx, vec![0]);
            assert!(p.iter().all(|v| v.is_finite()) && wsum.is_finite() && wsum > 0.0);
        }
    }
}