awknowledge — the guide

awgraph(tool, public)

A semantic code graph for agents — AST + tree-sitter, call graphs.

Name

awgraph — A semantic code graph for agents — AST + tree-sitter, call graphs.

The problem it solves

"Who calls this?" answered by grep is a guess. Agents burn enormous context re-reading files to rebuild a graph the parser already knows.

Instead of trusting / you check

instead of trusting: that grep found everything
you check: an AST + tree-sitter call graph an agent can traverse

Adopt it alone

Index one repo and ask it who calls one function.

Install

install

pip install awgraph

Commands

commands

awgraph

Where it sits in the path

Chapter 8 · Many agents, one repo

Links

Source on GitHub · Its own page

Generated 2026-10-29 09:32Z from the ecosystem registry. A field here that is wrong is wrong in the registry — fix it there and this page follows.

One estate, 8 doors

These projects are organs of the same system — the same identity plane, the same agent runtime, the same operational discipline. Follow any of them.

the osaitherium.comThe Living OS these four repos are cut from. Open, no login.pythonawdkBuild AI agent fleets — 3 lines, any backend, local or cloud.markdownawskillsPortable agent skills — self-contained procedures an agent loads on demand.markdownawknowledgeHow to run a coding agent so the result survives — the laws, with evidence.cudaaitherkvcacheNear-optimal KV cache quantization for LLM inference — sub-byte compression.powershellAitherZeroPowerShell 7+ automation framework — numbered, self-describing scripts.writingThe BlogHow all of it is actually built, measured and operated.pythonawrunA priority-aware queue and dispatcher for agentic runs and ad-hoc CI builds. It also judges whether the runner pool is big enough for the queue it is draining, and can ask a host to grow it -- reserving capacity is zero-sum, so a saturated pool needs more of it, not a different share of it.

The ecosystem this belongs to

Every Aitherium repository publishes an aither-manifest.json beside its page, and each surface reads all of them — so the network is browsable from any node in it.