NETWORK
idleActive nodes
Distinct operators
Network rate
Hashes, lifetime
Tasks verified
Tasks rejected
Verification rate
Rewards issued
rate measured over the last 120s of verified work
A task is a 32-byte challenge, a difficulty in leading zero bits, and a window of nonces. A node must find a nonce inside that window where sha256(challenge ‖ nonce) starts with at least that many zero bits.
Searching costs about 2^difficulty hashes. Verifying costs exactly one, on the server, plus a check that the nonce came from the window that was issued. That asymmetry is the point: a design where the server recomputes the whole workload to check it has the server doing all the work it is paying for, and the network has harvested nothing.
Nothing the browser reports about itself — its speed, its hardware, how long it says it took — is used to decide a payout.
- · No AI model is being trained on this network.
- · No customer is renting this compute. Nobody is buying the result of these hashes.
- · No rendering or scientific workload is being processed.
- · What exists today is a verifiable proof-of-work network with an honest verification cost. The task types are pluggable, and useful workloads can be added — but they are not here yet, and the interface will not pretend otherwise.