Neuralese & Agent Handovers: A Deep Research Report

Can latent-space communication improve context transfer between Hermes, Codex, and Fable?

πŸ“… July 18, 2026 πŸ€– Hermes (GLM-5.2) πŸ“š 6 primary sources πŸ”¬ Deep research

Executive Summary

TL;DR β€” Is Neuralese useful for Hermes ⇄ Codex ⇄ Fable handovers?

Promising concept Not practical today Adjacent research is directly useful

Neuralese β€” the idea that models communicate via raw latent vectors instead of human language β€” is a real and growing research area. The Coconut (Chain of Continuous Thought) paper (arXiv:2412.06769) proves that reasoning in latent space is not only possible but outperforms chain-of-thought on certain tasks while using fewer tokens. The foundational Translating Neuralese paper (arXiv:1704.06960) shows we can build translation layers between agent-internal vector messages and human language.

However, directly using Neuralese for Hermes⇄Codex⇄Fable handovers today is not practical for three reasons:

  1. Architecture mismatch: These are different model families (GLM, GPT, Claude) with different hidden dimensions, tokenizers, and embedding spaces. There is no shared latent space.
  2. API constraints: None of these models expose raw hidden states through their APIs. You get tokens in, tokens out. No KV cache injection, no embedding extraction.
  3. Training required: Coconut requires multi-stage curriculum training to teach the model to use latent reasoning. You can't apply it to a pre-trained model via prompting.

But the adjacent research IS directly applicable: The Handoff Debt paper (arXiv:2606.02875) shows that structured context handoffs reduce agent takeover costs by 42–63% in tokens. And KV-cache sharing research (PolyKV, QKVShare) demonstrates the infrastructure pattern for when you do control the models.

1. What is "Neuralese"?

The term "Neuralese" was popularized by the 2017 paper "Translating Neuralese" (Andreas et al., arXiv:1704.06960) and refers to the dense vector representations that neural models use internally β€” the continuous, high-dimensional embeddings that carry meaning before it's decoded into discrete tokens.

Diego Dotta's Medium article frames it evocatively: Neuralese is the "most spoken language you'll never speak" β€” the private internal chatter of models, never designed for human consumption. He distinguishes three categories:

CategoryDescriptionExample
1. Human languagesMessy, culture-soaked, built for wet brainsEnglish, Portuguese, Python
2. Machine protocolsRule-bound, discrete, zero ambiguityJSON over HTTPS, HTTP headers
3. Latent representationsContinuous vector soup inside a model, never transmittedHidden states, embeddings

The key insight from Dotta's article: when machines talk to each other today (Alexa β†’ Roomba), they use category 2 (protocols). But as agents become more autonomous and learn on the fly, they could skip human language entirely and trade vectors β€” category 3. That's Neuralese.

2. The Coconut Paper: Reasoning in Latent Space (arXiv:2412.06769)

Training Large Language Models to Reason in a Continuous Latent Space

Authors: Shibo Hao et al. (Meta/UCSD)  |  Published: Dec 2024, revised Nov 2025  |  v3

Core Idea

Standard LLMs reason in "language space" β€” they generate a chain-of-thought (CoT) as word tokens. But most tokens in a CoT exist for grammatical fluency, not reasoning. The paper introduces Coconut (Chain of Continuous Thought): instead of decoding the last hidden state into a word token, feed it directly back as the next input embedding. The model reasons in continuous latent space, never passing through the language bottleneck.

CoT vs Coconut β€” Simplified

Standard CoT:
  Question β†’ [token] β†’ [token] β†’ [token] β†’ Answer
              ↑ decode    ↑ decode    ↑ decode
              to word     to word     to word

Coconut:
  Question β†’ [hidden state] β†’ [hidden state] β†’ [hidden state] β†’ Answer
              ↑ NO decode      ↑ NO decode      ↑ NO decode
              (feed raw vector back as next input embedding)

Key Findings

How It Works

The model switches between language mode (standard autoregressive token generation) and latent mode (feeding hidden states directly as next embeddings). Special tokens <bot> and <eot> mark the boundaries. Training uses a multi-stage curriculum: start with full CoT, then progressively replace reasoning steps with continuous thoughts (kΓ—c latent thoughts replace each language step).

Critical Limitations

Theoretical Follow-up

The paper cites Zhu et al. (2025a, 2025b), who developed a theoretical framework showing continuous CoT is more efficient than discrete CoT on certain tasks by encoding multiple reasoning paths in superposition states β€” and analyzed the training dynamics that explain how this superposition emerges.

3. Translating Neuralese: The Cross-Agent Communication Foundation (arXiv:1704.06960)

Translating Neuralese

Authors: Jacob Andreas et al. (UC Berkeley)  |  Published: Apr 2017, revised Dec 2018  |  v5

Core Idea

This is the foundational paper for the term "Neuralese." It addresses a specific problem: when multi-agent RL systems learn to communicate through differentiable channels, the messages are opaque vectors. How do you interpret them?

The key insight: agent messages and natural language strings mean the same thing if they induce the same belief about the world in a listener. Instead of needing parallel data (which doesn't exist), they train a translation model that preserves the functional effect of messages β€” semantics and pragmatics β€” ensuring players communicating through a translation layer don't suffer substantial reward loss.

Relevance to Agent Handovers

This paper is the closest academic precedent to the question you're asking. It establishes that:

But: This was done in a narrow RL setting (referential games) with small custom-trained agents. Scaling to frontier LLMs from different families is an open problem.

4. The Directly Relevant Research: Agent Handoffs

4a. Handoff Debt (arXiv:2606.02875) β€” June 2026

Handoff Debt: The Rediscovery Cost When Coding Agents Take Over Interrupted Tasks

Authors: Dipesh KC, Anjila Budathoki  |  Published: June 2026

This paper studies exactly your use case: what happens when one coding agent takes over an interrupted task from another. It introduces the concept of "handoff debt" β€” the rediscovery cost imposed when a predecessor's work is opaque or incomplete.

Methodology

The protocol interrupts a coding agent at deterministic handoff points, freezes the repository, and evaluates successor agents under four handoff views:

Handoff ViewWhat the successor sees
Repository state onlyJust the code β€” no context about what was done or why
Raw traceThe full predecessor agent trace (all tool calls, outputs)
Summary notesA natural-language summary of what was done
Structured notesStructured notes with specific fields (goal, progress, blockers, next steps)

Key Results

Implication for Hermes⇄Codex⇄Fable: The biggest win isn't from Neuralese β€” it's from structured natural-language handoff notes. The paper shows that well-structured text summaries capture most of the benefit at a fraction of the cost.

4b. QKVShare: Quantized KV-Cache Handoff (arXiv:2605.03884) β€” May 2026

QKVShare: Quantized KV-Cache Handoff for Multi-Agent On-Device LLMs

Authors: Pratik Honavar, Tejpratap GVSL  |  Published: May 2026

This is the closest thing to "Neuralese for agent handoffs" in practice. QKVShare studies how to hand off latent context (KV caches) between agents efficiently.

What it does

Results (Llama-3.1-8B-Instruct, 150 GSM8K problems)

Critical limitation for your use case: QKVShare works between agents running the same model (Llama-3.1-8B β†’ Llama-3.1-8B). The KV cache is model-specific β€” you cannot inject a GLM KV cache into a GPT model. This is the fundamental barrier to Neuralese-based handoffs between different model families.

4c. PolyKV: Shared Compressed KV Cache Pool (arXiv:2604.24971) β€” April 2026

PolyKV: A Shared Asymmetrically-Compressed KV Cache Pool for Multi-Agent LLM Inference

Authors: Ishan Patel, Ishan Joshi  |  Published: April 2026

PolyKV takes the KV-sharing concept further: multiple concurrent agents share a single compressed KV cache pool. Keys quantized at int8, Values at 3-bit via Walsh-Hadamard Transform + Lloyd-Max quantization.

Results (Llama-3-8B, 15 concurrent agents, 4K context)

Same limitation: same-model only. But it demonstrates the infrastructure pattern for when you do control the models.

5. Analysis: Neuralese for Hermes ⇄ Codex ⇄ Fable Handovers

The Fundamental Problem

Your three agents run on different model families:

AgentModel FamilyHidden DimTokenizerAPI Access
HermesGLM-5.2 (via Featherless)GLM-specificGLM BPEToken-level only
CodexGPT-5.6-sol (OpenAI)GPT-specificGPT BPEToken-level only
FableClaude Fable 5 (Anthropic)Claude-specificClaude BPEToken-level only

Neuralese requires a shared latent space. These three models have:

A hidden state vector from GLM-5.2 is meaningless if injected into GPT-5.6. It's like trying to play a Blu-ray disc in a DVD player β€” the physical format is incompatible.

What Would Be Required

To make Neuralese work across model families, you'd need:

  1. Hidden state access: API endpoints that expose raw hidden states (none of the three providers offer this)
  2. Cross-model alignment: A learned projection layer mapping one model's latent space to another's (like the "Translating Neuralese" approach, but at scale across frontier models)
  3. Shared tokenizer or token alignment: KV cache positions are token-indexed; different tokenizers mean different position alignments
  4. Custom training: The Coconut approach requires multi-stage curriculum training per model

This is a multi-million-dollar research program, not an engineering task.

What IS Practical Today

The 80/20 Solution: Structured Handoff Notes

The Handoff Debt paper (2606.02875) directly answers your question with data. The biggest efficiency gains come not from latent-space transfer, but from well-structured natural-language handoff documents:

The paper tested four handoff views and found that structured notes (with fields like goal, progress, blockers, next steps) and summary notes both dramatically outperform raw traces and repo-only handoffs. The raw trace β€” which is the closest analog to "passing everything" β€” is actually less efficient than a good summary because the successor has to parse through noise.

6. The Efficiency Spectrum: From Text to Vectors

Here's where each approach falls on the efficiency/feasibility trade-off for your specific use case:

Approach Efficiency Gain Cross-Model? Feasible Today? Investment
Repo-only handoff
(successor reads code, no context)
Baseline (worst) Yes Yes None
Raw trace handoff
(full predecessor log)
Marginal Yes Yes Low
Summary notes
(NL summary of work done)
42–63% token reduction Yes Yes Low
Structured notes
(goal/progress/blockers/next)
42–63% token reduction Yes Yes Low
Prompt compression
(LLMLingua, PCToolkit)
2–20Γ— compression Yes Yes Medium
KV-cache sharing
(QKVShare, PolyKV)
2.6Γ— TTFT, 97% memory Same model only If self-hosted High
Coconut (latent reasoning) Fewer tokens, BFS Single model Requires training Very High
Cross-model Neuralese
(latent vector handoff)
Theoretical max Requires alignment layer No Research program

7. Recommendations for Your Stack

Immediate (Zero Cost, High Impact)

Adopt structured handoff notes as the standard format for Hermes⇄Codex⇄Fable transitions.

Based on the Handoff Debt paper's findings, create a standard handoff document with these fields:

## Handoff Document
- Task: [original goal]
- Status: [completed | in-progress | blocked]
- Progress: [what was accomplished, with file/line refs]
- Blockers: [what failed and why]
- Next Steps: [ordered list of immediate actions]
- Key Decisions: [architectural/design choices made]
- Files Modified: [list with brief change descriptions]
- Tests: [what passes, what fails, what's missing]
- Context: [non-obvious things the successor needs to know]

This alone should give you 40–60% token reduction on agent takeovers, based on the paper's data.

Medium-Term (Low Cost, Medium Impact)

Add prompt compression for the raw trace. Tools like LLMLingua-2 (arXiv:2403.12968) can compress prompts 2–20Γ— while preserving semantic content. When you do need to pass a full predecessor trace, compress it first. This is model-agnostic and works through APIs.

Long-Term (If You Self-Host Models)

If you ever move to self-hosted models (e.g., Qwen3.5-9B on the RTX 4090, which you're already evaluating for Nagato), then KV-cache sharing becomes viable. QKVShare and PolyKV show that you can transfer compressed KV caches between agents running the same model with minimal quality loss. This would eliminate re-prefill costs entirely for same-model handoffs.

But this only works when both agents run the same model β€” not across GLM/GPT/Claude.

Research Watch

Cross-model latent alignment is an active research area. The "Translating Neuralese" approach (belief-preserving translation) is the theoretical foundation, but nobody has demonstrated it at frontier-model scale. If a paper emerges showing cross-family KV-cache transfer with acceptable quality loss, that would change the calculus. Until then, structured text remains the best cross-model handoff format.

8. Dotta's Experiment: A Clue Worth Noting

One finding from Dotta's Medium article deserves special attention for your use case. He ran a simple experiment: asking non-reasoning models the "Sally has 3 brothers" question under different constraints:

TestApproachTokensLatencyCorrect?
1. DirectJust ask80.87sNo
2. JSON schemaForce step-by-step in JSON1642.56sYes
3. 4-letter wordsConstrain vocab to ≀4 letters641.63sYes

Test 3 used 60% fewer tokens than test 2 and was faster, while still getting the right answer. The "language" the model reasoned in was a stripped-down, minimalist English β€” "bros" and "sis" instead of "brothers" and "sisters." No fluff.

This is a practical bridge between full Neuralese and full natural language: a compressed, efficiency-optimized reasoning dialect. It's not vectors, but it captures the spirit β€” less language overhead, more reasoning signal per token. This could be directly applied to handoff notes: a compressed format that prioritizes information density over readability.

9. Conclusion

Final Verdict

Is Neuralese useful for Hermes⇄Codex⇄Fable handovers?

Not directly, not today. The models are from different families with incompatible latent spaces, and none expose hidden states through their APIs. Cross-model Neuralese transfer is an unsolved research problem.

Is it efficient?

Theoretically yes, practically no. Coconut proves latent reasoning is more token-efficient than CoT. But the efficiency gains are locked behind custom training and same-model constraints.

What should you do instead?

Structured handoff notes. The Handoff Debt paper provides hard evidence that well-structured natural-language handoff documents reduce successor agent costs by 42–63% in tokens and 20–59% in events. This works across any model family, requires zero infrastructure, and captures most of the practical benefit today.

When to revisit: If you move to self-hosted same-model agents (Qwen on the 4090), KV-cache sharing becomes viable. If cross-model latent alignment research breaks through at frontier scale, Neuralese handoffs become possible. Until then, the best "Neuralese" is a really good handoff document.

References

  1. Hao, S. et al. (2024). "Training Large Language Models to Reason in a Continuous Latent Space." arXiv:2412.06769. https://arxiv.org/abs/2412.06769 β€” The Coconut paper. Proves latent-space reasoning outperforms CoT on planning tasks with fewer tokens.
  2. Andreas, J. et al. (2017). "Translating Neuralese." arXiv:1704.06960. https://arxiv.org/abs/1704.06960 β€” Foundational paper. Translation between agent-internal vector messages and human language via belief preservation.
  3. Dotta, D. (2025). "Neuralese: The Most Spoken Language You'll Never Speak." Medium. Link β€” Popular analysis. Includes token-efficiency experiment showing compressed reasoning dialects work.
  4. KC, D. & Budathoki, A. (2026). "Handoff Debt: The Rediscovery Cost When Coding Agents Take Over Interrupted Tasks." arXiv:2606.02875. https://arxiv.org/abs/2606.02875 β€” Directly relevant. Shows structured handoff notes reduce successor costs 42–63%.
  5. Honavar, P. & GVSL, T. (2026). "QKVShare: Quantized KV-Cache Handoff for Multi-Agent On-Device LLMs." arXiv:2605.03884. https://arxiv.org/abs/2605.03884 β€” KV-cache transfer between same-model agents. 2.6Γ— TTFT improvement.
  6. Patel, I. & Joshi, I. (2026). "PolyKV: A Shared Asymmetrically-Compressed KV Cache Pool for Multi-Agent LLM Inference." arXiv:2604.24971. https://arxiv.org/abs/2604.24971 β€” Shared compressed KV pool. 97.7% memory reduction across 15 agents.
  7. Zhu et al. (2025a, 2025b). Theoretical framework for Coconut's superposition states. Cited within arXiv:2412.06769v3.
  8. Pham et al. (2023). Continuous space for multi-agent communication. Cited within arXiv:2412.06769v3.