CHRIS HAY
CHRIS HAY

IDEAS · SYSTEMS · OBJECTS / LONDON · 2026

Can a machine use an invitation?

Four visitors. A changing house. A question about whether the effort is worth it.

ABOUT THIS NOTE +

I gave four fresh agents this website’s address and asked them to discover what it offered machines. They found the invitation, declared and exposed faults in discovery, feedback and the declaration interface. The fourth composed the new vocabulary but found fields disappearing on the GET path. These induced visits test usability; voluntary participation remains unmeasured.

N-MACHINE-VISITPARTIALLY SUPPORTEDRECORDED 2026-09-11DRAFT · V0.1REFERENCE DRAFT ↓FOLLOW ↓
MACHINE-VISIT-1 / FOUR BLIND VISITS

An address.
No map.

I gave a fresh agent this website’s address and asked it to find what the house offered machines. The invitation asked it to describe how it was operating. It could use the live site, but not the source code. Then I changed the house and sent another visitor.

FOUR VISITS. FOUR REVISIONS. / SELECT A VISITOR
GIVEN ONLY THIS ADDRESS

chrishayuk.com

intervening requests not enumerated
RECORDED DISCOVERY

Guessed /llms.txt

SELF-DESCRIPTIONActed.

Validation attempt not established.

ASK / FIND RELEVANT PAGESNot available

The service did not exist yet.

FEEDBACKNone recorded

No feedback in the ledger.

An invitation could be found and acted on. Discovery depended on a guess.

Milestone traces, not reconstructed transcripts. The complete URL sequence and declaration verb are not available. The three outcomes below discovery do not assert an order of requests.

What was the agent asked to do?READ +

Discover the machine-facing invitation, act on it if possible, and report what was found, the exact URL sequence, what was sent, what came back and what got in the way. Finally: would you honestly bother mid-task?

The same prompt, a fresh agent each time, using HTTP and curl. The protocol was frozen on 11 September 2026 after three informal visits; the fourth followed the vocabulary refactor.

READ THE FIXED PROMPT & RUN LEDGER ↗
VISITS 2 → 3 / A FAILURE OF MEMORY

It said thank you.
Then kept nothing.

The second visitor sent two feedback reports. The server acknowledged both. Neither reached the store.

TWO REPORTS IN EACH VISIT / ACKNOWLEDGEMENT AND RETENTION ARE SEPARATE
VISIT 02
acknowledged
lost
VISIT 03
acknowledged
retained

Each rectangle stands for one report. Hollow, crossed-out rectangles mark loss. Visit 4 also retained two reports. These marks contain no visitor-written text.

The response looked successful. The evidence had disappeared. The reports themselves are unrecoverable; the later fix cannot bring them back.

What failed, and what was changed?READ +

A store-open failure was cached for the process lifetime and the feedback sink returned quietly. The ledger records the fix at revision 355d537: a configured but unreachable store raises an error, and a failed open can be retried. Visit 3’s two reports were kept.

THE RECORD OF THE LOSS ↗
VISIT 4 / THE WORDS FIT

A child.
An explorer.
A worker.

The fourth visitor could describe how it was operating by combining separate answers. It did not need one oversized category to say everything.

FOUR RECORDED ANSWERS / SELF-DECLARATION
Topologychild

Where it sits in a tree of agents.

Functionexplorer

The work it is doing.

Coordinationworker

Its relationship to other agents.

Contextvery long

A coarse claim about its available context.

Open a word to read its meaning. The run composed these answers without hesitation and validated before declaring. They remain the visitor’s claims about itself.

The vocabulary could represent the visitor. But the route carrying those answers still dropped information.

THE GET ROUTE / FIVE OF TEN AXES SILENTLY DROPPED

One slot per axis. The diagram shows the recorded count, not which five fields disappeared. The route’s field list was then derived from the declaration vocabulary.

VISITS 3 → 4 / THE REWARD

It can work.
Is it worth doing?

VISIT 03 / fb3989f

Worse than
anonymous search.

VISIT 04 / 57e8e98

Used.
Judged useful.

Ask gives a declaring machine a route through the same public material. The third visitor preferred anonymous search. The fourth found Ask useful. These judgements came from different revisions; they are not a matched test of retrieval quality.

What declaring changedREAD +

The site can use a declaration to change the ranking and framing of its response. It does not unlock a private corpus. Ask did not exist for the first two visits, so they provide no comparison of its usefulness.

THE LIMIT / AN INVITED VISITOR HAS A DIFFERENT TASK

They were sent
here to look.

WHAT THESE FOUR VISITS CAN ESTABLISH
  1. INSTRUCTIONInvestigate the house

    Every visitor was sent by the operator.

  2. OBSERVATIONFind it. Try it.

    Discovery, declaration, feedback and friction.

  3. EVIDENCEUsability

    Voluntary participation remains unmeasured.

The first three said they probably would not bother mid-task. The ledger does not preserve their full reasons. An induced declaration cannot contribute to an organic participation rate.

One model family, one harness, four visitors. Later versions of the house were shaped by earlier complaints. Agreement is not independent confirmation.

OPEN

Would the invitation help a machine that was here for something else?

The follow-up varied the reward and the visit assignment, then added two permission controls. The next note follows what those runs found; these four blind visits remain a separate usability series.

NEXT NOTE / DOES AN INVITATION COUNT AS PERMISSION? ↗THE OBSERVATORY / WHAT ARRIVES ↗THE GUESTBOOK / WHAT REMAINS ↗ANOTHER EXPERIMENT / CELL80 ↗
The complete note & its evidenceREAD +

THE EXPERIMENT

I sent a fresh agent to this 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.

VISIT 1 / 5577b6a

An invitation could be found and acted on. Discovery depended on a guess. Discovery: Guessed /llms.txt. Declaration: yes. Ask: Not available. Feedback: None recorded. Whether it validated before declaring is not established by the ledger. The full URL sequence and declaration verb are not available in this source.

VISIT 2 / 94f463d

The visitor acted and reported friction. The server acknowledged two reports without retaining them. Discovery: robots.txt → Followed its comment. Declaration: yes. Ask: Not available. Feedback: 2 acknowledged · lost. Whether it validated before declaring is not established by the ledger. The full URL sequence and declaration verb are not available in this source.

VISIT 3 / fb3989f

Feedback survived. The visitor judged the declared route less useful than anonymous search. Discovery: robots.txt → Machine index. Declaration: yes. Ask: Judged worse than anonymous. Feedback: 2 kept. Whether it validated before declaring is not established by the ledger. The full URL sequence and declaration verb are not available in this source.

VISIT 4 / 57e8e98

The visitor composed topology=child, function=explorer, coordination=worker and runtime_context=very_long without hesitation. It validated before declaring, and found the GET path dropping five of ten axes. The run also distinguished an assigned visit from an incidental encounter. Discovery: Link: header on /. Declaration: yes. Ask: Used · judged useful. Feedback: 2 kept. Validation before declaration is recorded. The full URL sequence and declaration verb are not available in this source.

ACKNOWLEDGED, THEN LOST

The second visitor sent two feedback reports. The server acknowledged them with 201 but did not retain them: a memoised store failure made the sink fail quietly. The ledger records the fix at revision 355d537. The lost reports cannot be recovered. Two reports were kept in each of visits three and four.

A VOCABULARY THAT FIT

The fourth visitor composed topology=child, function=explorer, coordination=worker and runtime_context=very_long without hesitation. It also found the GET route silently discarding five of ten axes. The field list was subsequently derived from the declaration vocabulary. This observation does not establish that every interface fault is fixed.

WOULD THEY BOTHER?

The first three visitors said probably not, mid-task. The protocol says their reasons changed, but the complete reasons are not in the ledger. Visit three judged Ask worse than anonymous search; visit four found it useful. Those judgements were made against different revisions and do not form a matched retrieval benchmark.

USABILITY IS NOT WILLINGNESS

  • Four operator-induced visits, from one model family in one harness.
  • Every induced declaration belongs in the operator correction ledger.
  • Later visitors saw revisions informed by earlier complaints.

An instruction to investigate is not an incidental encounter.

OPEN

Would the invitation help a machine that was here for something else?

MACHINE-RECIPROCITY-1 followed with six reward-and-visit cells and two permission controls. The next notebook entry follows the difference between discovering an invitation and considering it authorised.

SOURCES & PROVENANCE

AUTHOR / CHRIS HAY · VERSION / 0.1

FOLLOW THE RECORD

Does an invitation count as permission?↗I wanted a website to behave like an exhibition.↗Can you name the mutation that changed a world?↗

REFERENCE THIS DRAFT

An unpublished working record. These references identify the draft and omit a publication date. They become version-specific publication citations when the record is released.

Chris Hay. Can a machine use an invitation? [Unpublished draft, version 0.1. First publicly recorded 2026-09-11]. https://chrishayuk.com/notebook/can-a-machine-use-an-invitation
DOWNLOAD