← Back
SLAD · What it is actually for
A protocol for immutable, cryptographically signed traces. No token, no balance, no exchange. Just mathematics, keys, and a tree nobody can rewrite.
Open web app →
How it works
01
1. Sign a trace
A small JSON object is signed with your Ed25519 key. The signature covers the whole object — any change invalidates it.
02
2. Publish to IPFS
Content is addressed by its hash (CID). The address IS the content — there is nothing to silently change.
03
3. Build the tree
Each new trace points to the previous one. Depth grows; history stays verifiable without asking anyone for permission.
What it is actually for
Each scenario has three parts: the problem, what SLAD solves — and what it does NOT solve. We state the third part deliberately.
Software releases
Problem
You download a program and do not know whether the file comes from the author or was altered on the way.
SLAD solves
The author publishes a signed trace with the release hash. You check the hash locally — match or not.
Does not solve
Does NOT solve: whether the code is safe or sensible. Only whether it is the same code.
Authorship and priority
Problem
You published an idea, a rule, a document — and later someone claims it was theirs.
SLAD solves
A signed timestamp in the tree proves when the wording appeared under your key. Verifiable years later.
Does not solve
Does NOT solve: ownership claims. Cryptography provides evidence, not court rulings.
Identity without a platform
Problem
Your “verified” profile belongs to a platform. It can suspend it, and the verification disappears with it.
SLAD solves
Your identity is the key. You sign statements with it; anyone can verify the signature, nobody can revoke it.
Does not solve
Does NOT solve: someone else claiming to be your key. Check the chain of references, not just signatures.
Contribution and reputation
Problem
Reputation is granted by platforms. It can be bought, faked, or lost when the account disappears.
SLAD solves
Trace Weight (TW) is computed only from signed data: depth, support from OTHER keys, position in history. Everyone computes the same number.
Does not solve
Does NOT solve: whether someone is honest. TW measures work, not character. It is not money — not transferable, not purchasable.
Limits
- No anonymity by itself — the network sees the IP address.
- No central court — everyone judges for themselves.
- Large trees need a local index; IPFS does not index children.
- A private node handles hundreds of thousands of traces, not millions.
Status
Protocol open · MIT licence · Genesis phase complete (1024 traces) · no tokens, no exchanges