Bitcoin puzzle transaction ~32 BTC prize to who solves it

[WanderingPhilospher]

Code:

400000000000000000000000000000000
282a8bfbda44ad168dfff85563a4be809
17d5740425bb52e9720007aa9c5b417f7

Really, this is your discovery? Lol.

I found many like this, in decimal format; it is AMAZING:

Code:

110
99
11

110
88
22

1110
888
222

1110
777
333

9=1, 8=2, 7=3, 6=4, etc
After someone solves #130 through #160, I would appreciate a tip, to me, for showing and explaining this extremely, thoroughly etcly.

[btc11235]

We can either try to brute-force the pkeys, and/or we can try to reverse-engineer (also by some amount of brute-force, I guess) and recreate the process by which the pkeys were created...

I just can't quite grok what's happening here  

Let me explain more... [snip]

Thank you for your answers to my posts, they've been helpful I'm curious how many of these you've solved with this method of seeding the random with specific values; was it only #50?

I'd like to review all your posts (and some other users' too) but whenever I go to your profile and click either "Show the last posts of this person" or "Show the last topics started by this person" I don't get any results

...this silly thread where lately only a bunch of newbies divide some public keys.

This is me NGL

[citb0in]

Please everyone, just stop feeding the troll. The ignore button on your left is very useful. I have used it for a long time, but it doesn't work well when others are quoting the troll and prompting more garbage.

I meant the actual ...[some bullshit]

You lower the value of this thread so much by just using it as your personal diary.

absolutely agree! +1

[alek76]

You are right. To be more precise, we use the van Oorschot and Weiner Method of kangaroos.

I imagined if you use Gaudry Schost method (re-place a kangaroo at a new random point as soon as you hit a distinguished point) that you could have an advantage.
Especially when using tame points in the target bitrange and wild points where one or many might not be in the target bit-range (e.g. when having many targets while experimenting with division).

You would kind of saturate the tame DPs more and more while the chance to hit a DP with the wild range increases.

But today I don't think it is of much use.

You can move tame kangaroos like this:

Code:

// Random Tame StartingKey range bnL - bnU
Int TameStartingKey;
Int tsk;
new_tsk:
tsk.Rand(pow2U);
if (tsk.IsLower(&bnL)) goto new_tsk;
TameStartingKey.Set(&tsk);
//
Int tkey;
tkey.Rand(pow2W);
keys[index].SetInt32(0);
keys[index].Add(&TameStartingKey);// Tame keys
keys[index].Add(&tkey);

[nomachine]

I'm curious how many of these you've solved with this method of seeding the random with specific values; was it only #50?

I've tried all possible puzzles from 1 to 50 and iterate over possible seed values, set the seed, generate a random number, and check if it matches target number(WIF in decimal). Solved up to 50.

I tried the same method with #65 and I'm getting an approximate number for now.

Code:

import random
min_number = 18446744073709551615
max_number = 36893488147419103231
random_bytes = b'r\xbd\x83\r\xec}\xfc\xbf\xde'
random.seed(random_bytes)
generated_number = random.randint(min_number, max_number)
print("Seed :", random_bytes)
print("Generated number:", generated_number)

Seed : b'r\xbd\x83\r\xec}\xfc\xbf\xde'
Generated number: 30568377314984161259

And need to be:
30568377312064202855


This approach may take a very long time to find the correct seed value, as it essentially involves brute-forcing all possible seeds. Depending on the range of possible seeds (length in bytes) and the complexity of the random number generator, this process could be impractical. Require an enormous amount of computational resources and time.

What I concluded from everything is that the seed is a value in bytes with 90% certainty. And there is no pattern.
Not a timestamp - can't be reproduced by going back in time.

[k3ntINA]

hi "nomachine"
It is not possible to send private messages.
Please email me if possible.
amir.k3nt@gmail.com

[digaran]

hi "nomachine"
It is not possible to send private messages.
Please email me if possible.

To anyone doing research, working to find solutions etc, please remember not to open any file sent over email, always use precautions to avoid getting infected. I'm not insinuating anything here, this should apply to all matters. As this is a safety precaution. Anyways, good luck.

Good luck everyone with your spam free, troll free thread.😉

[k3ntINA]

Hey "Digaran" do you have to interfere in anything? How about cleaning the toilet?
Pay attention, the people who are here are experts in programming and... they have more knowledge and experience than you and I, but now they don't know what to do?
Why do you think they are ignorant and you are only wise?
I didn't send my findings to you, you obviously have a bad grudge against me, that you make me look like a hacker or a thief!
You are a thief who took another person's email, added a number and thought you were clever. The sewing needle also thought it was sharp and smart, it was in this thought that the thread went into its hole...

[WanderingPhilospher]

Let us give Diagran a chance...

Diagran, this is what I mean by not giving a concrete example:

Let me give you something to work with public keys through +, - only, it's best to use key subtracter.
First select a range and do subtractions in bulk, then pick one of the offsets and perform the same subtraction on it, then pick one of the second offsets and add it to your original target, if you see the distance between your original target and second offset was added to your original target, it means the second offset is not -n, but if you see the distance was subtracted after trying to do addition, it means the 2nd offset is -n, which indicates your second attempt at bulk subtraction, subtracted a larger number than your original key.

Now since you have your ranges saved, you can conclude the size of your target.

Ok, so in trying to follow you:

My target public key is: 033c4a45cbd643ff97d77f41ea37e843648d50fd894b864b0d52febc62f6454f7c
I ran it through keysubtracter, and selected the first offset: 038a9d2ee7775961943a32840dc7c444eae15a4e2a5e211bda0ae586bcae54e289
and ran that first offset back through keysubtracter.
Next, I selected an offset in the second file and added it to my original target public key:
023d659ede74c20f96b7d17eb93b978ea419be26e598e04eaf57e1e05bb097869f  + 033c4a45cbd643ff97d77f41ea37e843648d50fd894b864b0d52febc62f6454f7c = 032bc14141590d389d8926fc02b664df28a44806d94d6dd7852f802fa2423f57ff

Now, when I searched through both files, 032bc14141590d389d8926fc02b664df28a44806d94d6dd7852f802fa2423f57ff was not there. So how am I to know the distance between the second offset pubkey and original target pubkey based on adding the two above?

Explain it to the people. Step by step with examples that can be verified.

[digaran]

I didn't send my findings to you, you obviously have a bad grudge against me, that you make me look like a hacker or a thief!
You are a thief who took another person's email, added a number and thought you were clever. The sewing needle also thought it was sharp and smart, it was in this thought that the thread went into its hole...

Ok, for clarification, I never contacted you, one day I received a PM from you asking me to join telegram and whatnot, I said share whatever you have here, then you sent another PM with your email address asking me to email you, which I did, then after a week and after a few email exchanging, you asked what type of file is more convenient for me, THEN I said if you want to send any file, upload it on a file sharing service on the cloud.
After that you said some bs about my email address, which is totally irrelevant because you don't even know me and I never gave you my  name etc, so accusing me of impersonation and theft is a shame on you not mine.
Now if you have nothing to hide, why don't you share your findings here for all to see?
Remember what I said about whacking anyone touching people's coins? Now thread your needle carefully.😉
@WP, lets not give "Diagran" a chance, after all people in here should know a few things about modular operations to know that won't work, at least not that simply.

[k3ntINA]

The reason why I asked you for a telegram or email was because of the type of my user account because there is a limit for sending private messages.
Because you did not introduce yourself, even your name and... is not suspicious? I searched and exactly your email, without the last numbers, belonged to a person who had a high level of education.
If you are that person who wants to remain anonymous, you don't create an original email with a numerical difference at the end, and you avoid saying your email, which is the same as your name, at the beginning of the conversation, and most importantly, considering that we speak the same language, that person lives in another country. And I did not see anything from our own country in his resume.
** You insulted first that after my post, you quickly sent a warning to the members to be aware.
Do you really assume that all these people in the forum are beginners?
In any case, this is not the place for these conversations to fill the pages with marginal issues, you should also learn that you are not supposed to send answers on every issue...
Definitely, if it could be made public, I would have sent it. There is a need to investigate something that I am not able to solve this phenomenon, and Google did not find anything for me, and unfortunately, professional programmer friends here seem to be busy and do not have time to see my work...
Of course, some friends also sent messages, but I saw that they had no history in the forum and I could not trust them.
Friends, I apologize for the off-topic post.

[alek76]

Hi again everyone. I added mods with different ways of generating keys. The getKeysFromRandomSeed() function is made in two versions, located in folders 005 and 006, respectively. Just replace the files and rebuild the project.
https://github.com/alek76-2/VanitySearch/tree/main/mod/005
https://github.com/alek76-2/VanitySearch/tree/main/mod/006
logs:

Code:

VanitySearch_bit66_hb03.exe -stop -t 1 -bits 66 -r 10 -level 0 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
[ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ]
[                                                           ]
[===========================================================]
[                Changes by Alek76 modify 0.05              ]
[===========================================================]
[          Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9         ]
[===========================================================]
[    Options added argv [-start] [-bits] and disable SSE    ]
[                                                           ]
[ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ]
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so [Compressed]
Start Sat Nov  4 19:48:20 2023
Base Key: Randomly changed every 10 Mkeys
Number of CPU thread: 1
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 3E83B482ABFAF4B33
[1.08 Mkey/s][GPU 0.00 Mkey/s][Total 2^23.37][Prob 0.0%][50% in 2.97319e+34y][Found 0]
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 38C4111B5590EB61D
[1.03 Mkey/s][GPU 0.00 Mkey/s][Total 2^24.33][Prob 0.0%][50% in 3.11891e+34y][Found 0]
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 36524D9A4683DCF53
[1.03 Mkey/s][GPU 0.00 Mkey/s][Total 2^24.90][Prob 0.0%][50% in 3.11697e+34y][Found 0]
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 3DAEDA8D12C373053
[1.03 Mkey/s][GPU 0.00 Mkey/s][Total 2^25.16][Prob 0.0%][50% in 3.11948e+34y][Found 0]

[WanderingPhilospher]

Hi again everyone. I added mods with different ways of generating keys. The getKeysFromRandomSeed() function is made in two versions, located in folders 005 and 006, respectively. Just replace the files and rebuild the project.
https://github.com/alek76-2/VanitySearch/tree/main/mod/005
https://github.com/alek76-2/VanitySearch/tree/main/mod/006
logs:

Code:

VanitySearch_bit66_hb03.exe -stop -t 1 -bits 66 -r 10 -level 0 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
[ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ]
[                                                           ]
[===========================================================]
[                Changes by Alek76 modify 0.05              ]
[===========================================================]
[          Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9         ]
[===========================================================]
[    Options added argv [-start] [-bits] and disable SSE    ]
[                                                           ]
[ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ]
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so [Compressed]
Start Sat Nov  4 19:48:20 2023
Base Key: Randomly changed every 10 Mkeys
Number of CPU thread: 1
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 3E83B482ABFAF4B33
[1.08 Mkey/s][GPU 0.00 Mkey/s][Total 2^23.37][Prob 0.0%][50% in 2.97319e+34y][Found 0]
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 38C4111B5590EB61D
[1.03 Mkey/s][GPU 0.00 Mkey/s][Total 2^24.33][Prob 0.0%][50% in 3.11891e+34y][Found 0]
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 36524D9A4683DCF53
[1.03 Mkey/s][GPU 0.00 Mkey/s][Total 2^24.90][Prob 0.0%][50% in 3.11697e+34y][Found 0]
[i] Generate Keys HMAC-SHA512 1024 Rounds From Random SEED
Bit 66 CPU Base Key thId 0: 3DAEDA8D12C373053
[1.03 Mkey/s][GPU 0.00 Mkey/s][Total 2^25.16][Prob 0.0%][50% in 3.11948e+34y][Found 0]

Cool features.

I peeked into your random bits code and it is wonky. A lot of code to make sure it falls within the 2000…3FFF… (66 bitrange)

[alek76]

Cool features.

I peeked into your random bits code and it is wonky. A lot of code to make sure it falls within the 2000…3FFF… (66 bitrange)

But it’s reliable, let him check) There, he also added cleaning to prevent memory leaks. You can change the algorithm in mod 006. After the random seed, do the sha256 function and then the HMAC-SHA512 function. The number of rounds can be set to any value. here - #define hmac_sha512_nb_round 2048.
I think the mod 005 algorithm is better, I like it better)

[WanderingPhilospher]

Cool features.

I peeked into your random bits code and it is wonky. A lot of code to make sure it falls within the 2000…3FFF… (66 bitrange)

But it’s reliable, let him check) There, he also added cleaning to prevent memory leaks. You can change the algorithm in mod 006. After the random seed, do the sha256 function and then the HMAC-SHA512 function. The number of rounds can be set to any value. here - #define hmac_sha512_nb_round 2048.

I’ll take your word; I was just saying it seems like a lot of code.

I rewrote the Rand function.

My old way, for #66 as an example, would have been to set
Base key at 0x2000…
And then use the Rand function you are using, with an nbit flag and pass a 65 to it.

But got tired of passing a base key when I wanted to change ranges.

[nomachine]

I am currently testing the speed of fastecdsa.encoding for h160

Code:

import os
import time, hashlib, binascii
from fastecdsa.encoding.sec1 import SEC1Encoder
from fastecdsa.curve import secp256k1
from contextlib import contextmanager

@contextmanager
def timing(label):
    start_time = time.time()
    try:
        yield
    finally:
        end_time = time.time()
        elapsed_time = end_time - start_time
        print(f"{label} Average Time: {elapsed_time:.8f} seconds")

dec = 30568377312064202855
def generate_h160():
    h160 = hashlib.new('ripemd160', hashlib.sha256(bytes.fromhex(binascii.hexlify(SEC1Encoder.encode_public_key(secp256k1.G * dec, compressed=True)).decode('utf-8'))).digest()).digest()
    return h160

with timing("generate_h160"):
    h160 = generate_h160()
    print(h160.hex())

3b510a18bbf7b99bf5d2bdcde07a76bddda8f376
generate_h160 Average Time: 0.00011618 seconds

This is very fast...Very close to secp256k1 as ice:

Code:

def generate_h160():
    h160 = ice.privatekey_to_h160(2, True, dec)
    return h160

 About ~30x faster than normal ecdsa in python

[dextronomous]

this shit is sick, fast, i mean, go go nomachine we will overcome all,

52e763a7ddc1aa4fa811578c491c1bc7fd570137
generate_h160 Average Time: 0.00000000 seconds

now alek, can you send a exe to pm or github. thanks man.

[alek76]

now alek, can you send a exe to pm or github. thanks man.

The program takes exactly 1 minute to assemble. These mods don't need OpenSSL, you don't have to build it if it's difficult for you. Just replace Int.cpp, Int.h and Random.cpp, Random.h with the original ones and comment out the lines #include <openssl.... The original files are in the root directory. I think it's worth learning how to assemble programs. Understand correctly, I can’t keep up with all the adjustments. In essence, this is a branching of the code; for this purpose, the “mod” directory has been added.

[digaran]

About ~30x faster than normal ecdsa in python

Why only 1 hash? 1 hash can not determine the overall speed, if you want to see the actual speed rate, you'd have to benchmark your code by going in a loop, set a range and generate 1 billion rmd160, then check the time, after all you are going to generate trillions of them when brute forcing. Base your upgrades on bulk generation of hashes, if your speed is 100M/s, 2M more or less is not significant. 5M, 10M? That's something.

[alek76]

That's something.

1 / 0.00011618 = 8607 Keys/s. But in fact it is more. To reduce measurement time, you need to generate more than 10,000 hashes in a cycle, preferably tens of millions. Then the measurement time is not actually counted, and the result will be more plausible.