refactor(sdk): dedup + cohesion follow-up across analyze and time handling

CHANGELOG.md

@@ -4,6 +4,8 @@ Cross-package release notes for relayburn. Package changelogs contain package-le
 
 ## [Unreleased]
 
+- `burn` subagent-tree views now require a re-ingest to render pre-Root-emission event logs (legacy reconstruction path removed).
+
 ## [3.4.0] - 2026-06-20
 
 - `burn summary` and `burn compare` accept `--bucket <DURATION>` to emit a per-bucket time-series across the `--since` window instead of a single total (`{ "bucketSeconds": N, "buckets": [...] }` in JSON). Bucket units: `30s` / `5m` / `1h` / `12h` / `1d` / `7d` — note `m` is minutes here, unlike `--since` where `m` is months. `summary --bucket` supports only the default grouped (`byModel` / `--by-provider`) modes; `hotspots` / `overhead` are unchanged.

crates/relayburn-sdk/src/analyze/claude_md.rs

@@ -21,7 +21,7 @@ use serde::{Deserialize, Serialize};
 
 use crate::analyze::cost::{lookup_model_rate, PER_MILLION};
 use crate::analyze::pricing::PricingTable;
-use crate::analyze::util::{group_turns_by_session, tokens_from_bytes};
+use crate::analyze::util::{group_turns_by_session_sorted, percentile, tokens_from_bytes};
 
 #[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
 #[serde(rename_all = "camelCase")]
@@ -325,13 +325,11 @@ pub(crate) fn attribute_claude_md_refs(
         };
     }
 
-    let by_session = group_turns_by_session(turns.iter().copied());
+    let by_session = group_turns_by_session_sorted(turns.iter().copied());
 
     let mut session_costs: Vec<SessionClaudeMdCost> = Vec::new();
     let mut total_cost = 0.0_f64;
     for (session_id, turns) in by_session {
-        let mut turns = turns;
-        turns.sort_by_key(|t| t.turn_index);
         let mut cost = 0.0_f64;
         let mut riding_turns: u64 = 0;
         let mut model_counts: IndexMap<String, u64> = IndexMap::new();
@@ -417,18 +415,6 @@ fn pick_dominant_model(counts: &IndexMap<String, u64>) -> String {
     best_model
 }
 
-fn percentile(sorted: &[f64], p: f64) -> f64 {
-    if sorted.is_empty() {
-        return 0.0;
-    }
-    if sorted.len() == 1 {
-        return sorted[0];
-    }
-    let raw = (p * sorted.len() as f64).ceil() as i64 - 1;
-    let idx = raw.clamp(0, sorted.len() as i64 - 1) as usize;
-    sorted[idx]
-}
-
 #[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
 #[serde(rename_all = "camelCase")]
 pub struct TrimRecommendation {