The network issues a search
A random 32-byte challenge, a difficulty in leading zero bits, and a window of nonces to search. All three are chosen by the server and recorded before you see them.
QUERN issues your browser a search: find an input whose SHA-256 begins with a required number of zero bits. Finding one takes millions of attempts on your GPU. Checking one takes the server a single hash. That asymmetry is the whole design — the network can verify every result without redoing the work it is paying for.
Requires a browser with WebGPU — desktop Chrome or Edge. Nothing is installed and nothing runs in the background: closing the tab stops the node.
A random 32-byte challenge, a difficulty in leading zero bits, and a window of nonces to search. All three are chosen by the server and recorded before you see them.
A WGSL kernel hashes the challenge against millions of nonces in parallel, inside a Web Worker so the page stays responsive. Stop it and it stops.
You return the nonce. The server hashes it once, counts the zero bits, and checks it fell inside the window it issued. Verified work is credited; nothing else is.