About

The server uses smart job generation algorithms. Instead of random assignment, it analyzes current coverage and generates the next job from the largest unchecked key range. This ensures more efficient coverage of the key space.

The client does not scan a key segment sequentially. Instead, it traverses the entire key range with a large stride defined for each puzzle.

For example, consider a range from 0 to 100. On the server side, we specify that clients will scan this range with a stride of 10. Each client receives its own job (an offset from 0 to 9) and checks keys 0, 10, 20, … or 1, 11, 21, … and so on. This ensures uniform coverage of the entire key range across all clients. Offsets are generated so that each subsequent job is selected from the largest unchecked range. In our example, if the first job had offset 3, the next one would fall in the range 4–9, since it is larger than 0–2.

Our client is built using improved algorithms based on BitCrack. The key improvements focus on GPU performance optimization through coalesced memory access and partially 64-bit arithmetic. These optimizations provide a significant performance boost of approximately 20–25%.

Another difference is that there is no need to monitor every step of the client's work. Instead of a block queue, as is typical with BitCrack, our client launches exactly as many blocks as the GPU can process at once. This allows running the computation in a tight loop without losing time on processing results after each step.

Funds from a solved puzzle are distributed automatically, directly from the found address. The pool takes a 5% fee and pays an elevated network fee out of its own share to ensure the fastest possible delivery.

The remaining 95% is distributed among participants proportionally to their contribution. A minimum of 0.01% of all completed work for the specific key is required to qualify for a payout.

The payout is made in a single transaction, sent immediately after the solution is found.