Skip to main content
Glama
521,454 tools. Updated 2026-09-06 11:42

"Sage" matching MCP tools:

  • Create detailed implementation plans by leveraging AI models to debate, critique, and refine strategies. Input a task and absolute paths to generate a consensus plan, optionally saving results and full transcripts for future reference.
    -
  • Send code and receive expert review suggestions with SEARCH/REPLACE edits. Specify absolute paths for files or directories to include in the review context. Ideal for detailed code improvements.
    -
  • Send a prompt with absolute file paths to a sage-like model for its opinion or code review. Embed relevant file contents for context to handle large codebases effectively.
    -
  • Analyze a failed SAGE command to identify error type, root cause, and affected files. Obtain actionable suggestions without running any new commands.
    MIT
  • After a SAGE command fails, get safe fix suggestions with explanations and confidence scores without executing any commands.
    MIT
  • Save or clear a message draft for any Telegram chat. Pass empty text to remove the draft, or use replyTo to attach it to a specific message.
    MIT

Matching MCP Servers

  • A
    license
    A
    quality
    A
    maintenance
    Local-first MCP server and CLI wrapper for AI coding agents. SAGE routes shell commands through a tracked local runner, stores command history on the user’s machine, and returns compressed terminal output to reduce noisy context.
    16
    10
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables Claude Desktop and MCP-compatible agents to formulate, solve, and certify mathematical optimization problems using production-grade open-source solvers, providing mathematically grounded decisions.
    MIT

Matching MCP Connectors

  • Semantic search over the Stoic corpus — Marcus Aurelius' Meditations, Seneca's essays, and Epictetus' Discourses, Enchiridion and Fragments. Search by theme or citation, fetch any passage, or get the daily reflection. Public domain translations, no auth.

  • Find fresh, source-backed rare and one-of-one products at independent retailers.

  • Generate expressive WAV speech using one of 10 persona voices—like Storyteller or Announcer—for branded agents, characters, stories, and alerts.
    MIT
  • Track your ParalleliX Compute API consumption: check request count, PRLX credits spent, and remaining balance.
    MIT
  • Store the current project to its file to prevent losing your work.
    AGPL 3.0
  • Compute health professional or facility density per 100,000 residents by department or commune. Filter by profession, specialty, or establishment type, and compare to national average.
    MIT
  • Receive and atomically claim a bounded message batch for the session. A caller-generated token replays the same batch after a lost response, preventing duplication or missed messages.
    Apache 2.0
  • Replace the existing content of a wiki page and return the new revision ID. Supports edit-conflict detection, section edits, and append/prepend modes.
    MIT
    Destructive
  • Check unified inbox for task assignments, direct messages, and passive replies, with pagination and watermark-based deduplication to track work reliably.
    Apache 2.0
  • Store memory in SAGE as fact (durable, cross-agent) or observation (session-only). Correct old memories by replacement ID to ensure verified updates.
    Apache 2.0
  • Execute one local shell command with a clear purpose label (read, search, test, build, deploy, audit, unknown) to get exit code, compact output, and agent metadata for tracked execution.
    MIT
  • Search for D&D 5e classes, races, backgrounds, and feats. Use natural language queries or filter by source document to find character creation options.
    MIT
  • Query OpenAI token consumption and request counts by service type, model, project, or API key. Monitor these metrics over time with summary or daily breakdowns.
    MIT
  • Check GPU capabilities, find bottlenecks in a ComfyUI workflow, and apply the recommended faster path with before/after proof.
    MIT