INDIVIDUAL MCP TOOL
rank_chains
Ranks Israeli supermarket chains by how much more they charge than the cheapest price, over a common set of identical products.
LIVE ENDPOINT
https://foodiepedia.co.il/api/mcp
Connect to this endpoint to inspect the live schema for rank_chains and invoke it with your own arguments.
Indexed input schema
{}Risk classification
Potential side effects detected · medium confidence · heuristic, not a guarantee.
- A tool name or description suggests a financial action.
Parent server
CONNECT 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.foodiepedia-prices]
url = "https://foodiepedia.co.il/api/mcp"
enabled = true
Claude Code
.mcp.json
{
"mcpServers": {
"foodiepedia-prices": {
"type": "http",
"url": "https://foodiepedia.co.il/api/mcp"
}
}
}
Claude Desktop
Settings → Connectors → Add custom connector
Name: foodiepedia-prices
Remote MCP URL: https://foodiepedia.co.il/api/mcp
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": {
"foodiepedia-prices": {
"url": "https://foodiepedia.co.il/api/mcp"
}
}
}
Visual Studio Code
.vscode/mcp.json
Add to Visual Studio Code{
"servers": {
"foodiepedia-prices": {
"type": "http",
"url": "https://foodiepedia.co.il/api/mcp"
}
}
}
Generic MCP
Client-specific MCP configuration
{
"name": "foodiepedia-prices",
"transport": "streamable-http",
"url": "https://foodiepedia.co.il/api/mcp"
}
MCP Inspector
Run the official MCP Inspector locally and enter the indexed Streamable HTTP endpoint.
Related tools
search_products— Find grocery products sold in Israeli supermarkets by Hebrew name, brand or barcode (e.get_product_prices— Today's shelf price of one product (by barcode) in each Israeli supermarket chain we track, cheapest first, with the time we checked each price.compare_basket— Given a shopping list (barcodes and quantities), returns the total in every chain that sells all of it, the cheapest chain and the saving versus the most expensive, chains missing items, and the best split between two chains.