Tools Holding an LLM
Haygent deterministic spines, bounded intelligence slots, evidence gates, and truthful halt
Autonomous-agent systems commonly ask a language model to choose the next action, maintain memory, interpret tool output, decide when it is finished, and narrate success. Haygent reverses that architecture. A Haygent is a deterministic, contract-bound process that contains narrow intelligence slots. The runtime—not the model—owns control flow, permissions, state packets, evidence gates, repair budgets, replay, and completion. The model may adjust only declared schema fields. Progress exists only when evidence objects satisfy a gate, and exhausted repair produces a truthful HALT rather than a fabricated success.
Current evidence state
SPECIFIED
This label describes the strongest public-safe state of the specific paper claims. Open the paper's claim ledger for claim-level distinctions and limitations.
Publication
- Full paper:
/papers/p23-haygent-deterministic-agents - Claim ledger:
content/papers/p23-haygent-deterministic-agents/claim-ledger.json - Source manifest:
content/papers/p23-haygent-deterministic-agents/source-manifest.json - Diagrams: 3
- Approximate body length: 1,463 words
Demonstrations
d15-haygent-run-inspector
Benchmarks
b10-haygent-bounded-agent-correctness
Public boundary
The research entry publishes a public-safe architecture and evidence record. It does not grant implementation rights or expose restricted claim-ready material.