Skip to main content
Glama
796,152 tools. Updated 2026-11-17 14:00

"Sovereign Node MCP server" matching MCP tools:

Matching MCP Servers

  • A
    license
    A
    quality
    B
    maintenance
    Enables agents to accomplish multi-step work by writing a single sandboxed JavaScript program that drives shell, filesystem, HTTP, and every tool of any configured MCP server, returning only a small summary instead of raw JSON. This collapses dozens of advertised tool schemas into one tool, cutting per-request context by roughly 26× while keeping disabled upstream servers reachable.
    1
    42 npm
    MIT

Matching MCP Connectors

  • AI-to-AI petrol station. 56 pay-per-call endpoints covering market signals, crypto/DeFi, geopolitics, earnings, insider trades, SEC filings, sanctions screening, ArXiv research, whale tracking, and more. Micropayments in USDC on Base Mainnet via x402 protocol.

  • Privacy-first PDF to Markdown/JSON converter for AI Agents. Optimized for complex B2B invoices (E-Fatura) and tables. Features native Turkish character correction and local-first WASM parsing.

  • Monitor affiliate revenue and referral activity by querying real-time partner analytics, attributed referral counts, and commission payout status from the Aradia partner ledger.
    MIT
  • Plan a Coalesce pipeline by discovering and ranking node types from the repo. Provide a goal and source node IDs to get the best node type and scaffold the pipeline.
    MIT
  • Create a campaign A/B test or convert a sequence email node into a typed A/B test node by supplying a campaign ID or automation node ID; control variant A is generated automatically.
    MIT
    Destructive
  • Fetch a single tree node and the IDs of its attached memories, rules, and skills by providing workspace and node UUIDs.
    MIT
  • Fetch detailed configuration of a Kubernetes node pool, including node count, hardware, autoscaling bounds, LANs, labels, annotations, and available upgrade versions before updating.
    Apache 2.0
  • Set a timed reminder for a map node relative to its deadline, using an offset in days and a local HH:MM time. Replaces the existing reminder for that person and node without changing the deadline.
    MIT
  • Extract a depth-bounded subgraph around a specified node (multi-hop expansion up to depth 3). Use to map clusters of related entities from a knowledge graph by providing node ID and type.
    MIT
  • Check whether this node is the primary trader or standby by reading the Mac heartbeat file, reporting heartbeat age, liveness, bot process counts, and active node for failover awareness.
    MIT
  • Retrieve one Audible category node and its immediate children by ID, so you can avoid fetching the full category tree when only one node is needed.
    MIT
  • Delete a map node and its entire subtree permanently. Verify the node ID first, as the action is irreversible and cannot target the root node or entire maps.
    MIT