== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[snaka]

Does anyone know how to make BitCrack check the max number of keys/second by utilizing the max dedicated GPU memory? I have a 3070 Ti and have set it to:

Code:

-b 925 -t 256 -p 256

That's the highest configuration that I've been able to run without getting an error message. It nets me 1200 MKeys/s. I'm hoping to hit 2000 MKeys/s, if possible.

[1714628255]

1714628255

[1714628255]

1714628255

[1714628255]

1714628255

[1714628255]

1714628255

[Diviserbyzero]

i have found the range for it, cause my pc is a little slower but i have matched "13zb1hQbWV" so the birthday paradox worked and i am on the numbers calculation

[LoyceV]

Just in ranges searched, probably 60-70 files, probably more, each with 25 million ranges searched. Each file is roughly 1.5 gb in size.
~
EDIT: I found over 350 more files with ranges searched lol. I ran a lot of these with BSGS and the other via brute force. Maybe a searchable database is better?

So it's more than 0.5TB already? Pulsed Media gets you 4TB for €3 per month (this Black Friday offer expires soon).
Question: how many files would you be looking at by the time you've exhausted the search space? Is it a few times more or several orders of magnitude more?

[WanderingPhilospher]

Just in ranges searched, probably 60-70 files, probably more, each with 25 million ranges searched. Each file is roughly 1.5 gb in size.
~
EDIT: I found over 350 more files with ranges searched lol. I ran a lot of these with BSGS and the other via brute force. Maybe a searchable database is better?

So it's more than 0.5TB already? Pulsed Media gets you 4TB for €3 per month (this Black Friday offer expires soon).
Question: how many files would you be looking at by the time you've exhausted the search space? Is it a few times more or several orders of magnitude more?

I am done running the bruteforce/baby step giant step methods through the #120 (120 bit range); so there would be no more files of this type.
I am running Kangaroo through the range now, wilds only as I have double the tames needed already.
It's not a huge deal, if there is not a free resource, then I'll just hang on to them and keep them on my hard drive for now.

[Diviserbyzero]

Hello everyone!

i am late to the party but i got something for ya.

I have read the posts about the puzzle and analyzed everything then i came with an algorithm.

TIPS
===============
Deterministic Wallet
Bitcoin V1
Large Bitcoin Collider
===============

i have built a Python program its fast but it requires more computing power like GPU except i have i3 laptop.

i am working on 66, you will know within 3 days when i drain it.

it's been 3 days, you didn't drained it? huh

this laptop is a little slower but i found the range with 30% address match


BTC
Anyone with enough knowledge of c++, i need to modify vanity++ to search only in the range i specify coz its searching randomly.
i know where the key is, but vanity is skipping that portion,
like

Code:

./vanitygen++ -F compressed -Z 00000000000000000000000000000000000000000000000F7051F27B09112D0 -l $((256-64)) 116jYLq

but it doesnt start on F7051F27B09112D0 up is there a tool for that

i will give you 10%

[moderator's note: consecutive posts merged]

[WanderingPhilospher]

BTC
Anyone with enough knowledge of c++, i need to modify vanity++ to search only in the range i specify coz its searching randomly.
i know where the key is, but vanity is skipping that portion,
like

Code:

./vanitygen++ -F compressed -Z 00000000000000000000000000000000000000000000000F7051F27B09112D0 -l $((256-64)) 116jYLq

but it doesnt start on F7051F27B09112D0 up is there a tool for that

i will give you 10%

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

Example where I tell the program to search in the 2ca21000000000000 range:

Code:

Pub Addr: 13zb1hQj7PdiJU5sfEWofPBmT8NA7TRJbD
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmAYf92mrjcyHUtu11Z
Priv (HEX): 0x000000000000000000000000000000000000000000000002CA21721064C4D1FA

Pub Addr: 13zb1hQy3JY7XweFWJKLDv3vTigcpfkoVs
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmAYoPL1CHZwQM5mLGf
Priv (HEX): 0x000000000000000000000000000000000000000000000002CA219351C5B08186

Pub Addr: 13zb1hQeHGycNgLtEhW6SjRy9pGvYi5SxS
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmAYC4KXZfgpSky3cWr
Priv (HEX): 0x000000000000000000000000000000000000000000000002CA2104DAC02D1CB7

Pub Addr: 13zb1hQoXGsgqw2bbWss5iP2AiuSNjTjda
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmAZ8sk3qDrFwfH71N7
Priv (HEX): 0x000000000000000000000000000000000000000000000002CA21E1EA6BBF59F5

Pub Addr: 13zb1hQ5wzcbWX75MC16yHeyKPUjusPEGD
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZmAYyVkYBChbWU4JimS
Priv (HEX): 0x000000000000000000000000000000000000000000000002CA21BC17B8F960F0

another example telling the program to search in the 37f0e000000000000 range:

Code:

Pub Addr: 13zb1hQtTeA1RxGME7LnPWYQJUCUT534Dr
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2Eb4t2CTyV8YnBEJT9
Priv (HEX): 0x0000000000000000000000000000000000000000000000037F0E70293B50C890

Pub Addr: 13zb1hQbdhEPf2qsMEJqtvzUhuKxn8puGE
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa2EbT4oiu1wNZFHAQKM
Priv (HEX): 0x0000000000000000000000000000000000000000000000037F0EC9A12BD1F6C2

another example:

Code:

Pub Addr: 13zb1hQCi6JxoGYXrfjP3njTmwhamDQJpX
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58Y4Xhgwt5oeB45rFY
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D24E56009C3E38

Pub Addr: 13zb1hQeTsAcn9EFKTj16eUkgWnzxK8N6x
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58Y1gx5zY9AQG9DWTH
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D242E18702FDF9

Pub Addr: 13zb1hQR82eZQGdsp7PjW53M4ooegaPXKj
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58XjyKARXgDumQYQg7
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D2037EFC2AE128

Pub Addr: 13zb1hQgoqDqApAH2DPQVdkD7LVgYERCrs
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58YR2XFZtknYDQWCEh
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D2A0FE3B06542F

Pub Addr: 13zb1hQmKq9Um7b43u5T8bPp91LbrtZvTx
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58Y8XoP8X3hD1y8HMu
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D25E79330E829E

Pub Addr: 13zb1hQ2wZUdUVP83aoCDevZ779bFe4j8Q
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58YXFtBHdXZ4Ve1qAs
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D2BA1E3818AF1D

Pub Addr: 13zb1hQNFmwgHH2kmShX1Gweqsf6JoRUPr
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58YmQL2vr9mSuvkGLU
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D2F3299FB1351E

Pub Addr: 13zb1hQxyqAT3sz4d9JP1NXwKRuG2DZSK8
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa58Xy7BBEtj6utM7p9h
Priv (HEX): 0x000000000000000000000000000000000000000000000003A1D23877A44271C6

[Diviserbyzero]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

maybe i can modify it to use cpu coz the range is very small and will probably take 3 hours.

its like decimal 51400000000 to 52100000000

[WanderingPhilospher]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

[Diviserbyzero]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

10 characters

[WanderingPhilospher]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

10 characters

Would only take seconds to find the key then. Send me those 10 characters and I will check the entire range for you. And I will agree to your 10%.

[Minase]

i have found the range for it, cause my pc is a little slower but i have matched "13zb1hQbWV" so the birthday paradox worked and i am on the numbers calculation

that prefix is not in just one range  i have a few of them (7-8 i think)

Code:

13zb1hQbWVBmBqFsBnFR49ZxK8A6RXeaMg 33DFE48077F5A7B93 029402E2F709D6540A689A342555C1D395FEF23A2AC35255BB72FDEDD5BDF51881
13zb1hQbWVnN3ag9GNS2vCraT8PQJDjVdr 354D62E5F7A0D2EB2 02B21A6B1590B145841A0DABBE71EA01E29ED60F0E468CFF36445A9C92EB3A6375
13zb1hQbWVLbiRYaoLhWuCDY7WcAw4dXF9 3AEA44357912CC482 02E056DC9AF6092439E37BB9A70B7314799601C6577F23EB902CBEBA1DB2357B67

just some addresses i found in one of my lists, maybe it will help someone.

[Diviserbyzero]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

10 characters

Would only take seconds to find the key then. Send me those 10 characters and I will check the entire range for you. And I will agree to your 10%.

no i am not giving my range to anyone, i give 10% to whoever modifies a program to search a certain range

[Minase]

than try keyhunt (cpu only)
you just need to compile it
https://github.com/albertobsd/keyhunt

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

10 characters

Would only take seconds to find the key then. Send me those 10 characters and I will check the entire range for you. And I will agree to your 10%.

no i am not giving my range to anyone, i give 10% to whoever modifies a program to search a certain range

[WanderingPhilospher]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

10 characters

Would only take seconds to find the key then. Send me those 10 characters and I will check the entire range for you. And I will agree to your 10%.

no i am not giving my range to anyone, i give 10% to whoever modifies a program to search a certain range

Lol, fair enough. Then use a simple python script to search that 2^28 range remaining. Easy breezy...go get it!

[bibilgin]

BTC
Anyone with enough knowledge of c++, i need to modify vanity++ to search only in the range i specify coz its searching randomly.
i know where the key is, but vanity is skipping that portion,
like

Code:

./vanitygen++ -F compressed -Z 00000000000000000000000000000000000000000000000F7051F27B09112D0 -l $((256-64)) 116jYLq

but it doesnt start on F7051F27B09112D0 up is there a tool for that

i will give you 10%

I think your computer has a virus

Code:

./vanitygen++ -F compressed -Z 000000000000000000000000000000000000000000000000F7051F27B09112D0 -l $((256-64)) 116jYLq

It is written wrong!! Hex 65 character!! wallet start wrong!!

Code:

./vanitygen++ -F compressed -Z 000000000000000000000000000000000000000000000000F7051F27B09112D0 -l $((256-64)) 16jY7qL

This is how it will be!

[ProjectSe7en]

Yes there is a tool for that. But it is based on VanitySearch and uses GPU.

well i have no gpu, just intel i3 laptop

How many beginning characters of the range do you know, or is it a large range?

10 characters

Would only take seconds to find the key then. Send me those 10 characters and I will check the entire range for you. And I will agree to your 10%.

no i am not giving my range to anyone, i give 10% to whoever modifies a program to search a certain range

Diviserbyzero DM to me Now!   

[Diviserbyzero]

So today i made an experiment to see the probability of matching characters of address in the bitrange that is not the challenge address but i was surprised that the script solved the puzzle in seconds and did not find any other address except the target

ii ran it with puzzle 12 and see i have set it to 1 million tries

Code:

import random
import bitcoin
import sys


def hex2addr(hx,ds):
    decoded_private_key = ds
    private_key=hx
    compressed_private_key = private_key + '01'
    # Multiply the EC generator point G with the private key to get a public key point
    public_key = bitcoin.fast_multiply(bitcoin.G, decoded_private_key)
    # Encode as hex, prefix 04
    hex_encoded_public_key = bitcoin.encode_pubkey(public_key,'hex')

    # Compress public key, adjust prefix depending on whether y is even or odd
    (public_key_x, public_key_y) = public_key
    if (public_key_y % 2) == 0:
        compressed_prefix = '02'
    else:
        compressed_prefix = '03'
    hex_compressed_public_key = compressed_prefix + bitcoin.encode(public_key_x, 16)

    ad =bitcoin.pubkey_to_address(public_key)
    # Generate compressed bitcoin address from compressed public key
    adr= bitcoin.pubkey_to_address(hex_compressed_public_key)
    return adr

def check(ad):
    if "1DBau" in ad:
        print(ad)


st = "0"
n = 1000000
while n>0:
    ps = random.getrandbits(12)
    pt = str(ps).rstrip("L")
    ps = int(pt)
    hx = hex(ps).lstrip("0x").rstrip("L")
    tp = 64-len(hx)
    hxs = st*tp+hx
    ads = hex2addr(hxs,ps)
    check(ads)
    n =n-1
print("done")

output

Code:

└──╼ $python dif2.py
1DBaumZxUkM4qMQRt2LVWyFJq5kDtSZQot
1DBaumZxUkM4qMQRt2LVWyFJq5kDtSZQot

[ProjectSe7en]

So today i made an experiment to see the probability of matching characters of address in the bitrange that is not the challenge address but i was surprised that the script solved the puzzle in seconds and did not find any other address except the target

ii ran it with puzzle 12 and see i have set it to 1 million tries

Code:

import random
import bitcoin
import sys


def hex2addr(hx,ds):
    decoded_private_key = ds
    private_key=hx
    compressed_private_key = private_key + '01'
    # Multiply the EC generator point G with the private key to get a public key point
    public_key = bitcoin.fast_multiply(bitcoin.G, decoded_private_key)
    # Encode as hex, prefix 04
    hex_encoded_public_key = bitcoin.encode_pubkey(public_key,'hex')

    # Compress public key, adjust prefix depending on whether y is even or odd
    (public_key_x, public_key_y) = public_key
    if (public_key_y % 2) == 0:
        compressed_prefix = '02'
    else:
        compressed_prefix = '03'
    hex_compressed_public_key = compressed_prefix + bitcoin.encode(public_key_x, 16)

    ad =bitcoin.pubkey_to_address(public_key)
    # Generate compressed bitcoin address from compressed public key
    adr= bitcoin.pubkey_to_address(hex_compressed_public_key)
    return adr

def check(ad):
    if "1DBau" in ad:
        print(ad)


st = "0"
n = 1000000
while n>0:
    ps = random.getrandbits(12)
    pt = str(ps).rstrip("L")
    ps = int(pt)
    hx = hex(ps).lstrip("0x").rstrip("L")
    tp = 64-len(hx)
    hxs = st*tp+hx
    ads = hex2addr(hxs,ps)
    check(ads)
    n =n-1
print("done")

output

Code:

└──╼ $python dif2.py
1DBaumZxUkM4qMQRt2LVWyFJq5kDtSZQot
1DBaumZxUkM4qMQRt2LVWyFJq5kDtSZQot

2^12 = 4,096

that's why

[Diviserbyzero]

so none of addresses in 12 bit space matches 4 characters of that address?
if no, the it means random know something we don't

[ProjectSe7en]

so none of addresses in 12 bit space matches 4 characters of that address?
if no, the it means random know something we don't

Bigger bit more characters appears.