eCommerce
worthapp.app
Provides pricing and marketplace links to compare new, used, and resale prices and find where to buy or sell a named item.
ENDPOINT 1
https://worth.area21.io/mcp?src=mcp_registry
MCP server metadata
- Name
- worth
- Version
- 0.1.0
Worth prices one item. Call price_item for a photo or a name. Call compare_prices to weigh new, used, and resale. Call where_to_buy_or_sell for store and marketplace links. Use only the links Worth returns. Prices are estimates, not offers.
Known tools 3
where_to_buy_or_sellMarketplace links to buy one named item new, buy it used, or sell it.
Inferred read-onlyCONNECT WITH APPROVAL
Client installation
Review this server and its permissions before adding it. Secret placeholders must be set locally.
Codex
~/.codex/config.toml
[mcp_servers.worth]
url = "https://worth.area21.io/mcp?src=mcp_registry"
enabled = true
Claude Code
.mcp.json
{
"mcpServers": {
"worth": {
"type": "http",
"url": "https://worth.area21.io/mcp?src=mcp_registry"
}
}
}
Claude Desktop
Settings → Connectors → Add custom connector
Name: worth
Remote MCP URL: https://worth.area21.io/mcp?src=mcp_registry
Add this remote URL as a custom connector in Claude Desktop. Availability depends on the user plan and workspace policy.
Cursor
.cursor/mcp.json
{
"mcpServers": {
"worth": {
"url": "https://worth.area21.io/mcp?src=mcp_registry"
}
}
}
Visual Studio Code
.vscode/mcp.json
Add to Visual Studio Code{
"servers": {
"worth": {
"type": "http",
"url": "https://worth.area21.io/mcp?src=mcp_registry"
}
}
}
Generic MCP
Client-specific MCP configuration
{
"name": "worth",
"transport": "streamable-http",
"url": "https://worth.area21.io/mcp?src=mcp_registry"
}
MCP Inspector
Run the official MCP Inspector locally and enter the indexed Streamable HTTP endpoint.
TRUST AND VERIFICATION EVIDENCE
Loading Trust v2 evidence…
Checking the associated registrable domain. The BuiltWith key remains server-side.
Evidence is source-attributed and does not guarantee that a third-party server is safe. Risk labels are conservative metadata heuristics.