@proximap/mcp 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Ameya Borkar
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,57 @@
+# @proximap/mcp
+
+A [Model Context Protocol](https://modelcontextprotocol.io) server that exposes
+[proximap](https://github.com/AmeyaBorkar/proximap) as tools for AI agents
+(e.g. Claude). Powered by OpenStreetMap; no API keys required.
+
+## Tools
+
+- **`find_nearby_amenities`** — `{ query, radiusMeters?, categories?, filters?, accessible?,
+  open?, rankBy?, mode?, explain?, concise?, limit?, language? }` → amenities near a place/`lat,lng`,
+  ranked by distance or road-network travel time. Supports facet filters (diet/payment/wifi/wheelchair),
+  accessibility-first ranking, open-now/open-at, a one-line `summary` per result, and a token-economy
+  `concise` mode.
+- **`geocode`** — `{ query, limit?, language? }` → the best guess plus ranked candidates and an
+  `ambiguous` flag when several distinct places share the name (the many "Springfield"s) — present the
+  candidates instead of guessing.
+- **`list_categories`** — `{}` → the category terms proximap understands (for `find_nearby_amenities`).
+- **`detect_amenity_gaps`** — `{ query, categories?, searchRadiusMeters?, thresholdMeters?, language? }`
+  → which everyday amenities are missing or far, framed as "not found in OSM," never asserted as truth.
+- **`walkability_score`** — `{ query, idealMeters?, maxMeters?, language? }` → a 0–100 score with a
+  transparent per-category breakdown, the missing categories, and a data-confidence note.
+- **`compare_locations`** — `{ locations[2+], weights?, idealMeters?, maxMeters?, language? }` → a ranked
+  scorecard of candidate locations with a per-dimension winner.
+- **`reachable_amenities`** — `{ query, within, mode?, categories?, language? }` → the amenities reachable
+  within a time budget (real isochrone where available), plus the polygon.
+- **`plan_errands`** — `{ query, categories[1+], mode?, end?, candidatesPerCategory?, language? }` → the
+  shortest trip that visits one of each category (Generalized TSP), with the chosen places and totals.
+
+All tools are powered by OpenStreetMap (+ the key-free Valhalla engine for travel time/isochrones) and
+return compact JSON. Travel times and routing degrade gracefully to straight-line estimates if the
+routing engine is unavailable.
+
+## Install & run
+
+```bash
+npm install @proximap/mcp
+proximap-mcp        # starts a stdio MCP server
+```
+
+## Register with an MCP client
+
+```json
+{
+  "mcpServers": {
+    "proximap": {
+      "command": "proximap-mcp"
+    }
+  }
+}
+```
+
+For Claude Code, add the snippet above to your `.mcp.json` (or use
+`claude mcp add proximap proximap-mcp`).
+
+## License
+
+MIT

package/dist/index.js

@@ -0,0 +1,454 @@
+#!/usr/bin/env node
+
+// src/index.ts
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import {
+  categoryVocabulary,
+  compareLocations,
+  detectGaps,
+  disambiguateLocation,
+  findNearbyAmenities,
+  planErrands,
+  reachableAmenities,
+  ValhallaRoutingProvider,
+  walkabilityScore
+} from "@proximap/core";
+import { z } from "zod";
+
+// src/payload.ts
+function toNearbyPayload(result, options = {}) {
+  const { origin, results, total, routing } = result;
+  const head = {
+    origin: {
+      name: origin.name,
+      displayName: origin.displayName,
+      lat: origin.location.lat,
+      lng: origin.location.lng
+    },
+    total,
+    count: results.length,
+    routing: routing ?? null
+  };
+  if (options.concise) {
+    return {
+      ...head,
+      results: results.map((poi) => ({
+        rank: poi.rank,
+        name: poi.name ?? null,
+        category: poi.category,
+        ...poi.travelSeconds !== void 0 ? { travelSeconds: poi.travelSeconds } : { distanceMeters: Math.round(poi.distanceMeters) },
+        lat: poi.location.lat,
+        lng: poi.location.lng,
+        ...poi.rankingReason ? { summary: poi.rankingReason } : {}
+      }))
+    };
+  }
+  return {
+    ...head,
+    results: results.map((poi) => ({
+      rank: poi.rank,
+      name: poi.name ?? null,
+      category: poi.category,
+      kind: poi.kind ?? null,
+      distanceMeters: Math.round(poi.distanceMeters),
+      travelSeconds: poi.travelSeconds ?? null,
+      travelMeters: poi.travelMeters ?? null,
+      lat: poi.location.lat,
+      lng: poi.location.lng,
+      osmId: poi.id,
+      completeness: poi.completeness ?? null,
+      lastVerified: poi.lastVerified ?? null,
+      wheelchair: poi.tags.wheelchair ?? null,
+      wheelchairDescription: poi.tags["wheelchair:description"] ?? null,
+      openState: poi.openState ?? null,
+      nextChange: poi.nextChange ?? null,
+      rankingReason: poi.rankingReason ?? null
+    }))
+  };
+}
+var compactPlace = (place) => ({
+  name: place.name,
+  displayName: place.displayName,
+  lat: place.location.lat,
+  lng: place.location.lng,
+  kind: place.kind ?? null
+});
+function toDisambiguationPayload(result) {
+  return {
+    query: result.query,
+    ambiguous: result.ambiguous,
+    best: result.best ? compactPlace(result.best) : null,
+    candidates: result.candidates.map(compactPlace)
+  };
+}
+function toErrandsPayload(plan) {
+  return {
+    origin: {
+      name: plan.origin.name,
+      displayName: plan.origin.displayName,
+      lat: plan.origin.location.lat,
+      lng: plan.origin.location.lng
+    },
+    end: plan.end ? {
+      displayName: plan.end.displayName,
+      lat: plan.end.location.lat,
+      lng: plan.end.location.lng
+    } : null,
+    mode: plan.mode,
+    totalSeconds: plan.totalSeconds,
+    totalMeters: plan.totalMeters,
+    missing: plan.missing,
+    stops: plan.stops.map((stop) => ({
+      category: stop.category,
+      name: stop.poi.name ?? null,
+      kind: stop.poi.kind ?? null,
+      osmId: stop.poi.id,
+      lat: stop.poi.location.lat,
+      lng: stop.poi.location.lng,
+      legSeconds: stop.legSeconds,
+      legMeters: stop.legMeters
+    }))
+  };
+}
+function toReachablePayload(result) {
+  return {
+    origin: {
+      name: result.origin.name,
+      displayName: result.origin.displayName,
+      lat: result.origin.location.lat,
+      lng: result.origin.location.lng
+    },
+    withinMinutes: result.withinMinutes,
+    mode: result.mode,
+    isochrone: result.isochrone,
+    // [lng, lat] ring, or null
+    count: result.count,
+    results: result.results.map((poi) => ({
+      rank: poi.rank,
+      name: poi.name ?? null,
+      category: poi.category,
+      kind: poi.kind ?? null,
+      travelSeconds: poi.travelSeconds ?? null,
+      travelMeters: poi.travelMeters ?? null,
+      distanceMeters: Math.round(poi.distanceMeters),
+      lat: poi.location.lat,
+      lng: poi.location.lng,
+      osmId: poi.id
+    }))
+  };
+}
+function toGapsPayload(report) {
+  return {
+    origin: {
+      name: report.origin.name,
+      displayName: report.origin.displayName,
+      lat: report.origin.location.lat,
+      lng: report.origin.location.lng
+    },
+    searchRadiusMeters: report.searchRadiusMeters,
+    thresholdMeters: report.thresholdMeters,
+    gaps: report.gaps,
+    missing: report.missing
+  };
+}
+function toScorePayload(report) {
+  return {
+    origin: {
+      name: report.origin.name,
+      displayName: report.origin.displayName,
+      lat: report.origin.location.lat,
+      lng: report.origin.location.lng
+    },
+    score: report.score,
+    confidence: report.confidence,
+    decay: report.decay,
+    breakdown: report.breakdown,
+    missing: report.missing
+  };
+}
+function toComparePayload(report) {
+  return {
+    ranked: report.ranked.map((entry) => ({
+      index: entry.index,
+      displayName: entry.origin.displayName,
+      score: entry.score
+    })),
+    best: report.best ? {
+      index: report.best.index,
+      displayName: report.best.origin.displayName,
+      score: report.best.score
+    } : null,
+    weights: report.weights,
+    dimensions: report.dimensions,
+    locations: report.locations.map((location) => ({
+      name: location.origin.name,
+      displayName: location.origin.displayName,
+      lat: location.origin.location.lat,
+      lng: location.origin.location.lng,
+      score: location.score,
+      confidence: location.confidence,
+      missing: location.missing,
+      breakdown: location.breakdown
+    }))
+  };
+}
+
+// src/index.ts
+var VERSION = "1.0.0";
+function jsonResult(data) {
+  return { content: [{ type: "text", text: JSON.stringify(data, null, 2) }] };
+}
+function errorResult(error) {
+  const message = error instanceof Error ? error.message : String(error);
+  return { content: [{ type: "text", text: `Error: ${message}` }], isError: true };
+}
+var server = new McpServer({ name: "proximap", version: VERSION });
+server.registerTool(
+  "find_nearby_amenities",
+  {
+    title: "Find nearby amenities",
+    description: 'Find amenities, utilities, and points of interest near a place, ranked by distance. Accepts a place name, an address, or a "lat,lng" string. Powered by OpenStreetMap.',
+    inputSchema: {
+      query: z.string().describe('Place name, address, or "lat,lng" coordinates'),
+      radiusMeters: z.number().positive().optional().describe("Search radius in metres (default 1000)"),
+      categories: z.array(z.string()).optional().describe("Restrict to categories or terms, e.g. coffee, pharmacy, petrol"),
+      filters: z.object({
+        diet: z.union([z.string(), z.array(z.string())]).optional(),
+        cuisine: z.union([z.string(), z.array(z.string())]).optional(),
+        payment: z.union([z.string(), z.array(z.string())]).optional(),
+        internetAccess: z.boolean().optional(),
+        outdoorSeating: z.boolean().optional(),
+        takeaway: z.boolean().optional(),
+        delivery: z.boolean().optional(),
+        wheelchair: z.union([z.string(), z.array(z.string())]).optional()
+      }).optional().describe("Facet filters: diet/cuisine/payment, wifi, takeaway, wheelchair, etc."),
+      accessible: z.boolean().optional().describe("Rank step-free / wheelchair-accessible places first"),
+      open: z.string().optional().describe(
+        'Keep only places open at this time: "now", or an ISO datetime like "2026-06-20T21:00". Unknown-hours places are kept and labelled.'
+      ),
+      rankBy: z.enum(["distance", "travelTime"]).optional().describe("Order by straight-line distance (default) or road-network travel time"),
+      mode: z.enum(["walk", "bike", "drive"]).optional().describe("Travel mode for rankBy=travelTime (default walk)"),
+      explain: z.boolean().optional().describe("Add a short ranking reason / summary to each result"),
+      concise: z.boolean().optional().describe("Return a slim, high-signal payload (with a one-line summary) for token economy"),
+      limit: z.number().int().positive().optional().describe("Maximum number of results (default 30)"),
+      language: z.string().optional().describe('Preferred language for names, e.g. "en"')
+    }
+  },
+  async ({
+    query,
+    radiusMeters,
+    categories,
+    filters,
+    accessible,
+    open,
+    rankBy,
+    mode,
+    explain,
+    concise,
+    limit,
+    language
+  }) => {
+    try {
+      const openOption = open === "now" ? "now" : open ? { at: open } : void 0;
+      const explainOn = Boolean(explain || concise);
+      const result = await findNearbyAmenities(query, {
+        ...radiusMeters ? { radiusMeters } : {},
+        ...categories ? { categories } : {},
+        ...filters ? { filters } : {},
+        ...accessible ? { accessible } : {},
+        ...openOption ? { open: openOption } : {},
+        // Travel-time ranking uses the key-free public Valhalla engine.
+        ...rankBy === "travelTime" ? {
+          rankBy: "travelTime",
+          routing: new ValhallaRoutingProvider(),
+          ...mode ? { mode } : {}
+        } : {},
+        ...explainOn ? { explain: true } : {},
+        ...limit ? { limit } : {},
+        ...language ? { language } : {}
+      });
+      return jsonResult(toNearbyPayload(result, { concise: Boolean(concise) }));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+server.registerTool(
+  "geocode",
+  {
+    title: "Geocode a place",
+    description: 'Resolve a place name or address to coordinates using OpenStreetMap. Returns the best guess plus ranked candidates, and an `ambiguous` flag when several distinct places share the name (e.g. the many "Springfield"s) \u2014 present the candidates instead of guessing.',
+    inputSchema: {
+      query: z.string().describe("Place name or address to look up"),
+      limit: z.number().int().positive().optional().describe("Maximum candidates (default 5)"),
+      language: z.string().optional().describe('Preferred language, e.g. "en"')
+    }
+  },
+  async ({ query, limit, language }) => {
+    try {
+      const result = await disambiguateLocation(query, {
+        limit: limit ?? 5,
+        ...language ? { language } : {}
+      });
+      return jsonResult(toDisambiguationPayload(result));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+server.registerTool(
+  "list_categories",
+  {
+    title: "List categories",
+    description: "List the category terms proximap understands, for use with find_nearby_amenities. Returns each canonical term and its top-level category.",
+    inputSchema: {}
+  },
+  async () => jsonResult(categoryVocabulary())
+);
+server.registerTool(
+  "detect_amenity_gaps",
+  {
+    title: "Detect amenity gaps",
+    description: 'Report which everyday amenities are missing or far from a place \u2014 a "what is absent" check. Absence is framed as "not found in OSM within the threshold", not asserted as ground truth.',
+    inputSchema: {
+      query: z.string().describe('Place name, address, or "lat,lng" coordinates'),
+      categories: z.array(z.string()).optional().describe("Category terms to check (defaults to everyday needs)"),
+      searchRadiusMeters: z.number().positive().optional().describe("How far to search for the nearest match (default 5000)"),
+      thresholdMeters: z.number().positive().optional().describe("Distance beyond which a category is a gap (default 1500)"),
+      language: z.string().optional().describe("Preferred language for names")
+    }
+  },
+  async ({ query, categories, searchRadiusMeters, thresholdMeters, language }) => {
+    try {
+      const report = await detectGaps(query, {
+        ...categories ? { categories } : {},
+        ...searchRadiusMeters ? { searchRadiusMeters } : {},
+        ...thresholdMeters ? { thresholdMeters } : {},
+        ...language ? { language } : {}
+      });
+      return jsonResult(toGapsPayload(report));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+server.registerTool(
+  "walkability_score",
+  {
+    title: "Walkability score",
+    description: "Rate how walkable / well-served a location is on a 0-100 scale, with a transparent per-category breakdown (nearest distance + sub-score), the categories missing nearby, and a confidence note reflecting OSM data density. An open, tunable alternative to proprietary walkability indices.",
+    inputSchema: {
+      query: z.string().describe('Place name, address, or "lat,lng" coordinates'),
+      idealMeters: z.number().positive().optional().describe("Distance still scoring full marks, \u22485-min walk (default 400)"),
+      maxMeters: z.number().positive().optional().describe("Distance scoring zero, \u224830-min walk (default 2400)"),
+      language: z.string().optional().describe("Preferred language for names")
+    }
+  },
+  async ({ query, idealMeters, maxMeters, language }) => {
+    try {
+      const decay = {};
+      if (idealMeters) decay.idealMeters = idealMeters;
+      if (maxMeters) decay.maxMeters = maxMeters;
+      const report = await walkabilityScore(query, {
+        ...Object.keys(decay).length > 0 ? { decay } : {},
+        ...language ? { language } : {}
+      });
+      return jsonResult(toScorePayload(report));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+server.registerTool(
+  "compare_locations",
+  {
+    title: "Compare locations",
+    description: "Compare two or more candidate locations (e.g. places to live) by access to weighted daily-need categories, returning a ranked scorecard with a per-dimension winner and a confidence note. Key-free and OSM-native. Out of scope (not in OSM): transit frequency, school quality, crime, prices.",
+    inputSchema: {
+      locations: z.array(z.string()).min(2).describe('Two or more place names, addresses, or "lat,lng" strings'),
+      weights: z.record(z.string(), z.number().positive()).optional().describe('Category term to weight, e.g. { "food": 2, "transport": 3 }'),
+      idealMeters: z.number().positive().optional().describe("Full-marks distance (default 400)"),
+      maxMeters: z.number().positive().optional().describe("Zero-score distance (default 2400)"),
+      language: z.string().optional().describe("Preferred language for names")
+    }
+  },
+  async ({ locations, weights, idealMeters, maxMeters, language }) => {
+    try {
+      const categories = weights ? Object.entries(weights).map(([term, weight]) => ({ term, weight })) : void 0;
+      const decay = {};
+      if (idealMeters) decay.idealMeters = idealMeters;
+      if (maxMeters) decay.maxMeters = maxMeters;
+      const report = await compareLocations(locations, {
+        ...categories ? { categories } : {},
+        ...Object.keys(decay).length > 0 ? { decay } : {},
+        ...language ? { language } : {}
+      });
+      return jsonResult(toComparePayload(report));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+server.registerTool(
+  "reachable_amenities",
+  {
+    title: "Reachable amenities",
+    description: "List the amenities reachable within a time budget (e.g. a 15-minute walk) using a real isochrone where available, falling back to a travel-time threshold. Returns the filtered, time-sorted amenity list (the answer), plus the isochrone polygon. Powered by OpenStreetMap + the key-free Valhalla engine.",
+    inputSchema: {
+      query: z.string().describe('Place name, address, or "lat,lng" coordinates'),
+      within: z.number().positive().describe("Time budget in minutes (e.g. 15)"),
+      mode: z.enum(["walk", "bike", "drive"]).optional().describe("Travel mode (default walk)"),
+      categories: z.array(z.string()).optional().describe("Restrict to categories or terms, e.g. grocery, pharmacy"),
+      language: z.string().optional().describe("Preferred language for names")
+    }
+  },
+  async ({ query, within, mode, categories, language }) => {
+    try {
+      const result = await reachableAmenities(query, {
+        within,
+        routing: new ValhallaRoutingProvider(),
+        ...mode ? { mode } : {},
+        ...categories ? { categories } : {},
+        ...language ? { language } : {}
+      });
+      return jsonResult(toReachablePayload(result));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+server.registerTool(
+  "plan_errands",
+  {
+    title: "Plan errands",
+    description: 'Plan the shortest trip from an origin that visits one of each requested category (e.g. a pharmacy AND an ATM AND a grocery) \u2014 the Generalized-TSP "pick one per set, then optimize" workflow. Returns the chosen places in visit order with per-leg and total travel. Categories with no candidate nearby are reported as missing, not faked.',
+    inputSchema: {
+      query: z.string().describe('Starting place name, address, or "lat,lng" coordinates'),
+      categories: z.array(z.string()).min(1).describe('Categories to hit one of each, e.g. ["pharmacy", "atm", "grocery"]'),
+      mode: z.enum(["walk", "bike", "drive"]).optional().describe("Travel mode (default walk)"),
+      end: z.string().optional().describe('Optional fixed end point (place or "lat,lng")'),
+      candidatesPerCategory: z.number().int().positive().optional().describe("Nearest candidates considered per category (default 5)"),
+      language: z.string().optional().describe("Preferred language for names")
+    }
+  },
+  async ({ query, categories, mode, end, candidatesPerCategory, language }) => {
+    try {
+      const plan = await planErrands(query, {
+        categories,
+        ...mode ? { mode } : {},
+        ...end ? { end } : {},
+        ...candidatesPerCategory ? { candidatesPerCategory } : {},
+        ...language ? { language } : {}
+      });
+      return jsonResult(toErrandsPayload(plan));
+    } catch (error) {
+      return errorResult(error);
+    }
+  }
+);
+var transport = new StdioServerTransport();
+await server.connect(transport);
+process.stderr.write(`proximap MCP server ${VERSION} ready (stdio)
+`);
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/payload.ts"],"sourcesContent":["import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport {\n  categoryVocabulary,\n  compareLocations,\n  detectGaps,\n  disambiguateLocation,\n  findNearbyAmenities,\n  planErrands,\n  reachableAmenities,\n  ValhallaRoutingProvider,\n  walkabilityScore,\n} from '@proximap/core';\nimport { z } from 'zod';\nimport {\n  toComparePayload,\n  toDisambiguationPayload,\n  toErrandsPayload,\n  toGapsPayload,\n  toNearbyPayload,\n  toReachablePayload,\n  toScorePayload,\n} from './payload';\n\nconst VERSION = '1.0.0';\n\nfunction jsonResult(data: unknown) {\n  return { content: [{ type: 'text' as const, text: JSON.stringify(data, null, 2) }] };\n}\n\nfunction errorResult(error: unknown) {\n  const message = error instanceof Error ? error.message : String(error);\n  return { content: [{ type: 'text' as const, text: `Error: ${message}` }], isError: true };\n}\n\nconst server = new McpServer({ name: 'proximap', version: VERSION });\n\nserver.registerTool(\n  'find_nearby_amenities',\n  {\n    title: 'Find nearby amenities',\n    description:\n      'Find amenities, utilities, and points of interest near a place, ranked by distance. ' +\n      'Accepts a place name, an address, or a \"lat,lng\" string. Powered by OpenStreetMap.',\n    inputSchema: {\n      query: z.string().describe('Place name, address, or \"lat,lng\" coordinates'),\n      radiusMeters: z\n        .number()\n        .positive()\n        .optional()\n        .describe('Search radius in metres (default 1000)'),\n      categories: z\n        .array(z.string())\n        .optional()\n        .describe('Restrict to categories or terms, e.g. coffee, pharmacy, petrol'),\n      filters: z\n        .object({\n          diet: z.union([z.string(), z.array(z.string())]).optional(),\n          cuisine: z.union([z.string(), z.array(z.string())]).optional(),\n          payment: z.union([z.string(), z.array(z.string())]).optional(),\n          internetAccess: z.boolean().optional(),\n          outdoorSeating: z.boolean().optional(),\n          takeaway: z.boolean().optional(),\n          delivery: z.boolean().optional(),\n          wheelchair: z.union([z.string(), z.array(z.string())]).optional(),\n        })\n        .optional()\n        .describe('Facet filters: diet/cuisine/payment, wifi, takeaway, wheelchair, etc.'),\n      accessible: z\n        .boolean()\n        .optional()\n        .describe('Rank step-free / wheelchair-accessible places first'),\n      open: z\n        .string()\n        .optional()\n        .describe(\n          'Keep only places open at this time: \"now\", or an ISO datetime like ' +\n            '\"2026-06-20T21:00\". Unknown-hours places are kept and labelled.',\n        ),\n      rankBy: z\n        .enum(['distance', 'travelTime'])\n        .optional()\n        .describe('Order by straight-line distance (default) or road-network travel time'),\n      mode: z\n        .enum(['walk', 'bike', 'drive'])\n        .optional()\n        .describe('Travel mode for rankBy=travelTime (default walk)'),\n      explain: z\n        .boolean()\n        .optional()\n        .describe('Add a short ranking reason / summary to each result'),\n      concise: z\n        .boolean()\n        .optional()\n        .describe('Return a slim, high-signal payload (with a one-line summary) for token economy'),\n      limit: z\n        .number()\n        .int()\n        .positive()\n        .optional()\n        .describe('Maximum number of results (default 30)'),\n      language: z.string().optional().describe('Preferred language for names, e.g. \"en\"'),\n    },\n  },\n  async ({\n    query,\n    radiusMeters,\n    categories,\n    filters,\n    accessible,\n    open,\n    rankBy,\n    mode,\n    explain,\n    concise,\n    limit,\n    language,\n  }) => {\n    try {\n      const openOption = open === 'now' ? 'now' : open ? { at: open } : undefined;\n      // Concise mode needs the per-result summary, so it implies explain.\n      const explainOn = Boolean(explain || concise);\n      const result = await findNearbyAmenities(query, {\n        ...(radiusMeters ? { radiusMeters } : {}),\n        ...(categories ? { categories } : {}),\n        ...(filters ? { filters } : {}),\n        ...(accessible ? { accessible } : {}),\n        ...(openOption ? { open: openOption } : {}),\n        // Travel-time ranking uses the key-free public Valhalla engine.\n        ...(rankBy === 'travelTime'\n          ? {\n              rankBy: 'travelTime' as const,\n              routing: new ValhallaRoutingProvider(),\n              ...(mode ? { mode } : {}),\n            }\n          : {}),\n        ...(explainOn ? { explain: true } : {}),\n        ...(limit ? { limit } : {}),\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toNearbyPayload(result, { concise: Boolean(concise) }));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nserver.registerTool(\n  'geocode',\n  {\n    title: 'Geocode a place',\n    description:\n      'Resolve a place name or address to coordinates using OpenStreetMap. Returns the best ' +\n      'guess plus ranked candidates, and an `ambiguous` flag when several distinct places share ' +\n      'the name (e.g. the many \"Springfield\"s) — present the candidates instead of guessing.',\n    inputSchema: {\n      query: z.string().describe('Place name or address to look up'),\n      limit: z.number().int().positive().optional().describe('Maximum candidates (default 5)'),\n      language: z.string().optional().describe('Preferred language, e.g. \"en\"'),\n    },\n  },\n  async ({ query, limit, language }) => {\n    try {\n      const result = await disambiguateLocation(query, {\n        limit: limit ?? 5,\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toDisambiguationPayload(result));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nserver.registerTool(\n  'list_categories',\n  {\n    title: 'List categories',\n    description:\n      'List the category terms proximap understands, for use with find_nearby_amenities. ' +\n      'Returns each canonical term and its top-level category.',\n    inputSchema: {},\n  },\n  async () => jsonResult(categoryVocabulary()),\n);\n\nserver.registerTool(\n  'detect_amenity_gaps',\n  {\n    title: 'Detect amenity gaps',\n    description:\n      'Report which everyday amenities are missing or far from a place — a \"what is absent\" check. ' +\n      'Absence is framed as \"not found in OSM within the threshold\", not asserted as ground truth.',\n    inputSchema: {\n      query: z.string().describe('Place name, address, or \"lat,lng\" coordinates'),\n      categories: z\n        .array(z.string())\n        .optional()\n        .describe('Category terms to check (defaults to everyday needs)'),\n      searchRadiusMeters: z\n        .number()\n        .positive()\n        .optional()\n        .describe('How far to search for the nearest match (default 5000)'),\n      thresholdMeters: z\n        .number()\n        .positive()\n        .optional()\n        .describe('Distance beyond which a category is a gap (default 1500)'),\n      language: z.string().optional().describe('Preferred language for names'),\n    },\n  },\n  async ({ query, categories, searchRadiusMeters, thresholdMeters, language }) => {\n    try {\n      const report = await detectGaps(query, {\n        ...(categories ? { categories } : {}),\n        ...(searchRadiusMeters ? { searchRadiusMeters } : {}),\n        ...(thresholdMeters ? { thresholdMeters } : {}),\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toGapsPayload(report));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nserver.registerTool(\n  'walkability_score',\n  {\n    title: 'Walkability score',\n    description:\n      'Rate how walkable / well-served a location is on a 0-100 scale, with a transparent ' +\n      'per-category breakdown (nearest distance + sub-score), the categories missing nearby, ' +\n      'and a confidence note reflecting OSM data density. An open, tunable alternative to ' +\n      'proprietary walkability indices.',\n    inputSchema: {\n      query: z.string().describe('Place name, address, or \"lat,lng\" coordinates'),\n      idealMeters: z\n        .number()\n        .positive()\n        .optional()\n        .describe('Distance still scoring full marks, ≈5-min walk (default 400)'),\n      maxMeters: z\n        .number()\n        .positive()\n        .optional()\n        .describe('Distance scoring zero, ≈30-min walk (default 2400)'),\n      language: z.string().optional().describe('Preferred language for names'),\n    },\n  },\n  async ({ query, idealMeters, maxMeters, language }) => {\n    try {\n      const decay: { idealMeters?: number; maxMeters?: number } = {};\n      if (idealMeters) decay.idealMeters = idealMeters;\n      if (maxMeters) decay.maxMeters = maxMeters;\n      const report = await walkabilityScore(query, {\n        ...(Object.keys(decay).length > 0 ? { decay } : {}),\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toScorePayload(report));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nserver.registerTool(\n  'compare_locations',\n  {\n    title: 'Compare locations',\n    description:\n      'Compare two or more candidate locations (e.g. places to live) by access to weighted ' +\n      'daily-need categories, returning a ranked scorecard with a per-dimension winner and a ' +\n      'confidence note. Key-free and OSM-native. Out of scope (not in OSM): transit frequency, ' +\n      'school quality, crime, prices.',\n    inputSchema: {\n      locations: z\n        .array(z.string())\n        .min(2)\n        .describe('Two or more place names, addresses, or \"lat,lng\" strings'),\n      weights: z\n        .record(z.string(), z.number().positive())\n        .optional()\n        .describe('Category term to weight, e.g. { \"food\": 2, \"transport\": 3 }'),\n      idealMeters: z.number().positive().optional().describe('Full-marks distance (default 400)'),\n      maxMeters: z.number().positive().optional().describe('Zero-score distance (default 2400)'),\n      language: z.string().optional().describe('Preferred language for names'),\n    },\n  },\n  async ({ locations, weights, idealMeters, maxMeters, language }) => {\n    try {\n      const categories = weights\n        ? Object.entries(weights).map(([term, weight]) => ({ term, weight }))\n        : undefined;\n      const decay: { idealMeters?: number; maxMeters?: number } = {};\n      if (idealMeters) decay.idealMeters = idealMeters;\n      if (maxMeters) decay.maxMeters = maxMeters;\n      const report = await compareLocations(locations, {\n        ...(categories ? { categories } : {}),\n        ...(Object.keys(decay).length > 0 ? { decay } : {}),\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toComparePayload(report));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nserver.registerTool(\n  'reachable_amenities',\n  {\n    title: 'Reachable amenities',\n    description:\n      'List the amenities reachable within a time budget (e.g. a 15-minute walk) using a real ' +\n      'isochrone where available, falling back to a travel-time threshold. Returns the filtered, ' +\n      'time-sorted amenity list (the answer), plus the isochrone polygon. Powered by OpenStreetMap ' +\n      '+ the key-free Valhalla engine.',\n    inputSchema: {\n      query: z.string().describe('Place name, address, or \"lat,lng\" coordinates'),\n      within: z.number().positive().describe('Time budget in minutes (e.g. 15)'),\n      mode: z.enum(['walk', 'bike', 'drive']).optional().describe('Travel mode (default walk)'),\n      categories: z\n        .array(z.string())\n        .optional()\n        .describe('Restrict to categories or terms, e.g. grocery, pharmacy'),\n      language: z.string().optional().describe('Preferred language for names'),\n    },\n  },\n  async ({ query, within, mode, categories, language }) => {\n    try {\n      const result = await reachableAmenities(query, {\n        within,\n        routing: new ValhallaRoutingProvider(),\n        ...(mode ? { mode } : {}),\n        ...(categories ? { categories } : {}),\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toReachablePayload(result));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nserver.registerTool(\n  'plan_errands',\n  {\n    title: 'Plan errands',\n    description:\n      'Plan the shortest trip from an origin that visits one of each requested category ' +\n      '(e.g. a pharmacy AND an ATM AND a grocery) — the Generalized-TSP \"pick one per set, then ' +\n      'optimize\" workflow. Returns the chosen places in visit order with per-leg and total travel. ' +\n      'Categories with no candidate nearby are reported as missing, not faked.',\n    inputSchema: {\n      query: z.string().describe('Starting place name, address, or \"lat,lng\" coordinates'),\n      categories: z\n        .array(z.string())\n        .min(1)\n        .describe('Categories to hit one of each, e.g. [\"pharmacy\", \"atm\", \"grocery\"]'),\n      mode: z.enum(['walk', 'bike', 'drive']).optional().describe('Travel mode (default walk)'),\n      end: z.string().optional().describe('Optional fixed end point (place or \"lat,lng\")'),\n      candidatesPerCategory: z\n        .number()\n        .int()\n        .positive()\n        .optional()\n        .describe('Nearest candidates considered per category (default 5)'),\n      language: z.string().optional().describe('Preferred language for names'),\n    },\n  },\n  async ({ query, categories, mode, end, candidatesPerCategory, language }) => {\n    try {\n      const plan = await planErrands(query, {\n        categories,\n        ...(mode ? { mode } : {}),\n        ...(end ? { end } : {}),\n        ...(candidatesPerCategory ? { candidatesPerCategory } : {}),\n        ...(language ? { language } : {}),\n      });\n      return jsonResult(toErrandsPayload(plan));\n    } catch (error) {\n      return errorResult(error);\n    }\n  },\n);\n\nconst transport = new StdioServerTransport();\nawait server.connect(transport);\nprocess.stderr.write(`proximap MCP server ${VERSION} ready (stdio)\\n`);\n","import type {\n  ComparisonReport,\n  Disambiguation,\n  ErrandPlan,\n  GapReport,\n  NearbyResult,\n  Place,\n  ReachableResult,\n  WalkabilityReport,\n} from '@proximap/core';\n\n/**\n * Flatten a nearby-search result for agents. `concise` returns a slim, high-signal\n * payload (rank/name/category/metric/coords + a one-line summary) — materially\n * smaller than the detailed shape, for token economy.\n */\nexport function toNearbyPayload(result: NearbyResult, options: { concise?: boolean } = {}) {\n  const { origin, results, total, routing } = result;\n  const head = {\n    origin: {\n      name: origin.name,\n      displayName: origin.displayName,\n      lat: origin.location.lat,\n      lng: origin.location.lng,\n    },\n    total,\n    count: results.length,\n    routing: routing ?? null,\n  };\n\n  if (options.concise) {\n    return {\n      ...head,\n      results: results.map((poi) => ({\n        rank: poi.rank,\n        name: poi.name ?? null,\n        category: poi.category,\n        ...(poi.travelSeconds !== undefined\n          ? { travelSeconds: poi.travelSeconds }\n          : { distanceMeters: Math.round(poi.distanceMeters) }),\n        lat: poi.location.lat,\n        lng: poi.location.lng,\n        ...(poi.rankingReason ? { summary: poi.rankingReason } : {}),\n      })),\n    };\n  }\n\n  return {\n    ...head,\n    results: results.map((poi) => ({\n      rank: poi.rank,\n      name: poi.name ?? null,\n      category: poi.category,\n      kind: poi.kind ?? null,\n      distanceMeters: Math.round(poi.distanceMeters),\n      travelSeconds: poi.travelSeconds ?? null,\n      travelMeters: poi.travelMeters ?? null,\n      lat: poi.location.lat,\n      lng: poi.location.lng,\n      osmId: poi.id,\n      completeness: poi.completeness ?? null,\n      lastVerified: poi.lastVerified ?? null,\n      wheelchair: poi.tags.wheelchair ?? null,\n      wheelchairDescription: poi.tags['wheelchair:description'] ?? null,\n      openState: poi.openState ?? null,\n      nextChange: poi.nextChange ?? null,\n      rankingReason: poi.rankingReason ?? null,\n    })),\n  };\n}\n\nconst compactPlace = (place: Place) => ({\n  name: place.name,\n  displayName: place.displayName,\n  lat: place.location.lat,\n  lng: place.location.lng,\n  kind: place.kind ?? null,\n});\n\n/** Flatten a geocoding disambiguation: best guess + ranked candidates + an ambiguity flag. */\nexport function toDisambiguationPayload(result: Disambiguation) {\n  return {\n    query: result.query,\n    ambiguous: result.ambiguous,\n    best: result.best ? compactPlace(result.best) : null,\n    candidates: result.candidates.map(compactPlace),\n  };\n}\n\n/** Flatten an errand plan for agent consumption. */\nexport function toErrandsPayload(plan: ErrandPlan) {\n  return {\n    origin: {\n      name: plan.origin.name,\n      displayName: plan.origin.displayName,\n      lat: plan.origin.location.lat,\n      lng: plan.origin.location.lng,\n    },\n    end: plan.end\n      ? {\n          displayName: plan.end.displayName,\n          lat: plan.end.location.lat,\n          lng: plan.end.location.lng,\n        }\n      : null,\n    mode: plan.mode,\n    totalSeconds: plan.totalSeconds,\n    totalMeters: plan.totalMeters,\n    missing: plan.missing,\n    stops: plan.stops.map((stop) => ({\n      category: stop.category,\n      name: stop.poi.name ?? null,\n      kind: stop.poi.kind ?? null,\n      osmId: stop.poi.id,\n      lat: stop.poi.location.lat,\n      lng: stop.poi.location.lng,\n      legSeconds: stop.legSeconds,\n      legMeters: stop.legMeters,\n    })),\n  };\n}\n\n/** Flatten an isochrone-reachability result for agent consumption. */\nexport function toReachablePayload(result: ReachableResult) {\n  return {\n    origin: {\n      name: result.origin.name,\n      displayName: result.origin.displayName,\n      lat: result.origin.location.lat,\n      lng: result.origin.location.lng,\n    },\n    withinMinutes: result.withinMinutes,\n    mode: result.mode,\n    isochrone: result.isochrone, // [lng, lat] ring, or null\n    count: result.count,\n    results: result.results.map((poi) => ({\n      rank: poi.rank,\n      name: poi.name ?? null,\n      category: poi.category,\n      kind: poi.kind ?? null,\n      travelSeconds: poi.travelSeconds ?? null,\n      travelMeters: poi.travelMeters ?? null,\n      distanceMeters: Math.round(poi.distanceMeters),\n      lat: poi.location.lat,\n      lng: poi.location.lng,\n      osmId: poi.id,\n    })),\n  };\n}\n\n/** Map geocoding candidates to compact records. */\nexport function toGeocodePayload(places: Place[]) {\n  return places.map((place) => ({\n    name: place.name,\n    displayName: place.displayName,\n    lat: place.location.lat,\n    lng: place.location.lng,\n    kind: place.kind ?? null,\n  }));\n}\n\n/** Flatten an amenity-gap report for agent consumption. */\nexport function toGapsPayload(report: GapReport) {\n  return {\n    origin: {\n      name: report.origin.name,\n      displayName: report.origin.displayName,\n      lat: report.origin.location.lat,\n      lng: report.origin.location.lng,\n    },\n    searchRadiusMeters: report.searchRadiusMeters,\n    thresholdMeters: report.thresholdMeters,\n    gaps: report.gaps,\n    missing: report.missing,\n  };\n}\n\n/** Flatten a walkability report for agent consumption. */\nexport function toScorePayload(report: WalkabilityReport) {\n  return {\n    origin: {\n      name: report.origin.name,\n      displayName: report.origin.displayName,\n      lat: report.origin.location.lat,\n      lng: report.origin.location.lng,\n    },\n    score: report.score,\n    confidence: report.confidence,\n    decay: report.decay,\n    breakdown: report.breakdown,\n    missing: report.missing,\n  };\n}\n\n/** Flatten a location-comparison report for agent consumption. */\nexport function toComparePayload(report: ComparisonReport) {\n  return {\n    ranked: report.ranked.map((entry) => ({\n      index: entry.index,\n      displayName: entry.origin.displayName,\n      score: entry.score,\n    })),\n    best: report.best\n      ? {\n          index: report.best.index,\n          displayName: report.best.origin.displayName,\n          score: report.best.score,\n        }\n      : null,\n    weights: report.weights,\n    dimensions: report.dimensions,\n    locations: report.locations.map((location) => ({\n      name: location.origin.name,\n      displayName: location.origin.displayName,\n      lat: location.origin.location.lat,\n      lng: location.origin.location.lng,\n      score: location.score,\n      confidence: location.confidence,\n      missing: location.missing,\n      breakdown: location.breakdown,\n    })),\n  };\n}\n"],"mappings":";;;AAAA,SAAS,iBAAiB;AAC1B,SAAS,4BAA4B;AACrC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,SAAS;;;ACGX,SAAS,gBAAgB,QAAsB,UAAiC,CAAC,GAAG;AACzF,QAAM,EAAE,QAAQ,SAAS,OAAO,QAAQ,IAAI;AAC5C,QAAM,OAAO;AAAA,IACX,QAAQ;AAAA,MACN,MAAM,OAAO;AAAA,MACb,aAAa,OAAO;AAAA,MACpB,KAAK,OAAO,SAAS;AAAA,MACrB,KAAK,OAAO,SAAS;AAAA,IACvB;AAAA,IACA;AAAA,IACA,OAAO,QAAQ;AAAA,IACf,SAAS,WAAW;AAAA,EACtB;AAEA,MAAI,QAAQ,SAAS;AACnB,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS,QAAQ,IAAI,CAAC,SAAS;AAAA,QAC7B,MAAM,IAAI;AAAA,QACV,MAAM,IAAI,QAAQ;AAAA,QAClB,UAAU,IAAI;AAAA,QACd,GAAI,IAAI,kBAAkB,SACtB,EAAE,eAAe,IAAI,cAAc,IACnC,EAAE,gBAAgB,KAAK,MAAM,IAAI,cAAc,EAAE;AAAA,QACrD,KAAK,IAAI,SAAS;AAAA,QAClB,KAAK,IAAI,SAAS;AAAA,QAClB,GAAI,IAAI,gBAAgB,EAAE,SAAS,IAAI,cAAc,IAAI,CAAC;AAAA,MAC5D,EAAE;AAAA,IACJ;AAAA,EACF;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS,QAAQ,IAAI,CAAC,SAAS;AAAA,MAC7B,MAAM,IAAI;AAAA,MACV,MAAM,IAAI,QAAQ;AAAA,MAClB,UAAU,IAAI;AAAA,MACd,MAAM,IAAI,QAAQ;AAAA,MAClB,gBAAgB,KAAK,MAAM,IAAI,cAAc;AAAA,MAC7C,eAAe,IAAI,iBAAiB;AAAA,MACpC,cAAc,IAAI,gBAAgB;AAAA,MAClC,KAAK,IAAI,SAAS;AAAA,MAClB,KAAK,IAAI,SAAS;AAAA,MAClB,OAAO,IAAI;AAAA,MACX,cAAc,IAAI,gBAAgB;AAAA,MAClC,cAAc,IAAI,gBAAgB;AAAA,MAClC,YAAY,IAAI,KAAK,cAAc;AAAA,MACnC,uBAAuB,IAAI,KAAK,wBAAwB,KAAK;AAAA,MAC7D,WAAW,IAAI,aAAa;AAAA,MAC5B,YAAY,IAAI,cAAc;AAAA,MAC9B,eAAe,IAAI,iBAAiB;AAAA,IACtC,EAAE;AAAA,EACJ;AACF;AAEA,IAAM,eAAe,CAAC,WAAkB;AAAA,EACtC,MAAM,MAAM;AAAA,EACZ,aAAa,MAAM;AAAA,EACnB,KAAK,MAAM,SAAS;AAAA,EACpB,KAAK,MAAM,SAAS;AAAA,EACpB,MAAM,MAAM,QAAQ;AACtB;AAGO,SAAS,wBAAwB,QAAwB;AAC9D,SAAO;AAAA,IACL,OAAO,OAAO;AAAA,IACd,WAAW,OAAO;AAAA,IAClB,MAAM,OAAO,OAAO,aAAa,OAAO,IAAI,IAAI;AAAA,IAChD,YAAY,OAAO,WAAW,IAAI,YAAY;AAAA,EAChD;AACF;AAGO,SAAS,iBAAiB,MAAkB;AACjD,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,MAAM,KAAK,OAAO;AAAA,MAClB,aAAa,KAAK,OAAO;AAAA,MACzB,KAAK,KAAK,OAAO,SAAS;AAAA,MAC1B,KAAK,KAAK,OAAO,SAAS;AAAA,IAC5B;AAAA,IACA,KAAK,KAAK,MACN;AAAA,MACE,aAAa,KAAK,IAAI;AAAA,MACtB,KAAK,KAAK,IAAI,SAAS;AAAA,MACvB,KAAK,KAAK,IAAI,SAAS;AAAA,IACzB,IACA;AAAA,IACJ,MAAM,KAAK;AAAA,IACX,cAAc,KAAK;AAAA,IACnB,aAAa,KAAK;AAAA,IAClB,SAAS,KAAK;AAAA,IACd,OAAO,KAAK,MAAM,IAAI,CAAC,UAAU;AAAA,MAC/B,UAAU,KAAK;AAAA,MACf,MAAM,KAAK,IAAI,QAAQ;AAAA,MACvB,MAAM,KAAK,IAAI,QAAQ;AAAA,MACvB,OAAO,KAAK,IAAI;AAAA,MAChB,KAAK,KAAK,IAAI,SAAS;AAAA,MACvB,KAAK,KAAK,IAAI,SAAS;AAAA,MACvB,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK;AAAA,IAClB,EAAE;AAAA,EACJ;AACF;AAGO,SAAS,mBAAmB,QAAyB;AAC1D,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,MAAM,OAAO,OAAO;AAAA,MACpB,aAAa,OAAO,OAAO;AAAA,MAC3B,KAAK,OAAO,OAAO,SAAS;AAAA,MAC5B,KAAK,OAAO,OAAO,SAAS;AAAA,IAC9B;AAAA,IACA,eAAe,OAAO;AAAA,IACtB,MAAM,OAAO;AAAA,IACb,WAAW,OAAO;AAAA;AAAA,IAClB,OAAO,OAAO;AAAA,IACd,SAAS,OAAO,QAAQ,IAAI,CAAC,SAAS;AAAA,MACpC,MAAM,IAAI;AAAA,MACV,MAAM,IAAI,QAAQ;AAAA,MAClB,UAAU,IAAI;AAAA,MACd,MAAM,IAAI,QAAQ;AAAA,MAClB,eAAe,IAAI,iBAAiB;AAAA,MACpC,cAAc,IAAI,gBAAgB;AAAA,MAClC,gBAAgB,KAAK,MAAM,IAAI,cAAc;AAAA,MAC7C,KAAK,IAAI,SAAS;AAAA,MAClB,KAAK,IAAI,SAAS;AAAA,MAClB,OAAO,IAAI;AAAA,IACb,EAAE;AAAA,EACJ;AACF;AAcO,SAAS,cAAc,QAAmB;AAC/C,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,MAAM,OAAO,OAAO;AAAA,MACpB,aAAa,OAAO,OAAO;AAAA,MAC3B,KAAK,OAAO,OAAO,SAAS;AAAA,MAC5B,KAAK,OAAO,OAAO,SAAS;AAAA,IAC9B;AAAA,IACA,oBAAoB,OAAO;AAAA,IAC3B,iBAAiB,OAAO;AAAA,IACxB,MAAM,OAAO;AAAA,IACb,SAAS,OAAO;AAAA,EAClB;AACF;AAGO,SAAS,eAAe,QAA2B;AACxD,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,MAAM,OAAO,OAAO;AAAA,MACpB,aAAa,OAAO,OAAO;AAAA,MAC3B,KAAK,OAAO,OAAO,SAAS;AAAA,MAC5B,KAAK,OAAO,OAAO,SAAS;AAAA,IAC9B;AAAA,IACA,OAAO,OAAO;AAAA,IACd,YAAY,OAAO;AAAA,IACnB,OAAO,OAAO;AAAA,IACd,WAAW,OAAO;AAAA,IAClB,SAAS,OAAO;AAAA,EAClB;AACF;AAGO,SAAS,iBAAiB,QAA0B;AACzD,SAAO;AAAA,IACL,QAAQ,OAAO,OAAO,IAAI,CAAC,WAAW;AAAA,MACpC,OAAO,MAAM;AAAA,MACb,aAAa,MAAM,OAAO;AAAA,MAC1B,OAAO,MAAM;AAAA,IACf,EAAE;AAAA,IACF,MAAM,OAAO,OACT;AAAA,MACE,OAAO,OAAO,KAAK;AAAA,MACnB,aAAa,OAAO,KAAK,OAAO;AAAA,MAChC,OAAO,OAAO,KAAK;AAAA,IACrB,IACA;AAAA,IACJ,SAAS,OAAO;AAAA,IAChB,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO,UAAU,IAAI,CAAC,cAAc;AAAA,MAC7C,MAAM,SAAS,OAAO;AAAA,MACtB,aAAa,SAAS,OAAO;AAAA,MAC7B,KAAK,SAAS,OAAO,SAAS;AAAA,MAC9B,KAAK,SAAS,OAAO,SAAS;AAAA,MAC9B,OAAO,SAAS;AAAA,MAChB,YAAY,SAAS;AAAA,MACrB,SAAS,SAAS;AAAA,MAClB,WAAW,SAAS;AAAA,IACtB,EAAE;AAAA,EACJ;AACF;;;ADtMA,IAAM,UAAU;AAEhB,SAAS,WAAW,MAAe;AACjC,SAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC,EAAE,CAAC,EAAE;AACrF;AAEA,SAAS,YAAY,OAAgB;AACnC,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,SAAO,EAAE,SAAS,CAAC,EAAE,MAAM,QAAiB,MAAM,UAAU,OAAO,GAAG,CAAC,GAAG,SAAS,KAAK;AAC1F;AAEA,IAAM,SAAS,IAAI,UAAU,EAAE,MAAM,YAAY,SAAS,QAAQ,CAAC;AAEnE,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAEF,aAAa;AAAA,MACX,OAAO,EAAE,OAAO,EAAE,SAAS,+CAA+C;AAAA,MAC1E,cAAc,EACX,OAAO,EACP,SAAS,EACT,SAAS,EACT,SAAS,wCAAwC;AAAA,MACpD,YAAY,EACT,MAAM,EAAE,OAAO,CAAC,EAChB,SAAS,EACT,SAAS,gEAAgE;AAAA,MAC5E,SAAS,EACN,OAAO;AAAA,QACN,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS;AAAA,QAC1D,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS;AAAA,QAC7D,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS;AAAA,QAC7D,gBAAgB,EAAE,QAAQ,EAAE,SAAS;AAAA,QACrC,gBAAgB,EAAE,QAAQ,EAAE,SAAS;AAAA,QACrC,UAAU,EAAE,QAAQ,EAAE,SAAS;AAAA,QAC/B,UAAU,EAAE,QAAQ,EAAE,SAAS;AAAA,QAC/B,YAAY,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS;AAAA,MAClE,CAAC,EACA,SAAS,EACT,SAAS,uEAAuE;AAAA,MACnF,YAAY,EACT,QAAQ,EACR,SAAS,EACT,SAAS,qDAAqD;AAAA,MACjE,MAAM,EACH,OAAO,EACP,SAAS,EACT;AAAA,QACC;AAAA,MAEF;AAAA,MACF,QAAQ,EACL,KAAK,CAAC,YAAY,YAAY,CAAC,EAC/B,SAAS,EACT,SAAS,uEAAuE;AAAA,MACnF,MAAM,EACH,KAAK,CAAC,QAAQ,QAAQ,OAAO,CAAC,EAC9B,SAAS,EACT,SAAS,kDAAkD;AAAA,MAC9D,SAAS,EACN,QAAQ,EACR,SAAS,EACT,SAAS,qDAAqD;AAAA,MACjE,SAAS,EACN,QAAQ,EACR,SAAS,EACT,SAAS,gFAAgF;AAAA,MAC5F,OAAO,EACJ,OAAO,EACP,IAAI,EACJ,SAAS,EACT,SAAS,EACT,SAAS,wCAAwC;AAAA,MACpD,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,yCAAyC;AAAA,IACpF;AAAA,EACF;AAAA,EACA,OAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,MAAM;AACJ,QAAI;AACF,YAAM,aAAa,SAAS,QAAQ,QAAQ,OAAO,EAAE,IAAI,KAAK,IAAI;AAElE,YAAM,YAAY,QAAQ,WAAW,OAAO;AAC5C,YAAM,SAAS,MAAM,oBAAoB,OAAO;AAAA,QAC9C,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC;AAAA,QACvC,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,QACnC,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,QAC7B,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,QACnC,GAAI,aAAa,EAAE,MAAM,WAAW,IAAI,CAAC;AAAA;AAAA,QAEzC,GAAI,WAAW,eACX;AAAA,UACE,QAAQ;AAAA,UACR,SAAS,IAAI,wBAAwB;AAAA,UACrC,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,QACzB,IACA,CAAC;AAAA,QACL,GAAI,YAAY,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,QACrC,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,QACzB,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,gBAAgB,QAAQ,EAAE,SAAS,QAAQ,OAAO,EAAE,CAAC,CAAC;AAAA,IAC1E,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAGF,aAAa;AAAA,MACX,OAAO,EAAE,OAAO,EAAE,SAAS,kCAAkC;AAAA,MAC7D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,gCAAgC;AAAA,MACvF,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,+BAA+B;AAAA,IAC1E;AAAA,EACF;AAAA,EACA,OAAO,EAAE,OAAO,OAAO,SAAS,MAAM;AACpC,QAAI;AACF,YAAM,SAAS,MAAM,qBAAqB,OAAO;AAAA,QAC/C,OAAO,SAAS;AAAA,QAChB,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,wBAAwB,MAAM,CAAC;AAAA,IACnD,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAEF,aAAa,CAAC;AAAA,EAChB;AAAA,EACA,YAAY,WAAW,mBAAmB,CAAC;AAC7C;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAEF,aAAa;AAAA,MACX,OAAO,EAAE,OAAO,EAAE,SAAS,+CAA+C;AAAA,MAC1E,YAAY,EACT,MAAM,EAAE,OAAO,CAAC,EAChB,SAAS,EACT,SAAS,sDAAsD;AAAA,MAClE,oBAAoB,EACjB,OAAO,EACP,SAAS,EACT,SAAS,EACT,SAAS,wDAAwD;AAAA,MACpE,iBAAiB,EACd,OAAO,EACP,SAAS,EACT,SAAS,EACT,SAAS,0DAA0D;AAAA,MACtE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,8BAA8B;AAAA,IACzE;AAAA,EACF;AAAA,EACA,OAAO,EAAE,OAAO,YAAY,oBAAoB,iBAAiB,SAAS,MAAM;AAC9E,QAAI;AACF,YAAM,SAAS,MAAM,WAAW,OAAO;AAAA,QACrC,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,QACnC,GAAI,qBAAqB,EAAE,mBAAmB,IAAI,CAAC;AAAA,QACnD,GAAI,kBAAkB,EAAE,gBAAgB,IAAI,CAAC;AAAA,QAC7C,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,cAAc,MAAM,CAAC;AAAA,IACzC,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAIF,aAAa;AAAA,MACX,OAAO,EAAE,OAAO,EAAE,SAAS,+CAA+C;AAAA,MAC1E,aAAa,EACV,OAAO,EACP,SAAS,EACT,SAAS,EACT,SAAS,mEAA8D;AAAA,MAC1E,WAAW,EACR,OAAO,EACP,SAAS,EACT,SAAS,EACT,SAAS,yDAAoD;AAAA,MAChE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,8BAA8B;AAAA,IACzE;AAAA,EACF;AAAA,EACA,OAAO,EAAE,OAAO,aAAa,WAAW,SAAS,MAAM;AACrD,QAAI;AACF,YAAM,QAAsD,CAAC;AAC7D,UAAI,YAAa,OAAM,cAAc;AACrC,UAAI,UAAW,OAAM,YAAY;AACjC,YAAM,SAAS,MAAM,iBAAiB,OAAO;AAAA,QAC3C,GAAI,OAAO,KAAK,KAAK,EAAE,SAAS,IAAI,EAAE,MAAM,IAAI,CAAC;AAAA,QACjD,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,eAAe,MAAM,CAAC;AAAA,IAC1C,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAIF,aAAa;AAAA,MACX,WAAW,EACR,MAAM,EAAE,OAAO,CAAC,EAChB,IAAI,CAAC,EACL,SAAS,0DAA0D;AAAA,MACtE,SAAS,EACN,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,EACxC,SAAS,EACT,SAAS,6DAA6D;AAAA,MACzE,aAAa,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,mCAAmC;AAAA,MAC1F,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,oCAAoC;AAAA,MACzF,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,8BAA8B;AAAA,IACzE;AAAA,EACF;AAAA,EACA,OAAO,EAAE,WAAW,SAAS,aAAa,WAAW,SAAS,MAAM;AAClE,QAAI;AACF,YAAM,aAAa,UACf,OAAO,QAAQ,OAAO,EAAE,IAAI,CAAC,CAAC,MAAM,MAAM,OAAO,EAAE,MAAM,OAAO,EAAE,IAClE;AACJ,YAAM,QAAsD,CAAC;AAC7D,UAAI,YAAa,OAAM,cAAc;AACrC,UAAI,UAAW,OAAM,YAAY;AACjC,YAAM,SAAS,MAAM,iBAAiB,WAAW;AAAA,QAC/C,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,QACnC,GAAI,OAAO,KAAK,KAAK,EAAE,SAAS,IAAI,EAAE,MAAM,IAAI,CAAC;AAAA,QACjD,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,iBAAiB,MAAM,CAAC;AAAA,IAC5C,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAIF,aAAa;AAAA,MACX,OAAO,EAAE,OAAO,EAAE,SAAS,+CAA+C;AAAA,MAC1E,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,kCAAkC;AAAA,MACzE,MAAM,EAAE,KAAK,CAAC,QAAQ,QAAQ,OAAO,CAAC,EAAE,SAAS,EAAE,SAAS,4BAA4B;AAAA,MACxF,YAAY,EACT,MAAM,EAAE,OAAO,CAAC,EAChB,SAAS,EACT,SAAS,yDAAyD;AAAA,MACrE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,8BAA8B;AAAA,IACzE;AAAA,EACF;AAAA,EACA,OAAO,EAAE,OAAO,QAAQ,MAAM,YAAY,SAAS,MAAM;AACvD,QAAI;AACF,YAAM,SAAS,MAAM,mBAAmB,OAAO;AAAA,QAC7C;AAAA,QACA,SAAS,IAAI,wBAAwB;AAAA,QACrC,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,QACvB,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,QACnC,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,mBAAmB,MAAM,CAAC;AAAA,IAC9C,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,OAAO;AAAA,EACL;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,aACE;AAAA,IAIF,aAAa;AAAA,MACX,OAAO,EAAE,OAAO,EAAE,SAAS,wDAAwD;AAAA,MACnF,YAAY,EACT,MAAM,EAAE,OAAO,CAAC,EAChB,IAAI,CAAC,EACL,SAAS,oEAAoE;AAAA,MAChF,MAAM,EAAE,KAAK,CAAC,QAAQ,QAAQ,OAAO,CAAC,EAAE,SAAS,EAAE,SAAS,4BAA4B;AAAA,MACxF,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,+CAA+C;AAAA,MACnF,uBAAuB,EACpB,OAAO,EACP,IAAI,EACJ,SAAS,EACT,SAAS,EACT,SAAS,wDAAwD;AAAA,MACpE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,8BAA8B;AAAA,IACzE;AAAA,EACF;AAAA,EACA,OAAO,EAAE,OAAO,YAAY,MAAM,KAAK,uBAAuB,SAAS,MAAM;AAC3E,QAAI;AACF,YAAM,OAAO,MAAM,YAAY,OAAO;AAAA,QACpC;AAAA,QACA,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,QACvB,GAAI,MAAM,EAAE,IAAI,IAAI,CAAC;AAAA,QACrB,GAAI,wBAAwB,EAAE,sBAAsB,IAAI,CAAC;AAAA,QACzD,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACjC,CAAC;AACD,aAAO,WAAW,iBAAiB,IAAI,CAAC;AAAA,IAC1C,SAAS,OAAO;AACd,aAAO,YAAY,KAAK;AAAA,IAC1B;AAAA,EACF;AACF;AAEA,IAAM,YAAY,IAAI,qBAAqB;AAC3C,MAAM,OAAO,QAAQ,SAAS;AAC9B,QAAQ,OAAO,MAAM,uBAAuB,OAAO;AAAA,CAAkB;","names":[]}

package/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "@proximap/mcp",
+  "version": "1.0.0",
+  "description": "Model Context Protocol server for proximap — geospatial tools for AI agents and Claude.",
+  "keywords": [
+    "mcp",
+    "model-context-protocol",
+    "claude",
+    "ai",
+    "maps",
+    "geocoding",
+    "amenities"
+  ],
+  "license": "MIT",
+  "author": "Ameya Borkar <ameyaborkar17@gmail.com>",
+  "homepage": "https://github.com/AmeyaBorkar/proximap#readme",
+  "bugs": "https://github.com/AmeyaBorkar/proximap/issues",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/AmeyaBorkar/proximap.git",
+    "directory": "packages/mcp"
+  },
+  "type": "module",
+  "bin": {
+    "proximap-mcp": "./dist/index.js"
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "engines": {
+    "node": ">=20"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsup",
+    "typecheck": "tsc --noEmit",
+    "prepublishOnly": "npm run build"
+  },
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.29.0",
+    "@proximap/core": "^1.0.0",
+    "zod": "^4.4.3"
+  }
+}