If you provide the private key you already have the private key. You mean get the public keys?

Yes, but my kernel is only for one private key and use an offset to generate multiple private/public key pairs. You can easily transfer an array and don't use the offset (| global_id). https://github.com/bernardladenthin/BitcoinAddressFinder/blob/main/src/main/resources/inc_ecc_secp256k1custom.cl#L170 You need to adapt my custom method __kernel void generateKeysKernel_grid(__global u32 *r, __global const u32 *k). In k must be transfered more than one private key. Then you can calculate each k offset for every kernel and calculate for every given private key all public key pais and fetch the result.

This is also easily prossible in my project because many unit tests existing which can be adapted easily.

But keep in mind, memory access is very slow. If you transfer many private keys, it cost a lot of shared memory and this memory needs to be written and read by each kernel which is a very slow operation. Therefore I decided to pass a single key and calculate multiple keys with an offset. This operation will be done on the CPU also and is a trick that I don't need so much memory operations.

Cheers, Bernard

Hi, yes, always booth together, I build a RIPEMD 160 (P2PKH) from compressed and one from uncompressed x,y coordinates. Each private key results in two public keys with two database lookups.

Cheers, Bernard

Hi, It can read / parse and create a database of any altcoin address (P2PKH) which is similar to bitcoin (RIPEMD 160 hash). In short, I'll create a database of any RIPEMD 160 hashes of P2PKH which I've found. A cross collision can be found also.

This means my database contains

• bitcoin
• bitcoin cash
• bitcoin gold
• blackcoin
• dash
• dogecoin
• feathercoin
• litecoin
• namecoin
• novacoin
• reddcoin
• vertcoin
• ZCash

The difference of my program is, you can search this giantic databases and not only one address. This increases the chance of an unlikely hit/collision drastic:

Light (2.68 GiB), Last update: February 10, 2021

• Contains Bitcoin addresses whith amount and many altcoin addresses with amount.
• Static amount of 0 is used to allow best compression.
• Unique entries: 65170711
• Mapsize: 2752 MiB
• Link (1.8 GiB packed): http://ladenthin.net/lmdb_light.zip
• Time to create the database: ~4 hours

Full (32.2 GiB), Last update: February 10, 2021

• Contains all Bitcoin addresses which are ever used and many altcoin addresses with and without amount.
• Static amount of 0 is used to allow best compression.
• Unique entries: 781419881
• Mapsize: 32992 MiB
• Link (17.5 GiB packed): http://ladenthin.net/lmdb_full.zip
• Time to create the database: ~34 hours

Cheers, Bernard

Thanks a lot, I'll take car of it soon.

Hi folks,

I've read many times about this idea and I like you to present my implementation.

I'll do some further improvements but it works like a charm currently and has a high code coverage.

You can create a database (or use my precomputed) containing addresses with amount.

Afterwards you can use a CPU and/or OpenCL to create many private keys and the corresponding public addresses and check if the address was already used and check if the address has an amount.

I know it's unlikely to find one.

This tool is able to crack a puzzle transaction much faster than every other existing tool.

https://github.com/bernardladenthin/BitcoinAddressFinder

Feel free to use it, improve it or write me some suggestions.

Cheers and greetings from Berlin, Bernard