Show HN: Strot – Compile an LLM's intent once, run decisions locally forever
Summary
Show HN: STROT,一个开源「决策编译器」,用 LLM 编译一次意图,之后在本地以 144M 小模型零成本执行分类、评分与路由决策,附带校准与置信度门控保证。
View Cached Full Text
Cached at: 10/19/26, 05:00 AM
strot-ai/Project-STROT
Source: https://github.com/strot-ai/Project-STROT
⬢ STROT
The open decision compiler
Compile your intent once with an LLM. Then decide on every record forever — classification, scoring, routing — as type-safe JSON with probabilities and confidence, on your own hardware, at zero marginal cost.
Website · Docs · Benchmarks · PyPI
Agents at compile time. Never at runtime.
pip install strot-ai
import strot
result = strot.run(
tickets,
query="Triage incoming support tickets into the correct workflow.",
action_registry={
"billing_dispute": "Refunds, invoice corrections, double charges",
"technical_defect": "Crashes, bugs, broken behavior",
},
llm="anthropic/claude-opus-4-8", # used once, on first compile only
)
for o in result.outcomes:
print(o["action"], round(o["confidence"], 2))
# billing_dispute 0.97
# technical_defect 0.94
The LLM runs once, at compile time. Production is a frozen, self-contained Python artifact: a small local decision model arbitrates every record, nothing is generated, every output is bounded, and low-confidence records abstain instead of guessing.
STROT = Agentic Schema Intent + Compiler & State + Code + Execution + NLU
⟹ JSON Decisions
(classification · scoring · routing · typed answers)
How it works
COMPILE (once per intent + schema)
intent + sample ─▶ synthesize ─▶ golden gate ─▶ teacher labels ─▶ calibrate
(labels, (your known (annotate (fit the
projection, answers must a sample, confidence
handlers) pass) once) threshold)
│
▼
frozen artifact (.py)
RUNTIME (every record, forever)
record ─▶ projection ─▶ decision model ─▶ confidence gate ─▶ typed JSON
(compiled) (144M, CPU, (decide or decision
~60 ms) abstain)
Two surfaces
run() — route each record to an action and execute the compiled handler.
decide() — answer typed questions (choice / score / boolean) per record:
result = strot.decide(records, questions={
"is_bug_report": {"type": "boolean", "instructions": "mentions crashes/errors?"},
"customer_sentiment":{"type": "score", "min": 1, "max": 5, "instructions": "1 angry, 5 happy"},
"routing_bucket": {"type": "choice", "options": ["billing", "engineering", "spam"]},
})
# → {"booleans": {...}, "scores": {...}, "choices": {...}} with probabilities + confidence
Measured
Real model (SupersonicLabs/Julia-1, 144M, CPU), real datasets, clean Docker containers:
| Result | |
|---|---|
| Grounded routing accuracy (398 records) | 92.5% compiled vs 74.8% naive — the compiler is worth +18pp on the same model |
| Semantic text (AG News, unseen labels) | 86.7% compiled vs 72.7% naive (+14pp) |
| Typed decisions vs the leading hosted decision API’s own example | near-identical (sentiment 1.79 vs 1.8) |
| Latency / marginal cost / LLM calls per record | ~60 ms · $0 · 0 |
Reproduce everything: benchmarks/ — with the losses published too.
What makes it different
- Compile once, decide forever — content-addressed artifact cache; schema drift triggers exactly one recompile.
- Golden-record promotion — artifacts must pass your known answers before they serve.
- Fitted guarantees — temperature scaling + split conformal prediction, baked in: dispatched decisions are wrong ≤ α of all records (marginal); the rest abstain.
- Measured, not guessed — the compiler scores labelings, and can train a distilled head, keeping only what beats the baseline on held-out data.
- 0% structural hallucination — output is selection + computation over your registry; nothing is generated at runtime.
- Model-independent — the decision model is a slot (
nlu=): local Julia-1 by default, hosted APIs, or any drop-in specialist.
Install
pip install strot-ai # core: pure stdlib
pip install strot-ai[local] # + the local decision model (torch/transformers)
pip install strot-ai[hosted] # + openai, for a hosted decision runtime
pip install strot-ai[anthropic] # + anthropic, for the synthesizer
Bake the local model into your image for offline production:
RUN pip install strot-ai[local] \
&& python -c "import strot; strot.prefetch_nlu(local_dir='/opt/julia-1', install=True)"
ENV STROT_NLU_CHECKPOINT=/opt/julia-1
(Never pip install julia — unrelated package.)
Documentation
DEVELOPERS.md — architecture, compile lifecycle, calibration semantics and caveats, deployment, model swapping, full API reference.
License
MIT. Default decision model: Apache-2.0 (SupersonicLabs/Julia-1). Implements ideas from STROT (arXiv:2505.01636).
Similar Articles
A proxy that watches the yes/no and pick-one decisions your app asks an LLM for, then trains a local model to make them for free
Stuntd is an open-source local proxy that records LLM decision calls, trains a lightweight model to handle them locally, reducing costs while maintaining high agreement with the teacher model.
i created an open-source repo to convert llms into decision models.
作者发布了开源项目 DecisionFormer,可将普通 LLM 转换为直接预测选择而非生成文本的决策模型,适用于决策模型实验与推理方式探索。
Built a Python agent framework where a decision model chooses actions instead of an LLM - looking for feedback
作者介绍了 DecisionLoop,一个用小型决策模型替代 LLM 处理意图识别、工具选择与控制流的 Python 智能体框架,初步测试在工具调用准确率、成本和延迟上优于基于 LangChain 的 LLM 智能体,并寻求架构反馈与基准测试建议。
LEV: Thinking Fast and Deep with Looped Decision Models
LEV 是一种“系统1.5”决策模型,通过循环运行主干网络并在每轮后对选项打分来延长思考,而无需生成思维链,单一检查点即可在任意推理深度作答。实验显示 Lev-2.6B 在 JevBench 上从单轮 63.2% 提升至四轮 76.2%,且一个轻量停止器可在几乎无精度损失的情况下节省 15-24% 的计算。
Our Own Jev: Typed Decisions in One Forward Pass, from an In-House Judge to Open LoRA Models
这篇论文介绍了一种"typed decision"System 1 接口:通过一次前向传播直接从模型 logits 或小分类头输出固定选项的概率,用于替代昂贵的 frontier LLM 判官。作者部署了一个自托管的 rank-16 LoRA 判官来分流 14.8 万条 agent 编码会话记录,成本仅为前沿模型判官的约 1%;并在 JevBench 上用 35B 开源模型达到 79.3%,与商业参考系统(73.0%)无显著差异。