index.html is an ultra-fast, 100% offline, zero-dependency browser-based cryptographic analysis and search engine designed to solve Bitcoin Puzzle transactions. It runs entirely inside your local browser memory using parallel Web Workers and WebGPU hardware acceleration.
Run directly in your browser with zero installation:
👉 https://mucid19.github.io/btc-puzzle-hunter/
- Solves elliptic curve discrete logarithm problems in
$O(\sqrt{N})$ time complexity instead of exponential brute force. - Elliptic Curve Collision Search: Computes deterministic pseudorandom jumps and trap points across the puzzle's search space.
- Built-in support for puzzles with exposed public keys (#19, #57, #135, #140, #145, #150, #155, #160).
- Automatically detects your CPU core count (
navigator.hardwareConcurrency). - Spawns parallel Web Workers with 100% CPU utilization.
- Dynamic cache busting via Blob URLs ensures clean memory allocation on every run.
- Harness the raw parallel computing power of your GPU cores directly through WebGPU (
gpu_engine.js) to process key combinations at maximum throughput.
- 🔄 Strategy Cycle (Agent): Automatically cycles through search strategies dynamically.
- 🔄 Auto (Hybrid): Blends low-discrepancy and chaotic sequences for uniform coverage.
- 🎲 Pure Random: Cryptographically secure uniform global exploration.
- 📐 Sobol (Quasi-RNG): Low-discrepancy space-filling sequence.
- 📏 Van der Corput: Number-theoretic bit-reversal sequence.
-
🌟 Weyl Golden Ratio (
$\phi$ ): Irrational stride lattice for non-overlapping traversal. - ♾️ Coprime Stride: Modular non-repeating cycle walk.
- 🌀 Hilbert Curve: Multi-dimensional space-filling topological walk.
- ⚡ Weak Entropy: Targets defective PRNG seeds and low-entropy keys.
- 🌌 Deterministic Chaos: Logistic and tent map dynamic trajectory.
- 🦘 Pollard's Kangaroo: Elliptic curve trap and collision network.
- 🎲 Halton Sequence: Prime-based multi-dimensional uniform coverage.
- 🔀 Scrambled Sobol: Owen-scrambled dynamic space filling.
- 🎰 MCMC (Markov Chain): Adaptive Metropolis-Hastings walk.
- Full Pool & Multi-Select: Hunt across all active unsolved puzzles simultaneously in circular rotation, or pick a custom subset.
- Archive & Verification: Solved puzzles (#1 to #65, etc.) are kept in a dedicated Archive dropdown for test validation and algorithm verification.
- Space Range Sliders: Interactive dual hex sliders to focus the search window on specific sections of the keyspace.
- Instant 1-click language switcher (
🌐 Türkçe/🌐 English) in the navigation bar. - Fully translated controls, algorithm names, live statistics, and notifications.
- Embedded cryptographic modules: secp256k1 elliptic curve, BigInteger, SHA-256, and RIPEMD-160.
- Zero external API calls, zero telemetry, zero server-side dependencies. Works completely offline.
- Clone or Download:
git clone https://github.com/Mucid19/btc-puzzle-hunter.git
- Open:
Double-click
index.htmlin any modern web browser (Chrome, Brave, Edge, Firefox, Opera). - Configure:
- Select your target puzzle (#66, #71, #72, or use All Puzzles).
- Choose your algorithm (e.g.,
🔄 Auto (Hybrid),🦘 Pollard's Kangaroo,📐 Sobol). - Select your CPU core count or enable WebGPU.
- Start:
Click
▶ Start Huntingto begin the search.
| File | Description |
|---|---|
index.html |
100% standalone, zero-dependency browser application |
gpu_engine.js |
WebGPU hardware acceleration engine |
kangaroo_engine.js |
Pollard's Kangaroo elliptic curve collision library |
all_160_puzzles.json |
All 160 Bitcoin puzzle target ranges and addresses dataset |
manifest.json |
Progressive Web App (PWA) manifest |
sw.js |
Offline Service Worker caching script |
icon-192.png / icon-512.png |
High-resolution PWA application icons |
ui_preview.png |
Interface preview screenshot |
LICENSE |
MIT Open-Source License |
README.md |
Project documentation |
If this open-source tool helped your research or cryptographic experiments, voluntary Bitcoin donations are warmly appreciated:
bc1qxf5cfrxasshlkt79x0q805l9t3feer868en68nhlxmwetlr6sv4qdfda5s
Distributed under the MIT License. See LICENSE for more information.
This software is developed strictly for educational, mathematical research, and cryptographic analysis purposes.
