Cross-PR Combined-Tree Verification
Your coding agents are isolated in worktrees; your breakage is not.
我該用這個嗎
品質與安全性
A
發現項目(1)
- LOW在 check_all 中
根據工具定義與協定合規性的自動化分析。
上下文成本
~255Token(工具定義)
~393 B典型回應大小
極小的注意力影響(128k 上下文的 0.20%)
這是每次將伺服器的工具載入模型上下文時所消耗的約略 token 數量。數量越高,可用於其他工作的注意力就越少。
安裝
一鍵安裝
將以下內容加入你的 `claude_desktop_config.json` 檔案:
{
"mcpServers": {
"cross-pr-combined-tree-verification": {
"url": "https://textforagents.com/products/cross-pr-combined-tree-verification/mcp"
}
}
}遠端端點
https://textforagents.com/products/cross-pr-combined-tree-verification/mcpstreamable-http它能做什麼
工具清單
工具(3)
🟢 唯讀🟡 寫入🔴 刪除⚪ 未知
🟢check_pair(repo_id, a, b)
Speculatively 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.
輸入結構描述
{
"type": "object",
"properties": {
"repo_id": {
"type": "string"
},
"a": {
"type": "string"
},
"b": {
"type": "string"
}
},
"required": [
"repo_id",
"a",
"b"
]
}🔴check_all(repo_id, branches)
Pair matrix plus full-union verdict with drop-one-out culprits. Plan repos. Args: repo_id, branches?.
輸入結構描述
{
"type": "object",
"properties": {
"repo_id": {
"type": "string"
},
"branches": {
"type": "array",
"items": {
"type": "string"
}
}
},
"required": [
"repo_id"
]
}⚪validate_verdict(repo_id, verdict)
Re-validate a verdict's triple binding; returns FRESH or STALE (naming the moved head). Args: repo_id, verdict.
輸入結構描述
{
"type": "object",
"properties": {
"repo_id": {
"type": "string"
},
"verdict": {
"type": "object"
}
},
"required": [
"repo_id",
"verdict"
]
}社群
證據
近期觀測
已驗證未記錄版本3 個工具