recusal-langgraph 0.1.0__tar.gz

recusal_langgraph-0.1.0/.gitignore

@@ -0,0 +1,44 @@
+# Python
+__pycache__/
+*.py[cod]
+*.egg-info/
+.eggs/
+build/
+dist/
+.pytest_cache/
+.mypy_cache/
+.ruff_cache/
+.venv/
+venv/
+env/
+
+# Secrets, never commit
+.env
+.env.*
+*.key
+*.pem
+*.p12
+*service-account*.json
+secrets/
+
+# OS / IDE
+.DS_Store
+Thumbs.db
+.vscode/
+.idea/
+
+# Local hook activation, the repo ships .claude/settings.json.example only;
+# copying it to settings.json is a deliberate per-clone step, never committed
+.claude/settings.json
+.claude/settings.local.json
+
+# Local working docs, not part of the published project
+linkedin.md
+NOTES.md
+RUNBOOK.local.md
+ESSAY.local.md
+SOURCES.local.md
+*.local.md
+
+# Engineering Harness local state, internal planning notes
+.claude/harness/

recusal_langgraph-0.1.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or Derivative
+          Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and do
+          not modify the License. You may add Your own attribution notices
+          within Derivative Works that You distribute, alongside or as an
+          addendum to the NOTICE text from the Work, provided that such
+          additional attribution notices cannot be construed as modifying
+          the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Philip Paz
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

recusal_langgraph-0.1.0/PKG-INFO

@@ -0,0 +1,125 @@
+Metadata-Version: 2.4
+Name: recusal-langgraph
+Version: 0.1.0
+Summary: Recusal gate for LangGraph: judge every ToolNode call at execution time, refuse before it runs, and optionally put each decision on a hash-chained audit log.
+Project-URL: Homepage, https://github.com/philpaz/recusal
+Project-URL: Documentation, https://github.com/philpaz/recusal/tree/main/adapters/langgraph
+Project-URL: Repository, https://github.com/philpaz/recusal
+Project-URL: Issues, https://github.com/philpaz/recusal/issues
+Project-URL: Changelog, https://github.com/philpaz/recusal/blob/main/CHANGELOG.md
+Author-email: Philip Paz <philip.paz@gmail.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: agent-governance,ai-agents,guardrails,langgraph,recusal,tool-use
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Topic :: Security
+Classifier: Topic :: Software Development :: Quality Assurance
+Classifier: Typing :: Typed
+Requires-Python: >=3.10
+Requires-Dist: langchain-core<2,>=1.6.5
+Requires-Dist: langgraph<2,>=1.2.12
+Requires-Dist: recusal<1,>=0.14.0
+Description-Content-Type: text/markdown
+
+# recusal-langgraph
+
+The [Recusal](https://github.com/philpaz/recusal) gate for
+[LangGraph](https://langchain-ai.github.io/langgraph/): every tool call a `ToolNode` is
+about to execute is judged by your policy first, and a refused call never runs.
+
+This is a separate distribution from `recusal`. The kernel has zero runtime dependencies
+and a frozen compatibility perimeter; this package carries the LangGraph dependency and
+its own version, so a LangGraph release never forces a release of the kernel.
+
+**Status: not yet published to PyPI.** Until it is, install it from the repository:
+
+```bash
+pip install "recusal-langgraph @ git+https://github.com/philpaz/recusal#subdirectory=adapters/langgraph"
+```
+
+Requires Python 3.10+, `recusal>=0.14.0`, `langgraph>=1.2.12` and `langchain-core>=1.6.5`.
+It is tested on every pull request against exactly `langgraph==1.2.12` with
+`langchain-core==1.6.5`, and weekly against the newest releases.
+
+## Use
+
+```python
+from langchain_core.tools import tool
+from langgraph.prebuilt import ToolNode
+from recusal import Finding
+from recusal_langgraph import recusal_gate
+
+
+@tool
+def run_sql(sql: str) -> str:
+    """Run a SQL statement."""
+    ...
+
+
+def policy(tool_name, tool_input):
+    sql = tool_input.get("sql", "")
+    if tool_name == "run_sql" and sql.lstrip().upper().startswith("DELETE"):
+        return [Finding.fail("no_deletes", severity="CRITICAL", message="DELETE is not allowed")]
+    return []
+
+
+node = ToolNode([run_sql], wrap_tool_call=recusal_gate(policy))
+```
+
+Your `@tool` list goes into `ToolNode` unchanged. Every call in a model message crosses
+the gate separately, immediately before execution. A refused call is answered with an
+error `ToolMessage` carrying Recusal's reason, and its tool does not run. A policy that
+raises refuses the call (fail closed). For an async graph, attach
+`recusal_agate(policy)` with `awrap_tool_call` and run with `ainvoke`.
+
+The policy judges the invocation the tool executes, not the dict the model wrote: the
+input is validated once, defaults the model omitted are completed, and those same
+objects are passed to the function. Arguments the host injects (state, store, runtime)
+are left out of judgment, and the model can never supply them.
+
+## Put every decision on the record
+
+```python
+from recusal.audit import AuditLog
+from recusal_langgraph import recusal_audited_gate
+
+log = AuditLog(path="decisions.jsonl")
+node = ToolNode([run_sql], wrap_tool_call=recusal_audited_gate(policy, log))
+```
+
+`recusal_audited_agate` is the async form. Each call the gate sees, allowed or refused,
+is one hash-chained entry labeled `langgraph.toolnode` with LangGraph's tool call id and
+a SHA-256 fingerprint of the arguments (never the arguments). If the log cannot be
+written the call is refused. Check the log with `recusal audit verify decisions.jsonl`.
+
+The audited gates call the plain gate's own judging function, so there is one decision
+path.
+
+## What the gate refuses, and what it does not see
+
+- **Refused before the policy runs:** a tool whose class or instance overrides the
+  standard execution lifecycle (it could run without reaching the gate), input that does
+  not validate against the tool's schema, and a tool whose callable declares a parameter
+  the schema omits, since that is a value no proposal can carry and the policy would
+  never see.
+- **Not on the audit log:** a call another `wrap_tool_call` hook answered without
+  reaching the gate.
+
+This package reads two private LangChain and LangGraph helpers to find the arguments the
+host injects. That is why its framework requirements have an upper bound, and why the
+weekly lane against the newest releases exists.
+
+## Compatibility
+
+This package is outside the kernel's frozen perimeter (`STABILITY.md`, Integrations). Its
+public names are the ones in `recusal_langgraph.__all__`. When a LangGraph release
+changes what the hook is handed, this package gets a release and the kernel does not.
+
+A runnable offline demonstration, with a scripted graph and no API key, is
+[`examples/langgraph_gate.py`](https://github.com/philpaz/recusal/blob/main/examples/langgraph_gate.py)
+and
+[`examples/langgraph_audit.py`](https://github.com/philpaz/recusal/blob/main/examples/langgraph_audit.py).

recusal_langgraph-0.1.0/README.md

@@ -0,0 +1,98 @@
+# recusal-langgraph
+
+The [Recusal](https://github.com/philpaz/recusal) gate for
+[LangGraph](https://langchain-ai.github.io/langgraph/): every tool call a `ToolNode` is
+about to execute is judged by your policy first, and a refused call never runs.
+
+This is a separate distribution from `recusal`. The kernel has zero runtime dependencies
+and a frozen compatibility perimeter; this package carries the LangGraph dependency and
+its own version, so a LangGraph release never forces a release of the kernel.
+
+**Status: not yet published to PyPI.** Until it is, install it from the repository:
+
+```bash
+pip install "recusal-langgraph @ git+https://github.com/philpaz/recusal#subdirectory=adapters/langgraph"
+```
+
+Requires Python 3.10+, `recusal>=0.14.0`, `langgraph>=1.2.12` and `langchain-core>=1.6.5`.
+It is tested on every pull request against exactly `langgraph==1.2.12` with
+`langchain-core==1.6.5`, and weekly against the newest releases.
+
+## Use
+
+```python
+from langchain_core.tools import tool
+from langgraph.prebuilt import ToolNode
+from recusal import Finding
+from recusal_langgraph import recusal_gate
+
+
+@tool
+def run_sql(sql: str) -> str:
+    """Run a SQL statement."""
+    ...
+
+
+def policy(tool_name, tool_input):
+    sql = tool_input.get("sql", "")
+    if tool_name == "run_sql" and sql.lstrip().upper().startswith("DELETE"):
+        return [Finding.fail("no_deletes", severity="CRITICAL", message="DELETE is not allowed")]
+    return []
+
+
+node = ToolNode([run_sql], wrap_tool_call=recusal_gate(policy))
+```
+
+Your `@tool` list goes into `ToolNode` unchanged. Every call in a model message crosses
+the gate separately, immediately before execution. A refused call is answered with an
+error `ToolMessage` carrying Recusal's reason, and its tool does not run. A policy that
+raises refuses the call (fail closed). For an async graph, attach
+`recusal_agate(policy)` with `awrap_tool_call` and run with `ainvoke`.
+
+The policy judges the invocation the tool executes, not the dict the model wrote: the
+input is validated once, defaults the model omitted are completed, and those same
+objects are passed to the function. Arguments the host injects (state, store, runtime)
+are left out of judgment, and the model can never supply them.
+
+## Put every decision on the record
+
+```python
+from recusal.audit import AuditLog
+from recusal_langgraph import recusal_audited_gate
+
+log = AuditLog(path="decisions.jsonl")
+node = ToolNode([run_sql], wrap_tool_call=recusal_audited_gate(policy, log))
+```
+
+`recusal_audited_agate` is the async form. Each call the gate sees, allowed or refused,
+is one hash-chained entry labeled `langgraph.toolnode` with LangGraph's tool call id and
+a SHA-256 fingerprint of the arguments (never the arguments). If the log cannot be
+written the call is refused. Check the log with `recusal audit verify decisions.jsonl`.
+
+The audited gates call the plain gate's own judging function, so there is one decision
+path.
+
+## What the gate refuses, and what it does not see
+
+- **Refused before the policy runs:** a tool whose class or instance overrides the
+  standard execution lifecycle (it could run without reaching the gate), input that does
+  not validate against the tool's schema, and a tool whose callable declares a parameter
+  the schema omits, since that is a value no proposal can carry and the policy would
+  never see.
+- **Not on the audit log:** a call another `wrap_tool_call` hook answered without
+  reaching the gate.
+
+This package reads two private LangChain and LangGraph helpers to find the arguments the
+host injects. That is why its framework requirements have an upper bound, and why the
+weekly lane against the newest releases exists.
+
+## Compatibility
+
+This package is outside the kernel's frozen perimeter (`STABILITY.md`, Integrations). Its
+public names are the ones in `recusal_langgraph.__all__`. When a LangGraph release
+changes what the hook is handed, this package gets a release and the kernel does not.
+
+A runnable offline demonstration, with a scripted graph and no API key, is
+[`examples/langgraph_gate.py`](https://github.com/philpaz/recusal/blob/main/examples/langgraph_gate.py)
+and
+[`examples/langgraph_audit.py`](https://github.com/philpaz/recusal/blob/main/examples/langgraph_audit.py).

recusal_langgraph-0.1.0/pyproject.toml

@@ -0,0 +1,55 @@
+# The Recusal adapter for LangGraph, a separate distribution from `recusal`.
+#
+# Why separate: `recusal` has zero runtime dependencies and a frozen compatibility
+# perimeter (STABILITY.md). An adapter follows a framework that releases on its own
+# schedule, so it carries that dependency and its own version here, and a framework's
+# breaking change never forces a release of the kernel.
+#
+# Build backend pinned exactly, the same pin as the kernel's pyproject.toml: a floating
+# backend is unreviewed code in the release path.
+[build-system]
+requires = ["hatchling==1.27.0"]
+build-backend = "hatchling.build"
+
+[project]
+name = "recusal-langgraph"
+dynamic = ["version"]
+description = "Recusal gate for LangGraph: judge every ToolNode call at execution time, refuse before it runs, and optionally put each decision on a hash-chained audit log."
+readme = "README.md"
+# LangGraph's own minimum.
+requires-python = ">=3.10"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+authors = [{ name = "Philip Paz", email = "philip.paz@gmail.com" }]
+keywords = ["recusal", "langgraph", "ai-agents", "agent-governance", "guardrails", "tool-use"]
+classifiers = [
+    "Development Status :: 4 - Beta",
+    "Intended Audience :: Developers",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3 :: Only",
+    "Topic :: Security",
+    "Topic :: Software Development :: Quality Assurance",
+    "Typing :: Typed",
+]
+dependencies = [
+    # 0.14.0 is the first release where `decide` and `recusal.invocation` are public.
+    "recusal>=0.14.0,<1",
+    # The lower bound is the version the pinned CI lane tests; the weekly latest lane
+    # (.github/workflows/compat.yml) tests the newest release.
+    "langgraph>=1.2.12,<2",
+    "langchain-core>=1.6.5,<2",
+]
+
+[project.urls]
+Homepage = "https://github.com/philpaz/recusal"
+Documentation = "https://github.com/philpaz/recusal/tree/main/adapters/langgraph"
+Repository = "https://github.com/philpaz/recusal"
+Issues = "https://github.com/philpaz/recusal/issues"
+Changelog = "https://github.com/philpaz/recusal/blob/main/CHANGELOG.md"
+
+[tool.hatch.version]
+path = "src/recusal_langgraph/__init__.py"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/recusal_langgraph"]

recusal_langgraph-0.1.0/smoke_test.py

@@ -0,0 +1,133 @@
+"""Prove the INSTALLED recusal-langgraph wheel gates a real LangGraph ToolNode.
+
+Run it from a directory outside the repository, with an interpreter that has the built
+wheels installed:
+
+    python /path/to/adapters/langgraph/smoke_test.py
+
+It fails if the package it imports is the source tree and not an installed distribution:
+a check run from the checkout would prove nothing about the wheel. A scripted graph
+proposes the calls; no model, API key or network is used.
+"""
+
+from __future__ import annotations
+
+import asyncio
+import os
+import sys
+import tempfile
+from importlib import metadata
+from pathlib import Path
+from typing import Any
+
+# Python puts this script's directory first on the import path. Drop it, so nothing in
+# the source tree can stand in for the installed package.
+_HERE = Path(__file__).resolve().parent
+sys.path[:] = [entry for entry in sys.path if Path(entry or ".").resolve() != _HERE]
+
+import recusal_langgraph  # noqa: E402
+from langchain_core.messages import AIMessage, ToolMessage  # noqa: E402
+from langchain_core.tools import tool  # noqa: E402
+from langgraph.graph import START, MessagesState, StateGraph  # noqa: E402
+from langgraph.prebuilt import ToolNode, tools_condition  # noqa: E402
+from recusal_langgraph import (  # noqa: E402
+    SURFACE,
+    recusal_agate,
+    recusal_audited_gate,
+    recusal_gate,
+)
+
+import recusal  # noqa: E402
+from recusal import Finding  # noqa: E402
+from recusal.audit import AuditLog, verify  # noqa: E402
+
+EXECUTED: list[str] = []
+CALLS = [
+    {"name": "run_sql", "args": {"sql": "SELECT 1"}, "id": "c1", "type": "tool_call"},
+    {"name": "run_sql", "args": {"sql": "DELETE FROM t"}, "id": "c2", "type": "tool_call"},
+]
+
+
+@tool
+def run_sql(sql: str) -> str:
+    """Record SQL text without connecting to a database."""
+    EXECUTED.append(sql)
+    return f"recorded: {sql}"
+
+
+def policy(tool_name, tool_input):
+    if str(tool_input.get("sql", "")).upper().startswith("DELETE"):
+        return [Finding.fail("no_deletes", severity="CRITICAL", message="DELETE is not allowed")]
+    return []
+
+
+def graph(node: ToolNode):
+    script = iter([AIMessage(content="", tool_calls=CALLS)])
+
+    def scripted_agent(state: MessagesState) -> dict[str, Any]:
+        return {"messages": [next(script, AIMessage(content="done"))]}
+
+    builder = StateGraph(MessagesState)
+    builder.add_node("agent", scripted_agent)
+    builder.add_node("tools", node)
+    builder.add_edge(START, "agent")
+    builder.add_conditional_edges("agent", tools_condition)
+    builder.add_edge("tools", "agent")
+    return builder.compile()
+
+
+def answers(messages: list) -> dict[str, tuple[str, str]]:
+    return {
+        m.tool_call_id: (m.status, str(m.content)) for m in messages if isinstance(m, ToolMessage)
+    }
+
+
+def run(node: ToolNode) -> dict[str, tuple[str, str]]:
+    EXECUTED.clear()
+    return answers(graph(node).invoke({"messages": []})["messages"])
+
+
+async def arun(node: ToolNode) -> dict[str, tuple[str, str]]:
+    EXECUTED.clear()
+    return answers((await graph(node).ainvoke({"messages": []}))["messages"])
+
+
+def main() -> None:
+    for module in (recusal, recusal_langgraph):
+        origin = Path(module.__file__).resolve()
+        assert "site-packages" in origin.parts, f"{module.__name__} is not installed: {origin}"
+    assert metadata.version("recusal-langgraph") == recusal_langgraph.__version__
+    requires = metadata.requires("recusal-langgraph") or []
+    assert any(r.startswith("recusal") and "lang" not in r for r in requires), requires
+
+    # Negative control: without the gate the DELETE runs, so the refusals below are the gate's.
+    run(ToolNode([run_sql]))
+    assert sorted(EXECUTED) == ["DELETE FROM t", "SELECT 1"], EXECUTED
+
+    got = run(ToolNode([run_sql], wrap_tool_call=recusal_gate(policy)))
+    assert EXECUTED == ["SELECT 1"], EXECUTED
+    assert got["c1"] == ("success", "recorded: SELECT 1"), got
+    assert got["c2"][0] == "error" and "DELETE is not allowed" in got["c2"][1], got
+
+    got = asyncio.run(arun(ToolNode([run_sql], awrap_tool_call=recusal_agate(policy))))
+    assert EXECUTED == ["SELECT 1"], EXECUTED
+    assert got["c2"][0] == "error" and "DELETE is not allowed" in got["c2"][1], got
+
+    with tempfile.TemporaryDirectory() as folder:
+        log = AuditLog(path=os.path.join(folder, "audit.jsonl"))
+        run(ToolNode([run_sql], wrap_tool_call=recusal_audited_gate(policy, log)))
+        assert EXECUTED == ["SELECT 1"], EXECUTED
+        by_id = {entry["action"]["tool_use_id"]: entry["action"] for entry in log.entries}
+        assert by_id["c2"]["decision"] == "deny" and by_id["c2"]["surface"] == SURFACE, by_id
+        assert by_id["c1"]["decision"] != "deny", by_id
+        intact, problems = verify(log.entries)
+        assert intact, problems
+
+    print(
+        f"recusal-langgraph {recusal_langgraph.__version__} with recusal "
+        f"{recusal.__version__}: installed wheel gates and records"
+    )
+
+
+if __name__ == "__main__":
+    main()

recusal_langgraph-0.1.0/src/recusal_langgraph/__init__.py

@@ -0,0 +1,32 @@
+"""Recusal for LangGraph: judge every ``ToolNode`` call before it runs.
+
+    from langgraph.prebuilt import ToolNode
+    from recusal_langgraph import recusal_gate
+
+    node = ToolNode([run_sql], wrap_tool_call=recusal_gate(policy))
+
+``policy(tool_name, tool_input)`` is an ordinary Recusal policy returning findings. A
+refused call is answered with an error ``ToolMessage`` carrying Recusal's reason, and its
+tool does not run. ``recusal_agate`` is the ``awrap_tool_call`` form, and
+``recusal_audited_gate`` and ``recusal_audited_agate`` put each decision on a hash-chained
+audit log.
+
+The decision is made by ``recusal.decide``. This package adds only what is LangGraph's:
+where the hook attaches, how the invocation is completed, and how a refusal is answered.
+"""
+
+from ._audit import SURFACE, recusal_audited_agate, recusal_audited_gate
+from ._gate import Policy, RecusalRefusal, recusal_agate, recusal_gate
+
+__version__ = "0.1.0"
+
+__all__ = [
+    "SURFACE",
+    "Policy",
+    "RecusalRefusal",
+    "__version__",
+    "recusal_agate",
+    "recusal_audited_agate",
+    "recusal_audited_gate",
+    "recusal_gate",
+]

recusal_langgraph-0.1.0/src/recusal_langgraph/_audit.py

@@ -0,0 +1,89 @@
+"""The audited gate: the same decision, with every call on a hash-chained ``AuditLog``.
+
+``recusal_audited_gate(policy, log)`` and ``recusal_audited_agate(policy, log)`` call the
+plain gate's own judging function with the recording arguments passed through to
+``recusal.decide``, which writes the entry before returning. There is no second decision
+path. If the log cannot be written the decision becomes a deny, so nothing runs unrecorded.
+
+Each entry carries the surface ``langgraph.toolnode`` and LangGraph's tool call id, and a
+SHA-256 fingerprint of the arguments, never the arguments themselves.
+
+What each entry is bound to:
+
+- a call that is judged: the invocation the tool executes, validated and completed, with
+  host-injected arguments left out;
+- a call refused before judgment (a tool that overrides the standard lifecycle, input that
+  does not validate, a parameter the schema omits): the arguments as proposed.
+
+What is not on the log: a call another ``wrap_tool_call`` hook answered without reaching
+the gate.
+"""
+
+from __future__ import annotations
+
+from typing import Any, Optional
+
+from recusal.audit import AuditLog
+
+from ._gate import Policy, _judge
+
+#: The surface label every entry carries: the runtime that adjudicated, LangGraph's ToolNode.
+SURFACE = "langgraph.toolnode"
+
+
+def _recording(
+    request,
+    actor: Optional[str],
+    control: Optional[dict[str, Any]],
+    log: AuditLog,
+    surface: str = SURFACE,
+):
+    """The recording arguments for one call, built in one place for both gates."""
+    return {
+        "audit": log,
+        "surface": surface,
+        "tool_use_id": request.tool_call["id"],
+        "actor": actor,
+        "control": control,
+    }
+
+
+def recusal_audited_gate(
+    policy: Policy,
+    log: AuditLog,
+    *,
+    actor: Optional[str] = None,
+    control: Optional[dict[str, Any]] = None,
+    surface: str = SURFACE,
+):
+    """Return a synchronous ToolNode hook that records, then gates, each call.
+
+    ``surface`` names the runtime on the record; another host of the same hook
+    (LangChain's ``create_agent`` middleware) passes its own."""
+
+    def gate(request, execute):
+        refusal, judged = _judge(
+            request, policy, **_recording(request, actor, control, log, surface)
+        )
+        return refusal if refusal is not None else execute(judged)
+
+    return gate
+
+
+def recusal_audited_agate(
+    policy: Policy,
+    log: AuditLog,
+    *,
+    actor: Optional[str] = None,
+    control: Optional[dict[str, Any]] = None,
+    surface: str = SURFACE,
+):
+    """Return an asynchronous ToolNode hook for awrap_tool_call, same logic as the sync one."""
+
+    async def gate(request, execute):
+        refusal, judged = _judge(
+            request, policy, is_async=True, **_recording(request, actor, control, log, surface)
+        )
+        return refusal if refusal is not None else await execute(judged)
+
+    return gate

recusal_langgraph-0.1.0/src/recusal_langgraph/_gate.py

@@ -0,0 +1,423 @@
+"""The gate: judge each ``ToolNode`` call at execution time, on the invocation that runs.
+
+The hook is LangGraph-native: a user's existing ``@tool`` list goes unchanged into
+``ToolNode`` and ``recusal_gate(policy)`` is attached with ``wrap_tool_call``. Every call in
+a model message crosses the gate separately immediately before execution. Denials become
+error ``ToolMessage`` objects carrying Recusal's reason; allow and defer execute normally.
+Async graphs attach ``recusal_agate(policy)`` through ``awrap_tool_call`` and run with
+``ainvoke``, using the same decision logic.
+
+The policy judges the invocation the tool executes, not the dict the model wrote: the hook
+hands execution a per-call copy of the tool whose parse step (``_to_args_and_kwargs``, run by
+``BaseTool.run``/``arun`` after ToolNode has injected the host's state, store and runtime)
+validates the input once, holds the callable the route executes to the schema (every named
+parameter it declares is a field the schema declares, a key the host injects, or a name the
+framework reserves and fills at call time; any other is a default the model's proposal cannot
+carry and the policy would never see, so the call is refused), completes any schema parameter
+the framework's parse dropped (``_parse_input`` selects the kwargs it returns through the
+argument model's own ``model_dump``, so a field with ``exclude=True`` or a root serializer can
+vanish) from that callable's default, projects every model-controlled argument through a
+projection that runs no serializer of its own, decides, and on allow passes those same
+completed objects to the function. Host arguments are excluded from judgment and can never be
+supplied by the model; a tool whose class or instance overrides the standard lifecycle is
+refused rather than judged in the wrong place.
+"""
+
+from __future__ import annotations
+
+import dataclasses
+import datetime
+import decimal
+import enum
+import inspect
+import math
+import uuid
+from typing import Any, Callable, List
+
+from langchain_core.messages import ToolMessage
+from langchain_core.tools import BaseTool, StructuredTool, Tool, ToolException
+from langchain_core.tools.base import FILTERED_ARGS, _get_runnable_config_param
+from langgraph.prebuilt.tool_node import _get_all_injected_args
+from pydantic import BaseModel, ValidationError
+
+from recusal import Finding, decide
+
+#: A Recusal policy: ``policy(tool_name, tool_input)`` returns a list of findings.
+Policy = Callable[[str, dict], List[Any]]
+
+
+class RecusalRefusal(ToolException):
+    """Raised inside a judging copy's parse step: the call is refused and the message is the
+    reason. ``BaseTool.run``/``arun`` turn it into an error ToolMessage through the copy's
+    ``handle_tool_error``, which handles only this type and leaves every other
+    ``ToolException`` to the original tool's own setting."""
+
+
+# The execution lifecycle this gate relies on: ``invoke``/``ainvoke`` call ``run``/``arun``,
+# which parse the input through ``_to_args_and_kwargs`` and then call ``_run``/``_arun``.
+# The judging copy replaces that parse step, so a tool that overrides any of these on its
+# class (other than the three standard implementations) or on the instance may execute
+# without ever reaching the seam; such a tool is refused rather than judged in the wrong place.
+_LIFECYCLE = ("invoke", "ainvoke", "run", "arun", "_to_args_and_kwargs")
+_STANDARD = {
+    name: {vars(cls)[name] for cls in (BaseTool, StructuredTool, Tool) if name in vars(cls)}
+    for name in _LIFECYCLE
+}
+
+
+def _lifecycle_refusal(tool) -> str | None:
+    """Why this tool's execution path cannot be judged at the parse seam, or None."""
+    for name in _LIFECYCLE:
+        if name in vars(tool):
+            return f"`{name}` is overridden on the tool instance"
+        if getattr(type(tool), name, None) not in _STANDARD[name]:
+            return f"{type(tool).__name__} overrides `{name}`"
+    return None
+
+
+def _host_keys(tool) -> frozenset[str]:
+    """The argument names the host supplies, never the model.
+
+    ToolNode strips every ``InjectedToolArg``-annotated key from the model's arguments and
+    adds back only the state, store and runtime it owns (``_inject_tool_args``), and
+    ``_parse_input`` sets an ``InjectedToolCallId`` from the call id; a value under one of
+    these keys at the parse seam is therefore the host's. Everything else the parse step
+    produces, including a field an ``extra="allow"`` schema accepted, is model-controlled and
+    is judged.
+    """
+    injected = _get_all_injected_args(tool)
+    return frozenset(injected.all_injected_keys) | frozenset(
+        getattr(tool, "_injected_args_keys", ())
+    )
+
+
+def _schema_fields(tool) -> frozenset[str]:
+    """The parameter names the tool's ``args_schema`` declares (host-injected ones included;
+    they are excluded elsewhere), or none for a tool without a model schema."""
+    schema = tool.args_schema
+    if isinstance(schema, dict):
+        return frozenset(schema.get("properties", {}))
+    if isinstance(schema, type) and issubclass(schema, BaseModel):
+        return frozenset(schema.model_fields)
+    return frozenset()
+
+
+#: The parameter names the SDK reserves for itself (``run_manager``, ``callbacks``): it strips
+#: them from every schema it generates and fills ``callbacks`` on a function and
+#: ``run_manager`` on ``_run``/``_arun`` at call time, so a value under either name is never
+#: the model's. ``tests/test_langgraph_gate.py`` pins the set against the SDK's own constant.
+_RESERVED = frozenset(FILTERED_ARGS)
+
+
+def _execution_callable(tool, is_async: bool):
+    """The function the active route finally calls, chosen as the SDK chooses it.
+
+    ``StructuredTool._run`` calls ``func`` and ``_arun`` calls ``coroutine``, falling back to
+    ``func`` on a thread when there is none; ``BaseTool.arun`` runs the class's ``_arun`` when
+    it overrides the default and ``_run`` otherwise, and ``run`` always runs ``_run``. Bound
+    methods are returned, so ``self`` is not among the parameters inspected.
+    """
+    if isinstance(tool, StructuredTool):
+        target = tool.coroutine if is_async and tool.coroutine is not None else tool.func
+        if target is None:
+            raise TypeError(
+                "the tool has no callable for this route, so the invocation cannot be judged"
+            )
+        return target
+    if is_async and type(tool)._arun is not BaseTool._arun:
+        return tool._arun
+    return tool._run
+
+
+def _framework_keys(func) -> frozenset[str]:
+    """The parameter names the framework fills on ``func`` at call time: the reserved names
+    and the parameter annotated ``RunnableConfig``, found exactly as the SDK finds it."""
+    config_param = _get_runnable_config_param(func)
+    return _RESERVED | ({config_param} if config_param else frozenset())
+
+
+def _completed(
+    kwargs: dict[str, Any], tool, host_keys: frozenset[str], is_async: bool
+) -> dict[str, Any]:
+    """The parsed kwargs, held to the callable the route executes, with every suppressed
+    schema parameter restored from that callable's default.
+
+    Python fills whatever the parsed kwargs leave out from the callable's own defaults, after
+    the policy has judged, so the callable is the authority on what will execute. Each named
+    parameter it declares must be a field the schema declares (judged), a key the host injects
+    (never the model's) or a name the framework fills at call time (:func:`_framework_keys`);
+    any other parameter is a value the proposal cannot carry and the policy would never see,
+    so the call is refused as unjudgeable, naming the parameter and never its default. A
+    positional-only parameter cannot be judged by name and is refused too.
+
+    ``_parse_input`` returns only the fields present in the validated model's
+    ``model_dump()``, so a schema field with ``exclude=True`` or a model-wide serializer that
+    omits it never reaches the kwargs, and the function would fill its own Python default
+    after the policy judged an invocation without it. Each parameter the schema declares, the
+    host does not inject, and the parse did not return is taken from the route's callable's
+    default here, and passed explicitly, so the judged invocation is the executed one; a
+    suppressed parameter with no default raises ``TypeError`` and the call is refused as
+    unjudgeable.
+    """
+    fields = _schema_fields(tool)
+    func = _execution_callable(tool, is_async)
+    try:
+        parameters = inspect.signature(func).parameters
+    except (TypeError, ValueError) as exc:
+        raise TypeError(f"the tool's callable cannot be inspected for its parameters ({exc})")
+    framework_keys = _framework_keys(func)
+    completed = dict(kwargs)
+    for name, parameter in parameters.items():
+        if parameter.kind in (parameter.VAR_POSITIONAL, parameter.VAR_KEYWORD):
+            continue
+        if name in host_keys or name in framework_keys:
+            continue
+        if parameter.kind is parameter.POSITIONAL_ONLY:
+            raise TypeError(
+                f"the callable's parameter `{name}` is positional-only, so the invocation "
+                "cannot be judged by name"
+            )
+        if name not in fields:
+            raise TypeError(
+                f"the callable's parameter `{name}` is absent from the argument schema, so "
+                "the invocation cannot be judged; declare it in the schema"
+            )
+        if name in completed:
+            continue
+        if parameter.default is parameter.empty:
+            raise TypeError(
+                f"the schema suppressed `{name}` and the callable has no default for it, so "
+                "the invocation cannot be judged"
+            )
+        completed[name] = parameter.default
+    return completed
+
+
+def _faithful(value: Any, _stack: tuple[int, ...] = ()) -> Any:
+    """A detached, serializer-free data projection of one parsed argument, for judgment.
+
+    The policy receives this projection; the tool receives the original parsed objects. The
+    projection reads a Pydantic model field by field (``getattr`` over ``model_fields`` plus
+    ``model_extra``), so no ``field_serializer`` or custom ``model_dump`` runs: a serializer
+    that displays ``SELECT`` for a field holding ``DELETE`` is exactly what this bypasses.
+    Supported, each with a fixed meaning: ``None``, ``bool``, ``int``, ``str``; a finite
+    ``float``; ``Enum`` by its value (projected in turn); ``datetime``/``date``/``time`` by
+    ``isoformat()``; a finite ``Decimal`` and a ``UUID`` by ``str()``; ``list`` and ``tuple``
+    as a new list; ``dict`` with ``str`` keys as a new dict; Pydantic v2 models and
+    dataclasses as a new dict of their fields. Anything else (a Pydantic v1 model, a set, an
+    arbitrary object, a non-finite number, a cyclic value) raises ``TypeError`` and the call is
+    refused: a value that cannot be represented faithfully cannot be judged. Containers are
+    new objects, so a policy that mutates what it was given cannot change the invocation.
+    """
+    if isinstance(value, enum.Enum):
+        return _faithful(value.value, _stack)
+    if value is None or isinstance(value, (bool, int, str)):
+        return value
+    if isinstance(value, float):
+        if not math.isfinite(value):
+            raise TypeError("a non-finite float cannot be judged")
+        return value
+    if isinstance(value, (datetime.datetime, datetime.date, datetime.time)):
+        return value.isoformat()
+    if isinstance(value, decimal.Decimal):
+        if not value.is_finite():
+            raise TypeError("a non-finite Decimal cannot be judged")
+        return str(value)
+    if isinstance(value, uuid.UUID):
+        return str(value)
+    if id(value) in _stack:
+        raise TypeError("a cyclic value cannot be judged")
+    stack = _stack + (id(value),)
+    if isinstance(value, (list, tuple)):
+        return [_faithful(item, stack) for item in value]
+    if isinstance(value, dict):
+        projected = {}
+        for key, item in value.items():
+            if not isinstance(key, str):
+                raise TypeError(f"a mapping keyed by {type(key).__name__} cannot be judged")
+            projected[key] = _faithful(item, stack)
+        return projected
+    if isinstance(value, BaseModel):
+        projected = {
+            name: _faithful(getattr(value, name), stack) for name in type(value).model_fields
+        }
+        for key, item in (value.model_extra or {}).items():
+            projected[key] = _faithful(item, stack)
+        return projected
+    if dataclasses.is_dataclass(value) and not isinstance(value, type):
+        return {
+            field.name: _faithful(getattr(value, field.name), stack)
+            for field in dataclasses.fields(value)
+        }
+    raise TypeError(f"a {type(value).__name__} value cannot be judged faithfully")
+
+
+#: Error types whose message is written by user code (a validator's ``raise ValueError``
+#: or ``assert``), so it may echo anything the validator could see, including host state.
+_USER_WRITTEN = frozenset({"value_error", "assertion_error"})
+
+
+def _sanitized(exc: Exception, host_keys: frozenset[str]) -> str:
+    """A validation failure reduced to what is demonstrably safe to show the model and to
+    put on the record.
+
+    Pydantic's ``errors(include_input=False, include_context=False)`` already leaves the
+    input out, but a message is still forwarded only when it is one of Pydantic's own
+    templates for a model-facing field: an error at the model root (a ``model_validator``,
+    location ``()``), an error under a host-supplied argument (whose value may be graph
+    state), and an error of a user-written type (``value_error``, ``assertion_error``, whose
+    text a validator composed and may have built from host context) are reported as
+    location and error type only. A non-Pydantic exception is its class name."""
+    if isinstance(exc, ValidationError):
+        parts = []
+        for error in exc.errors(include_url=False, include_context=False, include_input=False):
+            loc = tuple(str(part) for part in error.get("loc", ()))
+            kind = str(error.get("type"))
+            where = ".".join(loc) or "model"
+            if not loc or loc[0] in host_keys or kind in _USER_WRITTEN:
+                parts.append(f"{where}: {kind}")
+            else:
+                parts.append(f"{where}: {error.get('msg')}")
+        return "; ".join(parts)
+    return type(exc).__name__
+
+
+def _unjudgeable(name: str, detail: str, bound: dict, policy: Policy, record: dict) -> str:
+    """The reason for a call that cannot be judged, recorded through ``decide`` like every
+    other refusal (so an audited gate logs it)."""
+
+    def unjudgeable(_name, _input):
+        return [Finding.fail("recusal_unjudgeable_input", severity="CRITICAL", message=detail)]
+
+    try:
+        _, reason = decide(name, bound, unjudgeable, safe_errors=True, **record)
+    except Exception as exc:  # noqa: BLE001, the refusal stands even if the record cannot be written
+        reason = (
+            f"Recusal failed closed (policy error): RECUSAL_POLICY_ERROR ({type(exc).__name__})"
+        )
+    return reason
+
+
+def _judging(tool, call: dict[str, Any], policy: Policy, record: dict[str, Any], is_async: bool):
+    """A per-call copy of ``tool`` that judges, then runs, exactly the invocation it parsed.
+
+    ``BaseTool.run``/``arun`` parse the input through ``_to_args_and_kwargs`` and hand the
+    result to ``_run``/``_arun``; ToolNode injects the host's state, store and runtime into
+    the input before that (``_inject_tool_args``), whatever hook or middleware ran earlier.
+    The copy's parse step therefore sees the final input: it runs the tool's own parser once,
+    holds the callable this route executes (``is_async`` names the route) to the schema and
+    completes any schema parameter that parse suppressed from that callable's default
+    (:func:`_completed`), projects every model-controlled argument with :func:`_faithful`,
+    calls ``decide`` once, and on allow returns the very objects it judged, so the tool
+    executes what was judged with no second validation and nothing to compare. A deny, an input the parser rejects,
+    a positional input, or a value that cannot be projected raises :class:`RecusalRefusal`,
+    which the copy's ``handle_tool_error`` turns into the error ToolMessage the model reads;
+    any other ``ToolException`` keeps the original tool's handling. The copy serves one call
+    id; every execution attempt of that call (a retry, a resume) is judged again.
+    """
+    name, call_id, fallback = call["name"], call.get("id"), call.get("args")
+    copy = tool.model_copy()
+    parse = type(tool)._to_args_and_kwargs
+    host_keys = _host_keys(tool)
+    original_handler = tool.handle_tool_error
+
+    def proposal(tool_input) -> dict:
+        """The model-facing input, for the record of a refusal that judged nothing."""
+        if isinstance(tool_input, dict):
+            try:
+                return _faithful({k: v for k, v in tool_input.items() if k not in host_keys})
+            except TypeError:
+                pass
+        return fallback if isinstance(fallback, dict) else {"input": fallback}
+
+    def seam(tool_input, tool_call_id):
+        if tool_call_id != call_id:
+            raise RuntimeError("Recusal: a judging copy of a tool was used for a different call")
+        try:
+            args, kwargs = parse(copy, tool_input, tool_call_id)
+        except Exception as exc:  # noqa: BLE001, an input the tool rejects is refused with its reason
+            detail = f"arguments do not validate ({_sanitized(exc, host_keys)})"
+            raise RecusalRefusal(_unjudgeable(name, detail, proposal(tool_input), policy, record))
+        if args:
+            detail = "a positional tool input cannot be judged by name"
+            raise RecusalRefusal(_unjudgeable(name, detail, proposal(tool_input), policy, record))
+        try:
+            kwargs = _completed(kwargs, tool, host_keys, is_async)
+            judged = {k: _faithful(v) for k, v in kwargs.items() if k not in host_keys}
+        except TypeError as exc:
+            raise RecusalRefusal(_unjudgeable(name, str(exc), proposal(tool_input), policy, record))
+        try:
+            decision, reason = decide(name, judged, policy, safe_errors=True, **record)
+        except Exception as exc:  # noqa: BLE001, a buggy policy must not silently disable the gate
+            decision, reason = (
+                "deny",
+                f"Recusal failed closed (policy error): RECUSAL_POLICY_ERROR ({type(exc).__name__})",
+            )
+        if decision == "deny":
+            raise RecusalRefusal(reason)
+        return args, kwargs
+
+    def handle(exc):
+        if isinstance(exc, RecusalRefusal):
+            return str(exc)
+        if not original_handler:
+            raise exc
+        if original_handler is True:
+            return str(exc)
+        if isinstance(original_handler, str):
+            return original_handler
+        return original_handler(exc)
+
+    object.__setattr__(copy, "_to_args_and_kwargs", seam)
+    object.__setattr__(copy, "handle_tool_error", handle)
+    return copy
+
+
+def _judge(request, policy: Policy, *, is_async: bool = False, **record: Any):
+    """Return ``(refusal, request_to_execute)``: a refusal ToolMessage for a call that can
+    never reach the seam, else the request with its tool replaced by the judging copy.
+
+    ``is_async`` names the route the hook runs on (``awrap_tool_call`` executes the tool
+    through ``arun``), so the copy holds the callable that route runs. ``record`` goes
+    straight to ``decide`` (``audit=``, ``surface=``, ``tool_use_id=``, ...), so a gate that
+    puts the decision on a log (examples/langgraph_audit.py) decides, and refuses, exactly as
+    this one does: one function, no second copy to drift.
+    """
+    call = request.tool_call
+    name, call_id, raw = call["name"], call.get("id"), call.get("args")
+
+    def refuse(detail):
+        bound = raw if isinstance(raw, dict) else {"input": raw}
+        reason = _unjudgeable(name, detail, bound, policy, record)
+        return ToolMessage(content=reason, tool_call_id=call_id, name=name, status="error"), None
+
+    tool = request.tool
+    if tool is None:
+        return refuse("no tool by that name is registered with this node")
+    why = _lifecycle_refusal(tool)
+    if why is not None:
+        return refuse(
+            f"the tool's execution path cannot be judged ({why}); the gate judges inside the "
+            "standard BaseTool lifecycle, so build the tool with @tool or StructuredTool"
+        )
+    return None, request.override(tool=_judging(tool, call, policy, record, is_async))
+
+
+def recusal_gate(policy: Policy):
+    """Return a synchronous ToolNode hook that gates each call before execution."""
+
+    def gate(request, execute):
+        refusal, judged = _judge(request, policy)
+        return refusal if refusal is not None else execute(judged)
+
+    return gate
+
+
+def recusal_agate(policy: Policy):
+    """Return an asynchronous ToolNode hook for awrap_tool_call."""
+
+    async def gate(request, execute):
+        refusal, judged = _judge(request, policy, is_async=True)
+        return refusal if refusal is not None else await execute(judged)
+
+    return gate

recusal_langgraph-0.1.0/tested-with.txt

@@ -0,0 +1,2 @@
+langgraph==1.2.12
+langchain-core==1.6.5