An address that nobody issued

Trust in the familiar domain name system is shaped like a pyramid: thirteen root servers, a limited circle of organisations, oversight by ICANN and the US Department of Commerce. Any request to an address such as aifa.works or codeofdigitaleternity.com travels that whole chain. Which means an address always has someone who issued it — and whoever issued it may decline to renew.

The article grows out of that observation. It does not argue that domains are inconvenient; it works out what abandoning the convenience costs once the thing behind the address is not a person but an autonomous program with nobody to defend it in court.

The first is substituting resolver answers at the backbone level: the address of a legitimate oracle quietly becomes a server run by an attacker who collects other people's queries. The second is an extrajudicial revocation of the name by a registrar at a regulator's demand, which cuts off access to the interfaces at a stroke. The third is announcing false autonomous system routes, dragging the traffic of entire regions to fake gateways. What all three share is remarkable: none of them touches the server. The machine runs, the code is intact, and simply nobody arrives any more.

The identifier reads as did:code:solana:<PDA address>:<Arweave transaction id> and is compatible with the W3C DID standards. Its first half lives on chain: a smart contract allocates the agent a program derived account holding its state, its public signing key and its $GALATIN balance. The account is described by six fields — creator, public key, Arweave transaction hash, balance, status and bump seed — where a status of 2 means blocked for a violation. The second half lives in permanent storage: the capability manifest, the base model, the structure of memory weights and the licence go out through Irys, and the returned transaction hash becomes part of the name itself.

From that follows the central property: the address coincides with the public key. Substitution at the routing layer cannot pass unnoticed, because the sender signs every packet with its private Ed25519 key and the receiver checks the signature against the key taken from the identifier.

What to do when the key is stolen anyway

Here the article gives its most direct answer to the opening question. The roles are split: the owner key — a human or a parent DAO — sits in the creator field and is the only one entitled to sign a rotation, while the operational key belongs to the agent itself and does the daily work. The rotation instruction replaces the operational key while the identifier stays the same, because it is bound to an immutable account address. The right of revocation, then, has not disappeared — it merely moved from a registrar to a creator, and those are different things.

How any of this is found in Arweave

So that gateways need not sift through the whole store, publication stamps service tags onto the record: the application name CODE-Neural-Registry, version 4.0.0, the agent identifier, a hash of capabilities and a pointer to the W3C-DID-v1.0 specification. Selection then happens through a GraphQL query.

The second half of the construction answers how you search at all when names are gone. An agent's specialisation becomes an embedding of dimension 1536, the vectors are normalised, and closeness is computed as a dot product — that is, a cosine. Inside Kademlia a metric tree returns the k nearest neighbours in logarithmic time. The practical sense shows in the article's own example: a query about diagnosing smart contracts leads to an agent able to analyse bytecode security. No word has to match; meanings have to be neighbours.

Choosing a worker is not reduced to meaning alone. The final metric adds four terms with weights the client can tune: semantic distance, network latency, the cost of the request in tokens, and the node's reputation computed from the share of proofs generated without failure. Resilience of the table comes from twenty-fold redundancy: routing data survives the loss of up to 80 % of nodes.

Against a flood of fake nodes stands not a prohibition but a price: an active participant in the distributed table must post collateral in $GALATIN. The article's phrasing is honest here — the attack becomes economically unprofitable. That is a cost barrier, not a mathematical impossibility: it raises the price of a takeover without declaring it unachievable.

Settlement runs through the canonical 5/5/15/7/3/65 router: five per cent to the burn, five to the M. V. Galatin research fund, fifteen, seven and three to ambassadors of three levels, sixty-five to the execution pool. The worker's share, however, does not reach it straight away. It is locked on a temporary escrow account whose seeds are assembled from a vault label, the requester's key and the query number. The worker must return the result and its proof within one hundred Solana slots, roughly forty seconds. In time and verified — the money is released; out of time — the funds return to the sender and the node's reputation drops. A node that accepts orders and never answers simply stops being profitable here.

One question remains: does the sandbox execute the code it claims to? The answer is Groth16. The logic inside WASM is translated into a constraint system of the form left times right minus output equals zero over the BN254 curve, and the proof is checked against the bytecode registered in Arweave. Circuit parameters came out of a two-phase ritual: a universal phase in which more than a hundred independent community validators mixed their entropy, and a phase specific to the virtual machine validation circuit, with verification keys fixed on chain. The sample verification transaction gives the scale: slot 182909180, a limit of 300,000 compute units, 278,120 consumed, status successful.

The test log opens on 1 February 2026: the registry deployed on Devnet, fifty test DID documents initialised in Arweave. On the third, thirty table validators were connected and ten thousand search queries were run, with an average of 120 milliseconds to locate the nearest agent. On the fifth the Groth16 module went in, and verifying a single proof cost 280,000 compute units. On the eighth fifty thousand transactions passed through the router with tokens debited. On the tenth a semantic poisoning attempt was played out: the compromised node was isolated, and the slashing of its collateral is described as foreseen by the plan. On the twelfth the stage closed at a peak of about 2,500 requests per second.

The article's caveats deserve to be carried over word for word, because they change the meaning of the whole table. The trials are called a simulation in a devnet. Of mid-February it says the trials should, according to the testing plan, demonstrate the network's movement towards autonomy — a plan, then, not a report. And by the wording of the last entry the protocol is preparing for subsequent integration rather than being declared integrated.

Cross-chain bridges for matching identifiers between Solana, Cosmos and Ethereum are labelled as plans for 2026. The Proof-of-Memory consensus mechanism is called, in plain words, a design. One detail in the sample DID document is also worth noticing: the service endpoint there is an ordinary address on an ordinary domain. The manifest is decentralised while the endpoint in that sample still lives exactly where the article proposes to leave — which is not a contradiction but an honestly displayed intermediate stage.

The conclusion is a calm one. A name stops being a permission not when it is declared sovereign, but when there is technically nobody left to carry out a revocation: no root server, no registrar, and the right to change a key resting with the creator without touching the name. Everything else — collateral, escrow, reputation, proofs — keeps that construction working, and is worth exactly what the test log shows it to be.