feat(recursion): add adaptive bounded routing #39
No reviewers
Labels
No labels
bug
documentation
duplicate
enhancement
good first issue
help wanted
invalid
question
wontfix
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference
nsaspy/prolog-rlm!39
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "feature/issue-17-adaptive-recursion"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Summary
expected_valueclaims are recomputed, and selectors cannot escape the final bounded candidate setactual_cost, usage, and child identity while preserving backwards compatibility with plain values andok(Value)unknown), and depth in execution tracesrlmentrypoint and include both adaptive modules inrlm_ready/0, so static-load CI covers the subsystemRLM-RESEARCH-008Architecture
The policy layer has no provider, MCP, tool, or actor side effects. Execution occurs only through explicit route handlers, preserving the existing provider/completion and supervision boundaries. Provider/agent handlers can optionally return measured execution metadata; the policy never invents provider-side cost or usage.
Validation
The exact PR head must pass production/static load, live-test definition load, the complete deterministic PlUnit suite (including adaptive recursion policy/runtime), persistent graph restart, durable artifact restart, whitespace checks, and the existing REAL OpenRouter core + structured-repair gates.
Closes #17