Topic: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED== - page 6. (Read 54732 times)

Are you replying to me, or just randomly hallucinating? What is the purpose of your writing?

 It's a blast to solve Puzzle 65, 66, 67, 68.  It takes about 60 seconds once we identify the public key from the blockchain.  

Here i tested my toddler bot script on Puzzle 65 = address -> 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe


root@puzzle ~/Test # time python3 toddler_puzzle_bot.py
Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
Endomorphism enabled
Threads : 12
Search compress only
Quiet thread output
K factor 4096
Mode BSGS sequential
Opening file 65.txt
Added 1 points from file
Bit Range 65
-- from : 0x10000000000000000
-- to   : 0x20000000000000000
N = 0x100000000000
Bloom filter for 17179869184 elements : 58890.60 MB
Bloom filter for 536870912 elements : 1840.33 MB
Bloom filter for 16777216 elements : 57.51 MB
Allocating 256.00 MB for 16777216 bP Points
Reading bloom filter from file keyhunt_bsgs_4_17179869184.blm .... Done!
Reading bloom filter from file keyhunt_bsgs_6_536870912.blm .... Done!
Reading bP Table from file keyhunt_bsgs_2_16777216.tbl .... Done!
Reading bloom filter from file keyhunt_bsgs_7_16777216.blm .... Done!
Thread Key found privkey 1a838b13505b26867  
Publickey 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
All points were found
Private Key: 1a838b13505b26867
WIF Key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZM21gaY8WN2CdwnTG57
Starting Electrum ....
starting daemon (PID 41802)
true
Keypair imported: 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Transaction IDs: []
Daemon stopped
Electrum daemon stopped successfully.

real   2m46.311s
user   1m55.133s
sys   0m59.598s


and the time required to import the key into Electrum and start the redirection of transactions (if they exist ).

The 10 minutes is the average time and this is a pretty stupid circumstance. At this stage, the transaction has
entered the mempool and remains 'Pending,' waiting for confirmation.

It only takes a matter of seconds (for such a small range) to obtain the private key from public key, after which
you (or a thousand of them) can replace the still-unconfirmed transaction in the mempool.  

In other words, you need a very strong miner to speed up (prioritize) the transaction to go through the mempool in
one (or less than) minute for puzzle 66, 67, 68, 69.

I cant belive that I read this BS again on this forum. Are you out of your mind? Why the hell do you need a mining pool?
I have read a similar BS from another user in another topic, that is talking about miners.

You dont need any miners to get the money, when you got the privatekey, you can immediately take control of the bitcoins. Do you really dont know how?

Hi, I modded VBCr, it is as its name states, random. It will not progress through a range.
Also, you have a very low rekey rate in your second command line. This will cause the program to basically always rekey to new random points.

There are plenty of programs out there that will do what you are wanting to do, especially if you are searching for a full length address.

https://github.com/WanderingPhilosopher/VanBitCrakcenS
https://github.com/WanderingPhilosopher/KeyHuntCudaClient
or any other Keyhunt-Cuda program on GitHub, or Rotor-Cuda

or an oldie but goodie
https://github.com/Telariust/VanitySearch-bitcrack/releases

Hope that helps...

Post a random 66 bit public key here and I will show you how easy it is to find. Might wanna read up on a few things.

If knowing that pubkey of puzzle 66 would work like that, then any address and transaction is in danger.

Stop beliving in bs.

So, has anyone figured out a bulletproof way to spend puzzle 66's inputs, once the key is found, without the internet-of-bots stealing the prize? Other than trying to find a big enough mining pool that will mine your transaction into a block and not expose the transaction to the mempool? Could any mining pool even be trusted to that extent?

Hi Guys
Im playing around with bitcoin puzzles , currently with VanBitCrackenRandom2 by scanning ranges and I think there is something not right or im missing something....
I need a tool which allows me to scan full ranges from my database.
With above software there is no indication when / if range has been completely scanned .
Even if I use small range which can be fully searched in seconds program is still looking for new keys good know where.

Can someone recommend any software ( gpu ) where I can specify in cmd start of the range and end of the range where I can get indication that range scan has been completed.

Currently Im using command:

VBCr -t 1 -gpu -gpuId 0 -g 2046,512 -bits 66 -dis 1  -begr 2000000000000000 -endr 3FFFFFFFFFFFFFFFF -r 210000 -o 66BitChallengeKey.txt 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so

And I dont even think command is right as when switching to micro  ranges its doing constant scan even if test keys are fund....

When I run this for:

VBCr -t 20  -dis 1  -begr 3FFFFFFFFFFFFFEFF -endr 3FFFFFFFFFFFFFFFF -r 1 -o aaa.txt 1Eo3WvHuWKcjcuA6R8KAPFWkNwMEa2WRvT
where 1Eo3WvHuWKcjcuA6R8KAPFWkNwMEa2WRvT has a PK WIF of KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qaCyWMw1qH2rzy6joVM6 from 3FFFFFFFFFFFFFFFF  its running all the time after the key is found regardless if I use -r flag or not...
Thanks in advance...

They're all on page 1 of this thread  https://bitcointalksearch.org/topic/bitcoin-challenge-transaction-1000-btc-total-bounty-to-solvers-updated-5218972

Does anyone still happen to have the public keys for all of the solved puzzles?   Like starting from puzzle number 1 upto number 65 for example?   Just was curious since usually only the private key is listed after a puzzle is solved.  But knowing what the public keys were helps greatly too.  Maybe you will reply here later if you have that list of values,  thanks

For 10 bits and a billion random trials you'll get the number 0 around 976562 times, on average.

If we replace each possible value from 0 to 2**66 - 1 with some emoticon for a thing in the universe, what exactly makes 0 to be more special than some other value? The values are just labels, it makes zero sense to discriminate them. The only valid affirmation you have is that there is a 100% chance that some random value in some 2**66 set of elements is contained in the set. It doesn't matter how you look at them.

Also, it would be weird as well if somehow the maximum probability solution (some value with maximum entropy and with exactly 33 bits of zeros and 33 bits of ones, in some arrangement that has the least possible compression form) is the one that's correct. So, why not exclude stuff from the other end of this mindset as well? It's like: if you throw a coin in the air 100 times, chances are very low you'll get a 50/50, but still, these are the maximum chances as well.

this is true if you go through all the values ​​without taking into account entropy.

Of course, if you try to generate a random number of 10 bits a billion times, you can get the number 0. But if you try to generate a random number of 66 bits, it becomes impossible to get the number 0. In this way, you need to ignore values ​​that with the maximum probability could not be a private key.

Does anyone know where I can find vanitysearch for sm89/ccap89. All the links to vanitysearch on the first page give me 404 errors. Thanks

if you have 56core/256GB server, you'll check about 12 exakeys per sec

2^129 / 11344588059320129643 / 3600*24 = ?

after 1_902_338_144_733  years AT MOST you'll become rich, but with this probability 1/680564733841876926926749214863536422912 you'll find PK in first second. Feel lucky? (haha)

p.s. if you pay $200 per month for server, you'll pay 1902338144733*200*12 = ?

4_565_611_547_359_200 dollars

so, it's only reasonable if you do not pay for server

Hi, I am new here, and I have read a lot regarding the ECDLP topic and try to understand how does it works, may I ask you all what computational power does the puzzles 130 needed to be solved? I am curious whether people will try to rent for GPU and solve for #130. Thanks.

Not that I have ever claimed to have solved this, and in spite of being a newbie I'm just as amused as you are by those who do claim to have done it.
And yes, I do work on pattern finding (mathematical as well as visual) and statistical approaches, and have done since I first discovered this challenge in 2019. With the hardware and the budget available to me, brute forcing would be ridiculous. A billion years or more to find a single key. Sure I could stumble on it tomorrow. But I could do that with pattern finding and statistics as well, and even if I do not, I find trying to think of new ways to discover patterns or statistical relations intellectually stimulating, and even if I don't get a single sat out of this, I may have gained some insights into things I might use elsewhere.
That said, given that I'm a newbie on this forum, and that before this one I've only posted one message, who will you send to fuck me? Please say she's a gorgeous brunette.

Doit... LOL isn't the first time that somebody claims that. And all others also failed to do that.

There is a lot of Newbie accounts with only one single message spamming the post recently, fuck them all

Hi. Are you sure you've found the key to the still unresolved address?

Hi!
When will you find the private key?
How to withdraw?
Through what program?
Bitcrack works
(66)
First number 9

If you really solved this, then congratulations. However, I'd be careful about making such claims. I've been at this on and off since 2019, and on several occasions I've thought I'd found mathematical patterns, and on a few of those occasions I've even been convinced, but none of them held up. I've also delved into visual patterns, on both the already claimed keys, and on the addresses.

Sadly I don't have the hardware to brute force, so pattern finding is essentially my only option. Nevertheless, I have my computer trying one of the so far unclaimed keys. Based on the number of keys it tries every minute, I will, statistically, be at it for about a billion years.