ⰄⰅⰕⰅⰓⰏⰋⰐⰋⰔⰏ ⰒⰓⰑⰑⰗⰔ

ⰄⰅⰕⰅⰓⰏⰋⰐⰋⰔⰏ ⰒⰓⰑⰑⰗⰔ — ⰔⰘⰑⰂⰐ ⰋⰐ ⰗⰖⰎⰎ ⰄⰅⰕⰀⰋⰎ, ⰂⰋⰕⰘ ⰋⰕⰔ ⰒⰓⰑⰑⰗ: Ⰰ ⰄⰅⰕⰅⰓⰏⰋⰐⰋⰔⰕⰋⰜ ⰜⰑⰐⰕⰅⰐⰕ-ⰀⰄⰄⰓⰅⰔⰔ ⰓⰅⰜⰑⰏⰒⰖⰕⰀⰁⰎⰅ ⰗⰓⰑⰏ ⰕⰘⰅ ⰜⰑⰏⰒⰑⰐⰅⰐⰕ'Ⱄ ⰐⰀⰏⰅ.

prove all · the deterministic core, in animation

6/6 proven · 512 samples

Determinism

The same input always yields the same UUID — verify by recomputation, not permission.

toUuid(x) = toUuid(x), for all x

Avalanche (tamper-evidence)

Change one character and ~half the 128 output bits flip — any edit is unmissable.

mean Hamming(toUuid(x), toUuid(x′)) / 128 ≈ 1/2

Order sensitivity (genus 2)

merge(a,b) differs from merge(b,a): the fold is non-commutative, both directions distinct.

≠

merge(a,b) ≠ merge(b,a)

Merkle inclusion

Every leaf carries an audit path that recomputes the root — inclusion provable without trusting the host.

fold(path(leaf)) = root

Collision-freedom

Distinct seeds give distinct UUIDs across the whole pi-train — no two coordinates share a receipt.

|{toUuid(s) : s ∈ set}| = |set|

Set-fold invariance

The same set folds to one root in any order — the fold is a function of the set, not the sequence.

fold(set) independent of order

animations raise the forgery cost, computed: 2,961 reproductions vs one static root · 7,260 live recomputations / second · or break 128-bit preimage per receipt

✓ proven · content-address 73cab198-f8c5-8351-a3cd-4a6ffd4f0cd7 — declared, placed, mounted, and recomputable from the component's name.