Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Etar]

If this is hex seed, then the space is decimal 1929795357851620611194880. Which one-threaded will take 117815298184130778 hours to search in.

Not always..

Code:

GPU: GPU #0 NVIDIA GeForce GTX 1660 SUPER (22x64 cores) Grid(88x128) (141.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^20.46 kangaroos [10.2s]
[706.03 MK/s][GPU 706.03 MK/s][Count 2^36.71][Dead 0][03:03 (Avg 01:25:08)][10658.1/13328.8MB] 
2024-11-01 13:55:48.791: Private key: 0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c748207a0daa16191d07a425d8080c276f9412472e0429e61bc355
2024-11-01 13:55:48.791: Private key 256bit: 0x376c7486601275fbac571546409b241cfd4093e2def806ba427927139ec9b8df
Success!!
Searching time: 251 s

[albert0bsd]

Searching time: 251 s

Nice, near 5 minutes.., that is with some precalculated Distinguished points?

[Etar]

Nice, near 5 minutes.., that is with some precalculated Distinguished points?

There the loading of the hashtable takes almost a minute. And the search took 3 minutes.
Yes, this is with precalculated DPs. It would be possible to accumulate more and find faster, but perhaps this will be enough.
Time will show. I am more concerned about the use of the mempool. It's for fun anyway...

[BdMtFk]

Hey, new to Bitcoin but I have a question that one of you may be able to help me understand.

Given the unfortunate event of puzzle#66
{
  the real solver likely panic and tried to sweep the WIF using electrum (34 inputs and paying only 5.217/B)

  the sniper within a minute made a clean TX (1 input and paying 406.356/B)
}

If saatoshi_rising used a static padding for low entropy puzzles (like #66)

-> "123456789abcdef123456789abcdef123456789abcdef12" + [2832ed74f2b5e35ee]

Would a sniper still be able to find the private key from the public key being exposed in the mempool within 2 block confirmations?

From my limited understanding this would not be possible because the pubkey would be from a 256-bit key, but maybe I am missing something.

Thanks!

[kTimesG]

What is the dilemma? Regardless of its bits, target - (minKey % N)
the result should be a pubkey in the 80-bit range, according to your statement, unless it is an "I Need Attention" from Diga, because if the puzzle was today, why does he have to wait more hours?

I suggest you should build a 1-bit database, let's call it "UnicornDB". It's so easy: compute all the public keys from keys 1 to 2⁸⁰ in one giant batch, add up all the parities of Y values mod 2. I'm sure you can add some clever way to extract any public key from it. Don't thank me for the tip. Go get'em!

PS: your formula is wrong.

[GR Sasa]

After studying the puzzle I think its not helpful even if the public key did get revealed, I'm not sure. but the ranges are not fix so idk how to solve that

[pbies]

If this is hex seed, then the space is decimal 1929795357851620611194880. Which one-threaded will take 117815298184130778 hours to search in.

Not always..

Code:

GPU: GPU #0 NVIDIA GeForce GTX 1660 SUPER (22x64 cores) Grid(88x128) (141.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^20.46 kangaroos [10.2s]
[706.03 MK/s][GPU 706.03 MK/s][Count 2^36.71][Dead 0][03:03 (Avg 01:25:08)][10658.1/13328.8MB] 
2024-11-01 13:55:48.791: Private key: 0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c748207a0daa16191d07a425d8080c276f9412472e0429e61bc355
2024-11-01 13:55:48.791: Private key 256bit: 0x376c7486601275fbac571546409b241cfd4093e2def806ba427927139ec9b8df
Success!!
Searching time: 251 s

What are these privatek keys here?

This one:
Private key: 0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c74 8207a0daa16191d07a425d8080c276f9412472e0429e61bc355
and this one:
Private key 256bit: 0x376c7486601275fbac571546409b241cfd4093e2def806ba427927139ec9b8df

How you move from 512 bits to 256 bits?

[albert0bsd]

What are these privatek keys here?

This one:
Private key: 0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c74 8207a0daa16191d07a425d8080c276f9412472e0429e61bc355
and this one:
Private key 256bit: 0x376c7486601275fbac571546409b241cfd4093e2def806ba427927139ec9b8df

How you move from 512 bits to 256 bits?

the 256 bit keys is after apply Modulo N  (This only can be done once that you already have the extended privatekey complete)

The extended private key  (That one of 512 bits) is just a transformation/rotation/multiplication/some other operation of original privatekey, THB I really like that trick, because make people think outside of the box.

[GR Sasa]

@albert0bsd
Can you provide us some of the tools that can be used to search the range since the range is not fixed?

[pbies]

@albert0bsd
Can you provide us some of the tools that can be used to search the range since the range is not fixed?

Try this (you may want to convert it to use CUDA - or - make it multithreaded with "process_map"):

Code:

#!/usr/bin/env python3

import hashlib
import multiprocessing
from tqdm import tqdm
from hdwallet import HDWallet
from hdwallet.symbols import BTC
from numba import cuda
from tqdm.contrib.concurrent import process_map

N = 115792089237316195423570985008687907852837564279074904382605163141518161494337

minKey = 0x659756abf6c17ca70e0000000000000000000140be6ddd93e441f8d4b4a85653b20b4cdcc5c748207a0daa16191d07a425d8080c276f9412472e0429e61bc355
maxKey = 0x659756abf6c17ca70fffffffffffffffffffff40be6ddd93e441f8d4b4a85653b20b4cdcc5c748207a0daa16191d07a425d8080c276f9412472e0429e61bc355
target_address = "1ECDLP8osCZHBB1LH5PVAUfFegeMgFb52q"

initial_stride = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

hdwallet = HDWallet(symbol=BTC)

def go(x):
	y=hex(int(x/N))[2:]
	hdwallet.from_private_key(private_key=y)
	a=hdwallet.p2pkh_address()
	if a=='1ECDLP8osCZHBB1LH5PVAUfFegeMgFb52q':
		print('\n'+y)
		o=open('found.txt','w')
		o.write(y+'\n')
		o.flush()
		o.close()

r=range(minKey, maxKey, initial_stride)
count=int((maxKey-minKey)/initial_stride)

print(f'from\n{hex(minKey)}\nto\n{hex(maxKey)}\ncount\n{hex(count)}')
print('Working...')
for i in tqdm(r,total=count):
	go(i)

print('\a', end='', file=sys.stderr)

[brainless]

Hello guys
Sorry I am traveling for next 6 days
Faraway from my desktop system
Just can watch your messages
In my view offered minkey maxkey and sha256 key indicate key is secure private key, it's base aes or salt related etc
And why KtimeG said focus on rawtx ,
All know just pubkey can be seen at Blockchain website ,
Now you all can think and apply coding in that way too

[albert0bsd]

@albert0bsd
Can you provide us some of the tools that can be used to search the range since the range is not fixed?

Only kangaroo and keymath

[Etar]

What does this mean? You will give the step by step instructions on how to solve, before the outgoing transaction?

SHA-256 of correct solve steps (will publish tomorrow at this time)

Most likely, the sha-256 hash is simply a hash of the text that contains instructions on how to correctly convert a public key to a range of 80 bits an so on (which will be available tomorrow).

All I know it was supposed to be 80 bits, anywhere in what was posted, so to me, you could post something like this:
0xa6c39217128593909a1fcc0fd92c07a6f5abd32c36a8e7cf4e91f1a8f0651db0
and that would be enough.

The difficulty of this challenge is that some people don't understand where the 80-bit range is, some don't understand how to convert a public key to the required range and return the resulting private key to the 512-bit format and vice versa.
This is just part of the challenge. This is more interesting than just comparing who has more gpus.

[COBRAS]

@Etar,

 (which will be available tomorrow).

interesting.

./modmath 0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c74 8207a0daa16191d07a425d8080c276f9412472e0429e61bc355 / 0x376c7486601275fbac571546409b241cfd4093e2def806ba427927139ec9b8df
Result: 1


./modmath 0x376c7486601275fbac571546409b241cfd4093e2def806ba427927139ec9b8df / 0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c74 8207a0daa16191d07a425d8080c276f9412472e0429e61bc355
Result: 1

what is a "trick" of this ?

[albert0bsd]

what is a "trick" of this ?

modmath don't have any issue, the trick is process the public key properly because some operations may fail with keymath.

But that is not the only way, literally there are hundreds of way to process this "puzzle" with some other tools or customs scripts.

[COBRAS]

what is a "trick" of this ?

modmath don't have any issue, the trick is process the public key properly because some operations may fail with keymath.

But that is not the only way, literally there are hundreds of way to process this "puzzle" with some other tools or customs scripts.

My question, how to use 512 pub for search another key  ?

[albert0bsd]

My question, how to use 512 pub for search another key  ?

Seriously?

I already explain some method: https://bitcointalk.org/index.php?topic=1306983.msg64646739#msg64646739

It is more or less the same with some twist. Just try to understand what are you doing. Good luck to every one. I am going to publish my method once that the puzzle was redeemed.

[COBRAS]

My question, how to use 512 pub for search another key  ?

Seriously?

I already explain some method: https://bitcointalk.org/index.php?topic=1306983.msg64646739#msg64646739

It is more or less the same with some twist. Just try to understand what are you doing. Good look to every one. I am going to publish my method once that the puzzle was redeemed.

About your method is interesting, yes. Thank you.

For what this privkey ?

0x659756abf6c17ca70e829a43c7752f1417002440be6ddd93e441f8d4b4a85653b20b4cdcc5c74 8207a0daa16191d07a425d8080c276f9412472e0429e61bc355

[albert0bsd]

Who want to solve this key?

Transformed/rotated public key: 0334a20e64c9a70138783b125ad81196c76585403905dda56a644ac83ac9620045   <<<<------------- This ONE

On range from 1 to 0x100000000000000000000 ?


Original key public key: 03a61fc84b6429f07fc0edf25265ef7a0ced3cd9a0edea85e9f58b50b5d73f66e7

[COBRAS]

Who want to solve this key?

Transformed/rotated public key: 0334a20e64c9a70138783b125ad81196c76585403905dda56a644ac83ac9620045

On range from 1 to 0x100000000000000000000 ?


Original key public key: 03a61fc84b6429f07fc0edf25265ef7a0ced3cd9a0edea85e9f58b50b5d73f66e7

Im try