The full upstream README, mirrored here for reference. Install config, tool schemas, adoption signals, and an original overview live on the ParalonCloud Rentals listing page.
Rent GPUs from inside your AI agent. This is an MCP server for the ParalonCloud Rental API: it lets Claude Code, Claude Desktop, Cursor, or any MCP client browse GPUs, start a rental, get its connection URL, and stop it — using natural language.
One key for everything: the same
prlc_key powers ParalonCloud's OpenAI-compatible inference API. Build an agent that calls a model and rents the GPU to run the heavy job.
| Tool | What it does | Cost |
|---|---|---|
list_gpus | List rentable GPUs with price, VRAM, compute capability, country | free |
get_balance | Your credit balance | free |
create_rental | Start a Jupyter rental (async → poll) | spends credits |
get_rental | Status + connection URL once running | free |
list_rentals | Your active rentals (status: "all" for history) | free |
destroy_rental | Stop a rental and stop billing | — |
Use a dedicated key for the agent, not your production key.
The client passes your key via the PARALON_API_KEY env var — you never edit the server.
Claude Desktop — claude_desktop_config.json:
Claude Code — one command:
Cursor — .cursor/mcp.json (same shape as Claude Desktop above).
Optional env: PARALON_BASE_URL (defaults to https://paraloncloud.com/api/v1).
"List the cheapest GPUs I can rent, then start a 2-hour Jupyter rental on one with at least 24GB of VRAM."
The agent calls list_gpus, picks a node, and calls create_rental with hours: 2. It then
polls get_rental for the Jupyter URL. Say "stop it" and it calls destroy_rental.
create_rental and destroy_rental change what you're billed — your MCP client will ask you
to approve them (Claude Code/Desktop confirm tool calls by default). Keep that on.create_rental auto-generates an idempotency key, so a retried call never starts a second GPU.hours so a rental auto-stops even if the agent forgets to.max_active_rentals limit (set in the Console) caps concurrency regardless.MIT