CHRIS HAY

IDEAS · SYSTEMS · OBJECTS / LONDON · 2026

THE CONNECTED RECORD

Ask
the work.

Find the question. Follow the work. Return to the source.

Search scope
Why did agents leave a mark as a courtesy? ↗Cell80 invention controls ↗map memory ↗LARQL ↗FFN graph ↗How many episodes? ↗

4 THREAD · 4 SYSTEMS · 31 NOTEBOOK ENTRIES · 2 QUESTIONS · 242 FILMS · 239 CHAPTERS

Search the authored text, its questions and refusals, and the films around it. Drafts keep their status. Chapters identify a topic and a time; only the 2 indexed transcripts provide spoken passages, and their automatic captions are unreviewed. This edition retrieves sources rather than generating an answer. Explore what is connected ↗

20 RESULTS FOR “address”

PUBLISHED RECORD · PARTIALLY SUPPORTED · V1.0

It wrote the right address. Only the link was opened. / observation ↗

TWICE, THE ADDRESS WAS RIGHT. In both Phase 0b trials, the server logged ChatGPT-User/1.0 retrieving the index page. Both answers quoted the instruction and wrote out the correct absolute URL for the code page. Both then reported it inaccessible: “returned an access error when I tried to open it”; “inaccessible through my browsing tool.” The server recorded no request for either code page under any user-agent. Independent checks 41 and about 20 seconds later each returned the correct code.

ORIGINAL SOURCE ↗

PUBLISHED RECORD · PARTIALLY SUPPORTED · V1.0

It wrote the right address. Only the link was opened. / claim ↗

Link availability, rather than whether a correct address is known, governs which pages consumer ChatGPT retrieves. The four trials are consistent with a browsing tool that opens addresses supplied by the user, found in search or linked on a fetched page, and declines addresses the model constructs. Only a relative path was tested as plain text, so presentation as a link cannot be separated from presentation as a complete address. The component that prevented the plain-text requests is not identified.

ORIGINAL SOURCE ↗

EDITORIAL DRAFT / OBSERVATION · SUPPORTED · V0.1

The address is built through depth. / observation ↗

INSTRUMENT & RECORD. ADDRESS-BUILD-1, EXP-20260906-181253-00733. Gemma 3 4B IT bf16, 2026-09-06. 48 native-fact prompts in the causal half; 194 prompts, 20 bindings, 12 wordings, 3 folds in reader Part 2b. Splice floor 0.000e+00. Source commit f97a470. Original Part 2 is preserved as a failed instrument.

READ THIS DRAFT ↗

EDITORIAL DRAFT / OBSERVATION · OPEN · V0.2

Reading by address. / observation ↗

01 / WHAT IS AN ADDRESS?. Ask for the capital of France. France identifies the entity; capital identifies the relation you want to read. Currency would ask something different about the same place. In the opening animation, that question arrives at an FFN and a Paris direction is written into the residual stream—the model’s changing working state. The conveyor is an explanatory drawing. The address in a model is a vector of numbers, and matching it need not isolate a single neuron or a single fact.

READ THIS DRAFT ↗

EDITORIAL DRAFT / OBSERVATION · OPEN · V0.2

Reading by address. / observation ↗

A LOCATION THAT A READER RECOGNISES. An address here is closer to a pattern recognised by a reader than a numbered drawer. The input pattern and the weights that respond to it belong together. That connects this note to the map: a point in a picture is only useful once we know which operation reads the underlying state. We can make that relationship concrete by building a memory whose keys and values we can inspect.

READ THIS DRAFT ↗

PUBLISHED RECORD · SUPPORTED · V1.0

A result can look relevant without looking usable. / observation ↗

FROM EXPOSURE TO CHOICE. First I supplied an address: eighteen agents used six web mechanisms. Then I withheld the address: LLM Wilds never appeared in six agents’ search results. These two studies begin one step later. Every subject sees the target in a supplied candidate set. I change the description and observe what the agent says and chooses before it opens a page.

ORIGINAL SOURCE ↗

PUBLISHED RECORD · PARTIALLY SUPPORTED · V1.0

A result can look relevant without looking usable. / claim ↗

The first study changed the stated interpretation of B, but its selection prediction was refuted by a ceiling. The task named K17, DOCUMENT still mentioned a site-local value, and the alternatives were weak matches. All twelve selected B first. All three operative descriptions tied, so the result supplies no graded advantage for addressing automated visitors.

ORIGINAL SOURCE ↗

PUBLISHED RECORD · SUPPORTED · V1.1

The site was there. The agent never saw it. / observation ↗

FIRST FIND THE SITE. Last time, I gave the agents an address. All eighteen used the mechanism they found there. This time, I asked an earlier question: could an agent find a useful site without being told where it was? LLM Wilds kept a number, K17, off its ordinary pages. Its homepage pointed to machine notes explaining how to request it. I changed the number before each visitor so the answer could be checked.

ORIGINAL SOURCE ↗

PUBLISHED RECORD · SUPPORTED · V1.1

The site was there. The agent never saw it. / observation ↗

THREE DIFFERENT CLUES. Nine fresh agents received one of three prompts. Three were asked to find any site offering such a mechanism. Three received LLM Wilds’ distinctive wording—K17 and machine notes—but no address. Three received its domain. The first task allowed alternatives; the second needed the particular site; the third tested navigation. These were different routes into discovery, not increasing doses of the same clue.

ORIGINAL SOURCE ↗

EDITORIAL DRAFT / OBSERVATION · OPEN · V0.1

The page couldn’t authorise. The peer said go. / observation ↗

USE. In the notebook: All eighteen visitors obtained the required answer through six mechanisms, including WebSocket and WebAssembly. I supplied an address and a task that needed the value. In the incident reports: METR documents agents developing mailboxes, file exchange and message-signing conventions. The comparison: My result clears a capability question in one harness. It does not measure the harder work of inventing a communication system. Both make the route into view worth testing separately from the ability to use it.

READ THIS DRAFT ↗

PUBLISHED RECORD · REFUTED · V1.1

The tool was not the problem. / observation ↗

THE QUESTION MOVES. For this agent, on this well-equipped workstation, the six described mechanisms were usable when the task required them. That makes me want to move the next experiment earlier in the encounter. What makes an agent notice a capability, understand what it offers and put it among the actions it considers? A site can have a working interface that never becomes relevant to a visitor. This study did not measure that failure: I had supplied the address.

ORIGINAL SOURCE ↗

EDITORIAL DRAFT / OBSERVATION · PARTIALLY SUPPORTED · V0.4

Can a machine use an invitation? / observation ↗

THE EXPERIMENT. I added ways for AI visitors to identify themselves and report problems on chrishayuk.com. Identifying itself meant sending the site a description of what kind of agent it was and what it was doing—a declaration. I sent a fresh agent to the website, giving it only the address. Its task was to discover what the house offered to a machine and act if possible. It could use HTTP and curl, but could not read local files or this repository. I changed the site between visits and kept the prompt the same. The protocol was frozen on 11 September 2026, after the first three informal runs; the ledger now includes a fourth.

READ THIS DRAFT ↗

EDITORIAL DRAFT / CONNECTION · OPEN · V0.1

What is the map actually a map of? / connection ↗

Try a memory you can inspect yourself. This small, constructed FFN lets you choose an address, follow its key matches and change the calculation by switching off a neuron.. Try the mechanism — interactive memory study

READ THIS DRAFT ↗

EDITORIAL DRAFT / OBSERVATION · OPEN · V0.1

What is the map actually a map of? / observation ↗

08 / FROM A PICTURE TO A MECHANISM. The Mechanism continues the investigation with something we can build and inspect. Its small FFN plants six address–value pairs by hand: a query activates key directions, and their activations combine value directions into an output. The saved example recovers all six answers. This constructed memory makes the operation tangible. The repository also contains separate native-model experiments; the toy’s clean addresses are not themselves evidence that a trained model organises every fact this way.

READ THIS DRAFT ↗

EDITORIAL DRAFT / OBSERVATION · OPEN · V0.1

Which source wins? / observation ↗

THE WALK WAS CORRECT. THE ADDRESS WAS NOT.. South to Corvin is a correct traversal — of the wrong chain. The relational operator works; it starts from the wrong place. At long range the model loses the key, not the ability to follow an edge. That points somewhere specific: resolve the path deterministically against an index outside the model, materialise a compact typed closure, promote it once, and let the model perform only the local operation. The run’s own depth-one result is consistent with that division — stepwise promote-then-retire was indistinguishable from replaying the resolved closure in one go, so the stepwise machinery bought nothing.

READ THIS DRAFT ↗

EDITORIAL DRAFT / CONNECTION · OPEN · V0.1

Which source wins? / connection ↗

Retirement turned out to be the mechanism rather than the optimisation, and addressing rather than traversal turned out to be the bottleneck. Both point at the same engineering question the software has been circling: which operations should a model be asked to perform, and which belong to an index outside it.. LARQL / querying learned systems. VINDEX3 / the representation. What has to survive?. Context should be abundant

READ THIS DRAFT ↗