Skip to main content
Glama
paultaki
by paultaki

search_loops

Read-onlyIdempotent

Search by job, keyword, or category to find bounded, verifiable work loops with verification, stop conditions, budgets, and approval boundaries — returns ranked matches with why-matched.

Instructions

Search AI Loop Library's bounded, verifiable work loops by job-to-be-done, keyword, or category. Each loop ships with a trigger, one-change-per-round discipline, a verification check, a stop condition, a budget, and a human approval boundary — so an agent can run it without thrashing. Returns ranked matches with a one-line why-matched.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
limitNo
queryYesJob to be done or keywords, e.g. 'flaky tests' or 'source-check a draft'
categoryNoOptional exact category filter, e.g. Engineering, Knowledge, Operations
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

Annotations declare readOnlyHint=true and idempotentHint=true, so the description's mention of ranked matches with a why-matched line adds value. The detailed loop components (trigger, discipline, etc.) provide extra context beyond annotations, without contradiction.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

Three sentences: first states purpose, second explains loop concept, third notes return format. The second sentence is lengthy but informative. Could be tighter, but no wasted text.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness4/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a search tool with 3 params and no output schema, the description covers search inputs (query/category), loop nature, and output format (ranked matches with why-matched). Lacks mention of pagination or limit behavior, but sufficient for a search intent.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 67% (query and category have descriptions, limit does not). The description mentions 'keyword' and 'category' matching schema terms but adds no new semantics for limit. No compensation for the missing limit description.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description clearly states the tool searches for 'bounded, verifiable work loops' by 'job-to-be-done, keyword, or category.' This precise verb-resource pairing distinguishes it from sibling tools like browse_catalog (browsing) or get_loop (single retrieval).

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines4/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

The description implies when to use this tool for discovery, but it does not explicitly state when not to use it or mention alternatives. Given sibling names like browse_catalog and get_loop, the context is reasonably clear.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Install Server

Other Tools

Latest Blog Posts

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/paultaki/ailooplibrary-mcp'

If you have feedback or need assistance with the MCP directory API, please join our Discord server