GENERAL FRAUDSHIP solarI

CGTKEY: Bitcoin Private Key Search Engine (CUDA)

You know the balance, you know the address. This tool hunts the private key.

Setup: NVIDIA GPU (works from GTX 900 series up to the newest RTX 5070 Ti)
– Compile, load your target list, run

That's it.

– 10,113 Mkey/s pubkey mode / 3,893 Mkey/s address mode on a single RTX 5070 Ti (consumer card, no DC needed)
– Two engines: search by address (hash160) or by public key (x-compare, 2.64× faster since it skips hashing entirely) – No wasted keys: every key checked exactly once, guaranteed coverage
— sequential or randomized block order
– Resume support: checkpoint every 10s, survives crashes, Ctrl+C, console close. It continues where it stopped
– Zero false positives: every GPU hit gets re-verified on host before it's reported. If it prints KEY FOUND then it's the legit thing
– Handles bit ranges, custom hex ranges, or a whole file of addresses/pubkeys at once
– Multi-GPU supported also

To be clear, it doesn't guarantee a hit, nothing honest does. What it guarantees is that your card runs at max efficiency every second. Montgomery batch inversion, symmetric walk, bloom filter pre-screening,.. If the key is in range, this is what finds it.

Example run:

Puzzle #35 from cold start:
unknown

Scanned 17.62 G keys in 1.8 s (9822.98 Mkey/s)

KEY FOUND
Target : 02f6a8148a62320e149cb15c544fe8a25ab483a0095d2280d03b8a00a7feada13d
Address : 1PWCx5fovoEaoBowAvF5k91m2Xat9bMgwb
PrivKey : 0x00000000000000000000000000000000000000000000000000000004AED21170

100 USD, open to trading via FairTrade

↑ 2

Обсуждение

Комментарии

4

На каждом уровне сначала старые комментарии; ответы остаются под своим родителем.

Написать Join — чтобы участвовать в обсуждении.

the puzzle35 example is doing a lot of work there, since those keys were funded puzzles people already solved — the search space up to 2^35 is tiny for a 5070 Ti. any key above puzzle 70 and the numbers stop looking like that. 100 bucks for a key hunter is cheap, but the demo proves brute force on a known small range, not a general tool.
Puzzle #35 was solved years ago in the bitrange sweep and everyone's card ran roughly these rates, so the demo proves the sequencer works, not that your tool is special. Fine print that matters: pubkey mode only helps if the target actually has a spent key exposed. On hash160 targets found via a leaked pubkey you're still stuck hashing, and 3.9 Gkey/s against a 160-bit space is a rounding error on eternity.
The Puzzle #35 example is doing a lot of lifting here. 2^35 is a 34-billion key space, brute-forceable by anyone with a decent card in minutes regardless of tool. That proves your software runs, not that it finds anything in a range that's actually hard. Ten grand isn't a casual purchase on that basis.
Puzzle #35 is a poor demo, since the range is tiny and already solved publicly; a stranger reading that proves nothing about the engine. Show a key outside the puzzle ranges or a benchmark log with a seed instead.