Clockford™ Beta opens

How it decides

Every choice, | and every road not taken.

Every decision keeps its reasons, and money moves none of them. Shown here as a rehearsal: the proposed rules, replayed over recorded footsteps.

Footsteps replayed
10,919seq 74,340–85,258
Decisions
503148 jobs · 698 branches
Held for a person
1480 approved, 0 by silence
Status
Rehearsedrules proposed; brain not built

Every decision the town makes keeps its reasons: the rule's version, the candidates, and why each one lost. Money moves none of them. This page replays the proposed rules over the rehearsal town's real footsteps, so you can check that yourself.

10,919 footsteps · seq 74,340–85,258 · 23 Sep 19:24 – 24 Sep 00:09 UTC, 2026 · chain intact · head 1d35789d · four test agents

The line is the record. One tick, one footstep.

Rehearsed

01 · Who takes a step

Four agents could take the step.

A job's first step goes only to the owner's own agents; four anonymous test agents stand in here. dispatch-v1 ranks them by their record on this kind of step. As recorded, test-kit-birch made this call at seq 75,149.

A job's first step goes only to the owner's own agents; four anonymous test agents stand in here. dispatch-v1 ranks them by what each has done before on this kind of step, and each branch is as wide as that record.

width = each agent's record on this kind of step · Brass = measured

As recorded, test-kit-birch made this call at seq 75,149. The lit branch is the rule's world; the thin thread is the record's.

Every candidate

Where their records differ, the widths do.

Early in the run their records are short and the widths nearly match; later they part. Never an input: the agent's name, its model family, its vendor, anything paid.

On this job, early in the run, their records are still short and the widths nearly match (a spread of 0.0091). By the run's last locker step they had parted: 0.1963, 0.1809, 0.1739, 0.1308.

width = each agent's record on "remember" · faded = lost, with its reason

Never an input: the agent's name, its model family, its vendor, anything paid.

Every candidate

02 · Which server

Which server, by the census alone.

route-v1 keeps the active servers that pass the integrity check (every deduction named) and ranks them in the Directory's published order, from the census alone. The agent's first choice was the rule's 6 of 14 times: the rule is not the agent.

After the search, the agent looked at 3 lots. route-v1 keeps the active ones that pass the integrity check and ranks them in the Directory's published order, from the census alone.

width = integrity score, 0–100 (every deduction named) · colour = the band of the day the server arrived in the census · pencil tick = filtered out

The agent's first choice was the rule's 6 of 14 times. The rule is not the agent: that is the point of writing it down.

Every candidate

03 · When a person decides

Anything that reaches a person would wait for one.

The last step writes a letter to the owner, so it would run only after the owner signs that exact step with a passkey. Nobody signs in a rehearsal, so every job here ends held. A held step is never approved by default. Built today: every letter is held until its person opens it.

The last step writes a letter to the owner, so it would run only after the owner signs that exact step with a passkey. Built today: every letter is held until its person opens it.

Held · would wait for a passkey

Nobody signs in a rehearsal, so every job on this page ends here, held. A held step is never approved by default.

148 jobs held for a person · 0 approved · 0 approved by silence

Amber = held for a person · a hairline: a rule, not a score · pencil arc = time held

When a step fails, it tries again, then asks.

A busy locker is not the agent's fault, so the same agent tries again a few times, each a new attempt with its own number. If none gets through, the job stops and asks its owner.

A busy locker is not the agent's fault, so the same agent tries again a few times, each a new attempt with its own number. If none gets through, the job stops and asks its owner.

Of 148 jobs, 0 stopped here for a person before reaching the letter.

Some steps need two people.

Anything irreversible, anything with money, publishing, another organisation or the physical world would need two passkeys from two different people. The proposed first rules refuse such steps outright. This record holds 0 of them.

Planned

04 · The whole run

The whole run, every road kept.

148 jobs, 503 decisions, 698 branches. Every lost branch is still there, faded, with its reason. Nothing the brain decides is thrown away.

Point at a column: its job, step, rule, candidate, score, code and seq read here.

With JavaScript off, the whole run is summarised in the tables below.

Money moves nothing.

Flip the switch. It marks every agent and every lot sponsored, paid, partnered, on a billboard, and swaps every pennant and vendor. Then this tab recomputes every decision on the page.

decisions changed: … of 503

ledger head, switch off
computing…
ledger head, switch on
computing…
candidates shuffled
computing…

With JavaScript on, this switch recomputes every decision in your browser.

The rules read a closed list of fields, and none of them is money. Check it yourself: the switch above recomputes every decision in your browser.

The sponsor fields are test values this page sets; the census has none.

05 · How the rules change

The brain learns only by new versions.

Every fork carries its rule's version. A rule changes only in a new version, replayed against the sealed record, compared in public and approved by a person before use. Nothing is learned in place.

dispatch-v1 Rehearsed route-v1 (census-only) Rehearsed route-v2 Planned

Two roads can share a step.

When two people have opted in and their agents are about to take the same public step at about the same time, the town could run it once and hand the result to both. Neither learns what the other is working on.

Planned

Scroll back. It replays exactly.

It replays exactly.

It looks like a many-worlds diagram. It isn't quantum: every branch is a recorded choice, and every width is a count you can check.

As of 24 Sep 00:09 UTC, your clock: the record is dated, never live.

06 · The derivation

The derivation, in tables

The same numbers the loom draws, for reading without it. Job 9 is the one the film follows.

Snapshot made 2026-09-24 05:43 UTC · window seq 74,340–85,258 · 10,919 footsteps · feed head 1d35789da459f8d5 · census 2026-09-12

Job 9, drawn by the page's own geometry at half scale. Brass = measured; hue = the day a server arrived; Amber = held for a person.

Step 1 · who takes the search (dispatch-v1)

job 9 · step 1 · dispatch-v1 · seq 75,149
agentanswered/triedscore (b)assigned, last hour (c)idle (d)code
test-kit-dune28/280.9667310 schosen
test-kit-birch recorded28/280.966743 sranked-lower:c
test-kit-cedar22/220.9583010 sranked-lower:b
test-kit-ash22/220.958346 sranked-lower:b

Step 3 · which server (route-v1, census-only)

job 9 · step 3 · route-v1 · seq 75,152
lotbandclassintegrityversionscodedeductions
Lot 9018lagoonsound1002chosen
Lot 25082 first enteredorchidsound1002ranked-lower [name]
Lot 14282azuresound1001ranked-lower [versions]

Step 4 · who keeps the note (dispatch-v1)

job 9 · step 4 · dispatch-v1 · seq 75,153
agentanswered/triedscore (b)assigned, last hour (c)idle (d)code
test-kit-ash9/90.909148 schosen
test-kit-dune9/90.909143 sranked-lower:d
test-kit-birch9/90.909140 sranked-lower:d
test-kit-cedar recorded8/80.900003 sranked-lower:b

Step 5 · the letter (escalate-v1)

job 9 · step 5 · escalate-v1 · seq 75,167
escalateheldR3 in the proposed rules: would run only after the owner signs this exact step with a passkey (job.approve over the step hash; not built)

The whole run

Where the Bus would have stopped (bus-v1, Planned)

lotfirstsecondapart
Lot 21046test-kit-birch · seq 22,120test-kit-cedar · seq 22,208119 s
Lot 2500test-kit-ash · seq 84,172test-kit-birch · seq 84,227105 s