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

Was the pk of TX59 gotten from your pool? If yes what about the BCH pk and how are they related? Whats your pool all about?

in hex 10 = 16 8=8 - if it will make you feel better you could do 0800000000000000- 0FFFFFFFFFFFFFFF which would be 1 shy of the whole range and I can pretty much guarantee it would not be in that last one. (I have pretty good odds there eh? hehe)

The pool has started the next TX. We're still in beta but taking new members via telegram.

Thanks for commenting Now the person who claimed the prize will make sure to swipe the bch too before revealing the private key here!


Thanks! Isn't that a bit shorter than the one before I think? Shouldn't it be 800000000000000-1FFFFFFFFFFFFFFFF instead of 1000000000000000?

I notice that the puzzle address also has BCH in it. How is it possible to swipe the BCH? is the BTC private key same as that of the BCH? How can one get the BCH pk?
Someone can help me with answers.....Thanks.

thanx

(DEC) 576460752303423488-1152921504606846976

0x7496CBB87CAB44F

congratulations to whoever found the key, and i really would like to see the private key,

Good day all.

Thanks to everybody for your replies in this post. I'd learned a lot! 

Congratulations to the lucky one that found #59.

My code is not configuring well. Maybe our friend Arulbero can write what was the private key

hi how did you create your pool?

When you say puzzle, has someone set up these addresses especially or are you just trying to hack random addresses with large amounts of BC in them?

Whats the range for the 60th address? Need to upgrade my blind monk script

It’d be a dream to crack this but I have neither the technology nor technical know how to be able to achieve it.

Whoever does it is a lucky guy.

For those who are curious, here's an update on the cracking pool.

This has been on the back burner due to a general lack of interest. I've repurposed the majority of my computing power to more useful applications. The public website is nearly complete now, I'm expecting it to be live today. If I see that interest has increased and people start to join the pool I'll reallocate some of my systems and time for this purpose.

I know it's been said already but to those of you who are posting these giant walls of numbers and analysis you're wasting your time. The only way these wallets will be cracked is by brute force. If you manage to find a flaw in the process used to generate random addresses you'd be much better off focusing on a larger payout. That being said, if you do manage to come up with a solid theory but lack the capacity to test a certain keyspace, post it here. I'll run it for you and even let you sweep the wallet yourself if you prove to be correct. The conjecture is ugly to try to read here and generally irrelevant nonsense.

There are some shortcuts in curve generation, that's why point are generated in large batches.
But due to the next steps, that make hashes, other operations are calculated individually.

Maybe authors of Bitcrack, vanitygen have mislooked something else, but this optimization
should be not in stupid walls of numbers, but somewhere in the code of bruteforcer.

Because it can be an digital analogue of a "black hole", if we can take the first 100-200 digits of the multi billionth trillion num... and fly in power of 2 at the "speed of light"))

2^115792089237316195423570985008687907853269984665640564039457584007913129639936 (the first 100-200 numbers of a huge number)
2^115792089237316195423570985008687907853269984665640564039457584007913129639937 (the first 100-200 numbers of a huge number)
2^115792089237316195423570985008687907853269984665640564039457584007913129639938 (the first 100-200 numbers of a huge number)
2^115792089237316195423570985008687907853269984665640564039457584007913129639939 (the first 100-200 numbers of a huge number)
...

and at the same time we can accelerate even more skipping any number of steps the farther to infinity, the greater the chance of getting the desired number.

why are you trying so hard to find a pattern where there are none?
this is not even "exactly a puzzle", i think you are misled by the choice of words by the starter. all these numbers you are trying to find a pattern for are chosen using a cryptographically secure pseudorandom number generator which has no pattern, if it did then it would have never been "secure" and should be considered broken.
the whole purpose of this is to show the strength of bitcoin private keys which are 256 bits. so far so much computing power has been wasted and they haven't even covered more than 4.9e-58 percent of it (that is 4.9 * 10^-58)

Would probably join the pool if cpu's are okay - no nifty vid cards but a pile of old comps just sitting around, pi's etc..  but avoided it because i don't feel like downloading one more program to like telegram. partly just ugh, at the thought, partly too many other things going on.

Bitcrack creator would add the function of reading the number from the file (selectable length is 18..77,77,78) so that you can take such files https://www.mersenne.org/primes/ and check them as addresses, there is the last 2^282,589,933 ~24mb (I merged the lines there and drove half of them along 78 addresses, I did not find anything, parallel to 18 long pass, and then, from the back side will go 123...321...). And if add the ability to generate large power of 2 generally it will be great. Otherwise we have to ask for Arulbero with its 64 gigabytes of memory to generate us .txt files from 2^17592186044416 (on google drive drop) in PARI/GP.

a little information about 2^ (we specifically do not need prime)
https://www.youtube.com/watch?v=pKwsPBeSiOc
https://www.youtube.com/watch?v=vetsor9NTF8
https://www.youtube.com/watch?v=lEvXcTYqtKU
http://earthmatrix.com/binary/system.htm

https://interestingengineering.com/japanese-kids-learn-multiply-using-line-counting-trick
it is interesting if you count in binary representation but we probably can't get anything from there for our purposes.

I don’t know what to come up with to calculate the giant numbers, if so many people with 10 higher education did not come up with anything)) Try to identify the sequence (which someone has probably already tried). For example, take numbers from 000-999 (all numbers consist of 1234567890, further combinations 00-99, 000-999, .. 000000-999999 .. and so on). We take 000-999, we ring our power of 2 (so that the starting and ending numbers connect to bagel), take 360 degree circle (where there will be both degrees 360 and our numbers 000-999), next, write out all triple matches with their degrees. Ie if we look from above, there will be a (expanding) circle, if there is a growing cone on the side. And depending on what combinations of numbers will fall out as the degree of 2,4,8,16,32,64,128 grows, we try to see the pattern.