{
 "$schema": "https://static.modelcontextprotocol.io/schemas/mcp-server-card/v1.json",
 "name": "com.clawhard/sieve",
 "title": "Sieve",
 "version": "1.0.0",
 "description": "Sieve runs a regular expression for real, on JavaScript's engine or on RE2 (Go), against strings that should and should not match, and shows each pass or fail with the matched text and groups. It also proves whether the pattern can backtrack catastrophically (ReDoS) and gives the input that would hang it. No account.",
 "websiteUrl": "https://sieve.clawhard.com",
 "documentationUrl": "https://sieve.clawhard.com/llms.txt",
 "iconUrl": "https://clawhard.com/icon-512.png",
 "serverInfo": {
  "name": "com.clawhard/sieve",
  "title": "Sieve",
  "version": "1.0.0"
 },
 "protocolVersion": "2025-06-18",
 "transport": "streamable-http",
 "endpoint": "https://sieve.clawhard.com/mcp",
 "remotes": [
  {
   "type": "streamable-http",
   "url": "https://sieve.clawhard.com/mcp"
  }
 ],
 "authentication": {
  "required": false
 },
 "capabilities": {
  "tools": {
   "listChanged": false
  },
  "prompts": {
   "listChanged": false
  },
  "resources": {
   "subscribe": false,
   "listChanged": false
  }
 },
 "tools": [
  {
   "name": "sieve_test_regex",
   "title": "Run a regular expression on test strings (JavaScript or RE2/Go) and check it for ReDoS",
   "description": "Use when you have written, been given or are about to commit a regular expression and need to know what it really matches, instead of predicting it (signals: \"write a regex for\", \"does this regex match\", \"validate emails/phone numbers/dates/slugs/URLs with a regex\", \"why doesn't my regex match\", \"test this pattern\", \"regex for Go\", \"is this regex safe\", \"catastrophic backtracking\", \"convert this Python regex to JavaScript\"). Executes the pattern on the real engine: JavaScript (V8 RegExp, the engine in Chrome, Node.js and Cloudflare Workers; flags d g i m s u v y) or RE2 (re2js, with Go regexp parity: Go, RE2, Google Sheets and BigQuery syntax; flags i m s). Give strings that must match and strings that must not; each case comes back pass/fail with the matched text, index and capture groups (numbered and named), and why a \"should not match\" string matched (usually a missing ^...$). match: \"full\" tests the whole string. texts lists every match, replace_with shows the replacement ($1/$<name> in JavaScript, $1/${name} in Go). For JavaScript it also runs a ReDoS analysis (recheck): proven linear, or exponential/polynomial backtracking with a concrete attack string and the hot part of the pattern. Flags patterns that compile but mislead: ^a|b$ anchoring, \\A/\\Z/\\h read as letters, [[:alpha:]], {,3}, [A-z], unescaped dots before extensions. Invalid patterns return the engine's error and a hint (Python (?P<name>), (?i), possessive and atomic groups; lookarounds and backreferences in RE2). Example: {\"pattern\":\"[\\\\w.+-]+@[\\\\w-]+\\\\.[a-z]{2,}\",\"should_match\":[\"ann@example.com\"],\"should_not_match\":[\"ann@example\",\"see ann@x.io now\"]}. Does not run Python, PCRE, Java or .NET engines; it reports what differs for common constructs. Up to 100 strings of 20000 characters; on a ReDoS-vulnerable pattern, long strings are skipped instead of hanging. Returns {valid, verdict: ok|warnings|redos|fails|invalid, summary, engine, engine_name, pattern, flags, match_mode, counts:{should_match, should_not_match, texts, passed, failed, skipped}, group_count, cases:[{text, length, expect: match|no_match|any, matched, pass (null = skipped), match_count, match:{text, index, end, groups?, named?}, matches? (texts only), why?, replaced?, skipped?}], warnings:[{rule, message, fix?, index?}], redos:{status: safe|vulnerable|unknown, complexity: linear|polynomial (degree n)|exponential|no attack found|unknown, attack?:{repr, length, string|null, sample}, hotspots?:[{start, end, text}], explanation?, fix_hint?, note?}|null, fix_message (ready-to-apply list, null when clean), error? and hint? (invalid patterns), notes, checked_at, open_url}."
  },
  {
   "name": "sieve_check_redos",
   "title": "Check regular expressions for ReDoS (catastrophic backtracking)",
   "description": "Use when a regular expression will run on user input or untrusted data (form validation, request routing, log parsing, WAF or search rules) and must not hang the server, or when reviewing a codebase's regexes for ReDoS (signals: \"is this regex safe\", \"ReDoS\", \"catastrophic backtracking\", \"regex hangs\", \"CPU spike on validation\", \"security review of regexes\", \"(a+)+\"). Analyzes 1 to 20 patterns with recheck (automaton analysis with a fuzzing fallback) for backtracking engines with JavaScript syntax, and returns per pattern: safe (proven linear, or no attack found when backreferences or lookarounds force fuzzing), or vulnerable with the complexity (exponential, or polynomial with its degree), a concrete attack string (repr like 'a'.repeat(31) + '\\\\x00', plus the string itself when short), the hot part of the pattern and a fix hint. Example: {\"patterns\":[\"^(a+)+$\",\"/^([a-z]+\\\\s)*$/\",\"^[\\\\w.+-]+@[\\\\w-]+\\\\.[\\\\w.-]+$\"]}. Python re, PCRE, Java, .NET and Ruby backtrack the same way on these constructs; RE2, Go regexp and Rust regex are linear-time and not affected. To also run the pattern on test strings, use sieve_test_regex."
  }
 ],
 "prompts": [
  {
   "name": "sieve_test_my_regex",
   "title": "Test a regex before I use it",
   "description": "Run a regular expression on strings it should and should not match, and check it for ReDoS."
  }
 ],
 "publisher": {
  "name": "Clawhard Studio",
  "url": "https://clawhard.com",
  "contact": "support@clawhard.com"
 }
}