@stephen-netu/design-system 0.1.0 → 0.2.1

package/src/n4-adaptive-manifold/pinnacle-events.ts

@@ -1,135 +0,0 @@
-import type { PinnacleEvent, LoopPhase, NodeIndicatorState } from './types.js';
-
-/** Minimum gap (ms) between claim and action to infer "thinking" */
-const THINK_GAP_MS = 2000;
-
-/** Track per-agent state for gap-based inference */
-interface AgentTracker {
-  lastEventSequence: number;
-  lastEventTime: number;
-  currentTask: string | null;
-  loopPhase: LoopPhase;
-}
-
-/**
- * Tier A inference layer: derives PinnacleEvents from sigchain snapshot deltas.
- *
- * When tier B (direct Garden telemetry) arrives, this class is replaced.
- * The PinnacleEvent shape is the same — canvas code doesn't change.
- */
-export class PinnacleEventInferrer {
-  private agents: Map<string, AgentTracker> = new Map();
-
-  /**
-   * Process a batch of sigchain-derived changes and return PinnacleEvents.
-   * Called by PinnacleView on each poller tick.
-   */
-  inferFromSnapshot(
-    nodes: ReadonlyArray<{ id: string; kind: string; metadata: Record<string, unknown> }>,
-    _edges: ReadonlyArray<{ source: string; target: string; relation: string }>,
-    sequence: number,
-  ): PinnacleEvent[] {
-    const events: PinnacleEvent[] = [];
-    const now = performance.now();
-
-    // Find all agent nodes
-    const agentNodes = nodes.filter((n) => n.kind === 'agent');
-
-    for (const agent of agentNodes) {
-      const existingTracker = this.agents.get(agent.id);
-      const isFirstSeen = !existingTracker;
-      const tracker = existingTracker ?? {
-        lastEventSequence: 0,
-        lastEventTime: now,
-        currentTask: null,
-        loopPhase: 'idle' as LoopPhase,
-      };
-
-      // Determine what the agent is doing from metadata
-      const claimedTask = agent.metadata?.current_task as string | undefined;
-      const actionSequence = (agent.metadata?.last_action_sequence as number) ?? 0;
-
-      let loopPhase: LoopPhase = 'idle';
-      let targetId: string | null = null;
-
-      if (claimedTask && claimedTask !== tracker.currentTask) {
-        // Agent just claimed a new task (or first seen with a task) → perceive
-        loopPhase = 'perceive';
-        targetId = claimedTask;
-      } else if (claimedTask && actionSequence > tracker.lastEventSequence) {
-        // Agent has a task and just performed an action → act
-        loopPhase = 'act';
-        targetId = claimedTask;
-      } else if (!isFirstSeen && claimedTask && now - tracker.lastEventTime > THINK_GAP_MS) {
-        // Gap inference only after baseline established — avoids false 'think' on first poll.
-        // If constructed 3s before first poll, every agent would immediately enter think.
-        loopPhase = 'think';
-        targetId = claimedTask;
-      } else if (claimedTask) {
-        // Agent has a task, recent action, within gap → still acting
-        loopPhase = tracker.loopPhase === 'idle' ? 'perceive' : tracker.loopPhase;
-        targetId = claimedTask;
-      }
-
-      // Only emit event if phase changed or target changed
-      if (loopPhase !== tracker.loopPhase || targetId !== tracker.currentTask) {
-        events.push({
-          agentId: agent.id,
-          targetId,
-          loopPhase,
-          sequence,
-        });
-      }
-
-      this.agents.set(agent.id, {
-        lastEventSequence: actionSequence || tracker.lastEventSequence,
-        lastEventTime:
-          actionSequence > tracker.lastEventSequence ? now : tracker.lastEventTime,
-        currentTask: claimedTask ?? null,
-        loopPhase,
-      });
-    }
-
-    // Detect departed agents (were tracked, no longer in nodes)
-    const currentAgentIds = new Set(agentNodes.map((a) => a.id));
-    for (const [agentId, tracker] of this.agents) {
-      if (!currentAgentIds.has(agentId) && tracker.loopPhase !== 'idle') {
-        events.push({
-          agentId,
-          targetId: null,
-          loopPhase: 'idle',
-          sequence,
-        });
-        this.agents.delete(agentId);
-      }
-    }
-
-    return events;
-  }
-
-  /**
-   * Convert persistent agent tracker state into NodeIndicatorState map for the canvas.
-   *
-   * Reads from this.agents (updated by inferFromSnapshot), NOT from emitted events.
-   * Events only fire on state changes — reading from the tracker ensures a stable
-   * 'think' pulse persists across ticks where nothing changes.
-   *
-   * Must be called after inferFromSnapshot on the same tick.
-   */
-  toIndicatorStates(): Map<string, NodeIndicatorState> {
-    const states = new Map<string, NodeIndicatorState>();
-
-    for (const [agentId, tracker] of this.agents) {
-      if (tracker.loopPhase !== 'idle') {
-        states.set(agentId, {
-          loopPhase: tracker.loopPhase,
-          phaseElapsedMs: 0,
-          traceTargetId: tracker.currentTask,
-        });
-      }
-    }
-
-    return states;
-  }
-
-}

package/src/n4-adaptive-manifold/providers/gravitational-provider.ts

@@ -1,191 +0,0 @@
-import type {
-  ManifoldSnapshot,
-  GravitationalConfig,
-  AlgorithmProvider,
-  LayoutAlgorithm,
-} from '../types.js';
-import type { NodeLayout, LayoutResult } from '../../n1-flow-canvas/types.js';
-import { DEFAULT_GRAVITATIONAL_CONFIG } from '../types.js';
-
-/** 
- * Node sizes by kind with support for measured content.
- * Checks node.data.measuredSize first (from Enchanted Blocks), 
- * then falls back to fixed sizes by kind.
- */
-function nodeSize(
-  kind: string, 
-  status: string, 
-  data?: Record<string, unknown>
-): { w: number; h: number } {
-  // Check for measured size from Enchanted Blocks integration
-  const measured = data?.measuredSize as { w: number; h: number } | undefined;
-  if (measured && measured.w > 0 && measured.h > 0) {
-    return measured;
-  }
-  
-  // Fall back to fixed sizes by kind
-  switch (kind) {
-    case 'agent': return { w: 52, h: 46 }; // Large hexagon
-    case 'task':  return { w: 72, h: 48 }; // Compact badge with ID
-    case 'signal': return { w: 10, h: 10 };
-    default:      return { w: 140, h: 32 };
-  }
-}
-
-/**
- * Gravitational layout with deterministic spiral placement.
- * Guarantees no overlap by construction using explicit overlap checking.
- */
-export class GravitationalProvider implements AlgorithmProvider {
-  readonly algorithm: LayoutAlgorithm = 'gravitational';
-  private config: GravitationalConfig;
-
-  constructor(config: Partial<GravitationalConfig> = {}) {
-    this.config = { ...DEFAULT_GRAVITATIONAL_CONFIG, ...config };
-  }
-
-  updateConfig(config: Partial<GravitationalConfig>): void {
-    this.config = { ...this.config, ...config };
-  }
-
-  async layout(
-    snapshot: ManifoldSnapshot,
-    canvasWidth: number,
-    canvasHeight: number,
-  ): Promise<LayoutResult> {
-    const { nodes, edges } = snapshot;
-    if (nodes.length === 0) {
-      return { positions: new Map(), bfsOrder: [] };
-    }
-
-    // Layout world: compact to fit viewport
-    const layoutDim = Math.max(canvasWidth, canvasHeight) * 1.2;
-    const cx = layoutDim / 2;
-    const cy = layoutDim / 2;
-
-    // ── Deterministic spiral layout with guaranteed separation ──────────────
-    // Sort nodes: agents first (center), then claimed tasks, then by priority
-    const sortedNodes = [...nodes].sort((a, b) => {
-      if (a.kind === 'agent' && b.kind !== 'agent') return -1;
-      if (a.kind !== 'agent' && b.kind === 'agent') return 1;
-      const aClaimed = a.metadata?.claiming_agent ? 1 : 0;
-      const bClaimed = b.metadata?.claiming_agent ? 1 : 0;
-      if (aClaimed !== bClaimed) return bClaimed - aClaimed;
-      const priorityOrder: Record<string, number> = { p0: 0, p1: 1, p2: 2, p3: 3 };
-      const aPriority = typeof a.metadata?.priority === 'string' ? a.metadata.priority : '';
-      const bPriority = typeof b.metadata?.priority === 'string' ? b.metadata.priority : '';
-      return (priorityOrder[aPriority] ?? 4) - (priorityOrder[bPriority] ?? 4);
-    });
-
-    // Place nodes in spiral with guaranteed minimum spacing
-    const positions = new Map<string, NodeLayout>();
-    const placed: Array<{ x: number; y: number; w: number; h: number }> = [];
-    
-    for (let i = 0; i < sortedNodes.length; i++) {
-      const node = sortedNodes[i];
-      const { w, h } = nodeSize(node.kind, node.status, node.metadata);
-      
-      // Golden angle spiral for even distribution
-      const goldenAngle = Math.PI * (3 - Math.sqrt(5));
-      const angle = i * goldenAngle;
-      
-      // Radius grows with sqrt(index) for equal area distribution
-      // Start with minimum spacing of 60px between nodes
-      const minSpacing = 60;
-      const baseRadius = Math.sqrt(i) * minSpacing * 1.5;
-      
-      let x = cx + Math.cos(angle) * baseRadius - w / 2;
-      let y = cy + Math.sin(angle) * baseRadius - h / 2;
-      
-      // Check for overlaps with placed nodes and nudge if needed
-      let attempts = 0;
-      while (attempts < 50) {
-        let hasOverlap = false;
-        for (const p of placed) {
-          const dx = Math.abs((x + w/2) - p.x);
-          const dy = Math.abs((y + h/2) - p.y);
-          const minDx = (w + p.w) / 2 + minSpacing;
-          const minDy = (h + p.h) / 2 + minSpacing;
-          if (dx < minDx && dy < minDy) {
-            hasOverlap = true;
-            // Nudge outward along the angle
-            const nudge = minSpacing * (1 + attempts * 0.2);
-            x = cx + Math.cos(angle) * (baseRadius + nudge) - w / 2;
-            y = cy + Math.sin(angle) * (baseRadius + nudge) - h / 2;
-            break;
-          }
-        }
-        if (!hasOverlap) break;
-        attempts++;
-      }
-      
-      // Clamp to bounds
-      x = Math.max(20, Math.min(layoutDim - w - 20, x));
-      y = Math.max(20, Math.min(layoutDim - h - 20, y));
-      
-      positions.set(node.id, { id: node.id, x, y, width: w, height: h });
-      placed.push({ x: x + w/2, y: y + h/2, w, h });
-    }
-
-    // BFS order for edge reveal
-    const incoming = new Set(edges.map((e) => e.target));
-    const roots = nodes.filter((n) => !incoming.has(n.id)).map((n) => n.id);
-    const visited = new Set<string>();
-    const bfsOrder: string[] = [];
-    const queue = [...roots];
-    while (queue.length > 0) {
-      const id = queue.shift()!;
-      if (visited.has(id)) continue;
-      visited.add(id);
-      bfsOrder.push(id);
-      for (const e of edges) {
-        if (e.source === id && !visited.has(e.target)) queue.push(e.target);
-      }
-    }
-    for (const n of nodes) {
-      if (!visited.has(n.id)) bfsOrder.push(n.id);
-    }
-    
-    return { positions, bfsOrder };
-  }
-
-  /** Classify node into gravitational zone based on kind + metadata */
-  private classifyZone(
-    kind: string,
-    metadata: Record<string, unknown>,
-  ): 'center' | 'mid' | 'periphery' {
-    // Agents: zone depends on dominant rotation axis
-    if (kind === 'agent') {
-      const sparkByAxis = metadata.spark_by_axis as
-        | [number, number, number]
-        | undefined;
-      if (sparkByAxis) {
-        const [i, j, k] = sparkByAxis;
-        const max = Math.max(i, j, k);
-        // Tie-break: k (relation) beats j (actuation) beats i (accumulation).
-        // Intentional: balanced agents (i===j===k) land in 'center' — coordination role.
-        if (max === k) return 'center'; // Relation axis dominant → coordination
-        if (max === j) return 'mid';    // Actuation axis dominant → worker
-        return 'periphery';             // Accumulation axis dominant → epistemic
-      }
-      return 'mid'; // default for agents without axis data
-    }
-
-    // Tasks: active tasks (claimed) pull to mid; idle tasks orbit by priority.
-    // p0 = critical → center; p1 = high → mid; p2/p3 = background → periphery.
-    // This gives the idle Pinnacle a legible priority hierarchy, not a random scatter.
-    if (kind === 'task') {
-      if (metadata.claiming_agent) return 'mid';
-      const priority = metadata.priority as string | undefined;
-      if (priority === 'p0') return 'center';
-      if (priority === 'p1') return 'mid';
-      return 'periphery';
-    }
-
-    // Signals: always middleground
-    if (kind === 'signal') return 'mid';
-
-    // Capabilities, intents: background/deferred
-    return 'periphery';
-  }
-}

package/src/n4-adaptive-manifold/providers/manifold-provider.ts

@@ -1,276 +0,0 @@
-// ManifoldProvider — S³ stereographic projection layout.
-// Pure arithmetic: quaternion orientation → 2D disk coordinates.
-// O(n), deterministic, zero simulation.
-//
-// Agents: projected from actual [w,i,j,k] via isometric rotation + orthographic flatten.
-// Tasks: positioned by rotation_axis metadata, row-packed within axis clusters.
-//
-// S-02: no Math.random, no HashMap — all placement is arithmetic.
-
-import type {
-  ManifoldSnapshot,
-  AlgorithmProvider,
-  LayoutAlgorithm,
-} from '../types.js';
-import type { NodeLayout, LayoutResult } from '../../n1-flow-canvas/types.js';
-
-// ── Node sizes (symbol body only, not flag extent) ──────────────────────────
-
-function nodeSize(kind: string, status: string): { w: number; h: number } {
-  switch (kind) {
-    case 'agent': return { w: 54, h: 48 };
-    case 'task':  return status === 'active' ? { w: 120, h: 32 } : { w: 90, h: 26 };
-    case 'signal': return { w: 28, h: 24 };
-    default:      return { w: 90, h: 26 };
-  }
-}
-
-// ── Axis mapping ─────────────────────────────────────────────────────────────
-// i = Accumulation (left), j = Actuation (right), k = Relation (top)
-// These are the canonical axis positions on the projected disk.
-
-const AXIS_POSITIONS: Record<string, { x: number; y: number }> = {
-  accumulation: { x: -0.6, y: 0.0 },   // i-axis → left
-  actuation:    { x: 0.6, y: 0.0 },    // j-axis → right
-  relation:     { x: 0.0, y: -0.6 },   // k-axis → top
-};
-
-// Hybrid axis positions are interpolated between the two axes.
-function hybridPosition(
-  axisA: string,
-  weightA: number,
-  axisB: string,
-  weightB: number,
-): { x: number; y: number } {
-  const a = AXIS_POSITIONS[axisA] ?? { x: 0, y: 0 };
-  const b = AXIS_POSITIONS[axisB] ?? { x: 0, y: 0 };
-  return {
-    x: a.x * weightA + b.x * weightB,
-    y: a.y * weightA + b.y * weightB,
-  };
-}
-
-// Column-based fallback positions — spread tasks across the disk by TOS lifecycle stage.
-// Used when rotation_axis metadata is not yet set (common during early pipeline stages).
-// Positions are in normalized disk coordinates [-1, 1].
-// Cluster centers are separated so that KiCad flags (~140px wide) don't overlap
-// across clusters. Flags flip direction at x > 55% viewport width, so left-side
-// clusters extend right and right-side clusters extend left — keep same-Y clusters
-// at least 0.45 normalized units apart in X (~180px at 960px canvas width).
-const COLUMN_POSITIONS: Record<string, { x: number; y: number }> = {
-  SEED:    { x: -0.62, y: -0.28 }, // upper-left  — proposing, accumulating
-  SPROUT:  { x: -0.22, y: -0.70 }, // top-center  — growing, active
-  WEED:    { x: -0.62, y:  0.42 }, // lower-left  — being weeded
-  GO:      { x:  0.65, y:  0.02 }, // right        — actuating, running
-  CONSULT: { x:  0.52, y: -0.52 }, // upper-right  — relation, consulting
-  FREEZE:  { x:  0.52, y:  0.50 }, // lower-right  — blocked, frozen
-  COMPOST: { x:  0.00, y:  0.65 }, // bottom       — completed
-  PRUNE:   { x:  0.22, y:  0.65 }, // bottom-right — pruned
-};
-
-// Parse rotation_axis string back to a 2D position.
-// Pure axis: "actuation" → AXIS_POSITIONS["actuation"]
-// Hybrid: "accumulation:0.6,actuation:0.4" → interpolated
-// Null with cluster hint: falls back to column-based spread position.
-function axisToPosition(
-  rotationAxis: string | null | undefined,
-  cluster?: string | null,
-): { x: number; y: number } {
-  if (!rotationAxis) {
-    // Fall back to column-based spread so tasks aren't all at center
-    return COLUMN_POSITIONS[cluster ?? ''] ?? { x: 0, y: 0.3 };
-  }
-
-  if (rotationAxis.includes(',')) {
-    // Hybrid format: "axisA:weightA,axisB:weightB"
-    const parts = rotationAxis.split(',');
-    const [axisA, wA] = parts[0].split(':');
-    const [axisB, wB] = parts[1].split(':');
-    return hybridPosition(axisA, parseFloat(wA), axisB, parseFloat(wB));
-  }
-
-  return AXIS_POSITIONS[rotationAxis] ?? { x: 0, y: 0.3 };
-}
-
-// ── Agent projection: quaternion [w,i,j,k] → 2D disk ────────────────────────
-//
-// The quaternion imaginary components (i, j, k) form a point inside the unit ball
-// (since |q|=1, we have i²+j²+k² ≤ 1). We apply an isometric rotation to get a
-// good viewing angle, then orthographically project to 2D.
-//
-// Isometric rotation: rotate 45° around Y, then 35.264° around X
-// (the standard isometric viewing angle). This spreads the three axes evenly
-// on the 2D plane.
-
-const ISO_ANGLE_Y = Math.PI / 4;           // 45°
-const ISO_ANGLE_X = Math.asin(1 / Math.sqrt(3)); // ~35.264°
-
-function projectQuaternionToDisk(
-  orientation: [number, number, number, number], // [w, i, j, k]
-): { x: number; y: number } {
-  const [, qi, qj, qk] = orientation;
-
-  // Rotate around Y axis
-  const cosY = Math.cos(ISO_ANGLE_Y);
-  const sinY = Math.sin(ISO_ANGLE_Y);
-  const rx = qi * cosY + qk * sinY;
-  const ry = qj;
-  const rz = -qi * sinY + qk * cosY;
-
-  // Rotate around X axis
-  const cosX = Math.cos(ISO_ANGLE_X);
-  const sinX = Math.sin(ISO_ANGLE_X);
-  const finalY = ry * cosX - rz * sinX;
-
-  // Orthographic projection: drop Z
-  return { x: rx, y: finalY };
-}
-
-// ── ManifoldProvider ─────────────────────────────────────────────────────────
-
-export class ManifoldProvider implements AlgorithmProvider {
-  readonly algorithm: LayoutAlgorithm = 'manifold';
-
-  async layout(
-    snapshot: ManifoldSnapshot,
-    canvasWidth: number,
-    canvasHeight: number,
-  ): Promise<LayoutResult> {
-    const { nodes, edges } = snapshot;
-    if (nodes.length === 0) {
-      return { positions: new Map(), bfsOrder: [] };
-    }
-
-    // Guard: if canvas hasn't been measured yet, return empty to avoid
-    // collapsing all nodes to (0,0).
-    if (canvasWidth < 100 || canvasHeight < 100) {
-      return { positions: new Map(), bfsOrder: [] };
-    }
-
-    // Asymmetric disk radii — use more horizontal space since canvases are typically wider.
-    // X uses 42% of width, Y uses 38% of height. This spreads nodes across the full viewport
-    // rather than clustering near center.
-    const diskRadiusX = canvasWidth * 0.42;
-    const diskRadiusY = canvasHeight * 0.38;
-    const centerX = canvasWidth / 2;
-    const centerY = canvasHeight / 2;
-
-    const positions = new Map<string, NodeLayout>();
-
-    // ── Separate agents and tasks ──────────────────────────────────────────
-    const agents = nodes.filter(n => n.kind === 'agent');
-    const tasks = nodes.filter(n => n.kind === 'task');
-    const others = nodes.filter(n => n.kind !== 'agent' && n.kind !== 'task');
-
-    // ── Agents: project from quaternion orientation ────────────────────────
-    // Agents occupy the inner disk (45% radius) so they never land on top of
-    // task clusters, which live on the full outer disk (100% radius).
-    const AGENT_DISK_SCALE = 0.45;
-    for (const agent of agents) {
-      const size = nodeSize(agent.kind, agent.status);
-      const proj = projectQuaternionToDisk(
-        (agent.metadata.orientation as [number, number, number, number]) ?? [1, 0, 0, 0],
-      );
-
-      const x = centerX + proj.x * diskRadiusX * AGENT_DISK_SCALE - size.w / 2;
-      const y = centerY + proj.y * diskRadiusY * AGENT_DISK_SCALE - size.h / 2;
-
-      positions.set(agent.id, {
-        id: agent.id,
-        x,
-        y,
-        width: size.w,
-        height: size.h,
-      });
-    }
-
-    // ── Tasks: position by rotation axis, row-packed within clusters ───────
-    // Group tasks by their axis position (normalized to a string key)
-    const taskGroups = new Map<string, Array<{ task: typeof tasks[number]; pos: { x: number; y: number } }>>();
-    for (const task of tasks) {
-      const rotationAxis = task.hint?.rotation_axis as string | null | undefined;
-      const cluster = task.hint?.cluster as string | null | undefined;
-      const pos = axisToPosition(rotationAxis, cluster);
-      const key = `${pos.x.toFixed(2)},${pos.y.toFixed(2)}`;
-      if (!taskGroups.has(key)) taskGroups.set(key, []);
-      taskGroups.get(key)!.push({ task, pos });
-    }
-
-    // Pack tasks within each cluster: row-major, left-to-right.
-    //
-    // Padding geometry (close-zoom KiCad flag constraints):
-    //   Flag extends 118px from node center (tip=8 + body=110).
-    //   Node half-width = 45px. Next col body starts at TASK_PAD_W - 45px.
-    //   No-overlap condition: 118 < TASK_PAD_W - 45 → TASK_PAD_W > 163 → use 170.
-    //   FLAG_H_HIT = 36px. No-overlap: TASK_PAD_H > 36 → use 40.
-    //
-    // MAX_COLS: uncapped sqrt(N). For large clusters (e.g. 207 SEED tasks) this
-    // spreads wide (15 cols × 170px = 2550px), forcing fit-zoom below 0.8 (mid-tier
-    // chips). At close zoom only ~6 cols are visible at once — no flag overlap.
-    const TASK_PAD_W = 170;  // 118px flag extent + 52px margin → 7px gap to next col
-    const TASK_PAD_H = 40;   // 36px FLAG_H_HIT + 4px gap
-
-    for (const [key, group] of taskGroups) {
-      const MAX_COLS = Math.max(1, Math.ceil(Math.sqrt(group.length)));
-      const [cx, cy] = key.split(',').map(Number);
-      const clusterCenterX = centerX + cx * diskRadiusX;
-      const clusterCenterY = centerY + cy * diskRadiusY;
-
-      const cols = Math.min(MAX_COLS, group.length);
-      const totalWidth = cols * TASK_PAD_W;
-      const startX = clusterCenterX - totalWidth / 2;
-      const startY = clusterCenterY - TASK_PAD_H / 2;
-
-      for (let i = 0; i < group.length; i++) {
-        const { task } = group[i];
-        const size = nodeSize(task.kind, task.status);
-        const col = i % cols;
-        const row = Math.floor(i / cols);
-
-        const x = startX + col * TASK_PAD_W + (TASK_PAD_W - size.w) / 2;
-        const y = startY + row * TASK_PAD_H + (TASK_PAD_H - size.h) / 2;
-
-        positions.set(task.id, {
-          id: task.id,
-          x,
-          y,
-          width: size.w,
-          height: size.h,
-        });
-      }
-    }
-
-    // ── Others (signals, etc.): place at center ────────────────────────────
-    for (const node of others) {
-      const size = nodeSize(node.kind, node.status);
-      positions.set(node.id, {
-        id: node.id,
-        x: centerX - size.w / 2,
-        y: centerY - size.h / 2,
-        width: size.w,
-        height: size.h,
-      });
-    }
-
-    // ── BFS order for edge reveal ──────────────────────────────────────────
-    const incoming = new Set(edges.map(e => e.target));
-    const roots = nodes.filter(n => !incoming.has(n.id)).map(n => n.id);
-    const visited = new Set<string>();
-    const bfsOrder: string[] = [];
-    const queue = [...roots];
-    while (queue.length > 0) {
-      const id = queue.shift()!;
-      if (visited.has(id)) continue;
-      visited.add(id);
-      bfsOrder.push(id);
-      for (const e of edges) {
-        if (e.source === id && !visited.has(e.target)) queue.push(e.target);
-      }
-    }
-    for (const n of nodes) {
-      if (!visited.has(n.id)) bfsOrder.push(n.id);
-    }
-
-    return { positions, bfsOrder };
-  }
-}

package/src/n4-adaptive-manifold/transition.ts

@@ -1,90 +0,0 @@
-// N4 TransitionAnimator — Interpolates between two LayoutResults
-// Uses requestAnimationFrame for smooth 60fps transitions.
-// S-02: deterministic interpolation, no random values.
-
-import type { AnimationFrame, EasingFn, NodeLayout } from './types.js';
-
-/** Named easing functions. All map t∈[0,1] → [0,1]. */
-export const EASING_FUNCTIONS: Record<string, EasingFn> = {
-  linear: (t) => t,
-  easeInOutCubic: (t) => (t < 0.5 ? 4 * t * t * t : 1 - Math.pow(-2 * t + 2, 3) / 2),
-  easeOutExpo: (t) => (t === 1 ? 1 : 1 - Math.pow(2, -10 * t)),
-  spring: (t) => {
-    // Damped spring approximation — overshoots ~6% then settles
-    const c4 = (2 * Math.PI) / 3;
-    return t === 0 ? 0 : t === 1 ? 1 : Math.pow(2, -10 * t) * Math.sin((t * 10 - 0.75) * c4) + 1;
-  },
-};
-
-export class TransitionAnimator {
-  private rafId: number | null = null;
-
-  /**
-   * Animate from `from` positions to `to` positions over `durationMs`.
-   * Calls `onFrame` on each animation frame with the interpolated moment.
-   * Calls `onComplete` when the animation finishes.
-   *
-   * Nodes present in `to` but not `from` appear at their target position (no lerp).
-   * Nodes present in `from` but not `to` are dropped from the interpolated map.
-   */
-  animate(
-    from: Map<string, NodeLayout>,
-    to: Map<string, NodeLayout>,
-    durationMs: number,
-    easing: EasingFn,
-    onFrame: (frame: AnimationFrame) => void,
-    onComplete: () => void,
-  ): void {
-    this.cancel();
-
-    const startTime = performance.now();
-
-    const tick = (now: number) => {
-      const elapsed = now - startTime;
-      const rawProgress = Math.min(elapsed / durationMs, 1);
-      const progress = easing(rawProgress);
-
-      const positions = new Map<string, NodeLayout>();
-
-      for (const [id, target] of to) {
-        const source = from.get(id);
-        if (!source) {
-          // New node — appear at target position
-          positions.set(id, { ...target });
-        } else {
-          // Interpolate
-          positions.set(id, {
-            id,
-            x: source.x + (target.x - source.x) * progress,
-            y: source.y + (target.y - source.y) * progress,
-            width: source.width + (target.width - source.width) * progress,
-            height: source.height + (target.height - source.height) * progress,
-          });
-        }
-      }
-
-      onFrame({ positions, progress, elapsedMs: elapsed });
-
-      if (rawProgress < 1) {
-        this.rafId = requestAnimationFrame(tick);
-      } else {
-        this.rafId = null;
-        onComplete();
-      }
-    };
-
-    this.rafId = requestAnimationFrame(tick);
-  }
-
-  /** Cancel any in-flight animation. */
-  cancel(): void {
-    if (this.rafId !== null) {
-      cancelAnimationFrame(this.rafId);
-      this.rafId = null;
-    }
-  }
-
-  get active(): boolean {
-    return this.rafId !== null;
-  }
-}