A X N
HOW IT WORKS · THE OPERATION, THE ANATOMY, THE VERIFICATION
Plate II One object passing through statesi · ii · iii
the file is hashed, sealed on an added margin, and given an address

You give it a file; it gives back an identity. Nothing is uploaded to compute it.

i

Taken up

Fingerprinted in your browser. Nothing altered, nothing transmitted.

ii

Inscribed

Six glyphs struck onto an added margin. Your bytes are never overprinted.

iii

Witnessed

A position in a public, exportable registry — checkable by a stranger who does not trust us.

Plate III The membrane crossed both waysanatomy
what each part of the identifier is, and which part is exact

The grammar is AXN:HEX.FAMILY.⟨six glyphs⟩. The hex marks position in the registry, the family is its semantic classification, and the glyphs are a display hash of the identity kernel — the symbols are memorable; the kernel stays exact.

YOUR FILE THE REGISTRY a hash goes down an address comes back THE MEMBRANE
The membrane is crossed in both directions. A hash goes down and an address comes back — and only the hash is derived from your bytes.
hex position · 05AB
🔃str ✊ges 🌹org ⏫str ∞ter ✖️mat

identity kernel deb473d8ff92c55f… · first six bytes of the SHA-256 of the canonical bytes

the colour beneath each glyph names its byte-family · Direction → Touch → Growth → Direction → Closure → Proof

the derivation, in full every registered position
Plate IV Verification is the halves meetingσύμβολον
two independent computations of one hash, compared in your browser

Both sides must produce the same kernel. Your file is hashed independently and compared with the registry's record. A match proves the bytes are the same.

Your file · Seed B
sha256(candidate bytes)
= deb473d8ff92c55f…
The registry · Seed A
AXN₀ kernel
= deb473d8ff92c55f…
at rest this is a comparison, not a claim — tap to see the halves meet
MATCH — the seam closes; the bytes are the same
What it does not claim →Why this exists →Stamp a file →
∮ = 1