Quote
is there any tutorial for searching hash160 using keyhunt on vast.ai ? i am new here , thanks
This sounds too strange for a newbie in here. You might be a dev out there but what do I know. I suggest you open a thread with this as an OP
Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 140. (Read 230098 times)
This sounds too strange for a newbie in here. You might be a dev out there but what do I know. I suggest you open a thread with this as an OP
;DLet me see, friends, is there a program that receives a photo file and then analyzes it, i.e. separates objects, people or animals, letters, numbers and colors and then makes a wallet from this information?
Yes, but you will have to wait a few years for it to be coded, since it's a new idea and also very insecure way, but if you already know what each color should represent, either they should represent 1 digit, decimal or hex, in which order? From which side/angle? Top to bottom-Left to right? What kind of algorithm is similar to convert people, animals to numbers and what should be the factors, who decides whether a man or woman should convert to what exactly?That requires an artificial intelligence with advanced algos, it's not an easy or even useful one to bother.
I mean, why do you think these keys are special? Why are you fixated on these keys in particular?
Just a simple example, when you multiply a point by lambda 2 times, you get 3 identical y coordinates, and if you divide or multiply those 3 points by the same scalar, the results will also have identical y coordinates, not to mention beta a1,a2, b1, b2 etc.
So when I share and talk about them, I hope someone who knows more and better to add to the discussion by providing more interesting facts.
That didn't answer my question. What makes you assume 0x14551231950b75fc4402da1732fc9bebf is more interesting than 0x14551231950b75fc4402da1732fc9bec0 or 0x14551231950b75fc4402da1732fc9bebe?
is there any tutorial for searching hash160 using keyhunt on vast.ai ? i am new here , thanks
;DLet me see, friends, is there a program that receives a photo file and then analyzes it, i.e. separates objects, people or animals, letters, numbers and colors and then makes a wallet from this information?
Yes, but you will have to wait a few years for it to be coded, since it's a new idea and also very insecure way, but if you already know what each color should represent, either they should represent 1 digit, decimal or hex, in which order? From which side/angle? Top to bottom-Left to right? What kind of algorithm is similar to convert people, animals to numbers and what should be the factors, who decides whether a man or woman should convert to what exactly?That requires an artificial intelligence with advanced algos, it's not an easy or even useful one to bother.
I mean, why do you think these keys are special? Why are you fixated on these keys in particular?
Just a simple example, when you multiply a point by lambda 2 times, you get 3 identical y coordinates, and if you divide or multiply those 3 points by the same scalar, the results will also have identical y coordinates, not to mention beta a1,a2, b1, b2 etc.
So when I share and talk about them, I hope someone who knows more and better to add to the discussion by providing more interesting facts.
What makes them different than any other "low" range keys, like for example 0x123456789123456789123456789? How would they help in solving?
Guess that's the million dollar question, we want to know what sets them apart, what mathematical properties they have when being divided specifically compared to other keys. And if you are asking me about their differences with other keys, means you are also clueless like me and the rest of the world, until of course we find a clue. It's a bit difficult for me to work behind a desk with a PC, I'm on a bed doing things slowly with a phone.😉
I mean, why do you think these keys are special? Why are you fixated on these keys in particular?
;DLet me see, friends, is there a program that receives a photo file and then analyzes it, i.e. separates objects, people or animals, letters, numbers and colors and then makes a wallet from this information?
What makes them different than any other "low" range keys, like for example 0x123456789123456789123456789? How would they help in solving?
Guess that's the million dollar question, we want to know what sets them apart, what mathematical properties they have when being divided specifically compared to other keys. And if you are asking me about their differences with other keys, means you are also clueless like me and the rest of the world, until of course we find a clue. It's a bit difficult for me to work behind a desk with a PC, I'm on a bed doing things slowly with a phone.😉
Not sure why you think those keys have a backdoor. 14551231950b75fc4402da1732fc9bebf is what you get if you pick (2**256-1) as a private key, which is above the group order, so mod 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141 it becomes 14551231950b75fc4402da1732fc9bebf. Likewise, ebaaedce6af48a03bbfd25e8cd0364141 is just the group order with the upper 0xfffffff... removed.
I don't think N was chosen intentionally having such backdoors, but I do think those keys I mentioned could help in solving low range keys only if we know the exact starting/ending range. Though my fascination about this one 14551231950b75fc4402da1732fc9bebf is different, because some people might think every key will result in some specific value when divided, but the key above is the evidence of how wrong we could be sometimes. Just like when you divide that by 2^255 mod n, you'd get "2" as the result, of course once you know that, it's not anything interesting, that's why I'm eager to learn more about other similar keys with similar properties.
What makes them different than any other "low" range keys, like for example 0x123456789123456789123456789? How would they help in solving?
I finally have 2^30.75+ (1,806,000,000) wild kangaroo points stored (offsets of #130s public key). Now it's time to release the tame kangaroos. Hopefully within 2-3 months, I'll have a tame land on a wild trap.
I imagine I am behind the group that found #120 & #125, but maybe luck will be on my side.
Long journey ahead, let's go.
I imagine I am behind the group that found #120 & #125, but maybe luck will be on my side.
Long journey ahead, let's go.
May the force BTC with you
Not sure why you think those keys have a backdoor. 14551231950b75fc4402da1732fc9bebf is what you get if you pick (2**256-1) as a private key, which is above the group order, so mod 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141 it becomes 14551231950b75fc4402da1732fc9bebf. Likewise, ebaaedce6af48a03bbfd25e8cd0364141 is just the group order with the upper 0xfffffff... removed.
I don't think N was chosen intentionally having such backdoors, but I do think those keys I mentioned could help in solving low range keys only if we know the exact starting/ending range. Though my fascination about this one 14551231950b75fc4402da1732fc9bebf is different, because some people might think every key will result in some specific value when divided, but the key above is the evidence of how wrong we could be sometimes. Just like when you divide that by 2^255 mod n, you'd get "2" as the result, of course once you know that, it's not anything interesting, that's why I'm eager to learn more about other similar keys with similar properties.
I finally have 2^30.75+ (1,806,000,000) wild kangaroo points stored (offsets of #130s public key). Now it's time to release the tame kangaroos. Hopefully within 2-3 months, I'll have a tame land on a wild trap.
I imagine I am behind the group that found #120 & #125, but maybe luck will be on my side.
Long journey ahead, let's go.
I imagine I am behind the group that found #120 & #125, but maybe luck will be on my side.
Long journey ahead, let's go.
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 NSAAnd 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
Not sure why you think those keys have a backdoor. 14551231950b75fc4402da1732fc9bebf is what you get if you pick (2**256-1) as a private key, which is above the group order, so mod 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141 it becomes 14551231950b75fc4402da1732fc9bebf. Likewise, ebaaedce6af48a03bbfd25e8cd0364141 is just the group order with the upper 0xfffffff... removed.
Puzzle 66: #?
?
What do we observe here? All colors are unknown. If a color is known, skip these 3 bytes, if a color is unknown, take these 3 bytes and process them on the GPU for an additional 6 bytes within the range of 200000:3fffff.
I'm speechless, truly amazing how some people are capable of turning ideas in to reality.? What do we observe here? All colors are unknown. If a color is known, skip these 3 bytes, if a color is unknown, take these 3 bytes and process them on the GPU for an additional 6 bytes within the range of 200000:3fffff.
Can you explain a bit more about the logic you are using in the quote above?
I'm interested to know more about skipping bytes, additional 6 bytes etc. Is there any pattern or any reproducible results if one had to follow your instructions?
Code:
import matplotlib.pyplot as plt
from matplotlib.patches import Rectangle
from webcolors import hex_to_name
def hex_to_rgb(hex_value):
hex_value = hex_value.lstrip('#')
return tuple(int(hex_value[i:i+2], 16) for i in (0, 2, 4))
def display_color_info(hex_colors):
fig, ax = plt.subplots(figsize=(12, len(hex_colors) * 2))
count = 0
for i, hex_value in enumerate(hex_colors):
hex_value = hex_value[:7]
rgb_values = hex_to_rgb(hex_value)
try:
color_name = hex_to_name(hex_value, spec='css3')
except ValueError:
color_name = "Unknown"
strip_line = Rectangle((0, i), 1, 1, color=hex_value, ec='k')
ax.add_patch(strip_line)
count += 1
counter = format(count, '02')
ax.text(1.2, i + 0.5, f"puzzle : {counter} | color : {color_name} | Hex : {hex_value}", va='center', fontsize=12)
ax.set_xlim(0, 2)
ax.set_ylim(0, len(hex_colors))
ax.axis('off')
plt.tight_layout()
plt.show()
int_list = [1, 3, 7, 8, 21, 49, 76, 224, 467, 514, 1155, 2683, 5216, 10544, 26867, 51510, 95823, 198669, 357535, 863317, 1811764, 3007503, 5598802, 14428676, 33185509, 54538862, 111949941, 227634408, 400708894, 1033162084, 2102388551, 3093472814, 7137437912, 14133072157, 20112871792, 42387769980, 100251560595, 146971536592, 323724968937, 1003651412950, 1458252205147, 2895374552463, 7409811047825, 15404761757071, 19996463086597, 51408670348612, 119666659114170, 191206974700443, 409118905032525, 611140496167764, 2058769515153876, 4216495639600700, 6763683971478124, 9974455244496707, 30045390491869460, 44218742292676575, 138245758910846492, 199976667976342049, 525070384258266191, 1135041350219496382, 1425787542618654982, 3908372542507822062, 8993229949524469768, 17799667357578236628, 30568377312064202855]
hex_colors = ["#" + ("%06X" % integer_value) for integer_value in int_list]
display_color_info(hex_colors)
Puzzle 66: #?
? What do we observe here? All colors are unknown. If a color is known, skip these 3 bytes, if a color is unknown, take these 3 bytes and process them on the GPU for an additional 6 bytes within the range of 200000:3fffff.
I made new code:
https://github.com/alek76-2/VanitySearch/tree/main/mod/009
This modification does not use OpenSSL.
Word list BIP-39 is connected. Added inclusion of the BrainWallet algorithm.
Number of words 1-16. Seed can be in HEX format with a length of 128 bits.
You can set an arbitrary seed with the -s option.
Repeat the seed from the one saved earlier in the Result.txt file.
Run cmd: VanitySearch.exe -stop -t 1 -bip39 12 -bits 66 -r 1 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
p.s. I don't have GPU computing resources, so I'm leaving this thread. And as soon as a normal post
appears, “First People” ("Pervonah") immediately appear and start new pages. Good luck.
https://github.com/alek76-2/VanitySearch/tree/main/mod/009
This modification does not use OpenSSL.
Word list BIP-39 is connected. Added inclusion of the BrainWallet algorithm.
Number of words 1-16. Seed can be in HEX format with a length of 128 bits.
You can set an arbitrary seed with the -s option.
Repeat the seed from the one saved earlier in the Result.txt file.
Run cmd: VanitySearch.exe -stop -t 1 -bip39 12 -bits 66 -r 1 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Code:
[ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ]
[ ]
[===========================================================]
[ Changes by Alek76 modify 0.09 ]
[===========================================================]
[ Tips: 1NULY7DhzuNvSDtPkFzNo6oRTZQWBqXNE9 ]
[===========================================================]
[ Options added argv [-start] [-bits] and disable SSE ]
[===========================================================]
[ Options added argv [-bip39] [-brainwallet] ]
[===========================================================]
[ Used Mersenne Twister PRNG and Seed of Unix time ]
[===========================================================]
[ ]
[ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ]
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so [Compressed]
[i] startKey Seed: giraffe salon quality estate seven father famous luxury sudden milk dash then
Start Fri Nov 10 01:46:59 2023
Base Key: Randomly changed every 1 Mkeys
Number of CPU thread: 1
[i] mod_009 Seed: peanut runway settle system noodle drum rural shrimp episode method steel away
Bit 66 CPU Base Key thId 0: 393829E6F495F0B02
[1.29 Mkey/s][GPU 0.00 Mkey/s][Total 2^21.30][Prob 0.0%][50% in 2.49269e+34y][Found 0]
[i] mod_009 Seed: canal wide hedgehog good aim lazy toddler survey undo logic budget come
Bit 66 CPU Base Key thId 0: 326A1AB38911F16C5
[1.16 Mkey/s][GPU 0.00 Mkey/s][Total 2^22.15][Prob 0.0%][50% in 2.77189e+34y][Found 0]
[i] mod_009 Seed: strong unaware neck other own around innocent wild eyebrow solar segment chef
Bit 66 CPU Base Key thId 0: 32B5E3AF43D6FB813
[1.12 Mkey/s][GPU 0.00 Mkey/s][Total 2^22.68][Prob 0.0%][50% in 2.87721e+34y][Found 0]
[i] mod_009 Seed: metal rocket deliver allow home dash wife wedding display chimney will bulb
Bit 66 CPU Base Key thId 0: 39AE7F167550007FD
[1.10 Mkey/s][GPU 0.00 Mkey/s][Total 2^23.07][Prob 0.0%][50% in 2.93188e+34y][Found 0]
[i] mod_009 Seed: actual essence civil observe armor hungry mutual belt vintage grit shed hurt
Bit 66 CPU Base Key thId 0: 37A206E198B6912B1
[1.08 Mkey/s][GPU 0.00 Mkey/s][Total 2^23.37][Prob 0.0%][50% in 2.96961e+34y][Found 0]
[i] mod_009 Seed: island gift message track behave loan conduct address sound decade kangaroo luggage
Bit 66 CPU Base Key thId 0: 36385D9324096E25D
[1.07 Mkey/s][GPU 0.00 Mkey/s][Total 2^23.62][Prob 0.0%][50% in 2.99965e+34y][Found 0]
[i] mod_009 Seed: enact anchor start slow advance goddess april track juice drill notable silent
Bit 66 CPU Base Key thId 0: 3D35D1A8ACEC3659B
[1.06 Mkey/s][GPU 0.00 Mkey/s][Total 2^23.83][Prob 0.0%][50% in 3.01685e+34y][Found 0]
[i] mod_009 Seed: sick bus foam city razor pencil diet top slim air bright urge
Bit 66 CPU Base Key thId 0: 3F13992CABC7127CC
appears, “First People” ("Pervonah") immediately appear and start new pages. Good luck.
OK. Genius. I left this thread. If you wanted it, you succeeded. Enjoy your intelligence alone.
Don't do that, never back down from a challenge, especially this one which is a world stage class challenge. If you are discouraged, find the courage to keep going forward.Remember I talked about this?
Code:
Imagine this is #130
00000000000000000000000000000002c56510da49e97b94ca065bbdfb67309c
And this is -n of 130
fffffffffffffffffffffffffffffffbf549cc0c655f24a6f5cc02ced4cf10a5
What happens if you drop all the leading Fs from -n of 130?
bf549cc0c655f24a6f5cc02ced4cf10a5
Code:
f549cc0c655f24a6f5cc02ced4cf10a5
All you have to do is to calculate their percentage differences, then from there you could potentially reduce the bit range by guess work, and even if you have to guess 100 million keys, which is not the case, because with this method you can pretty much reach a very low range result after 1000 guesses, but lets multiply that by 100, you will have 100k offsets with one of them being a low as 65 bit low key. Then you can unleash savage kangaroos to catch the correct key.😉
I see other than *A holes, we also have artists here, is that Nicholas cage?
Code:
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⣴⣾⣿⣿⣿⣿⡿⠿⠿⠛⠻⠿⣷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⡿⠟⠋⠁⠀⠀⠀⠀⠀⠀⠀⠙⢷⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⠟⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣀⣻⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⣿⣿⣿⡿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠟⠉⠉⢳⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⣠⡴⠶⠦⡄⠀⠀⠈⠃⡴⢻⣷⣾⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⣿⣆⠀⠀⠀⠞⠁⢀⣴⣶⠦⡄⠐⡆⠸⣟⠚⠋⠁⠈⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⠀⠀⠀⠀⠀⢯⣸⣿⠟⠃⠀⢷⠀⠈⠣⠀⠀⠀⠈⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⠟⠀⠀⠀⢨⡷⣄⠀⢿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣿⣿⣿⣿⡟⠛⠿⢿⡄⠀⠀⠀⠀⠀⠀⠀⠀⠈⠀⠐⠛⠀⠀⠀⠙⠆⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⣿⣿⣿⡹⣄⡶⠀⠀⠀⠀⠀⠀⠀⠀⢀⣦⠀⠀⠀⣀⡤⠴⣶⠀⠀⢸⣦⣤⣄⣀⡀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⣤⣽⣿⣿⣧⡻⣷⣦⣀⡀⠀⠀⠀⠀⠀⠈⠙⠂⢶⣯⣥⣴⣾⠏⠀⠀⣼⣿⣿⣿⣿⣿⣿⣷⣦⣤⣀
⠀⠀⢀⣠⣤⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣤⡰⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠁⠀⠀⠀⢹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
One has to wonder, what is he looking at? 😅
*= not WP though, he is one of the best in these woods.😘
Thanks for the code. I've compiled working binaries for CCAP89 already. I'll play around with the multi arch. stuff when I get some time!!
RTX 4070 Ti compute capability 8.9
1. Update/Install CUDA toolkit 12.3
2. Add this code in GPUEngine.cu:
In file VanitySearch.vcxproj replace CUDA 10.2.props and CUDA 10.2.targets to CUDA 12.3.props and CUDA 12.3.targets
3. In project properties -> CUDA C/C++ -> DEVICE -> CODE GENERATION -> add:
Apply -> OK
4. Choose Build Solution from the Build menu Visual Studio.
Or linux build: make gpu=1 ccap=89 all
It seems so
1. Update/Install CUDA toolkit 12.3
2. Add this code in GPUEngine.cu:
Code:
{0x75, 64},
{0x80, 64},
{0x86, 128},
{0x87, 128},
{0x89, 128},
//{0x90, 128},
{-1, -1} };
3. In project properties -> CUDA C/C++ -> DEVICE -> CODE GENERATION -> add:
Code:
compute_80,sm_80
compute_86,sm_86
compute_87,sm_87
compute_89,sm_89
4. Choose Build Solution from the Build menu Visual Studio.
Or linux build: make gpu=1 ccap=89 all
It seems so
Find the code and look for something like this:
Usually in GPUEngine.cu
Add in what you need.
I’m away from PC, when I get back to it, I’ll post what you need if you haven’t found or figured it out by then.
Code:
sSMtoCores nGpuArchCoresPerSM[] = {
{0x20, 32}, // Fermi Generation (SM 2.0) GF100 class
{0x21, 48}, // Fermi Generation (SM 2.1) GF10x class
{0x30, 192},
{0x32, 192},
{0x35, 192},
{0x37, 192},
{0x50, 128},
{0x52, 128},
{0x53, 128},
{0x60, 64},
{0x61, 128},
{0x62, 128},
{0x70, 64},
{0x72, 64},
{0x75, 64},
Add in what you need.
I’m away from PC, when I get back to it, I’ll post what you need if you haven’t found or figured it out by then.
I didn't know that. Is it just adding multiple COMPUTE_CAP= in the cli? How to do it in the Makefile with the variable?
Windows and Linux.
I’ve ran 40xx cards and 30xx, 20xx cards all from same exe.
Thanks. My question appears to be irrelevant as it seems the hardware (CCAP8.9) is not backwards compatible to the compiled code (CCAP7.5). I will have to recompile everything with the proper CCAP. Messy since I now have to keep track of multiple architectures.
You can compile multiple CCAPs within the same code/exe. I've acquired a new RTX4070 to add to my aging set of Nvidia cards. Does anyone know if any of the software (Kangaroo, Keyhunt, Bitcrack) take advantage of CCap higher than 7.5? I'm pretty sure none of them do since none of them (except keyhunt) has had recent development.
Two of the newest programs within the past 6 months are https://github.com/Etayson/Etarkangaroo and https://github.com/ilkerccom/bitcrackrandomiser . Hope that helpsWindows and Linux.
I’ve ran 40xx cards and 30xx, 20xx cards all from same exe.
Jump to: