Verified blast radius, not a guess
You get an instant graph-BFS estimate of dependents and depth immediately, then the backend blast_radius command runs a real ts-morph compiler probe plus a reverse-index BFS to return the actual direct and transitive sets, max depth reached, and a rename-safe / NOT rename-safe verdict.
Honest about what it can't statically see
The verified result surfaces a 'dynamic' list — call sites the compiler can't resolve, each with file:line and a reason. When present, the UI warns 'dynamic — radius not complete here', so you never get false confidence in a rename.
Compiler-resolved truth, not regex
The neighborhood and rankings use only compiler-verified edges (resolution === 'resolved'). Unresolved and regex edges are excluded, so 'used by' and 'uses' reflect real symbol references.
Answers the moment you open it
On entry the view auto-selects the most depended-on symbol — BFS-ranked over backward adjacency, depth-capped at 4 — so the graph and inspector are populated with zero clicks.
Local-first and private
Everything reads the local code map at .13x/map/codegraph.json. No file contents are uploaded, no embeddings, no cloud indexing, no external AI calls, no telemetry. The compiler probe runs locally via the bundled sidecar.
Deterministic, physics-free layout
Both the symbol scene (dep2 | dep1 | SYMBOL | fwd columns) and the FILES scene (shelf-packed directory clusters) use deterministic layouts — no jittery force simulation — with floating edges clipped cleanly to each node's border.