mlsanityData to 14 Oct 2026

Loom: A Scalable Analytical Neural Computer Architecture

arXiv 2604.08816 ↗First posted 9 Apr 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We present Loom, a computer architecture that executes programs compiled from C inside a looped transformer whose weights are derived analytically. The architecture implements a 22-opcode instruction set in 8 transformer layers. Each forward pass executes one instruction; the model is applied iteratively until the program counter reaches zero. The full machine state resides in a single tensor X ∈ ℝd × n of fixed size, and every step has fixed cost for fixed d and n, independent of program length or execution history. The default configuration uses d = 155 and n = 1024, yielding 4.7 million parameters and 928 instruction slots. A compact configuration at d = 146 and n = 512 suffices for a 9×9 Sudoku solver (284 instructions). The weights are program-independent: programs live in the state tensor, and the same fixed-weight model executes any compiled program. We make Loom source code publicly available at https://github.com/mkturkcan/Loom.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 23 references that are in the map. First posted on arXiv 9 Apr 2026.

Builds on

17 of 23 references.

References · 17

  1. 2023Looped Transformers as Programmable Computerscited by 237
  2. 2021Thinking Like Transformerscited by 184
  3. 2023Tracr: Compiled Transformers as a Laboratory for Interpretabilitycited by 104
  4. 2024On Expressive Power of Looped Transformers: Theoretical Analysis and Enhancement via Timestep Encodingcited by 36
  5. 2024Simulation of Graph Algorithms with Looped Transformerscited by 30
  6. 2024Universal Length Generalization with Turing Programscited by 25
  7. 2024Looped ReLU MLPs May Be All You Need as Practical Programmable Computerscited by 19
  8. 2025Constant Bit-size Transformers Are Turing Completecited by 19
  9. 2024Autoregressive Large Language Models are Computationally Universalcited by 15
  10. 2024ALTA: Compiler-Based Analysis of Transformerscited by 7
  11. 2025Code Simulation as a Proxy for High-order Tasks in Large Language Modelscited by 7
  12. 2025Neural Algorithmic Reasoning for Hypergraphs with Looped Transformerscited by 4
5 more
  1. 2025Learning to Add, Multiply, and Execute Algorithmic Instructions Exactly with Neural Networkscited by 4
  2. 2025Efficient Turing Machine Simulation with Transformerscited by 4
  3. 2024Algorithmic Language Models with Neurally Compiled Librariescited by 2
  4. 2026Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformercited by 2
  5. 2024Transformers are Efficient Compilers, Provablycited by 1

Built on by

Not cited yet.