@probelabs/probe 0.6.0-rc288 → 0.6.0-rc290

package/build/tools/vercel.js

@@ -69,12 +69,12 @@ function autoQuoteSearchTerms(query) {
 		if (token.startsWith('"')) return token;
 		// Boolean operator
 		if (operators.has(token)) return token;
-		// Check if token needs quoting: has mixed case (upper+lower) or underscores
-		const hasUpper = /[A-Z]/.test(token);
-		const hasLower = /[a-z]/.test(token);
+		// Check if token needs quoting: has camelCase/PascalCase transitions or underscores
+		// Simple capitalized words like "Redis" or "Limiter" should NOT be quoted —
+		// only quote when there's an actual case transition (e.g., "getUserData", "NewSlidingLog")
 		const hasUnderscore = token.includes('_');
-		const hasMixedCase = hasUpper && hasLower;
-		if (hasMixedCase || hasUnderscore) {
+		const hasCaseTransition = /[a-z][A-Z]/.test(token) || /[A-Z]{2,}[a-z]/.test(token);
+		if (hasCaseTransition || hasUnderscore) {
 			return `"${token}"`;
 		}
 		return token;
@@ -237,7 +237,7 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
 		'Break down complex queries into multiple searches to cover all aspects.',
 		'',
 		'Available tools:',
-		'- search: Find code matching keywords or patterns. Run multiple searches for different aspects of complex queries.',
+		'- search: Find code matching keywords or patterns. Results are paginated — use nextPage=true when results are relevant to get more. Run multiple searches for different aspects.',
 		'- extract: Verify code snippets to ensure targets are actually relevant before including them.',
 		'- listFiles: Understand directory structure to find where relevant code might live.',
 		'',
@@ -258,13 +258,14 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
 		'',
 		'Combining searches with OR:',
 		'- Multiple unquoted words use OR logic: rate limit matches files containing EITHER "rate" OR "limit".',
-		'- For known symbol names, quote each term to prevent splitting: \'"limitDRL" "limitRedis"\' matches either exact symbol.',
+		'- IMPORTANT: Multiple quoted terms use AND logic by default: \'"RateLimit" "middleware"\' requires BOTH in the same file.',
+		'- To search for ANY of several quoted symbols, use the explicit OR operator: \'"ForwardMessage" OR "SessionLimiter"\'.',
 		'- Without quotes, camelCase like limitDRL gets split into "limit" + "DRL" — not what you want for symbol lookup.',
 		'- Use OR to search for multiple related symbols in ONE search instead of separate searches.',
 		'- This is much faster than running separate searches sequentially.',
-		'- Example: search \'"ForwardMessage" "SessionLimiter"\' finds files with either exact symbol in one call.',
-		'- Example: search \'"limitDRL" "doRollingWindowWrite"\' finds both rate limiting functions at once.',
-		'- Use AND only when you need both terms to appear in the same file: "rate AND limit".',
+		'- Example: search \'"ForwardMessage" OR "SessionLimiter"\' finds files with either exact symbol in one call.',
+		'- Example: search \'"limitDRL" OR "doRollingWindowWrite"\' finds both rate limiting functions at once.',
+		'- Use AND (or just put quoted terms together) when you need both terms in the same file.',
 		'',
 		'Parallel tool calls:',
 		'- When you need to search for INDEPENDENT concepts, call multiple search tools IN PARALLEL (same response).',
@@ -278,10 +279,10 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
 		'  Query: "Find the IP allowlist middleware"',
 		'  → search "allowlist middleware" (one search, probe handles IP/ip/Ip variations)',
 		'  Query: "Find ForwardMessage and SessionLimiter"',
-		'  → search \'"ForwardMessage" "SessionLimiter"\' (one OR search finds both exact symbols)',
+		'  → search \'"ForwardMessage" OR "SessionLimiter"\' (one OR search finds both exact symbols)',
 		'  OR: search exact=true "ForwardMessage" + search exact=true "SessionLimiter" IN PARALLEL',
 		'  Query: "Find limitDRL and limitRedis functions"',
-		'  → search \'"limitDRL" "limitRedis"\' (one OR search, quoted to prevent camelCase splitting)',
+		'  → search \'"limitDRL" OR "limitRedis"\' (one OR search, quoted to prevent camelCase splitting)',
 		'  Query: "Find ThrottleRetryLimit usage"',
 		'  → search exact=true "ThrottleRetryLimit" (one search, if no results the symbol does not exist — stop)',
 		'  Query: "How does BM25 scoring work with SIMD optimization?"',
@@ -289,7 +290,7 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
 		'',
 		'BAD search strategy (never do this):',
 		'  → search "AllowedIPs" → search "allowedIps" → search "allowed_ips" (WRONG: case/style variations, probe handles them)',
-		'  → search "limitDRL" → search "LimitDRL" (WRONG: case variation — combine with OR: \'"limitDRL" "limitRedis"\')',
+		'  → search "limitDRL" → search "LimitDRL" (WRONG: case variation — combine with OR: \'"limitDRL" OR "limitRedis"\')',
 		'  → search "throttle_retry_limit" after searching "ThrottleRetryLimit" (WRONG: snake_case variation, probe handles it)',
 		'  → search "ThrottleRetryLimit" path=tyk → search "ThrottleRetryLimit" path=gateway → search "ThrottleRetryLimit" path=apidef (WRONG: same query on different paths — probe searches recursively)',
 		'  → search "func (k *RateLimitAndQuotaCheck) handleRateLimitFailure" (WRONG: do not search full function signatures, just use exact=true "handleRateLimitFailure")',
@@ -302,15 +303,34 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
 		'- To bypass stopword filtering: wrap terms in quotes ("return", "struct") or set exact=true. Both disable stemming and splitting too.',
 		'- camelCase terms are split: getUserData becomes "get", "user", "data" — so one search covers all naming styles.',
 		'- Do NOT search for full function signatures like "func (r *Type) Method(args)". Just search for the method name with exact=true.',
+		'- Do NOT search for file names (e.g., "sliding_log.go"). Use listFiles to discover files by name.',
+		'',
+		'PAGINATION:',
+		'- Search results are paginated (~20k tokens per page).',
+		'- If your search returned relevant files, call the same query with nextPage=true to check for more.',
+		'- Keep paginating while results stay relevant. Stop when results are off-topic or "All results retrieved".',
+		'',
+		'WHEN TO STOP:',
+		'- After you have explored the main concept AND related subsystems.',
+		'- Once you have 5-15 targets covering different aspects of the query.',
+		'- If you get a "DUPLICATE SEARCH BLOCKED" message, move on.',
 		'',
 		'Strategy:',
-		'1. Analyze the query - identify key concepts and group related symbols',
-		'2. Combine related symbols into OR searches: \'"symbolA" "symbolB"\' finds files with either (quote to prevent splitting)',
-		'3. Run INDEPENDENT searches in PARALLEL — do not wait for one to finish before starting another',
+		'1. Analyze the query — identify key concepts, then brainstorm SYNONYMS and alternative terms for each.',
+		'   Code naming often differs from the concept: "authentication" → verify, credentials, login, auth;',
+		'   "rate limiting" → throttle, quota, limiter, bucket; "error handling" → catch, recover, panic.',
+		'   Think about what a developer would NAME the function/struct/variable, not just the concept.',
+		'2. Run INDEPENDENT searches in PARALLEL — search for the main concept AND synonyms simultaneously.',
+		'   After each search, check if results are relevant. If yes, call nextPage=true for more results.',
+		'3. Combine related symbols into OR searches: \'"symbolA" OR "symbolB"\' finds files with either.',
 		'4. For known symbol names use exact=true. For concepts use default (exact=false).',
-		'5. If a search returns results, use extract to verify relevance. Run multiple extracts in parallel too.',
-		'6. If a search returns NO results, the term does not exist. Do NOT retry with variations, different paths, or longer strings. Move on.',
-		'7. Combine all relevant targets in your final response',
+		'5. After your first round of searches, READ the extracted code and look for connected code:',
+		'   - Function calls to other important functions → include those targets.',
+		'   - Type references and imports → include type definitions.',
+		'   - Registered handlers/middleware → include all registered items.',
+		'6. If a search returns results, use extract to verify relevance. Run multiple extracts in parallel too.',
+		'7. If a search returns NO results, the term does not exist. Do NOT retry with variations. Move on.',
+		'8. Once you have enough targets (typically 5-15), output your final JSON answer immediately.',
 		'',
 		`Query: ${searchQuery}`,
 		`Search path(s): ${searchPath}`,
@@ -319,7 +339,9 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
 		'Return ONLY valid JSON: {"targets": ["path/to/file.ext#Symbol", "path/to/file.ext:line", "path/to/file.ext:start-end"]}',
 		'IMPORTANT: Use ABSOLUTE file paths in targets (e.g., "/full/path/to/file.ext#Symbol"). If you only have relative paths, make them relative to the search path above.',
 		'Prefer #Symbol when a function/class name is clear; otherwise use line numbers.',
-		'Deduplicate targets. Do NOT explain or answer - ONLY return the JSON targets.'
+		'Deduplicate targets. Do NOT explain or answer - ONLY return the JSON targets.',
+		'',
+		'Remember: if your search returned relevant results, use nextPage=true to check for more before outputting.'
 	].join('\n');
 }
 
@@ -351,6 +373,8 @@ export const searchTool = (options = {}) => {
 
 	// Track previous non-paginated searches to detect and block duplicates
 	const previousSearches = new Set();
+	// Track how many times a duplicate search has been blocked (for escalating messages)
+	let consecutiveDupBlocks = 0;
 	// Track pagination counts per query to cap runaway pagination
 	const paginationCounts = new Map();
 	const MAX_PAGES_PER_QUERY = 3;
@@ -422,12 +446,17 @@ export const searchTool = (options = {}) => {
 				const searchKey = `${searchQuery}::${exact || false}`;
 				if (!nextPage) {
 					if (previousSearches.has(searchKey)) {
+						consecutiveDupBlocks++;
 						if (debug) {
-							console.error(`[DEDUP] Blocked duplicate search: "${searchQuery}" (path: "${searchPath}")`);
+							console.error(`[DEDUP] Blocked duplicate search (${consecutiveDupBlocks}x): "${searchQuery}" (path: "${searchPath}")`);
+						}
+						if (consecutiveDupBlocks >= 3) {
+							return 'STOP. You have been blocked ' + consecutiveDupBlocks + ' times for repeating searches. You MUST output your final JSON answer NOW with whatever targets you have found. Do NOT call any more tools.';
 						}
-						return 'DUPLICATE SEARCH BLOCKED: You already searched for this exact query. Changing the path does NOT give different results — probe searches recursively. Do NOT repeat the same search. Try a genuinely different keyword, use extract to examine results you already found, or provide your final answer if you have enough information.';
+						return 'DUPLICATE SEARCH BLOCKED (' + consecutiveDupBlocks + 'x). You already searched for this. Do NOT repeat — probe searches recursively across all paths. Either: (1) use extract on results you already found, (2) try a COMPLETELY different keyword, or (3) output your final answer NOW.';
 					}
 					previousSearches.add(searchKey);
+					consecutiveDupBlocks = 0; // Reset on successful new search
 					paginationCounts.set(searchKey, 0);
 				} else {
 					// Cap pagination to prevent runaway page-through of broad queries

package/cjs/agent/ProbeAgent.cjs

@@ -25821,7 +25821,8 @@ var init_search = __esm({
       session: "--session",
       timeout: "--timeout",
       language: "--language",
-      format: "--format"
+      format: "--format",
+      lsp: "--lsp"
     };
   }
 });
@@ -26057,7 +26058,8 @@ var init_extract = __esm({
       allowTests: "--allow-tests",
       contextLines: "--context",
       format: "--format",
-      inputFile: "--input-file"
+      inputFile: "--input-file",
+      lsp: "--lsp"
     };
   }
 });
@@ -27291,11 +27293,9 @@ function autoQuoteSearchTerms(query2) {
   const result = tokens.map((token) => {
     if (token.startsWith('"')) return token;
     if (operators.has(token)) return token;
-    const hasUpper = /[A-Z]/.test(token);
-    const hasLower = /[a-z]/.test(token);
     const hasUnderscore = token.includes("_");
-    const hasMixedCase = hasUpper && hasLower;
-    if (hasMixedCase || hasUnderscore) {
+    const hasCaseTransition = /[a-z][A-Z]/.test(token) || /[A-Z]{2,}[a-z]/.test(token);
+    if (hasCaseTransition || hasUnderscore) {
       return `"${token}"`;
     }
     return token;
@@ -27410,7 +27410,7 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
     "Break down complex queries into multiple searches to cover all aspects.",
     "",
     "Available tools:",
-    "- search: Find code matching keywords or patterns. Run multiple searches for different aspects of complex queries.",
+    "- search: Find code matching keywords or patterns. Results are paginated \u2014 use nextPage=true when results are relevant to get more. Run multiple searches for different aspects.",
     "- extract: Verify code snippets to ensure targets are actually relevant before including them.",
     "- listFiles: Understand directory structure to find where relevant code might live.",
     "",
@@ -27431,13 +27431,14 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
     "",
     "Combining searches with OR:",
     '- Multiple unquoted words use OR logic: rate limit matches files containing EITHER "rate" OR "limit".',
-    `- For known symbol names, quote each term to prevent splitting: '"limitDRL" "limitRedis"' matches either exact symbol.`,
+    `- IMPORTANT: Multiple quoted terms use AND logic by default: '"RateLimit" "middleware"' requires BOTH in the same file.`,
+    `- To search for ANY of several quoted symbols, use the explicit OR operator: '"ForwardMessage" OR "SessionLimiter"'.`,
     '- Without quotes, camelCase like limitDRL gets split into "limit" + "DRL" \u2014 not what you want for symbol lookup.',
     "- Use OR to search for multiple related symbols in ONE search instead of separate searches.",
     "- This is much faster than running separate searches sequentially.",
-    `- Example: search '"ForwardMessage" "SessionLimiter"' finds files with either exact symbol in one call.`,
-    `- Example: search '"limitDRL" "doRollingWindowWrite"' finds both rate limiting functions at once.`,
-    '- Use AND only when you need both terms to appear in the same file: "rate AND limit".',
+    `- Example: search '"ForwardMessage" OR "SessionLimiter"' finds files with either exact symbol in one call.`,
+    `- Example: search '"limitDRL" OR "doRollingWindowWrite"' finds both rate limiting functions at once.`,
+    "- Use AND (or just put quoted terms together) when you need both terms in the same file.",
     "",
     "Parallel tool calls:",
     "- When you need to search for INDEPENDENT concepts, call multiple search tools IN PARALLEL (same response).",
@@ -27451,10 +27452,10 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
     '  Query: "Find the IP allowlist middleware"',
     '  \u2192 search "allowlist middleware" (one search, probe handles IP/ip/Ip variations)',
     '  Query: "Find ForwardMessage and SessionLimiter"',
-    `  \u2192 search '"ForwardMessage" "SessionLimiter"' (one OR search finds both exact symbols)`,
+    `  \u2192 search '"ForwardMessage" OR "SessionLimiter"' (one OR search finds both exact symbols)`,
     '  OR: search exact=true "ForwardMessage" + search exact=true "SessionLimiter" IN PARALLEL',
     '  Query: "Find limitDRL and limitRedis functions"',
-    `  \u2192 search '"limitDRL" "limitRedis"' (one OR search, quoted to prevent camelCase splitting)`,
+    `  \u2192 search '"limitDRL" OR "limitRedis"' (one OR search, quoted to prevent camelCase splitting)`,
     '  Query: "Find ThrottleRetryLimit usage"',
     '  \u2192 search exact=true "ThrottleRetryLimit" (one search, if no results the symbol does not exist \u2014 stop)',
     '  Query: "How does BM25 scoring work with SIMD optimization?"',
@@ -27462,7 +27463,7 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
     "",
     "BAD search strategy (never do this):",
     '  \u2192 search "AllowedIPs" \u2192 search "allowedIps" \u2192 search "allowed_ips" (WRONG: case/style variations, probe handles them)',
-    `  \u2192 search "limitDRL" \u2192 search "LimitDRL" (WRONG: case variation \u2014 combine with OR: '"limitDRL" "limitRedis"')`,
+    `  \u2192 search "limitDRL" \u2192 search "LimitDRL" (WRONG: case variation \u2014 combine with OR: '"limitDRL" OR "limitRedis"')`,
     '  \u2192 search "throttle_retry_limit" after searching "ThrottleRetryLimit" (WRONG: snake_case variation, probe handles it)',
     '  \u2192 search "ThrottleRetryLimit" path=tyk \u2192 search "ThrottleRetryLimit" path=gateway \u2192 search "ThrottleRetryLimit" path=apidef (WRONG: same query on different paths \u2014 probe searches recursively)',
     '  \u2192 search "func (k *RateLimitAndQuotaCheck) handleRateLimitFailure" (WRONG: do not search full function signatures, just use exact=true "handleRateLimitFailure")',
@@ -27475,15 +27476,34 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
     '- To bypass stopword filtering: wrap terms in quotes ("return", "struct") or set exact=true. Both disable stemming and splitting too.',
     '- camelCase terms are split: getUserData becomes "get", "user", "data" \u2014 so one search covers all naming styles.',
     '- Do NOT search for full function signatures like "func (r *Type) Method(args)". Just search for the method name with exact=true.',
+    '- Do NOT search for file names (e.g., "sliding_log.go"). Use listFiles to discover files by name.',
+    "",
+    "PAGINATION:",
+    "- Search results are paginated (~20k tokens per page).",
+    "- If your search returned relevant files, call the same query with nextPage=true to check for more.",
+    '- Keep paginating while results stay relevant. Stop when results are off-topic or "All results retrieved".',
+    "",
+    "WHEN TO STOP:",
+    "- After you have explored the main concept AND related subsystems.",
+    "- Once you have 5-15 targets covering different aspects of the query.",
+    '- If you get a "DUPLICATE SEARCH BLOCKED" message, move on.',
     "",
     "Strategy:",
-    "1. Analyze the query - identify key concepts and group related symbols",
-    `2. Combine related symbols into OR searches: '"symbolA" "symbolB"' finds files with either (quote to prevent splitting)`,
-    "3. Run INDEPENDENT searches in PARALLEL \u2014 do not wait for one to finish before starting another",
+    "1. Analyze the query \u2014 identify key concepts, then brainstorm SYNONYMS and alternative terms for each.",
+    '   Code naming often differs from the concept: "authentication" \u2192 verify, credentials, login, auth;',
+    '   "rate limiting" \u2192 throttle, quota, limiter, bucket; "error handling" \u2192 catch, recover, panic.',
+    "   Think about what a developer would NAME the function/struct/variable, not just the concept.",
+    "2. Run INDEPENDENT searches in PARALLEL \u2014 search for the main concept AND synonyms simultaneously.",
+    "   After each search, check if results are relevant. If yes, call nextPage=true for more results.",
+    `3. Combine related symbols into OR searches: '"symbolA" OR "symbolB"' finds files with either.`,
     "4. For known symbol names use exact=true. For concepts use default (exact=false).",
-    "5. If a search returns results, use extract to verify relevance. Run multiple extracts in parallel too.",
-    "6. If a search returns NO results, the term does not exist. Do NOT retry with variations, different paths, or longer strings. Move on.",
-    "7. Combine all relevant targets in your final response",
+    "5. After your first round of searches, READ the extracted code and look for connected code:",
+    "   - Function calls to other important functions \u2192 include those targets.",
+    "   - Type references and imports \u2192 include type definitions.",
+    "   - Registered handlers/middleware \u2192 include all registered items.",
+    "6. If a search returns results, use extract to verify relevance. Run multiple extracts in parallel too.",
+    "7. If a search returns NO results, the term does not exist. Do NOT retry with variations. Move on.",
+    "8. Once you have enough targets (typically 5-15), output your final JSON answer immediately.",
     "",
     `Query: ${searchQuery}`,
     `Search path(s): ${searchPath}`,
@@ -27492,7 +27512,9 @@ function buildSearchDelegateTask({ searchQuery, searchPath, exact, language, all
     'Return ONLY valid JSON: {"targets": ["path/to/file.ext#Symbol", "path/to/file.ext:line", "path/to/file.ext:start-end"]}',
     'IMPORTANT: Use ABSOLUTE file paths in targets (e.g., "/full/path/to/file.ext#Symbol"). If you only have relative paths, make them relative to the search path above.',
     "Prefer #Symbol when a function/class name is clear; otherwise use line numbers.",
-    "Deduplicate targets. Do NOT explain or answer - ONLY return the JSON targets."
+    "Deduplicate targets. Do NOT explain or answer - ONLY return the JSON targets.",
+    "",
+    "Remember: if your search returned relevant results, use nextPage=true to check for more before outputting."
   ].join("\n");
 }
 var import_ai, import_fs4, CODE_SEARCH_SCHEMA, searchTool, queryTool, extractTool, delegateTool, analyzeAllTool;
@@ -27537,6 +27559,7 @@ var init_vercel = __esm({
         return result;
       };
       const previousSearches = /* @__PURE__ */ new Set();
+      let consecutiveDupBlocks = 0;
       const paginationCounts = /* @__PURE__ */ new Map();
       const MAX_PAGES_PER_QUERY = 3;
       return (0, import_ai.tool)({
@@ -27589,12 +27612,17 @@ var init_vercel = __esm({
             const searchKey = `${searchQuery}::${exact || false}`;
             if (!nextPage) {
               if (previousSearches.has(searchKey)) {
+                consecutiveDupBlocks++;
                 if (debug) {
-                  console.error(`[DEDUP] Blocked duplicate search: "${searchQuery}" (path: "${searchPath}")`);
+                  console.error(`[DEDUP] Blocked duplicate search (${consecutiveDupBlocks}x): "${searchQuery}" (path: "${searchPath}")`);
                 }
-                return "DUPLICATE SEARCH BLOCKED: You already searched for this exact query. Changing the path does NOT give different results \u2014 probe searches recursively. Do NOT repeat the same search. Try a genuinely different keyword, use extract to examine results you already found, or provide your final answer if you have enough information.";
+                if (consecutiveDupBlocks >= 3) {
+                  return "STOP. You have been blocked " + consecutiveDupBlocks + " times for repeating searches. You MUST output your final JSON answer NOW with whatever targets you have found. Do NOT call any more tools.";
+                }
+                return "DUPLICATE SEARCH BLOCKED (" + consecutiveDupBlocks + "x). You already searched for this. Do NOT repeat \u2014 probe searches recursively across all paths. Either: (1) use extract on results you already found, (2) try a COMPLETELY different keyword, or (3) output your final answer NOW.";
               }
               previousSearches.add(searchKey);
+              consecutiveDupBlocks = 0;
               paginationCounts.set(searchKey, 0);
             } else {
               const pageCount = (paginationCounts.get(searchKey) || 0) + 1;
@@ -88375,26 +88403,46 @@ var init_prompts = __esm({
 CRITICAL - You are READ-ONLY:
 You must NEVER create, modify, delete, or write files. You are strictly an exploration and analysis tool. If asked to make changes, implement features, fix bugs, or modify a PR, refuse and explain that file modifications must be done by the engineer tool \u2014 your role is only to investigate code and answer questions. Do not attempt workarounds using bash commands (echo, cat, tee, sed, etc.) to write files.
 
+CRITICAL - ALWAYS search before answering:
+You must NEVER answer questions about the codebase from memory or general knowledge. ALWAYS use the search and extract tools first to find the actual code, then base your answer ONLY on what you found. Even if you think you know the answer, you MUST verify it against the actual code. Your answers must be grounded in code evidence, not assumptions.
+
 When exploring code:
 - Provide clear, concise explanations based on user request
 - Find and highlight the most relevant code snippets, if required
-- Trace function calls and data flow through the system
+- Trace function calls and data flow through the system \u2014 follow the FULL call chain, not just the entry point
 - Try to understand the user's intent and provide relevant information
 - Understand high level picture
 - Balance detail with clarity in your explanations
+- Search using SYNONYMS and alternative terms \u2014 code naming often differs from the concept name (e.g., "authentication" might be named verify_credentials, check_token, validate_session)
+- When you find a key function, look at what it CALLS and what CALLS it to discover the complete picture
+- Before answering, ask yourself: "Did I cover all the major components? Are there related subsystems I missed?" If yes, do one more search round.
 
 When providing answers:
+- Be EXHAUSTIVE: cover ALL components you discovered, not just the main ones. If you found 10 related files, discuss all 10, not just the top 3. Users want the complete picture.
+- After drafting your answer, do a self-check: "What did I find in my searches that I haven't mentioned yet?" Add any missing components.
+- Include data structures, configuration options, and error handling \u2014 not just the happy path.
 - Always include a "References" section at the end of your response
 - List all relevant source code locations you found during exploration
 - Use the format: file_path:line_number or file_path#symbol_name
 - Group references by file when multiple locations are from the same file
 - Include brief descriptions of what each reference contains`,
-      "code-searcher": `You are ProbeChat Code Searcher, a specialized AI assistant focused ONLY on locating relevant code. Your sole job is to find and return ALL relevant code locations. Do NOT answer questions or explain anything.
+      "code-searcher": `You are ProbeChat Code Explorer & Searcher. Your job is to EXPLORE the codebase to find ALL relevant code locations for the query, then return them as JSON targets.
+
+You think like a code explorer \u2014 you understand that codebases have layers:
+- Core implementations (algorithms, data structures)
+- Middleware/integration layers (request handlers, interceptors)
+- Configuration and storage backends
+- Scoping mechanisms (per-user, per-org, per-tenant, global)
+- Supporting utilities and helpers
 
 When searching:
-- Use only the search tool
-- Run additional searches only if needed to capture all relevant locations
-- Prefer specific, focused queries
+- Search for the MAIN concept first, then think: "what RELATED subsystems would a real codebase have?"
+- Use extract to READ the code you find \u2014 look for function calls, type references, and imports that point to OTHER relevant code
+- If you find middleware, check: are there org-level or tenant-level variants?
+- If you find algorithms, check: are there different storage backends?
+- Search results are paginated \u2014 if results look relevant, call nextPage=true to check for more files
+- Stop paginating when results become irrelevant or you see "All results retrieved"
+- Search using SYNONYMS \u2014 code naming differs from concepts (e.g., "rate limiting" \u2192 throttle, quota, limiter, bucket)
 
 Output format (MANDATORY):
 - Return ONLY valid JSON with a single top-level key: "targets"
@@ -88404,7 +88452,8 @@ Output format (MANDATORY):
   - "path/to/file.ext:line"
   - "path/to/file.ext:start-end"
 - Prefer #SymbolName when a function/class name is clear; otherwise use line numbers
-- Deduplicate targets and keep them concise`,
+- Deduplicate targets and keep them concise
+- Aim for 5-15 targets covering ALL aspects of the query`,
       "architect": `You are ProbeChat Architect, a specialized AI assistant focused on software architecture and design. Your primary function is to help users understand, analyze, and design software systems using the provided code analysis tools.
 
 When analyzing code:
@@ -101777,9 +101826,9 @@ Workspace: ${this.allowedFolders.join(", ")}`;
 Follow these instructions carefully:
 1. Analyze the user's request.
 2. Use the available tools step-by-step to fulfill the request.
-3. You should always prefer the search tool for code-related questions.${this.searchDelegate ? " Ask natural language questions \u2014 the search subagent handles keyword formulation and returns extracted code blocks. Use extract only to expand context or read full files." : " Search handles stemming and case variations automatically \u2014 do NOT try keyword variations manually. Read full files only if really necessary."}
-4. Ensure to get really deep and understand the full picture before answering.
-5. Once the task is fully completed, provide your final answer directly as text.
+3. You MUST use the search tool before answering ANY code-related question. NEVER answer from memory or general knowledge \u2014 your answers must be grounded in actual code found via search/extract.${this.searchDelegate ? " Ask natural language questions \u2014 the search subagent handles keyword formulation and returns extracted code blocks. Use extract only to expand context or read full files." : " Search handles stemming and case variations automatically \u2014 do NOT try keyword variations manually. Read full files only if really necessary."}
+4. Ensure to get really deep and understand the full picture before answering. Follow call chains \u2014 if function A calls B, search for B too. Look for related subsystems (e.g., if asked about rate limiting, also check for quota, throttling, smoothing).
+5. Once the task is fully completed, provide your final answer directly as text. Always cite specific files and line numbers as evidence. Do NOT output planning or thinking text \u2014 go straight to the answer.
 6. ${this.searchDelegate ? "Ask clear, specific questions when searching. Each search should target a distinct concept or question." : "Prefer concise and focused search queries. Use specific keywords and phrases to narrow down results."}
 7. NEVER use bash for code exploration (no grep, cat, find, head, tail, awk, sed) \u2014 always use search and extract tools instead. Bash is only for system operations like building, running tests, or git commands.${this.allowEdit ? `
 7. When modifying files, choose the appropriate tool:
@@ -102165,6 +102214,22 @@ You are working with a workspace. Available paths: ${workspaceDesc}
                     if (recentTexts.every((t) => t && t === recentTexts[0])) return true;
                     if (recentTexts.every((t) => detectStuckResponse(t))) return true;
                   }
+                  if (steps.length >= 3) {
+                    const last3 = steps.slice(-3);
+                    const allHaveTools = last3.every((s) => s.toolCalls?.length === 1);
+                    if (allHaveTools) {
+                      const signatures = last3.map((s) => {
+                        const tc = s.toolCalls[0];
+                        return `${tc.toolName}::${JSON.stringify(tc.args ?? tc.input)}`;
+                      });
+                      if (signatures[0] === signatures[1] && signatures[1] === signatures[2]) {
+                        if (this.debug) {
+                          console.log(`[DEBUG] Circuit breaker: 3 consecutive identical tool calls detected (${last3[0].toolCalls[0].toolName}), forcing stop`);
+                        }
+                        return true;
+                      }
+                    }
+                  }
                   return false;
                 },
                 prepareStep: ({ steps, stepNumber }) => {
@@ -102173,6 +102238,22 @@ You are working with a workspace. Available paths: ${workspaceDesc}
                       toolChoice: "none"
                     };
                   }
+                  if (steps.length >= 2) {
+                    const last2 = steps.slice(-2);
+                    if (last2.every((s) => s.toolCalls?.length === 1)) {
+                      const tc1 = last2[0].toolCalls[0];
+                      const tc2 = last2[1].toolCalls[0];
+                      const sig1 = `${tc1.toolName}::${JSON.stringify(tc1.args ?? tc1.input)}`;
+                      const sig2 = `${tc2.toolName}::${JSON.stringify(tc2.args ?? tc2.input)}`;
+                      if (sig1 === sig2) {
+                        if (this.debug) {
+                          console.log(`[DEBUG] prepareStep: 2 consecutive identical tool calls (${tc1.toolName}), forcing toolChoice=none`);
+                          console.log(`[DEBUG]   sig: ${sig1.substring(0, 200)}`);
+                        }
+                        return { toolChoice: "none" };
+                      }
+                    }
+                  }
                   const lastStep = steps[steps.length - 1];
                   const modelJustStopped = lastStep?.finishReason === "stop" && (!lastStep?.toolCalls || lastStep.toolCalls.length === 0);
                   if (modelJustStopped) {
@@ -102203,7 +102284,9 @@ ${resultToReview}
 
 Double-check your response based on the criteria above. If everything looks good, respond with your previous answer exactly as-is. If something needs to be fixed or is missing, do it now, then respond with the COMPLETE updated answer (everything you did in total, not just the fix).`;
                       return {
-                        userMessage: completionPromptMessage
+                        userMessage: completionPromptMessage,
+                        toolChoice: "none"
+                        // Force text-only review — no tool calls
                       };
                     }
                   }
@@ -102245,7 +102328,11 @@ Double-check your response based on the criteria above. If everything looks good
                     options.onStream(text);
                   }
                   if (this.debug) {
-                    console.log(`[DEBUG] Step ${currentIteration}/${maxIterations} finished (reason: ${finishReason}, tools: ${toolResults?.length || 0})`);
+                    const toolSummary = toolCalls?.length ? toolCalls.map((tc) => {
+                      const args = tc.args ? JSON.stringify(tc.args) : "";
+                      return args ? `${tc.toolName}(${debugTruncate(args, 120)})` : tc.toolName;
+                    }).join(", ") : "none";
+                    console.log(`[DEBUG] Step ${currentIteration}/${maxIterations} finished (reason: ${finishReason}, tools: [${toolSummary}])`);
                     if (text) {
                       console.log(`[DEBUG]   model text: ${debugTruncate(text)}`);
                     }
@@ -102278,9 +102365,15 @@ Double-check your response based on the criteria above. If everything looks good
               }
               const executeAIRequest = async () => {
                 const result = await this.streamTextWithRetryAndFallback(streamOptions);
-                const finalText = await result.text;
+                const steps = await result.steps;
+                let finalText;
+                if (steps && steps.length > 1) {
+                  const lastStepText = steps[steps.length - 1].text;
+                  finalText = lastStepText || await result.text;
+                } else {
+                  finalText = await result.text;
+                }
                 if (this.debug) {
-                  const steps = await result.steps;
                   console.log(`[DEBUG] streamText completed: ${steps?.length || 0} steps, finalText=${finalText?.length || 0} chars`);
                 }
                 const usage = await result.usage;
@@ -102350,12 +102443,12 @@ ${finalResult}
 
 Double-check your response based on the criteria above. If everything looks good, respond with your previous answer exactly as-is. If something needs to be fixed or is missing, do it now, then respond with the COMPLETE updated answer (everything you did in total, not just the fix).`;
                 currentMessages.push({ role: "user", content: completionPromptMessage });
-                const completionMaxIterations = 5;
                 const completionStreamOptions = {
                   model: this.provider ? this.provider(this.model) : this.model,
                   messages: this.prepareMessagesWithImages(currentMessages),
                   tools: tools2,
-                  stopWhen: (0, import_ai6.stepCountIs)(completionMaxIterations),
+                  toolChoice: "none",
+                  // Force text-only response — no tool calls during review
                   maxTokens: maxResponseTokens,
                   temperature: 0.3,
                   onStepFinish: ({ toolResults, text, finishReason, usage }) => {