Cross-PR Combined-Tree Verification

com.textforagents/cross-pr-combined-tree-verification · v1.0.1 · agents-and-memory

Cross-PR Combined-Tree Verification is healthy: it completed an MCP handshake in 705 ms and exposes 3 tools.

Your coding agents are isolated in worktrees; your breakage is not.

Endpoint: https://textforagents.com/products/cross-pr-combined-tree-verification/mcp (streamable-http)

No repository listed · Website · JSON · Add to my inventory

Facts

Users (last 30 days)0
HandshakeHealthy
Auth neededNone
Tool count3
Latency705 ms
Last checked (UTC)2026-10-21T16:31:03.614Z

Health history

Checked (UTC)StatusLatencyError
2026-10-21T16:31:03.614ZHealthy705

Tools (3)

check_pairSpeculatively merge two PR branches onto base and return a bound per-pair verdict (COMPATIBLE / TEXTUAL-CONFLICT / SEMANTIC-BREAK / UNTESTED) with a rebase instruction. Args: repo_id, a, b.
check_allPair matrix plus full-union verdict with drop-one-out culprits. Plan repos. Args: repo_id, branches?.
validate_verdictRe-validate a verdict's triple binding; returns FRESH or STALE (naming the moved head). Args: repo_id, verdict.