Debugger
Qwen3.5-4B writes a <tool_call>. Thirteen extra layers in its weights, a
64-bit x86 computer that a compiler wrote and nobody trained, run the tool and write the answer back
into the chat. Pick a run and press play.
New in v2 and v3
The same model, with memory slots next to four of its layers. Everything below was recorded on the released model; Qwen's own answers stay exactly the same whether the memory is full or empty. The memory is run by Python code beside the model (v2); in v3, Qwen uses it through tools it calls itself.
Each square is one memory slot (2,048 per layer). Layer 13 holds the directory (file names), layer 14 the first pieces of text; layers 15-16 fill up only with long files, so they stay dark in this short session.
Press play.
Each word below came out of the model's own output layer, read from memory. Brighter means a larger lead over the next-best token (hover a word to see it). A 50,000-token document came back the same way with 0 errors.
Each JPEG was saved into memory, the memory was written to disk, and a fresh copy read every file back. The fingerprints (SHA-256) of what went in and what came out match.
Qwen decides when to call the memory tools and writes the calls itself; Python carries them out. Session 2 is a separate process that only gets the saved memory, not the first conversation.
Qwen has all eleven tools at once. Calls to the six original tools are run by the computer inside the model, every machine token checked against a reference machine; calls to the memory tools are run by Python. Session 2 is a separate process that only has the saved memory and notes.
The answer comes from lookup tables compiled into numbers, printed by the model's own output layer. Next to it: plain Qwen3.5-4B answering the same question by itself. Out of 1,000 such problems the tables got 1,000 right and plain Qwen got 979 wrong.
| Problem | From the tables | Plain Qwen |
|---|
<tool_call> … </tool_call>.
The computer's layers capture its bytes as Qwen writes them.Recorded on one 16 GB GPU with the compact Qwenx86 checkpoint, using greedy decoding. The registers, code and RAM are the reference machine replaying each run.
The x86 side comes from my Zen2 research. The CPU circuit is forked from Qwenputer by Divyansh Agrawal (MIT), whose compiler, tool-call bridge and chat loop Qwenx86 builds on. Base model: Qwen/Qwen3.5-4B.