Tiny Recursive Model (TRM)

thumb|right|400px|Tiny Recursive Model diagram (from Samsung SAIL Montréal) | | Feature | TRM | Large Language Models | |---|---|---| | Parameters | ~7M | 70B–175B+ | | Reasoning Style | Iterative, recursive | Single-pass prediction | | ARC-AGI Performance | ↑ Better on logic tasks | ↓ Weaker generalization | | Memory Footprint | Extremely low | High | | Explainability | Easier to trace steps | Often opaque | | Use Case Fit | Logic puzzles, verifiable computation | Open-ended language, wide context |

Relevance to Helix

TRM offers a feasible lightweight module for tasks that require:

• Deterministic verification
• Local reasoning on edge devices
• Constrained-resource environments
• Transparent reasoning chains (auditable steps)

Possible integration points:

• Helix_Models_Overview
• Helix Core Ethos (as a trusted verification subagent)
• QSR_Runbook for recursive policy validation
• Runbooks_&_Protocols: as a fallback verifier model

Resources

• [https://github.com/SamsungSAILMontreal/TinyRecursiveModels GitHub – Tiny Recursive Models]
• [https://arxiv.org/abs/2510.04871v1 ArXiv Paper (2025-10-06)]
• Related: Helix LLaMA:8B – Operating Ontology, Khronos: Experimental Runtime Agent

License

MIT – freely reusable with attribution

Status

{{Status|experimental}}

Category:Helix Models Category:AI Research Category:Recursive Reasoning