Builds a local structural knowledge graph of a codebase so AI coding assistants read only the minimal, relevant code during reviews and daily tasks—reducing tokens used while providing blast-radius impact analysis, incremental updates, and MCP integrations.
Automatically evolves Hermes Agent skills, prompts, tool descriptions and code using DSPy + GEPA — mutating text via API calls, evaluating trace-based failures, and selecting variants that pass tests and human PR review. No GPU training required; runs cost roughly $2–$10 per optimization.
Turns any codebase, docs, or wiki into an interactive knowledge graph for exploration, semantic search, and Q&A. Uses a Tree-sitter + multi-agent LLM pipeline to auto-generate node summaries, guided tours, and diff impact analysis; CLI and dashboard integrations.
A distilled 26M-parameter encoder–decoder LLM for on-device function-calling and tool use. Uses a pure-attention Simple Attention Network, provides open weights and local finetuning, and targets high-throughput inference on the Cactus runtime.
Compresses high-dimensional embeddings into low-bit TurboQuant indexes for fast, memory-efficient local vector search. Supports online ingest (no train/rebuild), SIMD kernels that match or beat FAISS, per-vector length-renormalization, and runtime allowlists — suited for privacy-sensitive, low-latency RAG.
Turns a domain description into a Claude Code agent team and the skills they use — auto-generates agent definitions and skill files from six pre-defined team-architecture patterns. Best for teams building structured multi-agent workflows on Claude Code.
Integrates Codex into Claude Code so you can run read-only code reviews, steerable adversarial reviews, and delegate long-running tasks to a local Codex instance via slash commands. Uses the local Codex CLI/app server and Node.js; designed for developers who want seamless handoff between Claude Code and Codex.
Provides a diagnostic suite that audits video-understanding benchmarks to find samples solvable without visual or temporal input, filters those shortcuts, and produces a distilled video-native testbed that reveals major capability gaps in current Video-LLMs.
Maps a codebase plus docs, PDFs, media and configs into a local, queryable knowledge graph; parses code with a local tree-sitter AST (no LLM), uses configurable backends for semantic extraction of non-code, and outputs graph.json, graph.html and a brief report.
An 8B-parameter, instruction-tuned long-context LLM optimized for instruction following, tool-calling, and multilingual dialogue — supports 131072-token context and common NLP tasks such as summarization, QA, code, and RAG.
Curated 100K subset of geometrically diverse CAD construction sequences sampled from a 1M agentically synthesized corpus — each item includes executable CadQuery scripts, 8 rendered views, STL/STEP exports, and precomputed DINOv3 embeddings for retrieval and benchmarking.
Turns a codebase into a live structural knowledge graph that coding agents can query in milliseconds. Bi-temporal, replay-aware indexing of symbols and relationships performed locally with zero LLM API calls; Rust-native, MCP-native integrations and fast incremental updates.