blindrange — public network

Key counts on this page are self-reported and unverified. A node returns whatever number it likes; nothing here checks it. What can be proved is possession: a data owner can ask the node responsible for a record to produce it and verify the AES-GCM tag, which a node cannot fake — it can neither derive the key nor forge the ciphertext. Reachability and last-seen are measured, not claimed.

Membership is public within a network — this page is everything an operator can publish about it. Contents are not. Every database here is encrypted under its own master key, so records and index entries are unlinkable pseudorandom pairs to every node, to every other user, and to whoever runs this seed. You can see that someone is storing; never what.

Nodes marked relay tenant sit behind NAT and were never configured for it — they diagnosed their own reachability and now receive traffic over an outbound connection, with direct QUIC paths punched when the networks allow.

share ‰ is each node's slice of a distribution pool per thousand — 500 would be half of everything. It is structural position on the ring multiplied by proved possession, so a node with no audits yet earns nothing and a node that self-reports generously earns nothing extra. Possession is scored over a six-hour window, weighting recent audits more heavily — a proof from this morning says little about a disk now, in either direction: a node that has just recovered stops being held to its earlier failures, and one that has just lost data stops coasting on earlier passes. Where the aggregate and the newest audit disagree, both are shown. Illustrative: a share of a pool, not an entitlement, and not money.

Every number above is logged. Each accepted audit and each share calculation is a leaf in an append-only Merkle log, so we cannot revise one after the fact without anyone who kept an earlier head noticing. Current head: 1033:e0a4f283c7e90c982c793b16c2eb45ff (/log/sth, /log/entries). Check it yourself with python3 examples/verify_log.py — it remembers this head and demands proof next time that the log still contains it. It cannot stop us declining to log something, and catching a split view needs two operators comparing heads.