Distributed ranges
Clients claim non-overlapping search ranges from the central service.

Distributed Bitcoin Puzzle search coordination for CPU and GPU workers.
OpenPuzzle coordinates distributed Bitcoin Puzzle range searches. Clients claim work from a central service, run supported search engines locally and report progress back without duplicating assigned ranges.
Clients claim non-overlapping search ranges from the central service.
Designed to support CPU and GPU workers with compatible search engines.
Works with GPU-oriented BitCrack workflows and CPU-oriented KeyHunt workflows.
Workers report progress, speed and completion to the central service.
Work allocation is designed so all clients have an equal right to receive work.
The project is developed publicly with community participation in mind.
OpenPuzzle is under active development. Public packaging and documentation continue to evolve.
Independent compute workers can easily duplicate the same key ranges. OpenPuzzle introduces a central coordinator that leases non-overlapping work, records progress and returns abandoned assignments to the available pool. The result is measurable shared coverage rather than isolated benchmark runs.
The project can coordinate CPU and GPU clients using different engines and backends. Each worker reports measured progress instead of relying on theoretical hardware specifications. This makes mixed fleets useful while keeping assignment state centralized.
OpenPuzzle is developed for intentionally published cryptographic puzzles and other authorized research tasks. The project is not presented as a system for targeting arbitrary wallets or third-party assets.
Lease expiry, process recovery, stop control and completion reporting are treated as core distributed-systems problems. A fast worker is only useful if the coordinator can trust which range it is running and whether that work was actually completed.