Brazilian trademarks (INPI)
Check whether a brand name is already filed or registered at INPI, with status, holder and class. 1 live · 1 in the catalog.
| Provider | Price | Status |
|---|---|---|
| Is this brand name taken in Brazil? Trademark search at INPI (consulta marca INPI)INPI marcas | $0.030 / call | Live |
Success rate and speed will show once a provider has 5 real calls in the last 30 days.
Run a comparison
Pick up to 6 live providers. Each one is charged at its own price; failures are free.
Questions
Which Brazilian trademarks (INPI) API is cheapest?
The cheapest is INPI marcas at $0.030 per call. Failed calls are not charged.
How do I call a Brazilian trademarks (INPI) API from an AI agent?
Connect your agent once: paste the message from superpowers.tools/docs into Claude, ChatGPT or Codex. Then ask in your own words, and your agent picks this provider and runs it. You pay only when a call works, and new accounts get $5 free. Developers can call POST /v1/run with "tool": "inpi.marcas" or use the MCP server.
For developersAPI call and the shared input and output format
Call it with one API key: POST /v1/run with "tool": "inpi.marcas", or through the MCP server. Every provider takes the same input and returns the same output, and failed calls are not charged.
Input
{
"type": "object",
"additionalProperties": false,
"required": [
"name"
],
"properties": {
"name": {
"type": "string",
"minLength": 2,
"maxLength": 40,
"description": "Brand name to look up, e.g. nubank"
},
"mode": {
"type": "string",
"enum": [
"exact",
"radical"
],
"default": "exact",
"description": "exact matches the name; radical matches marks that contain the root (INPI recommends both before filing)"
},
"class": {
"type": "integer",
"minimum": 1,
"maximum": 45,
"description": "Optional Nice class (NCL 1-45) to narrow the search"
},
"limit": {
"type": "integer",
"minimum": 1,
"maximum": 200,
"default": 50,
"description": "How many filings to return (the total is always reported)"
}
}
}Normalized output
{
"total": 0,
"live": 0,
"filings": []
}