feat(prover): delivery B: handler-named operations, Symfony, Livewire, Remix and Tornado entries, enforcement witnesses, memoised path walk

Codex delivery under spec access-control-prover plus one fix of mine. Operation rows may now name a handler by
name pattern and framework (Jenkins form validation and list filling, Tornado request methods, Remix actions);
the mapper recognises Symfony, Livewire and Laravel controllers, Remix exports and Tornado handlers;
`obligations/enforcement.py` turns Laravel route middleware, Symfony attributes and security.yaml rules and
Tornado's authenticated decorator into router and decorator witnesses. The path walk looks each node's callers
up once per change and does not walk a tree with no recognised entry: one seatunnel change fell from 670 s to
35 s. One name Codex could not source (Tornado get_current_user) is left out and said so in the facts header.

Smoke on the 23 fix changes: 15 pushes caught (65 percent, Wilson 45 to 81), 55 of 93 locations, precision
15 of 15 flagged, no instrument failure, no change over 120 s. Delivery A caught 7.

Co-Authored-By: Claude Fable 5.1 <[email protected]>

tests/test_obligation_paths.py

@@ -63,3 +63,21 @@ def test_records_are_consumed_by_the_checker():
     )
     (finding,) = result.findings
     assert finding.operation.function == "entry" and finding.label == "unguarded_path"
+
+
+def test_callers_are_looked_up_once_per_node_and_never_without_entries():
+    from openultrasast.semantic.obligations.paths import compose_paths
+
+    calls: list[str] = []
+    graph = {"a.py::leaf": [("a.py::mid", 3)], "a.py::mid": [("web.py::view", 9), ("a.py::other", 4)], "a.py::other": [("a.py::mid", 5)]}
+
+    def callers(path, function):
+        calls.append(f"{path}::{function}")
+        return graph.get(f"{path}::{function}", [])
+
+    paths, unreached = compose_paths(callers=callers, entries={"web.py::view"}, targets=[("a.py", "leaf"), ("a.py", "mid")], max_depth=3)
+    assert [p.hops[0][0] for p in paths] == ["web.py::view"] * len(paths) and len(paths) >= 2 and unreached == []
+    assert len(calls) == len(set(calls))  # once per node across both targets
+    calls.clear()
+    paths, unreached = compose_paths(callers=callers, entries=set(), targets=[("a.py", "leaf")])
+    assert paths == [] and unreached == ["a.py::leaf"] and calls == []