tendfeed-mcp
OfficialTendFeed — Bid/No-Bid Intelligence MCP Server
Should you bid? Every open EU tender, scored against 592,000 real award outcomes.
MCP server for bid/no-bid intelligence on EU public tenders, built on 592,000 real TED contract awards: observed competition density (median bidders, single-bidder share), price corridor, SME fit and beachhead ranking for every open tender. It answers "can I win this?", not just "what is out there?".
Why this exists
Tender portals list what is out there — they don't tell you whether bidding is worth it. Most losing bids die on competition and price, and that information exists: it is in the award notices of tenders already decided. TendFeed benchmarks every open EU tender against 592,000 real award outcomes (bidder counts, winning prices, SME shares per CPV sector × country) and returns a verdict with its evidence — the score, the reason, and the number of awards it is based on. An agent (or a human) can check the basis instead of trusting a guess. Works in Claude Code, Claude Desktop, Cursor, and any other MCP-capable harness.
Related MCP server: govrider-mcp-server
Two ways to use it
1. Connect to the hosted server (recommended) — no installation, always current data:
claude mcp add --transport http tendfeed https://tendfeed.eu/api/mcp/tendfeedFor stdio-only clients (Claude Desktop, Cursor) via mcp-remote:
{
"mcpServers": {
"tendfeed": {
"command": "npx",
"args": ["mcp-remote", "https://tendfeed.eu/api/mcp/tendfeed"]
}
}
}2. Run the bundled stdio wrapper — zero dependencies; initialize/tools/list answer
offline, tool calls reach the hosted endpoint:
node index.jsOr with Docker:
docker build -t tendfeed-mcp .
docker run -i --rm tendfeed-mcpAdd to an MCP client config:
{
"mcpServers": {
"tendfeed": {
"command": "node",
"args": ["/path/to/tendfeed-mcp/index.js"],
"env": { "TENDFEED_API_KEY": "cfm_live_… (optional, unlocks the live board)" }
}
}
}Tools
Tool | What it answers |
| "Where is competition thinnest right now?" — ranks CPV sector lanes by observed competition density (median bidders, single-bidder share, bid rate, beachhead score) |
| Open EU tenders with a bid/no-bid verdict: Worth-It score, reason, competition density, price corridor, deadline, SME fit — filterable by sector, country, score |
| One versioned verdict object for a single tender (decision, score, per-channel evidence) |
| Deprecated alias of |
Free tier and API key
Guests need no key: the expired-tender board is fully usable and every search returns a
live_matched count of current hits. An API key (created at
tendfeed.eu, active subscription) unlocks the live, still-biddable
board — sent as a header:
claude mcp add --transport http tendfeed https://tendfeed.eu/api/mcp/tendfeed \
--header "Authorization: Bearer cfm_live_YOUR_KEY"Agent skill
A ready-made skill that teaches an agent to use the server well (lane before single tender, always cite the verdict's reason and data basis) is served at tendfeed.eu/skill.md.
Discovery
MCP manifest: tendfeed.eu/.well-known/mcp.json
Official MCP registry:
eu.tendfeed/tendfeedGlama connector: glama.ai/mcp/connectors/eu.tendfeed/tendfeed
OpenAPI: tendfeed.eu/api/v1/openapi.json
Data
Raw data: TED — Tenders Electronic Daily (CC BY 4.0). The scoring, benchmarks and verdicts are TendFeed's own. No guarantee of award.
TendFeed is a service of AnalystHAUS GmbH — tendfeed.eu
This server cannot be installed
Maintenance
Latest Blog Posts
- Who's Calling? MCP Hosts Are an Identity Blind Spot (And the Spec Knows It)By Om-Shree-0709 on .mcpAgent IdentityOAuth 2.1
- Your AI Chatbot Just Exposed Your CEO's Salary to an InternBy Om-Shree-0709 on .Agent IdentityMCP SecurityOAuth Delegation
- Why MCP Servers Need Execution Sandboxing (And Why Your Current Stack Isn't Enough)By Om-Shree-0709 on .Agentic AiPrompt InjectionWebAssembly
MCP directory API
We provide all the information about MCP servers via our MCP API.
curl -X GET 'https://glama.ai/api/mcp/v1/servers/tendfeed-eu/tendfeed-mcp'
If you have feedback or need assistance with the MCP directory API, please join our Discord server