Skip to main content
Glama
96,297 servers. Updated

"author:alphaparkinc" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables AI agents to coordinate atomic distributed transactions across a swarm through a prepare/vote phase, unanimous commit-or-abort consensus, quorum validation, and failure recovery. It also layers in vector-clock causal stamping, LWW CRDT reconciliation, and gossip dissemination so multi-node state converges deterministically without external dependencies.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables running second-price Vickrey auctions that match consumer query intent with brand bids while preserving organic recommendation neutrality. It integrates as a zero-dependency MCP server for agentic commerce and privacy-preserving ad monetization workflows.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients to run bounded epidemic dissemination, causal ordering, conflict-free state merging, and quorum-based transaction coordination across autonomous agent swarms.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables AI agents to run structured multi-persona debates over high-stakes decisions and merge their positions into an explainable consensus, complete with logged dissenting minority opinions. It runs as a zero-dependency Python MCP server or importable module, compatible with Claude Desktop, Cursor, and custom agent frameworks.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables agents to track causal relationships, reconcile concurrent state changes, and coordinate consensus across distributed networks using vector clocks, CRDTs, gossip, and quorum-based protocols.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables personal AI agents to perceive ambient context, retain episodic memory with decay, act proactively, and route routine decisions through fast System-1 reflexes while escalating ambiguous multi-hop plans to frontier LLMs. Includes reversible execution checkpoints, token budgets, and local-first memory retention, and plugs into MCP clients like Claude Desktop, Cursor, and Windsurf.
    7
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables agents to synthesize typed MCP tool schemas at runtime, validate Python ASTs for unsafe imports, compile sandboxed callable handlers, and hot-plug them into an active MCP runtime. It provides a zero-dependency, standard-library-only MCP server for safe just-in-time tool creation and execution.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables AI agents to combine ambient multimodal perception, continuous episodic memory, and recency-decay context briefing for fast deterministic decisions and safe tool routing. It integrates with MCP clients to reduce unnecessary frontier LLM calls while enforcing token budgets and local-first memory retention.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP-compatible agents to arbitrate typed state-action schemas, dispatch routine actions deterministically, and apply pre-escalation filters that reduce unnecessary frontier LLM calls. It supports low-latency, schema-enforced routing with safety guardrails and local-first memory retention.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables agents to break high-level business objectives into dependency-ordered sub-task graphs and then directly generate the finished deliverables, such as financial spreadsheets, executive presentations, and analytical reports. It runs as a zero-dependency Python MCP server over JSON-RPC stdio, adding deterministic authorization, role-boundary validation, and telemetry.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients to compute shortest paths, topological dependency orderings, maximum network flows, minimum spanning trees, and PageRank-style centrality over graph topologies using only the Python standard library. It supports optimal multi-agent communication backbone and execution-plan analysis without external graph dependencies.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables autonomous multi-turn negotiation by calculating the Zone of Possible Agreement, modeling concession decay curves, enforcing reservation price thresholds, and generating structured bargaining counter-offers. It supports agentic commerce and contract negotiation workflows through a native MCP interface.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients to run zero-dependency graph algorithms—including topological sorting, strongly connected component detection, shortest paths, maximum flow, minimum spanning trees, and PageRank—for agent dependency resolution and execution planning.
    7
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables autonomous web agents to prune DOM trees, canonicalize URLs against anti-crawler traps, auto-map form input schemas, and convert HTML/Markdown tables into typed JSON records. It also scores agent execution trajectories against gold benchmarks using action-level precision, recall, and Levenshtein sequence edit distance.
    7
    MIT