Where to start

Check our work

If you're investing

← NETWORK

SNIP · STORAGE WITH PROOFS

Storage that keeps proving itself.

Every file is split, addressed by its contents, and handed to three separate machines. The network keeps asking each one to prove it still holds its piece, and takes money from the ones that can't answer.

SWUM KEEPS ITS SUCCESS AND FAILURE DATA HERE →

3x

COPIES OF EVERY FILE

100

BLOCKS BETWEEN CHALLENGES

BLAKE3

CONTENT ADDRESSING

HOW IT WORKS

Trust is replaced by a challenge.

Most storage providers ask you to believe a service level agreement. Here an archive node has to answer a retrievability challenge with a Merkle proof on a fixed schedule. A correct answer earns a reward. Silence costs it the stake it put up to participate.

Files are assigned to nodes by deterministic rendezvous hashing, so no operator chooses what they hold and no operator can quietly drop the unprofitable parts.

PRIVACY

The network never sees your bytes.

Encryption happens on your device before anything is uploaded. What the chain stores is an encrypted key bundle and the access metadata. It never encrypts raw file bytes itself, which means there's no point at which the network holds something readable.

SNIP: storage that keeps proving itself One file is split into three BLAKE3 content-addressed pieces, and each piece is held by a separate machine. Every 100 blocks the network challenges each machine, and each one answers with a Merkle proof. 1 FILE 3 PIECES 3 MACHINES MERKLE PROOF CHALLENGE BLAKE3 CONTENT-ADDRESSED Network CHALLENGE EVERY 100 BLOCKS

THE DETAIL

Replication Three copies by default, self healing when one drops.
Proofs Proof of retrievability with Merkle proofs, every 100 blocks.
Penalty Stake slashing on an expired challenge.
Transport libp2p over QUIC, with relay and hole punching so ordinary machines can take part.
Limit Up to 1,048,576 chunks per file.