GPU-Accelerated Bitcoin Puzzle Solver (Standalone Application Inspired by Existing Open-Source Tools)
Budget: $3,000 – $5,000 USD
We are looking for an experienced developer with strong knowledge of **cryptography, GPU computing, and Bitcoin address derivation** to build a standalone application that can solve **Bitcoin puzzle challenges** within a defined private key range.
The application will function similarly to existing open-source tools such as:
* BitCrack
* KeyHunt
* VanitySearch
However, our goal is **not to reinvent these projects**, but to create a **simplified standalone version with a user-friendly interface** so that non-technical users can participate in puzzle challenges.
Many of our investors are not technically experienced and cannot easily compile or configure existing open-source tools. We want a **compact executable application** that provides the same core functionality but is easier to run.
---
## Intended Use Case
This software will be used to solve **public and private Bitcoin puzzle challenges** where:
* A **known keyspace range** is provided
* A **target Bitcoin address** is provided
* Participants search for the private key within that defined range
Examples of these puzzles can be seen here:
https://privatekeyfinder.io/bitcoin-puzzle
https://privatekeyfinder.io/bitcoin-puzzle/71
These puzzles explicitly define a **search range and difficulty level**.
Our company will also create **internal puzzle challenges** for investors using the same structure:
* Defined keyspace range
* Public target address
* Internally generated and funded wallet
* Increasing difficulty levels over time
This will be used as part of an **annual puzzle competition** for our investor community.
---
## Core Program Functionality
The application should:
1. Accept a **private key search range**
2. Accept a **target Bitcoin address**
3. Generate private keys within the specified range
4. Derive the corresponding Bitcoin address
5. Compare the generated address to the target address
6. Stop immediately and output the private key when a match is found
Example Input:
Range Start
```
0000000000000000000000000000000200000000000000000000000000000000
```
Range End
```
00000000000000000000000000000003ffffffffffffffffffffffffffffffff
```
Target Address
```
1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua
```
---
## Key Technical Requirements
The application should ideally support:
* **GPU acceleration (CUDA preferred, OpenCL acceptable)**
* Efficient key generation and address derivation
* High-speed address comparison
* Configurable keyspace ranges
* Target address input
* Immediate output when a match is found
Optional but desirable features:
* Multi-GPU support
* Progress tracking
* Ability to pause/resume scanning
* Performance metrics (keys/sec)
---
## Deliverables
The final deliverable should include:
1. **Standalone executable application** (Windows preferred)
2. Simple configuration interface or CLI
3. Source code
4. Build instructions
5. Documentation explaining how to run the solver
The goal is a **compact, easy-to-run tool** that removes the complexity of compiling and configuring existing open-source projects.
---
## Important Clarification
This project **does not involve scanning arbitrary wallets or unauthorized access to third-party funds**.
The software will only be used for:
* Public puzzle challenges with known ranges
* Internally created puzzle wallets generated and funded by our company
All puzzles will explicitly define the **search range and authorized participation**.
---
## Helpful Technical Reference
For additional context on the type of cryptographic tooling involved, this article provides a technical overview of VanitySearch:
https://medium.com/@8891689/exploring-cryptographys-edge-a-technical-review-of-vanitysearch-17cfd29fcacb
---
## Developer Requirements
We are looking for developers with experience in:
* GPU programming (CUDA/OpenCL)
* Cryptography
* secp256k1 elliptic curve operations
* Bitcoin address generation
* High-performance computing
Experience with existing tools such as **BitCrack, KeyHunt, or VanitySearch** is a major plus.
---
## Budget
Budget is flexible depending on experience and proposed implementation.
Please include in your proposal:
* Relevant experience
* Estimated performance (keys/sec)
* Estimated timeline
* Suggested technical approach
The application will function similarly to existing open-source tools such as:
* BitCrack
* KeyHunt
* VanitySearch
However, our goal is **not to reinvent these projects**, but to create a **simplified standalone version with a user-friendly interface** so that non-technical users can participate in puzzle challenges.
Many of our investors are not technically experienced and cannot easily compile or configure existing open-source tools. We want a **compact executable application** that provides the same core functionality but is easier to run.
---
## Intended Use Case
This software will be used to solve **public and private Bitcoin puzzle challenges** where:
* A **known keyspace range** is provided
* A **target Bitcoin address** is provided
* Participants search for the private key within that defined range
Examples of these puzzles can be seen here:
https://privatekeyfinder.io/bitcoin-puzzle
https://privatekeyfinder.io/bitcoin-puzzle/71
These puzzles explicitly define a **search range and difficulty level**.
Our company will also create **internal puzzle challenges** for investors using the same structure:
* Defined keyspace range
* Public target address
* Internally generated and funded wallet
* Increasing difficulty levels over time
This will be used as part of an **annual puzzle competition** for our investor community.
---
## Core Program Functionality
The application should:
1. Accept a **private key search range**
2. Accept a **target Bitcoin address**
3. Generate private keys within the specified range
4. Derive the corresponding Bitcoin address
5. Compare the generated address to the target address
6. Stop immediately and output the private key when a match is found
Example Input:
Range Start
```
0000000000000000000000000000000200000000000000000000000000000000
```
Range End
```
00000000000000000000000000000003ffffffffffffffffffffffffffffffff
```
Target Address
```
1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua
```
---
## Key Technical Requirements
The application should ideally support:
* **GPU acceleration (CUDA preferred, OpenCL acceptable)**
* Efficient key generation and address derivation
* High-speed address comparison
* Configurable keyspace ranges
* Target address input
* Immediate output when a match is found
Optional but desirable features:
* Multi-GPU support
* Progress tracking
* Ability to pause/resume scanning
* Performance metrics (keys/sec)
---
## Deliverables
The final deliverable should include:
1. **Standalone executable application** (Windows preferred)
2. Simple configuration interface or CLI
3. Source code
4. Build instructions
5. Documentation explaining how to run the solver
The goal is a **compact, easy-to-run tool** that removes the complexity of compiling and configuring existing open-source projects.
---
## Important Clarification
This project **does not involve scanning arbitrary wallets or unauthorized access to third-party funds**.
The software will only be used for:
* Public puzzle challenges with known ranges
* Internally created puzzle wallets generated and funded by our company
All puzzles will explicitly define the **search range and authorized participation**.
---
## Helpful Technical Reference
For additional context on the type of cryptographic tooling involved, this article provides a technical overview of VanitySearch:
https://medium.com/@8891689/exploring-cryptographys-edge-a-technical-review-of-vanitysearch-17cfd29fcacb
---
## Developer Requirements
We are looking for developers with experience in:
* GPU programming (CUDA/OpenCL)
* Cryptography
* secp256k1 elliptic curve operations
* Bitcoin address generation
* High-performance computing
Experience with existing tools such as **BitCrack, KeyHunt, or VanitySearch** is a major plus.
---
## Budget
Budget is flexible depending on experience and proposed implementation.
Please include in your proposal:
* Relevant experience
* Estimated performance (keys/sec)
* Estimated timeline
* Suggested technical approach