Spec Driven Development
MCP Server that facilitates spec-driven development workflows, not just Vibe Coding.
제작자가 쓴 설명(영어 원문)
Who peers with whom, where they meet, and who an address range belongs to. PeeringDB and RDAP.
이 세 가지는 절대 하나의 점수로 합치지 않아요. 의견, 측정, 인기는 서로 다른 것이니까요.
이 서버는 아직 쉬운 말로 된 요약을 쓰지 못했어요. 아래는 레지스트리에서 읽어 온 사실이에요.
쓰고 있는 AI 앱을 고른 다음 설정을 복사하세요.
PEERINGDB_API_KEY, PEERING_MCP_CACHE_TTL, PEERING_MCP_CACHE_DIR, PEERING_MCP_NO_CACHE, PEERING_MCP_TIMEOUT, PEERING_MCP_MAX_RETRIES비밀로 표시된 값은 내 계정의 열쇠예요. 절대 다른 사람과 공유하거나 채팅에 붙여 넣지 마세요.
필요한 것
어떤 앱을 쓰세요?
위에서 앱을 고르세요. 기억해 두었다가 다음부터는 버튼에 “…에 설치”라고 표시해요.
Claude Desktop → Settings → Developer → Edit Config를 열고 claude_desktop_config.json에 이 내용을 붙여 넣으세요
{
"mcpServers": {
"peering": {
"command": "uvx",
"args": [
"peering-mcp"
],
"env": {
"PEERINGDB_API_KEY": "your-value",
"PEERING_MCP_CACHE_TTL": "your-value",
"PEERING_MCP_CACHE_DIR": "your-value",
"PEERING_MCP_NO_CACHE": "your-value",
"PEERING_MCP_TIMEOUT": "your-value",
"PEERING_MCP_MAX_RETRIES": "your-value"
}
}
}
}터미널에서 이 명령어를 실행하세요
claude mcp add peering --env PEERINGDB_API_KEY=your-value --env PEERING_MCP_CACHE_TTL=your-value --env PEERING_MCP_CACHE_DIR=your-value --env PEERING_MCP_NO_CACHE=your-value --env PEERING_MCP_TIMEOUT=your-value --env PEERING_MCP_MAX_RETRIES=your-value -- uvx peering-mcp실행하기 전에 빈 값을 채워 주세요.
프로젝트의 .cursor/mcp.json 또는 ~/.cursor/mcp.json에 붙여 넣으세요
{
"mcpServers": {
"peering": {
"command": "uvx",
"args": [
"peering-mcp"
],
"env": {
"PEERINGDB_API_KEY": "your-value",
"PEERING_MCP_CACHE_TTL": "your-value",
"PEERING_MCP_CACHE_DIR": "your-value",
"PEERING_MCP_NO_CACHE": "your-value",
"PEERING_MCP_TIMEOUT": "your-value",
"PEERING_MCP_MAX_RETRIES": "your-value"
}
}
}
}브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.
프로젝트의 .vscode/mcp.json에 붙여 넣으세요
{
"servers": {
"peering": {
"type": "stdio",
"command": "uvx",
"args": [
"peering-mcp"
],
"env": {
"PEERINGDB_API_KEY": "your-value",
"PEERING_MCP_CACHE_TTL": "your-value",
"PEERING_MCP_CACHE_DIR": "your-value",
"PEERING_MCP_NO_CACHE": "your-value",
"PEERING_MCP_TIMEOUT": "your-value",
"PEERING_MCP_MAX_RETRIES": "your-value"
}
}
}
}브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.
이 서버는 내 컴퓨터에서 실행되는데, ChatGPT는 인터넷에 있는 서버에만 연결할 수 있어요. 다른 앱을 고르세요.
선택한 앱은 이 기기의 쿠키에만 저장돼요. 계정은 필요 없어요.
PEERING_MCP_CACHE_TTL envPEERING_MCP_CACHE_DIR envPEERING_MCP_NO_CACHE envPEERING_MCP_TIMEOUT envPEERING_MCP_MAX_RETRIES env이 설정은 제작자의 레지스트리 정보로 만들었어요. README와 다르면 README를 따르세요.
내 컴퓨터에서 실행돼요. 설치하면 AI 앱에 도구 목록이 나타나요.
누구나 볼 수 있는 정보를 점검했고, 코드는 읽지 않았어요. 해당하지 않는 항목은 개수에서 뺐어요. · 2026년 11월 9일 점검
레지스트리 이름이 GitHub 계정 LeonardMichalas 기준으로 확인되었고, 이 계정이 저장소를 소유하고 있어요
아직 GitHub에서 이 저장소를 읽어 오지 않았어요
아직 GitHub에서 이 저장소를 읽어 오지 않았어요
내 컴퓨터에서 실행되는 서버라 인터넷 엔드포인트가 없어요
내 컴퓨터에서 실행되며, 대신 로컬 설정을 사용해요
내 컴퓨터에서 실행돼요. 도구 목록은 인터넷 엔드포인트가 있는 서버에서만 읽을 수 있어요
레지스트리에서 이 카테고리의 활성 서버 전체와 비교했어요. 스타는 게시자가 저장소를 소유한 경우에만 세요.
해당하는 기본 점검 1개 중 1개를 통과했어요. 코드는 읽지 않았어요. 키나 토큰을 넣기 전에 서버가 어떤 권한을 요구하는지 확인하고, 꼭 필요한 권한만 있는 키를 쓰세요.
입력해야 할 값: PEERINGDB_API_KEY
내 컴퓨터에서 실행돼요. AI 앱이 필요할 때 실행하고, 데이터는 제작자의 서버를 거치지 않아요(서버 자체가 온라인 서비스를 호출하는 경우는 제외).
GitHub 저장소는 마지막으로 – 변경됐고, 최신 버전(0.1.1)은 2개월 전 레지스트리에 올라왔어요.
Claude Desktop, Claude Code, Cursor, VS Code처럼 MCP를 지원하는 앱에서 쓸 수 있어요. 내 컴퓨터에 Python (uv)도 있어야 해요.
같은 카테고리에는: Spec Driven Development, Remote Desktop Commander, ReMCP
같은 카테고리에서 다른 제작자가 만든 서버예요. 스타 순으로 정렬했어요.
카드 보는 법:↓ 주간 다운로드i★ GitHub 스타i세 기둥: 리뷰 · 점검 · 사용 정도i업데이트 = 최신 버전을 레지스트리에 공개한 날i
MCP Server that facilitates spec-driven development workflows, not just Vibe Coding.
Remote Desktop Commander: use files, terminal and processes on your own computers from any AI app.
제작자의 저장소에서 쓰인 그대로 가져왔어요. PopNx MCP가 검토하거나 보증한 내용이 아니에요. HTML, 이미지, 스크립트는 제거했어요. 링크를 누르면 이 사이트를 벗어나요.
An MCP server that lets an AI agent look up how the internet is actually wired together — which networks connect to each other, at which internet exchanges and facilities, under what peering policy, and who a given address range is registered to.
Five read-only tools over two public sources: PeeringDB for interconnection, and the regional internet registries over RDAP for registration. Upstream responses are validated and shaped, free text is stripped of structure before it reaches a model, requests are rate limited to what PeeringDB asks for, and answers are cached on disk between runs. Every response is held to a byte budget.
Install it with uvx peering-mcp. A personal project, MIT licensed.
The internet is roughly eighty thousand independent networks that agree to carry each other's traffic. Which networks connect to which, where they meet, and on what terms is public, free and well structured — published through stable APIs by PeeringDB and the regional internet registries.
None of it is reachable by an AI agent. Ask a coding assistant which internet exchanges a given carrier is present at and it will answer from memory: fluent, confident, and often wrong. It has no way to check, so it does not check.
This server is that way to check.
| Tool | Question it answers |
|---|---|
lookup_network | Who is this network, and what is their peering policy? |
list_presence | Which internet exchanges and facilities are they present at? |
find_at_exchange | Who else is at this exchange, and would they peer? |
find_common_presence | Where can these networks meet each other? |
lookup_registration | Who is this IP range or AS number registered to? |
find_common_presence is the tool that motivated the project. Working out where two or more networks could interconnect means looking each one up, listing everywhere it is present, and intersecting the results by hand. That is about an hour and a dozen browser tabs. It should be one question.
It takes two to five AS numbers and answers in four requests, whatever the number of networks. Shared exchanges come back widest bottleneck first — ordered by the smallest capacity any one network has there, because that is what a connection between them would be limited by.
It also returns how many locations each network has on its own, so an empty answer is explainable: either the networks genuinely do not overlap, or one of them has no records at all, which is a very different thing.
find_at_exchange asks it the other way round: who is already at DE-CIX Frankfurt, and which of them will peer with anyone. It takes an exchange name or its PeeringDB id, optionally keeps only the networks stating one peering policy, and returns them largest capacity first. A name matching several exchanges — ten of them are called LINX, on four continents — comes back as candidates to choose between, never a guess at which one was meant.
lookup_registration is the one tool here that does not read PeeringDB. It asks the registry that made the allocation — RIPE NCC, ARIN, APNIC, LACNIC or AFRINIC — and answers with the holder, the allocation date, the range the registration actually covers, and where to report abuse. Which registry to ask is itself a lookup, resolved from IANA's own bootstrap files rather than through a third-party redirector, so the answer can say who it came from.
Ask about one address and you get the block it sits in: 8.8.8.8 is answered with 8.8.8.0 - 8.8.8.255, registered to Google LLC. A range no registry is responsible for, such as 240.0.0.0/8, is answered without a request leaving the machine.
Every tool returns the same envelope, so a model learns one shape rather than five. Asking lookup_network for AS3320 returns this — the whole response, 854 bytes on the wire, against a 42-field upstream record:
{
"status": "ok", "data": { "network": { "asn": 3320, "name": "Deutsche Telekom", "long_name": "Deutsche Telekom AG", "website": "https://wholesale.telekom.com", "network_type": "NSP", "traffic_estimate": "50-100Tbps", "scope": "Global", "traffic_ratio": "Mostly Inbound", "ipv4_prefixes": 150000, "ipv6_prefixes": 40000, "exchange_count": 7, "facility_count": 53, "policy": { "general": "Restrictive", "locations": "Required - International", "ratio_required": true, "contract_required": "Required", "url": null }, "irr_as_set": "AS3320:AS-DTAG AS3320:AS-DTAG-V6", "looking_glass": "https://lg.telekom.com" }, "candidates": [] }, "note": "PeeringDB records are maintained by the networks themselves. Treat a missing field as unrecorded, not as evidence it is untrue.", "provenance": { "source": "peeringdb", "fetched_at": "2026-09-14T16:44:53.916085Z", "record_updated": "2026-08-31T13:30:19Z", "from_cache": false } }
The status field is the first thing to read, and ok means one thing only: the answer is in data. A name matching several networks returns ambiguous with the candidates to choose between, never a guess at which one was meant. An AS number that is not listed returns not_found, with a note saying a network can route traffic without being registered.
Real responses, trimmed where marked. Nothing here is illustrative: each is what the tool returned on 2026-09-19.
"Where could Deutsche Telekom and Hurricane Electric peer with each other?" — one call to find_common_presence with [3320, 6939], four upstream requests:
{
"status": "ok", "data": { "networks": [ { "asn": 3320, "name": "Deutsche Telekom", "exchanges": 7, "facilities": 53 }, { "asn": 6939, "name": "Hurricane Electric", "exchanges": 335, "facilities": 342 } ], "exchanges": { "items": [ { "name": "NL-ix", "city": "Amsterdam, Rotterdam, Brussels, Luxembourg, Frankfurt,…", "country": "NL", "networks": [ { "asn": 3320, "speed_mbps": 220000, "ports": 2, "route_server": false }, { "asn": 6939, "speed_mbps": 400000, "ports": 1, "route_server": true } ] }, { "name": "DE-CIX Frankfurt", "city": "Frankfurt", "country": "DE", "networks": [ { "asn": 3320, "speed_mbps": 110000, "ports": 1, "route_server": false }, { "asn": 6939, "speed_mbps": 800000, "ports": 1, "route_server": true } ] } ], "total": 6, "truncated": false } } }
Six shared exchanges, widest bottleneck first: NL-ix leads because the narrower of the two networks has 220 Gbps there, not because anyone has more in total. The per-network totals underneath are what make an empty answer readable — Deutsche Telekom records 7 exchanges in all, so "no overlap" would mean something different from Hurricane Electric's 335.
"Who is already at DE-CIX Frankfurt, and would they peer with anyone?" — find_at_exchange with policy: "Open":
{
"status": "ok", "data": { "exchange": { "exchange_id": 31, "name": "DE-CIX Frankfurt", "city": "Frankfurt", "country": "DE", "networks_recorded": 1020 }, "networks": { "items": [ { "asn": 24940, "name": "Hetzner Online", "speed_mbps": 2800000, "ports": 3, "route_server": true, "policy": "Open" }, { "asn": 20940, "name": "Akamai Technologies", "speed_mbps": 2100000, "ports": 4, "route_server": true, "policy": "Open" } ], "total": 649, "truncated": true } }, "note": "Participation is self-reported by each network in PeeringDB; a network missing here is unrecorded, not absent. Showing the 2 largest of the 649 networks (of 1020 here) stating policy Open; raise limit for more, at most 200." }
649 of the 1,020 networks there state an open policy. The filter applies to the exchange rather than to the page, so that is a count of the exchange — not "the open ones among the largest fifty".
"Who is 8.8.8.8 registered to, and where do I report abuse?" — lookup_registration, which reads the registry rather than PeeringDB:
{
"status": "ok", "data": { "target": "8.8.8.8", "kind": "address", "registry": "ARIN", "handle": "NET-8-8-8-0-2", "holder": "Google LLC", "covers": "8.8.8.0 - 8.8.8.255", "allocation_type": "DIRECT ALLOCATION", "registered": "2023-12-28T17:24:33-05:00", "abuse": { "name": "Abuse", "email": "network-abuse@google.com" } }, "note": "Registry data: it says who an allocation was made to, which is not always who operates the resource today.", "provenance": { "source": "rdap", "record_updated": "2023-12-28T17:24:56-05:00", "from_cache": true } }
The question was about one address and the answer covers the block it sits in, which is what covers is for.
The agent never reaches the internet itself. Everything goes through the server, which is the only place rate limiting, caching, validation and sanitisation can actually be enforced.
A request takes one of two paths:
That shaping step is not cosmetic. One network's raw presence records can exceed 130 KB, and returning that would flood the agent's context window and make it measurably worse at the actual task. list_presence turns Hurricane Electric's 336 exchange ports into a page of exchanges that fits 6 KB, largest capacity first, and says how many it left out — the page is cut to the budget rather than to a count, so the limit is a ceiling and the bytes are the guarantee. find_common_presence reads 225 KB across three networks and answers in under 4 KB.
These are load-bearing rather than aspirational, and pull requests are reviewed against them.
GET is ever sent, enforced at the transport rather than by convention. The앞부분만 보여 드려요. 나머지는 저장소에서 읽어 보세요