Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 209. (Read 244497 times)

- here I need to run BitCrack 368,935 times in a row to check the range for this mask, but it's very long. I need another way.

There's an open source software which scans ranges that you specify if that's what you're asking. I don't know if I can post links or not but search bitcrackrandomiser on GitHub, it uses BitCrack and it also blacklists defeated ranges.

You should at least post your results, such as key per second, your hardware etc, this way everyone can see how your tool is performing, besides there is no use in hiding a tool from the public, it's not like a program which you could brute force bitcoin keys and steal coins, all the programs are useless, they are only good for 65 bit, above that range, you'd need to add more hardware.

A breakthrough would be when someone develops a program that could brute force 10 times faster with a single GPU, till then feel free to do as you want, remember sharing is caring.😉

of course we will run some tests on a private enviroment to check performance but I'm seriuously thinking about rent some on vast.ai and hunt by myself

who can solve
p = 115792089237316195423570985008687907852837564279074904382605163141518161494335
a = 1099511627776
b = 115792089237316195423570985008687907852837564279074904382605163141005436653346
c = (a-b) %p
result = 1612236468765

in pubkey

p =115792089237316195423570985008687907852837564279074904382605163141518161494335
a = 02feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d
b = 02746bd76e07a0dbbcc610245439ee1db94f73b70df43bc543d4046ebe119ad6b3
c = (a-b) %p
result = 02b21dd66bfde832c2dae35688c0e15b91b274ec018e2c14e23f1ca7cb32fcca73

substract formula
p = int(2**256 - 2**32 - 977)
x1 =  # fill pubkey1-x
y1=  # fill pubkey1-y
x2=  # fill pubkey2-x
y2=  # fill pubkey2-y



dx = (x1 - x2) % p
dy = (y1 - (-y2)) % p
c = dy * gmpy2.invert(dx, p) % p
Rx = (c*c - x2 - x1) % p
Ry = (c*(x2 - Rx) - y2) % p
print (Rx , Ry)
print (hex(Rx) , hex(Ry))


if you have alternate formula for adjust with mod p, apply and check for get acurate result in pubkey

You are not sharing it, so there is no way for interested parties to test it's performance, who would gamble their GPUs blindly? Ask that from yourself and happy hunting!😉

I built my own private brute forcer that make all calculations with pure cuda threads. actually it uses a single gpu, but if anyone with more than 10 good gpus on a windows enviroment would like to join forces we could try our luck together and split the prize.

my brute forcer is different because it uses a different logic while searching sequentially.

if you have 10+ gpus and would like to try DM me.

Actually I'm not interested to share my code. or software. thanks.

Hey people!
I'm using Altcrack to find 66 but it only searches consecutively through 1 or some other number. Tell me if there is a program that can search for 66 puzzles by sorting through all the range options by mask.

for example this mask (decimal): XXXXXX123456XXXXXXXX

Now I have to run Altcrack 368,935 times consecutively to check the range for this mask, but this is very long. Is there any other way?

Did you at least bother to use the search function in this thread to read why there are outs in those transactions?

Puzzle numbering starts with '1' (1BgGZ)
But in Bitcoin's blockchain, output_index starts with '0'.
So you're looking at the wrong puzzles, you must be talking about puzzle number 130, 135, 145, 150, 155, 161 respectively.

The reason why those have spent outputs already is because the owners decided to reveal the public keys of puzzles divisible by '5' as "bonus".
They didn't spent the puzzle's UTXO but sent and spent another set.
For 161, 161~256 are spent because the owner (not the OP) agreed to a comment that those are computationally impossible to bruteforce.

Just look the hashs on blockchain, all mentioned hashs already have outs, how could a hash with unknown privatekey has outs?

I just wonder, why did you start with 129 and not 66 or 67? And what do you mean by this puzzle is rigged, how exactly is it rigged?
To answer your question, we can't really compare mining with key brute forcing, but I'd say if you spend 3 bitcoins to rent GPUs, you might be able to solve #66 and grab 3.6 free  bitcoins, but I'd wait for experts to calculate the exact cost.😉

---

Ps all puzzles from 161 up to 256 are already solved, dis rigged puzzle!😅

Why on earth you said that above puzzles are already solved, however they aren't? We've been trying to solve a single puzzle 124 for past 8 months are so and now you suddenly claimed that all puzzles with pubkeys are solved. Are you checking their balances on Ethereum or some other cheap drug Blockchain?

Puzzle 129, 134, 139, 144, 149, 154, 160 are already solved, this means that this puzzle is rigged, but anyway, is it harder to solve puzzle 66 than mining a block?

you are not understand.

the math which is in BSGS or pollard rho or lambda, we all know -> all people know what and why.

but as always are smarts scientist which know a lot of more and not publish their papers.

I mean math which can solve a lot of things but it maybe is hidden for us.

No, for those we have Pollard Kangaroo, and they are math too

BSGS? sorry but not for 125 and more bit.

the memory will be huge. 

And BSGS is not a math ? it's all math here bro. 

If you are serious about this offer, I might be able to work on something and then give you a range and a public key so that you could spend the funds on finding the key, but first I need to be certain about the range.😉

Thank you for your interest in the ongoing puzzle and your willingness to contribute to the efforts to crack the keys. You are correct in noting that the current conclusion is that brute force remains the only viable method for cracking the keys. However, this does not mean that progress has not been made or that there is no hope of success.

Advancements in hardware technology have made it possible to perform brute force attacks much more quickly and efficiently than in the past. By using specialized hardware and parallel processing techniques, it is now possible to greatly reduce the time required to crack a key.

Personally speaking, your contribution could help me fund the acquisition of such a hardware, thereby accelerating the pace of progress and increasing the likelihood of success. With your support, I could potentially make significant strides in cracking the keys and solving this puzzle.

Furthermore, the potential benefits of cracking the keys could be significant. It could pave the way for the development of new encryption methods and security protocols, which could have far-reaching implications for the security of sensitive data across industries.

I deeply admire and appreciate your consideration and hope that you will choose me to support my effort at 15Y5kMbf8Niu6ALFMUhgP9x9RVcVoeBknm to crack the keys and solve this intriguing puzzle.

Regards,
Unplugged Coin
15Y5kMbf8Niu6ALFMUhgP9x9RVcVoeBknm