rechain
Refresh or extend a memory chain in the kaeru memory graph: recompute its shortest path after new edges or weights, or add a node to the trail while keeping its id, name, and summary.
Instructions
Refresh a chain the graph has outgrown. With no to, regenerate it — recompute the shortest path between its current endpoints (picks up new edges / re-weights). With to, extend the trail out to that node. Keeps the chain's id, name, and summary.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | No | Omit to regenerate (recompute the shortest path between the chain's current endpoints). Provide a node name/id to instead extend the trail out to it. | |
| chain | Yes | Chain name or UUIDv7 id to refresh. | |
| initiative | No |