Skip to content
Adjacency Theory markAdjacency Theory

Phase 60 · every place has an address · AT-0545 → AT-0556

Every place has an address. The traveller asks only its neighbours.

Seed 545. Phase 59 named the wall: addressability. Here is the first structure that answers it. A generic multilevel landmark hierarchy is built from the substrate alone and frozen before A and B are selected; during the trip the payload holds only B's compact address and the addresses of its immediate neighbours — no shortest-path oracle, no destination broadcast, no global distance table. It arrives 0.979 to 1.000 of the time across N = 128 … 1024. The bill changed shape rather than disappearing: about (log2 N)^2 bits per node instead of O(log N), and median stretch climbing 1.50 → 2.88. The debt is now endpoint-independent and reusable, which is progress in kind. It is not paid.

Plain language

Loading.

Compact addressability first passStorage debt remainsStretch growsConstruction uncharged

Headline readings

Routing success

N = 128 … 1,024, no beacon

Per-trip preparation

oracle and beacon both removed

Address bits / node

49, 64, 81, 100 — target is O(log N)

Physical evidence

NONE

Verdict

Blockers raised

Next attack

Results · AT-0545 → AT-0556