Skip to content
Book Open access

Sufficiently Advanced Agents Are Indistinguishable from Erlang: An Operational Mapping from OTP to Multi-agent LLM Systems

Oct 2026 · Proceedings of the 2nd International Workshop on Multi-Agent Systems using Generative Artificial INtelligence for Automated Software Engineering · 0 citations · 18 references

TL;DR

A term-by-term correspondence between OTP constructs and agent systems is developed, grading twenty mappings as exact, loose, or breaking; the breaking mappings mark the real limits of the transfer: context isolation, payload trust, and mid-inference preemption.

Abstract

Multi-agent LLM systems are rediscovering the engineering problem that produced Erlang/OTP: how to build systems more reliable than their individually unreliable parts. We treat this convergence as a predictive engineering model rather than an analogy. We develop a term-by-term correspondence between OTP constructs and agent systems, grading twenty mappings as exact, loose, or breaking; the breaking mappings mark the real limits of the transfer: context isolation, payload trust, and mid-inference preemption. The correspondence draws on production experience: Erlang ingest fleets processing millions of tweets per hour, and our present agent runtime's independent reproduction of failure shapes OTP was built to survive: orphaned workers, token-burning polling loops, and sessions held open across hour-scale delays. We then test supervision as a capability multiplier in preregistered experiments that cross supervision architecture with model tier. Across 2,400 episodes and eight model tiers, OTP-disciplined supervision never loses to bare agent loops, leads at four of the five tiers where the arms separate, and shows its largest edge where models partially succeed (pass^4 at 3B: 95% supervised vs. 65% bare; at 32B: 70% vs. 45% with retry and 5% without). A preregistered matched-compute control and a prospective replication (640 episodes in total) rule against the evaluated best-of-N control as the explanation: supervision beat nominally token-matched best-of-N in both (paired deltas +0.33 and +0.26, p <= 0.004), and the preregistered selector added zero successes over its first candidate; compute parity itself was not certified in either run. On hard decomposable tasks, supervised clean-context decomposition lifts a 32B model from 57% to 82%, monotonically from one to sixteen LLM actors, on a prospectively frozen holdout. We close with the problems our work to date leaves open: semantic failure detection, context leakage, and restart economics.

Read PDF

Similar papers

#small language model Preprint Sep 2026

ANI-Gamut: Benchmarking Agent Reliability across the Gamut of Agent-Network Interface Abstractions

ANI-Gamut is presented, a reproducible, open-source playground that exposes the same task at several levels on a single, densely populated brownfield substrate, where many coexisting services share resources and collateral damage actually arises.

Lorenzo Bracciale, P. Loreti, A. Mayer et al. · 0 citations
Preprint Sep 2026

Rosetta: Automating First-Principles Performance Modeling Using Multi-Agent LLMs

Rosetta is presented, a multi-agent LLM pipeline that automatically generates first-principles analytical models from research paper PDFs, and four design decisions address failure modes of na\"ive LLM-based generation.

K. Sankaralingam · 0 citations
#artificial intelligence Preprint Sep 2026

Staying on Task: Testing the Foundations of Long-Horizon Agent Reliability

Long-horizon agentic workflows require models to sustain repeated state-dependent actions all while the context grows, sub-task complexity changes, and new data arrives. Each situation represents an independent axis along which an agent may fail. An agent reconciling a long ledger, for example, must repeatedly read its...

Jeffrey Willette, Krishna C. Puvvada, Boris Ginsburg · 0 citations
Review Sep 2026

Skill-as-API: Confidential Multi-Agent Coordination for Agentic Software Engineering

An open-source Python implementation over XMTP with 1.8-2.9 s cross-continent hot-reconnect latency, and a software-engineering case study in which three agents coordinate a pull-request review while each retains ownership of its proprietary analysis prompts are provided.

Zi-Wei Zhao, Yu Gu, Haofeng Liang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.