Solves the "where should we meet" problem using actual travel time fairness instead of naive geographic midpoints. Wraps Valhalla routing and OpenStreetMap venue search into five tools: score venues by isochrone-based fairness for 2-10 participants, search for meeting spots, get reachability polygons, fetch turn-by-turn directions, and store L402 Lightning payment credentials. Works immediately with free public routing or point it at your own Valhalla instance for unlimited queries. The underlying rendezvous-kit library handles isochrone intersection math and fairness scoring. Supports both stdio for Claude Desktop and HTTP/SSE for ChatGPT or remote agents. Reach for this when you need AI to coordinate real-world meetups based on actual commute times rather than map geometry.
claude mcp add --transport stdio forgesworn-rendezvous-mcp uvx rendezvous-mcp