ANet Patu-1: The Value of Connection in the Agent Network

Mu Yuan, Jinke Song, Zhaomeng Zhou, Lan ZhangarXiv 2026 · arXiv

TL;DR

As LLM scaling laws for single models face diminishing returns, this paper introduces a new axis for scaling intelligence: agent networks. By deploying ANet Patu-1, a self-organizing consensus protocol, the authors demonstrate that a diverse network of cheap, specialized agents can dynamically form coalitions to out-scale and outperform a single massive, homogeneous model.

What Problem Does This Paper Address?

Frontier AI has focused heavily on making single models larger and more capable. However, the upcoming paradigm shifts toward networks of millions of heterogeneous agents—each utilizing different base models, tools, and expertise.

The core question changes from "how good is a single agent?" to "what is the value created by the connections between them?"

Existing multi-agent frameworks typically hard-wire a fixed topology (such as a central manager or a single flat chatroom). This introduces severe structural bottlenecks, capping the network's value. This paper looks to classical internet network laws—Sarnoff’s, Metcalfe’s, and Reed’s laws—to design an optimal, bottleneck-free collaboration protocol for AI agents.

Three network topologies and their corresponding value laws.

Methods

The authors mathematically model the joint value of an agent group by balancing synergy (which can grow non-linearly) against task conflict and coordination costs. From this model, they derive six essential properties for an optimal collaboration protocol (P1–P6), including self-organization, bottleneck-freeness, and constant $O(1)$ parallel round complexity.

They introduce ANet Patu-1, a protocol defined by three core principles:

  1. Consensus by parallel argument: Agents propose, score, and select answers simultaneously via an argmax mechanism, avoiding slow, turn-based discussions.
  2. Self-choosing coalitions: Agents bid affinity for sub-tasks, and a deterministic matcher groups them, unlocking combinatorial group-forming value ($V \propto 2^N$).
  3. Dynamic, grown structure: No topology is permanent. Coalitions dissolve and re-form every round based on a shared artifact store.

To evaluate protocol quality ($Q$) objectively without relying on subjective LLM "opinion-grading," the authors borrow from distributed-algorithm analysis: they formally specify the emergent protocol and mathematically derive its complexity.

Datasets

The paper does not use standard machine learning datasets. Instead, it evaluates the system using a Heterogeneous Agent Roster consisting of 10 agents. Each agent is assigned a specific "disciplinary lens" (e.g., internet economics, graph networks, distributed systems, evolutionary biology, mechanism design) to tackle the open-ended meta-task of designing a collaboration protocol.

Key Insights and Ideas

  • The Collaboration Scaling Law: Diversity trumps raw capability at scale. A network of cheap, specialized models (GPT-4o-mini) starts weaker than a single powerhouse model (GPT-5.6) but quickly overtakes it as more agents are connected.
  • Reflexivity: When a diverse network of agents is asked to design a collaboration protocol from scratch with no design hints, it naturally "rediscovers" and converges on the ANet Patu-1 protocol itself. The network successfully reconstructs the high-dimensional laws governing its own connective value.
  • Escaping the Coordinator Bottleneck: Traditional architectures rely on a single "decomposer" or "composer" agent, capping network value at linear ($V \propto N$) or quadratic ($V \propto N^2$) scaling. ANet Patu-1 achieves a group-forming value regime ($V \propto 2^N$) with linear message complexity $O(n)$ and constant parallel rounds $O(1)$.

Key Results

  • The Emergence Crossover: A heterogeneous crowd of cheap models overtakes a homogeneous crowd of strong models at a crossover point of $n^* \approx 2.6$ agents. By $n=6$, the cheap network achieves a perfect protocol quality score ($Q=1.0$), while the strong model remains capped in a mid-band ($Q \approx 0.54$) due to its rigid hierarchical structure.
Figure 1: The emergence crossover. A crowd of the cheapest model (gpt-4o-mini), when heterogeneous, starts weak at n=1 but its value-of-connection score Q compounds as complementary specialists connect—and overtakes a crowd of a far stronger model (gpt-5.6) that is homogeneous and sits in a mid band Q≈0.54 ([0.40, 0.66], measured): however capable each copy is, they default to a tree / central-coordinator design, so its structure—and value—is capped. The crossover at n⋆≈2.6 is the emergence of a collaboration scaling law— many cheap, diverse, connected agents beat a copied strong one.
  • Loop Convergence: The consensus loop avoids endless debate and stabilizes rapidly, typically within 2 to 3 iteration rounds, climbing to higher quality scores as the crowd size increases.
Convergence of the ANet Patu-1 consensus loop across different crowd sizes.

Limitations and Future Work

  • Task Scope: The evaluation relies heavily on a specific 10-agent disciplinary roster applied to a meta-protocol design task. Performance on broader, non-meta industrial tasks remains to be validated.
  • Scale Testing: While the protocol theoretically achieves $O(1)$ parallel rounds, the practical token overhead and latency of all-to-all scoring within coalitions at massive scales (e.g., millions of agents) requires further empirical testing.
  • Noise Sensitivity: The authors note that simple majority voting can be actively harmful because it dilutes top minds with low-quality agent noise. The competence-weighting mechanism must therefore remain highly robust to prevent quality dilution in open networks.

Summary updated

Abstract

The Internet taught us that the value of a network depends on \emph{how} its nodes connect: broadcast stars scale as $V\!\propto\!N$ (Sarnoff), fully-connected meshes as $N^2$ (Metcalfe), and group-forming networks as $2^{N}$ (Reed). We ask the analogous question for networks of AI agents. We model the net value of connection as a function of coordination-group size, derive from it the properties an optimal collaboration protocol must have, and introduce ANet Patu-1 -- a self-organizing consensus protocol in which the network continuously re-forms its own coalitions, adaptively riding the upper envelope of all three regimes at $O(1)$ parallel consensus rounds. To measure value without opinion-grading, we score an emergent protocol by formally specifying it and deriving its complexity, the way distributed algorithms are analyzed. Two results follow. (i)~Emergence -- a crowd of the \emph{cheapest} model, when heterogeneous, starts weak but its collective value compounds with $N$ and \emph{overtakes} a crowd of a far \emph{stronger} model that is homogeneous: a crossover that marks a scaling law for collaboration rather than for scale. (ii)~Reflexivity -- a heterogeneous network, given only its own problem and no design hints, converges on ANet Patu-1 itself, reconstructing the high-dimensional law that governs its own connective value.
BibTeX
@misc{yuan2026anet,
  author = {Mu Yuan and Jinke Song and Zhaomeng Zhou and Lan Zhang},
  title = {{ANet Patu-1: The Value of Connection in the Agent Network}},
  year = {2026},
  eprint = {2607.15053},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.15053},
}
Figure