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

Hi  ttdclient !

Do I understand correctly ? :

1 - this is designed to search for only one address #64 - 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

2 - the computer must be connected to the Internet all this time

Why did you specify the range of keyspace 8000000 - FFFFFFF after all, according to preliminary calculations, the address #64 - 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN should be located in the keyspace range 8000000000000000- FFFFFFFFFFFFFFFFF  ?

I have created a pool of sorts to collectively solve bit 64 of this challenge.

if you goto http://www.ttdsales.com/64bit/

create an account and you will get access to the user and stats page.  From there you can download the client software. 

It works with bitcrack and the server to hand out work and keep track of what has been checked.

Each range work load is 000000000 - FFFFFFFFF or 68,719,476,735 keys.  I selected this range because it does not complete to quickly on top hardware and is still easily completed in less then an hour with slower GPUs.

8000000 - FFFFFFF is generated by the server randomly.  There is a btc address I have generated for all 134,217,728 ranges in the DB.  The private key for these addresses are used as proof of work for the range work loads.  When the client software finishes a range and submits this proof the DB marks that range as checked and dispenses another.  Before being dispensed the range is checked against the DB to ensure it hasn't already been checked. What I am calling a random collision.

All work completed is kept track of for each user and displayed on your user stats page.

If/when we find the solution the bitcoin stored in 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN will be split between the contributing users equally according to work completed just like a bitcoin mining pool would for a mined block.  This percentage is displayed on your stats page.

Please check it out and pm me with any thoughts comments questions or ideas for improvements.

It is a work in progress but seems to be functioning nicely for my 6 machines that have been running on it for a couple of weeks now.  Currently running ~1.37 Billion Keys /s.

Yes, you are scammer, selling fake scripts. Do not buy from this scammer.
Lets talk about proofs, here is pub key 75bit 036cd3a64147d167f30bab1b88b887744e48ca4ed0187950393682897b88afa31e
show PK, as i see you could solve it in about 1 hour

Why post this...its pointless to post this on this thread.

This tool  -  https://iancoleman.io/bitcoin-key-compression/
does not allow to receive Private Key

These pubkeys are interesting. All of them coresponds to uncompressed addresses, and for example the first 3 of them are:
13GUJutC6GKgJQTcGzCtznDDYFQKVJFVwp
13Sa73PU9Ar5sE4SdFcBdbg9ntbNcMQhaA
14k4GhqA1svNZPbssdAjgdnfzWTpAigZVH

The input transactions to them were in May 2011, and released only this year in September 2019 (amounts 147BTC, 122BTC and 147BTC).

But why drotika combined these pubkeys saying that they are 170bit?

20 addresses emptied in one month is not luck
https://iancoleman.io/bitcoin-key-compression/

And how you know for sure that those public keys was in the 170 bit range? How to tell what range a public key is in?

What is this? And what is your reason of such message here?

range 170 bit
https://pastebin.com/rDUw5Kyf

Hi there cryptohazard, you sharing the code. with the features, maybe.

I did forget about this. Now I have some features to add to my slow code.

It works for me on AMD Ryzen 7 2700

Does it work only under INTEL i5-2540 and higher? Will it not work under AMD?
Perhaps there is a compiled software in exe option  -  Such as clBitCrack.exe ?

Yes it is a Pollard Kangaroo Python script.

Public key for #110 = 0309976ba5570966bf889196b7fdf5a0f9a1e9ab340556ec29f8bb60599616167d
Public key for #115 = 0248d313b0398d4923cdca73b8cfa6532b91b96703902fc8b32fd438a3b7cd7f55
Public key for #120 = 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630
Public key for #125 = 0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e
Public key for #130 = 03633cbe3ec02b9401c5effa144c5b4d22f87940259634858fc7e59b1c09937852
Public key for #135 = 02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16
Public key for #140 = 031f6a332d3c5c4f2de2378c012f429cd109ba07d69690c6c701b6bb87860d6640
Public key for #145 = 03afdda497369e219a2c1c369954a930e4d3740968e5e4352475bcffce3140dae5
Public key for #150 = 03137807790ea7dc6e97901c2bc87411f45ed74a5629315c4e4b03a0a102250c49
Public key for #155 = 035cd1854cae45391ca4ec428cc7e6c7d9984424b954209a8eea197b9e364c05f6
Public key for #160 = 02e0a8b039282faf6fe0fd769cfbc4b6b4cf8758ba68220eac420e32b91ddfa673

Is there any software for this?

Of course, it's easier. You know the points x and y. You need to find the multiplier (the desired private key) from the generator point, that is, from key 1.

Hi!! Is it easier to break an address with the public key? could you explain to me which method?

wait few month, soon some one will find and will post here