Outline sketch
# Agent memory control
State: the new observation or the query, plus short summaries of the related stored memories.
Ask: Choice for memory type and which memory view to search; Noul for redundant, related, keep candidate and evidence sufficient.
Then: code writes links, enforces traversal and budget limits, stops when the evidence is enough, and sends only the selected evidence to the answer model.
Needs access to: locomolaya
Who it's for
Builders of long-running agents with persistent memory
Steps / how it's set up
Steps (experimental)
- Keep the original observations with timestamps and provenance.
- Ask Jev typed questions on write (type, redundancy, relations) and on read (route, budget, candidate, stop).
- Enforce graph and retrieval limits in code, and let a separate model write the answer.
Sources
This pattern is experimental. Results are paper-reported on one benchmark — evaluate on your own agent history.
Expected effect
Moves frequent memory decisions out of the generative loop
Unofficial outline for learning. Paraphrased from public docs and tutorials — not a production recipe. Review sources before you automate anything.