A unified code + documentation knowledge graph extracted from Sphinx builds and Python AST analysis. Queryable via MCP, CLI, and Python API.
What makes it unique: Nexus is the only tool that puts code structure (call graphs, imports, inheritance, type annotations) and documentation structure (equations, cross-references, citations, theory pages) in the same graph. This enables queries that are impossible with code-only or doc-only tools — like tracing from a literature citation through an equation to the function that implements it.
Documentation: docs/ builds a full guide with Sphinx — authoring (what you write, what you get), vocabulary (node and edge types, id format), tools (the 40 MCP tools by the question they answer), and CLI. The docs enable the extension, so building them is also an end-to-end exercise of nexus against a real project — its own.
pip install -e ".[docs]"
python -m sphinx -b html docs docs/_build/htmlpip install sphinxcontrib-nexusAdd to your docs/conf.py:
extensions = ['sphinxcontrib.nexus']After sphinx-build, find the graph at <project root>/.nexus/graph.db (SQLite) and <project root>/.nexus/graph.json — a convention derived from the project root, which nexus config db prints. The interactive explorer page is the one artefact written into the Sphinx HTML output, at <outdir>/graph/graph.html.
nexus analyze src/ --db graph.dbnexus serve --db graph.db --project-root /path/to/projectnexus setup # project: .mcp.json + .claude/skills/ + .claude/rules/
nexus setup --global # user-level: ~/.claude.json + ~/.claude/skills/ (no rule)
nexus setup --check # what's missing / stale / locally modified (exit 1 if any)
nexus setup --diff # what THIS project changed — '+' lines are yours
nexus setup --force # overwrite local edits (keeps .bak); read --diff first
nexus setup --no-rules # skip the always-on routing rulesetup also installs an always-on routing rule (.claude/rules/nexus-tools.md)
carrying the question→tool table — including when grep/Read is the correct
choice — and the deferred-tool gotcha (mcp__nexus__* surfacing as deferred is
not unavailability; one ToolSearch loads them). Reference it from your
CLAUDE.md so it auto-loads. Positive routing must be always-on: a skill the
agent never invokes cannot steer it.
Your local edits are safe. Skills evolve in the projects that use them, so
setup never overwrites a locally-modified file without --force, and tracks
what it wrote in .claude/nexus-install-manifest.json. Use --diff to see what
your project changed — those edits are field-tested against real sessions and
are often worth sending upstream.
nexus ingest paper.pdf --db graph.db # extracts concepts, equations, citations via LLMnexus visualize --db graph.db # opens HTML graph explorer in browser| Config value | Default | Description |
|---|---|---|
nexus_output |
_nexus |
Where the interactive HTML explorer page is written, relative to the Sphinx HTML output directory. It moves graph.html only — the database, its JSON export and the runtime traces are not configurable; they are derived from the project root at <root>/.nexus/ whenever the project is anchored (has a .nexus/). An unanchored project has no durable root to anchor to, so its store stays with the build output under this directory too. |
nexus_ast_analyze |
True |
Run AST analysis during Sphinx build |
nexus_max_viz_nodes |
300 |
Max nodes in auto-generated graph.html |
nexus_extra_source_dirs |
[] |
Extra directories (relative to project root) to analyze in addition to autodetected source roots. Useful for out-of-tree test suites or separate module roots. |
nexus_analyze_tests |
True |
Whether Python test modules are merged into the graph. Set to False to exclude them entirely (e.g. to keep coverage numbers focused on production code). |
nexus_test_patterns |
["tests/*", "*/tests/*", "test_*.py", "*/test_*.py"] |
Glob patterns (POSIX, evaluated with fnmatch against the path relative to each source dir) identifying Python test modules. Used both by nexus_analyze_tests=False exclusion and by the is_test flag on function nodes — a function is marked as a test only when its name follows the test/test_* convention and it lives in a file matching one of these patterns. |
nexus_source_exclude_patterns |
[] |
Extra glob patterns (POSIX, same fnmatch semantics as nexus_test_patterns) listing directories or files to exclude from AST analysis entirely. Use this for tutorial scripts, vendored copies, legacy modules, or any other source that lives in the project tree but should not contribute nodes or edges to the graph. Patterns are applied in addition to the always-on base exclusions (docs/*, .venv/*, __pycache__/*) and to nexus_test_patterns when nexus_analyze_tests=False. |
nexus_infer_implements |
True |
Whether to run the token-intersection heuristic in merge._infer_implements. Set False when explicit registry / marker / directive coverage is complete and the heuristic's inferred edges are noise. |
nexus_verification_registry |
[] |
List of paths (relative to conf.py) to YAML files declaring explicit verification and implementation edges. See schema version 1 in the README's V&V section. Missing nodes are logged and skipped; schema errors raise RegistryError at build time. |
Nexus works with any Python project:
- Standard packages:
myproject/mypackage/__init__.py— detected automatically - src layout:
src/mypackage/— detected automatically - Flat modules: directories with
.pyfiles but no__init__.py— detected automatically - Custom sys.path: projects that add directories to
sys.pathinconf.py— picked up from the Sphinx build environment
A reference in prose becomes an edge only if nexus can decide what it names.
The rules matter because a wrong binding is invisible — it produces a
well-formed edge pointing at a node that exists, which nothing downstream can
question — while a missing one shows up in dead_references.
Namespace first. A relative reference (:meth:`Quadrature.product`,
:class:`SNMesh`) resolves against the namespace of the node it is
written in, following Sphinx's PythonDomain.find_obj: modname.classname.target,
then modname.target, then target as a fully qualified key. The same bare
name in two classes resolves to two different methods, so resolution is
per-reference rather than once per name.
Then ranked matching. When namespace context does not decide it, candidates are ranked: a real definition always beats a placeholder, then the role's own type preference, then concreteness, then a file-backed node, then the shortest qualified name. Passes that rewire the graph decline when the top candidates are indistinguishable in kind; passes that must return something take the minimum.
Deliberately more generous than Sphinx. An api page writing
:class:`CPMesh` with no currentmodule fails Sphinx's own lookup and
renders as plain text — nexus resolves it. That recovers thousands of real
doc-page-to-class links.
Except into the test tree. Test modules are full of short generic names
(K, record, slab), so they act as a magnet for any bare name with no
better candidate. A test-tree candidate is refused for a reference from
production code; test-to-test references and fully-qualified references are
unaffected.
Scanned directories define the namespace. Any directory you analyze contributes names that bare references can bind to. A prototyping directory importing a module retired months ago mints placeholders that roles elsewhere then match — exclude it:
nexus_source_exclude_patterns = ["scratch/*"]| Type | Source | Example |
|---|---|---|
file |
Sphinx | RST/doc pages |
section |
Sphinx | Labeled sections (:ref: targets) |
equation |
Sphinx | Labeled math equations (:eq: targets) |
proof_object |
Sphinx | A labeled sphinx-proof environment — definition, theorem, algorithm, … The environment kind is in metadata["prf_type"], the prose in metadata["statement"] |
term |
Sphinx | Glossary terms |
function |
Sphinx + AST | Python functions |
class |
Sphinx + AST | Python classes |
method |
Sphinx + AST | Python methods |
attribute |
Sphinx + AST | Class and instance attributes — including self.x: T in __init__, #:-documented bindings, and Cls.attr = ... bound after the class body |
module |
Sphinx + AST | Python modules |
data |
Sphinx + AST | Module-level constants |
exception |
Sphinx | Exception classes |
type |
Sphinx | Type aliases |
external |
Auto-detected | stdlib, builtins, installed packages (numpy, scipy, ...) |
unresolved |
Auto-detected | Referenced but not documented symbols |
tag |
AST | A string/enum value a function discriminates on ("spherical"), target of discriminates_on |
| Edge | Meaning | Source |
|---|---|---|
contains |
Parent → child (toctree, module→function, class→method) | Sphinx + AST |
references |
Cross-reference (:ref:, :term:) |
Sphinx |
documents |
Doc page → code symbol (:func:, :class:) |
Sphinx |
equation_ref |
Doc → equation (:eq:) |
Sphinx |
cites |
Doc → citation | Sphinx |
implements |
Code → equation (inferred from co-occurrence in docs) | Merge |
calls |
Function → function | AST |
imports |
Module → module | AST |
inherits |
Class → parent class | AST |
type_uses |
Function → type (from annotations) | AST |
tests |
Test → tested function | AST |
derives |
Derivation → equation | AST |
discriminates_on |
Function → tag it branches on (if x == "...", match) |
AST |
discretizes |
Discrete statement → the continuous one it discretizes | Directive |
derives_from |
Specialization → the parent it was reduced from | Directive |
approximates |
Closure/truncation → the exact form it stands in for | Directive |
query— keyword search across node namesfile_brief— what the graph knows about one FILE: the module node, the hub, the equations it is accountable to, the doc pages owed an update, and — for a test file — what its gates verify and the command that runs them. The entry point when all you have is a pathnode_at— map a file position (LSP result, stack trace) to the innermost enclosing graph nodecontext— 360-degree view of a symbol: connections grouped by type, each bucket most-connected-first and token-budgeted (limit_per_type, default 25; honestomittedcounts — a hub node's full context is megabytes)neighbors— direct connections with direction and type filteringcallers— functions that call a given node (optionally transitive)callees— functions called by a given node (optionally transitive)shortest_path— how two concepts connectgod_nodes— most connected nodes (entry points)stats— graph-level statistics
impact— blast radius analysis (what breaks if you change X); depth buckets token-budgeted (limit_per_depth, default 50) whiletotal_affectedstays the true countdetect_changes— map git diff to affected symbolsrename— safe multi-file rename with confidence taggingretest— minimum set of tests to re-run after changesdoc_impact— its dual: which documented claims a change puts in question, each with apage:line#anchorto open and whether any test would catch it becoming falsecommunities— detect functional groupings with cohesion scoresgraph_query— Cypher-like pattern matching ("function -calls-> function")bridges— find architectural hotspots connecting communitiesnative_place— functions that may belong inside a class (Feature-Envy / "native place"): every non-test caller is a method of one class. Ranked by strength (genuine relocations first, cross-module before same-module, private before public); public functions tested at least as much as used in production are flaggedlikely_free_primitiveand ranked last (a verified free-function primitive is correctly free)twin_paths— independent implementations of the same computation (Type-2/3 clones / single-source-of-truth violations): function bodies sharing a high fraction of AST structural shingles where neither calls the other. The fingerprint captures the array math (@,einsum, slicing) the call graph cannot see; cross-module pairs ranked firstdiscriminations— tags discriminated at multiple sites (candidate missing types): the same string/enum tag (if geometry == "...",match kind:) branched on by many functions. Makes the coding-elegance smell "a repeated conditional is a missing type — discriminate once, at the boundary" machine-checkable; ranked by site fan-indead_functions— functions/methods with no static callers (dead-code candidates): zero incomingcallsedges from non-test code. A candidate list, not a verdict (dynamic dispatch is invisible to the static graph);public/decoratedflags carry the false-positive sources, private+undecorated ranked firstprotocol_conformers— classes satisfying aProtocol's method-set without declaring it:Protocols are satisfied structurally butinheritsrecords only explicit subclassing, so a structural conformer has no edge. Matches by method-name set (a heuristic — the type checker / LSPgoToImplementationis authoritative)
The static graph is what can run; a runtime overlay is what actually ran. Capture is consumer-side (run a canonical workload under a tracer), then ingest the artifact; the overlay is stored in a sidecar (<project root>/.nexus/traces/<run>.json) keyed by node-ID and re-binds to the live graph at query time — it is never written into graph.db. The query tools accept comma-separated run names to union the canonical suite (so dead means fired in NO run, a branch is missing only if no run took it).
runtime_ingest— ingest acProfile/pstatsdump (counts + time + call edges), acoverage json --branchreport (line/branch coverage), or aviztracerJSON trace (temporal order) and overlay it on the graph by node-ID, joining on(file_path, lineno)with a decorator-window rule (97% join on a real solve).source_prefixdrops stdlib/third-party frames and takes a list — profiling a test suite yieldstests→ package records, so either directory alone drops one endpoint of every one of them.rootis the working directory the traced run used:coverage jsonemits relative file keys and records the rundir nowhere, so without it the join silently binds nothing. An ingest that binds nothing is reported as a failure, with a per-reason breakdown, and is not storedruntime_runs— list ingested runs (name, kind, metadata, node/edge counts)runtime_hotspots— nodes ranked by an observed metric:cumtimeis the dominant observed call chain (the dynamic stage DAG, better thanprocesses' static heuristic for a traced run);ncallsthe iteration-count / recompute smell (a property called 10k×/run = a caching opportunity);tottimeself-timeruntime_edges— runtime call edges overlaid on staticcalls:dynamic_onlyare fired edges the static resolver couldn't see — annotation-mediated dispatch throughself/typed locals and the resolved face of polymorphism (which concrete impl ran);firedare static edges confirmed live with counts;deadare static edges among run-reachable nodes that never fired.substantive_onlydrops edges where either endpoint is a property/trivial accessor, surfacing the polymorphic dispatch above property-getter noiseruntime_markers— tests carrying a marker as pytest resolved it at collection (apytestrun): module-levelpytestmark, class marks and conftest-attached marks all land here, none of which a decorator walk can see. Nothing is enumerated, so a project's own markers work without a nexus release — measured on a real project the AST path reports 0 nodes forfoundation/cap/regression/sentineland this resolves 3709/1707/111/39. Each result carries the pytest node ids and a runnableinvocationruntime_branches— per-node branch coverage (acoverage --branchrun): nodes that didn't take every conditional outcome, with those that alsodiscriminates_ona tag flagged and ranked first — a discrimination always taken one way is a missing type, the dynamic counterpart ofdiscriminationsruntime_timeline— the observed execution sequence from aviztracerrun: nodes in order of first entry (mesh → discretize → sweep → iterate → result), with amax_depthfilter for just the high-level stages
provenance_chain— citation → equation → code traceabilityverification_coverage— equation → code → test coverage map (supportslimit/offsetpagination)verification_audit— complete V&V audit: coverage + staleness + prioritized gap list (supportsgroup_byandinclude_tests)verification_gaps— untagged tests, unverified equations, missing err catchers (supportsmoduleandlevelfilters)staleness— detect docs that drifted from code: git-timestamp drift plus a dead-reference summarydead_references— doc/docstring references whose code target no longer exists (deleted/renamed symbols still referenced by theory pages, docstrings, or quoted type annotations — Sphinx renders these as plain text with no warning); project-rooted names only, with re-export and inheritance rescue passes to keep false positives out. Findings carryminted_by: the files whose own code created the placeholder the reference bound to, so an unmaintained directory minting a namespace is named directly rather than showing up as N unrelated dead referencessession_briefing— AI agent context restorationtrace_error— trace from failing test to equations on call pathmigration_plan— plan dependency migration with phased blast radiusingest— LLM-powered paper/PDF ingestion into the graphprocesses— detect named execution flows through the codebase (supportslimit/offsetpagination)
workspaces— list every checkout of the project (main tree + linked git worktrees) with branch, graph presence, and build provenanceuse_workspace— switch the server to the graph built inside another checkout, referenced by worktree name, branch name, or absolute root path (per-session; auto-reload follows)
Node results from AST-derived symbols carry file_path and lineno,
so any query answer can be fed straight back to an editor, LSP
request, or file read — the position → node bridge (node_at) runs
in both directions.
Because that invites acting on a position, every tool's result is
checked before it leaves the server: a graph is a snapshot of one
checkout, and an edit above a definition moves it without moving the
stored line. Whenever a returned file_path has changed since the graph
was built, a stale key appears beside it naming the build commit. The
check is silent — and costs nothing — on a fresh graph, so the key's
presence is the whole signal.
nexus file-brief path/to/module.py --project-root .Prints ≤6 lines of graph context for one source file — node count and
external callers, the highest-degree node's copy-pasteable ID, the
equations the file implements and how many tests verify them, the doc
pages documenting it, and a staleness flag when the file changed since
the graph was built. It reads the SQLite database directly (no graph
load, ~100 ms warm), which makes it cheap enough to wire into an
edit-time hook (e.g. a Claude Code PostToolUse hook on
Edit|Write): graph context then arrives WITH every edit, the way a
language server pushes diagnostics, instead of waiting to be asked.
--json emits the full structured brief.
Every tool call appends one JSON line to ~/.nexus/usage.jsonl
(timestamp, tool, args, duration, outcome, active workspace) so tool
adoption can be evaluated from recorded behavior. Set
NEXUS_USAGE_LOG=<path> to relocate it, or set it empty to disable.
Journaling never blocks or fails a tool call.
| Resource | Content |
|---|---|
nexus://graph/stats |
Node/edge counts by type |
nexus://graph/communities |
Functional area summaries |
nexus://graph/schema |
Node types, edge types, ID format |
nexus://briefing |
Session briefing for AI agents |
Installed via nexus setup. Each skill triggers on natural language:
| Skill | Triggers on |
|---|---|
nexus-exploring |
"How does X work?", "What calls this?", "Find dead code / clones / missing types" |
nexus-impact |
"Is it safe to change X?", "What tests to re-run?" |
nexus-debugging |
"Why is X failing?", "Which equation is wrong?" |
nexus-refactoring |
"Rename this", "Extract this into a module" |
nexus-verification |
"What's verified?", "Which docs are stale?", "Do docs cite things that no longer exist?" |
nexus-elegance |
"Review this diff for architectural decay", "Is this a twin path?" |
nexus-migration |
"Plan numpy→jax migration" |
nexus-guide |
"What Nexus tools are available?" |
nexus-cli |
"Analyze the codebase", "Start the server" |
behavioral-auto-regression |
Break-glass: an agent grepped for a structural question |
Skills and the routing rule are instructions whose runtime is a language model, so whether they work is an empirical question with a moving answer. evals/ measures it: each scenario is a natural-language symptom a user would type, run as an isolated headless session, graded on the journal — which tools were actually called — not on how good the answer sounds.
./evals/run_evals.py --project . --model haiku # measure
./evals/scorecard.py --results runs/haiku:haiku # aggregate view| style | prompt | measures |
|---|---|---|
direct |
paraphrases the tool's own description | keyword matching — a floor |
indirect |
describes the situation, never names the concept | routing inference |
proactive |
doesn't ask at all; using the tool is part of the job | initiative |
control |
has a correct non-graph answer | over-steering (compliance theater) |
A battery of direct prompts scores near-perfectly and predicts nothing — dead_references is reached by a direct prompt regardless of what instructions are installed, because the words line up.
Fraction of runs reaching an intended tool. Empty journal counts as a miss; only permission-denied runs are excluded.
| model | direct (floor) | indirect | proactive | controls |
|---|---|---|---|---|
| Fable 5 | 11/11 | — | — | — |
| Opus | 15/15 | — | — | — |
| Sonnet | 15/16 | — | — | — |
| Haiku 4.5 | 18/22 | 6/9 | 4/6 | 3/3 |
The situational rows are measured on Haiku deliberately: weak models fail first, so they localize instruction gaps most cheaply, and an instruction that steers Haiku steers everything above it. Controls are clean everywhere — the instructions do not push agents into using the graph where grep/Read is correct.
The gap between the direct and situational columns is the honest measure of steering, and it is why findings that must not be missed are pushed rather than steered — /doc-health and the SessionStart hook inject dead-reference findings deterministically instead of hoping an agent asks.
Ablation against a no-instructions arm gives instructed 3/6 vs bare 0/6 on situational scenarios: eighteen bare runs produced zero correct selections, so nothing in the instruction surface is redundant with model priors. Per-round records, self-grades, and what changed as a result live in evals/BASELINE.md; the authoring methodology and its pitfall catalogue live in .claude/skills/eval-authoring/.
Nexus turns pytest markers, RST directives, and repository-level YAML into typed verification edges in the graph, so audit tools can answer "which equations are actually verified, and by which tests, at what V&V level?" without hand-wiring.
Add standard pytest markers to your tests and they flow through to the graph automatically:
import pytest
@pytest.mark.l0
@pytest.mark.verifies("transport-cartesian")
@pytest.mark.catches("FM-07")
def test_attenuation_vacuum_source():
...After the next Sphinx build, the corresponding test node carries vv_level="L0", verifies=("transport-cartesian",), and catches=("FM-07",) in its metadata. A merge.write_verifies_edges pass then walks every function with a verifies tuple and emits real EdgeType.TESTS edges from the test to math:equation:transport-cartesian. Class-level and module-level pytestmark declarations propagate to contained test methods (gated on is_test=True — private helpers don't inherit).
The @verify.l0(equations=[...], catches=[...]) sugar form is also recognized.
Declare verification edges directly in theory prose:
.. math::
:label: transport-cartesian
\dots
.. implements:: transport-cartesian
:by: orpheus.sn.solve_sn
.. verifies:: transport-cartesian
:by: tests.test_sn.test_transportBoth directives accept an explicit :by: option naming the Python symbol. When omitted, they fall back to inspecting env.ref_context so usage nested inside .. py:function:: / .. autofunction:: blocks picks up the enclosing signature automatically. Directive edges are tagged source="directive" and survive incremental builds via a docname-keyed pending queue with an env-purge-doc handler.
Equations used to be graph leaves: code implemented them, tests verified them, and that was all the graph knew. Three directives declare the structure of the math itself, so provenance_chain returns a spine instead of a flat list — this test verifies the discrete form, which discretizes this continuous one:
.. math::
:label: sn-dd-closure
\psi_c = \tfrac{1}{2}(\psi_L + \psi_R)
.. discretizes:: sn-transport-continuous| Directive | Declares |
|---|---|
discretizes |
This discrete form discretizes that continuous one |
derives-from |
This specialization derives from that parent |
approximates |
This closure or truncation approximates that exact form |
Each names its target as the argument. The source comes from :label:, or — when omitted, as above — from the nearest preceding labeled statement, which is where these are written in practice. Either end may be a math equation or a sphinx-proof environment, so Theorem 3.4 derives-from Definition 3.2 uses the same syntax:
.. derives-from:: def-angular-flux
:label: thm-balanceMisuse is loud and never breaks the build: a directive with no bindable source, one that relates a statement to itself, or one whose target doesn't exist warns and is dropped.
When a project uses sphinx-proof, every labeled prf: environment becomes a proof_object node carrying its title, its statement text, and its kind in metadata["prf_type"]. :prf:ref: cross-references resolve to those nodes, and a prf:algorithm sitting next to the function that runs it makes the math-name ↔ code-name bridge explicit.
Unlabeled environments are skipped: sphinx-proof gives them a serial-numbered synthetic label that renumbers whenever anything above them moves, and nothing can reference them.
For bulk declarative facts that live with the repo rather than the tests, drop a verification.yaml somewhere and point nexus_verification_registry at it:
version: 1
verifications:
- test: py:function:tests.test_solver.test_attenuation
verifies: [transport-cartesian]
level: L0
catches: [FM-07]
implementations:
- function: py:function:orpheus.sn.solve_sn
implements: [transport-cartesian]
confidence: 1.0Schema errors raise RegistryError at build time with a path-and-field context. Missing nodes (test / function / equation) are logged and skipped — the registry can name symbols that don't exist yet without breaking the build.
Every path above produces the same EdgeType.TESTS / EdgeType.IMPLEMENTS edges, so the audit tools don't care which source they came from. The source attribute distinguishes pytest.mark.verifies, directive, registry, and the fallback inferred heuristic.
Tier calibration caveat (#5): the declared tier is the precision instrument; the heuristic tiers are a best-effort safety net. When an equation's implements anchor lands on a low-level primitive (token overlap favors it), tests that exercise the equation through a user-facing driver get credited as heuristic-multihop rather than heuristic-1hop — the coverage is real, but the confidence label reads weaker than it is. Measured on a mature declared-tier project (ORPHEUS, 972 test-bearing entries): 2 equations (0.2%) show this signature. The remedy is an explicit @pytest.mark.verifies("label") on the driver tests, not heuristic tuning — if a multihop-only count surprises you, declare the link.
from sphinxcontrib.nexus.query import GraphQuery
from sphinxcontrib.nexus.export import load_sqlite
from sphinxcontrib.nexus.project import resolve_db
q = GraphQuery(load_sqlite(resolve_db()))
# Full audit bucketed by V&V level
audit = q.verification_audit(group_by="level", include_tests=True)
for level, gaps in audit.grouped.items():
print(f"{level}: {len(gaps)} unverified equations")
print(f"declared: {audit.summary['tests_declared']} heuristic: {audit.summary['tests_inferred']}")
# Gap hunt
gaps = q.verification_gaps(module="orpheus.sn", level="L0")
print(f"untagged tests in orpheus.sn: {len(gaps.untagged_tests)}")
print(f"unverified L0 equations: {len(gaps.unverified_equations)}")Same surface on the MCP side (verification_audit, verification_gaps) and the CLI (nexus audit, nexus gaps).
A graph database is a snapshot of one checkout. Agent harnesses (e.g. Claude Code) spawn the MCP server against the main checkout and keep it running when a session moves into a git worktree — so without help, worktree sessions silently query the wrong branch's graph. Nexus closes that hole in four layers:
- Provenance stamping. Every graph write (Sphinx build,
nexus analyze) stampsmetadata["provenance"]withsource_root,built_at,git_branch,git_commit,git_dirty. Every database says which tree it is a snapshot of. - Discovery.
workspaces(MCP) /nexus workspaces(CLI) enumerate all checkouts viagit worktree listand report which have graphs, on which branch, built from where. - Switching + tripwire.
use_workspace(root)re-points the server at another checkout's graph (one server per agent session, so the switch is session-scoped); it accepts a worktree directory name, a branch name, or an absolute root path.session_briefingcarries aworkspaceblock that warns when files the graph indexes have changed since it was built, or when sibling worktrees have graphs of their own — the wrong-tree mismatch surfaces on the session's first turn. It deliberately does not warn on a branch-name difference alone: fast-forwarding a branch intomainand deleting it leaves a graph that still describes the checkout exactly, and warning there charges a multi-minute rebuild for nothing. - Roots auto-alignment.
session_briefingasks the client (MCProots/list) which directory the session was launched from; when that lies inside a different checkout that has a graph, the server switches to it automatically and reports the switch underworkspace.auto_align. Sessions launched inside a worktree need no manual step at all.
Recommended agent protocol for sessions that enter a worktree
mid-session (roots updates there are client-dependent): build the
docs (or run nexus analyze) inside the worktree, then call
use_workspace(<worktree name>).
Everything lives in .nexus/ at the project root — the same directory
that holds config.toml, which is what makes the root discoverable in
the first place:
<project root>/.nexus/graph.db # SQLite (primary)
<project root>/.nexus/graph.json # JSON export (secondary)
<project root>/.nexus/traces/<run>.json # runtime overlay sidecars
<html outdir>/graph/graph.html # the interactive explorer page
The location of the database is a convention, not a setting: every
surface already found .nexus/ to read the settings, so none of them
needs to be told where the graph is, and there is no second declaration
to drift. nexus config db prints the derived path for scripts and hooks.
- SQLite (primary) — indexed queries, FTS5 full-text search, 0.05ms neighbor lookups. Written with a
schema_versionrow in themetadatatable.load_sqliterejects databases written by a future nexus release withSchemaVersionError, so downgrading consumers fail loud instead of silently misreading. - JSON (secondary) — human-readable, NetworkX node-link format.
- Runtime overlays (
runtime_ingest) — one JSON per run, a sidecar keyed by node-ID, never written intograph.db(whichsphinx-buildregenerates), so a trace survives graph rebuilds and re-binds to the live graph at query time.
Why only the explorer page stays in the build output. Those four
artefacts have three different lifetimes. graph.db/graph.json are
derived and rewritten on every sphinx-build. graph.html is derived
and must be served from the HTML tree. But traces/ is durable,
expensive state — a profiled test run costs minutes to reproduce, and
the sidecar exists precisely so it survives the rebuild that wipes the
database. While all four shared the build directory, they inherited its
lifetime: rm -rf docs/_build destroyed the traces. A directory's
lifetime is set by its most-derived member, so only the artefact that has
to be served stays there.
from sphinxcontrib.nexus.export import load_sqlite
from sphinxcontrib.nexus.project import resolve_db
from sphinxcontrib.nexus.query import GraphQuery
kg = load_sqlite(resolve_db()) # <project root>/.nexus/graph.db
q = GraphQuery(kg)
# What uses numpy.ndarray?
q.query("ndarray", node_types=["external"])
# Blast radius of changing a function
q.impact("py:function:sn_solver.solve_sn", direction="upstream")
# Citation → equation → code chain
q.provenance_chain("py:function:sn_sweep.sweep_spherical")
# Migration plan
q.migration_plan("numpy", "jax")MIT