Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Kamoheapohea]

They are here. You don't have to believe me. it's just that they won't write in their papers that they are directly dealing with solving the Puzzles from this topic. .  

What the fuck! No they are not here! They do not care about this silly thread where lately only a bunch of newbies divide some public keys.

[digaran]

They are here. You don't have to believe me. it's just that they won't write in their papers that they are directly dealing with solving the Puzzles from this topic. .   

I meant the actual BIG GUNS, not some wannabes, I mean someone like "MinghuaQu" who apparently worked for NSA
And evidence suggest he might be the one generating secp256k1 curve, and I would like to ask him about his selection of N the group order, why this specific value? Why so many leading Fs?
Especially to ask him if he knows that the following keys posses  any unique properties such as some kind of backdoor etc.?

Code:

14551231950b75fc4402da1732fc9bebf
ebaaedce6af48a03bbfd25e8cd0364141

[Kamoheapohea]

I meant the actual ...[some bullshit]

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

[nomachine]

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...I use a trial-and-error method a problem-solving approach where you systematically try different options or solutions until you find one that works or achieves the desired result.
It involves a process of experimentation and learning from your attempts, and it's often used when you don't have a straightforward or known solution to a problem.

You start by making an attempt or trying a particular option, strategy, or input.
In this case it is a random seed.
After your attempt, you carefully observe the results and outcomes. You gather information about what worked and what didn't. You analyze the results to determine if your attempt was successful or not. If it was unsuccessful, you analyze why it didn't work. If something is nonsense, you reject it immediately and move on further. You are NOT holding back like some of the above.

Based on your analysis, you make adjustments to your approach, such as trying a different option, changing a parameter, or using a new strategy.

You repeat the process, trying the adjusted approach or a new option. You continue this cycle until you achieve the desired result or solve the problem. This cycle can last for years.

[digaran]

Seriously what is there to learn from random keys? When you go random on rmd160/addresses, it's like being in a gun fight and shoot blindly with your fingers, not a real gun.

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.

[Woz2000]

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.

[WanderingPhilospher]

E.g. https://en.wikipedia.org/wiki/John_Pollard_(mathematician)

You are right. To be more precise, we use the van Oorschot and Weiner Method of kangaroos.
The van Oorshot and Weiner method of was the fastest kangaroo method for
over 15 years. In this method, there is one ’Tame’ kangaroo (labelled T), and one ’Wild’
kangaroo (labelled W).
I don't even use files (for Tame & Wild) in my script. Everything happens in RAM. (with a bunch of caching and memoization)

Code:

    t = [
        mpz(
            lower_range_limit
            + mpz(random.randint(0, upper_range_limit - lower_range_limit))
        )
        for _ in range(Nt)
    ]
    T = [mulk(ti) for ti in t]
    dt = [mpz(0) for _ in range(Nt)]
    w = [
        mpz(random.randint(0, upper_range_limit - lower_range_limit)) for _ in range(Nw)
    ]
    W = [add_points(W0, mulk(wk)) for wk in w]
    dw = [mpz(0) for _ in range(Nw)]

    Hops, Hops_old = 0, 0

    oldtime = time.time()
    starttime = oldtime

    while True:
        for k in range(Nt):
            Hops += 1
            pw = T[k].x % hop_modulo
            dt[k] = powers_of_two[pw]
            solved = check(T[k], t[k], DP_rarity, T, t, W, w)
            if solved:
                STOP_EVENT.set()
                break
            t[k] = mpz(t[k]) + dt[k]  # Use mpz here
            T[k] = add_points(POINTS_TABLE[pw], T[k])

        for k in range(Nw):
            Hops += 1
            pw = W[k].x % hop_modulo
            dw[k] = powers_of_two[pw]
            solved = check(W[k], w[k], DP_rarity, W, w, T, t)
            if solved:
                STOP_EVENT.set()
                break
            w[k] = mpz(w[k]) + dw[k]  # Use mpz here
            W[k] = add_points(POINTS_TABLE[pw], W[k])

Yeah, this is pointless for higher ranges. Unless you have RAM in the Terabytes.
I don't think most know how Kangaroo actually works.

[digaran]

Another angle to work on #130, there are many ways to manipulate the ranges, I'm just providing the easiest ones.

Code:

400000000000000000000000000000000
282a8bfbda44ad168dfff85563a4be809
17d5740425bb52e9720007aa9c5b417f7

The second and the third keys above could be considered as #130, look what happens when we subtract each of them from the end range, they are the reverse of each other in hex like 8 turns to 7, a=5, b=4, c=3, d=2, e=1, f=0 etc.

What that means, is that if you could find a definitive mathematical/modular relation between such keys, then you could theoretically solve any keys by doing the same subtractions as above.
They are like when added, they generate a composite number divisible by powers of 2.  Only thing you have to figure, is to find a way either by +, -, /, and *, to land on a constant key, for example it doesn't matter what your key is, if you add 10  to 50 and divide by 2, you can get 30 which has a distance of 10 from half of 30(15) to 25 aka half of target.
I mean some relation like that, find that then you can solve any keys.
Let me show you, if you divide both keys and subtract their results, you can have:

Code:

2- 82a8bfbda44ad168dfff85563a4be809
3- aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa28e5131837b7a1186a8bed42070170dc
4- 7fffffffffffffffffffffffffffffff9eabce5229c9b8d24fe8f1f1854114a5
5- 34437fe574eaba29f33302227db7f66a
6- 555555555555555555555555555555551472898c1bdbd08c3545f6a10380b86e
7- 2554c9119ca7a98badb6b861c78366de
8- bfffffffffffffffffffffffffffffff2cad559c6c892c8707dda83f2abbaaf3

Now if you add the results, you will have these :

Code:

2- 200000000000000000000000000000000
3- aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab271f3def1f85c027d536e9b3357980d6
4- 100000000000000000000000000000000
5- 99999999999999999999999999999999a335b7bd9c5ec68a3fe49f2149ba2727
6- 55555555555555555555555555555555938f9ef78fc2e013ea9b74d99abcc06b
7- 9249249249249249249249249249249221887e3aad4e126b490a7f2be4b149dc
8- 80000000000000000000000000000000

Now remember you can always know the second offsets, when you divide and add, if you are interested, try to find a relation between the first 8 offsets and the second 8 offsets, and note that they are only divided by 2 through 8, you can go beyond 2^100 and study the results carefully.
🦟🦟, who let these flies in?

[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]