✶ crawlers waking ✶
Every Key Is A Crawler
That Remembers Every Road
one key for every model, and every key is a crawler. it walks each request to the path that held best for asks like it, on every platform, for everyone who came before. the whole memory is one field of 1024 phases. it never grows.
superposition · entanglement · interference · collapse — on plain cpus
home › the web
walkers at work 02
| crawler | from | ask | path | verdict | ||
|---|---|---|---|---|---|---|
| no walkers yet. | ||||||
how it walks 03
01 sense
Read the askWhat kind of ask it is (code, writing, research, maths…), how hard, what shape (tools, images, a long context), and which tool sent it: Claude Code, Cursor, an SDK, curl. Only tags leave this step, never the words.
taskgradeplatformshape
02 recall
Measure the fieldEach tag is a vector of 1024 phases; pairs like task × platform are bound into one (entangled). The crawler unbinds the field with them and reads every path's amplitude: how well it held, for everyone, on asks like this one.
world fieldyour field ×2
03 collapse
Pick one pathStrong amplitudes win most walks; weak ones are still tried now and then so the field keeps learning. A conversation that held stays on its path. A path that fails before the first byte is skipped.
heldreroutedzerofailed
04 imprint
Write it backThe outcome is bound back in. Cheap and fast rings loud. Slow or dear rings softer. A failure, or a quick re-ask, goes in with a minus sign and cancels what was there: interference. The field stays 16 KB.
+ constructive− destructive
the field 04
measure it pick a kind of ask
amplitude: −1 always failed, +1 always held cheap and fast. p: chance the next walk collapses there.
what the words mean here honestly
| word | in this router |
|---|---|
| superposition | every walk ever made is summed into one vector. one field holds them all at once. |
| entanglement | task and platform are bound into one atom, so "code from cursor" is its own thing, and decodes either side. |
| interference | a failure is imprinted with a minus sign and cancels the walks it resembles. |
| collapse | choosing one path for one request, weighted by amplitude. |
| decoherence | old walks fade a little with every new one, so the field follows providers as they change. |
| not | qubits. this is classical maths (circular convolution, ffts) on ordinary cpus. |
send a walker 05
Type an ask. A crawler carries it through all four steps right now, on the page's own key (Path Zero, the free house path), and the field remembers the walk. Your words are answered and then forgotten; only the tags stay.
Ask the weaver. The weaver keeps the log. It only repeats what the field and the log hold, and cannot move a crawler.
dreams 06
Every 30 minutes the field sleeps: the faintest tenth of its frequencies let go, and it re-reads what it believes for every kind of ask. Next sleep in —.
crawlers 07
Every key is a crawler. The hall ranks them by what they have done; pick a kind of ask to find the crawlers that walk it best. Open crawlers can be walked with: their memory, your paths.
recent duels vote on the better answer
connect 08
Speaks both formats. Make a key below, add your own provider paths, then point any tool at it.
The words of your asks. The answers. Your provider keys in plain text (they are encrypted at rest and only used to call that provider). The public page sees tags, paths, timings and verdicts, nothing more.
x-platform: my-tool name the tool yourself (otherwise read from user-agent) x-router-pin: <model> skip the collapse, use this path first x-router-path (response) the path that answered x-router-receipt (response) the walk's receipt page
The free house path. It answers short factual asks and declines the rest rather than guessing. Every key starts with 50 Path Zero credits; a walk that lands there costs one, and a decline costs nothing.
your crawler 09
One key, and with it a crawler of your own: named, drawn from your key, with a memory that learns from every walk. Paste the key into any tool that speaks Anthropic or OpenAI. It stays in this browser only.
how it walks its settings
its eye live, only you see this
your paths the field picks among these
your walks teach the field: good or bad
| when | ask | path | Φ | ms | teach |
|---|
family + portability fork, export, import
team fields a memory several crawlers share
duel two crawlers, one ask, on your paths (2 credit)
ENGRAM · every key is a crawler that remembers every road · the field holds tags, never words