alexxino
Newbie
Offline
Activity: 14
Merit: 0
|
|
September 24, 2024, 09:13:45 AM |
|
Maybe he/she is just a brilliant mind...and that person knows a way to reuse the DPs from 120,125 to find 130 and the rest. I would like to know how he/she did it !
|
|
|
|
virus-cyber
Newbie
Offline
Activity: 26
Merit: 0
|
|
September 24, 2024, 09:17:10 AM |
|
Maybe he/she is just a brilliant mind...and that person knows a way to reuse the DPs from 120,125 to find 130 and the rest. I would like to know how he/she did it ! it's simple, he uses https://github.com/JeanLucPons/Kangaroo
|
|
|
|
nomachine
Member
Offline
Activity: 476
Merit: 35
|
|
September 24, 2024, 09:17:29 AM |
|
Something else is happening here.
I think we are slowly sinking into conspiracy theories.
|
bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
|
|
|
AlanJohnson
Member
Offline
Activity: 126
Merit: 11
|
|
September 24, 2024, 09:40:52 AM |
|
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script... Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs. 120 is also solved by 3Emi. This 3Emi guy is definitely hiding something, or the creator himself.. Key 130 was found by the same person as the previous two. I think he used Kangaro, and this person is a miner. The timing is roughly consistent. I also don't think he will share the keys he found and how exactly he found them. yeah I agree. I am using vanity for the small ones. For example there are around 10 Billion addresses starts with "1BY8G" between 2^66 and 2^67. I run 10 vanity search instances and daily around 300 unique addresses found. It is kind of a lottery for me. 300/10B is very good probability. As for using Kangaroo method for 130bit ... as far as i know none of the publicly available software was able to do it cause they were limited to 125 or 128 bit (i don't remember). BTW How is vanity search "better" than normal brute force ? Isn't it like you still just randomly generate private keys and check if they match given address ? If so ... then all you do is saving addresses that starts with the same characters but it doesn't increase your chances. Correct me please if i'm wrong.
|
|
|
|
AlanJohnson
Member
Offline
Activity: 126
Merit: 11
|
|
September 24, 2024, 09:42:11 AM |
|
Something else is happening here.
I think we are slowly sinking into conspiracy theories. That would be cool... at least some fun here cause it's obvious we're not gonna find anything.
|
|
|
|
virus-cyber
Newbie
Offline
Activity: 26
Merit: 0
|
|
September 24, 2024, 09:52:38 AM |
|
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script... Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs. 120 is also solved by 3Emi. This 3Emi guy is definitely hiding something, or the creator himself.. Key 130 was found by the same person as the previous two. I think he used Kangaro, and this person is a miner. The timing is roughly consistent. I also don't think he will share the keys he found and how exactly he found them. yeah I agree. I am using vanity for the small ones. For example there are around 10 Billion addresses starts with "1BY8G" between 2^66 and 2^67. I run 10 vanity search instances and daily around 300 unique addresses found. It is kind of a lottery for me. 300/10B is very good probability. As for using Kangaroo method for 130bit ... as far as i know none of the publicly available software was able to do it cause they were limited to 125 or 128 bit (i don't remember). BTW How is vanity search "better" than normal brute force ? Isn't it like you still just randomly generate private keys and check if they match given address ? If so ... then all you do is saving addresses that starts with the same characters but it doesn't increase your chances. Correct me please if i'm wrong. https://github.com/ZenulAbidin/Kangaroo-256
|
|
|
|
nomachine
Member
Offline
Activity: 476
Merit: 35
|
|
September 24, 2024, 09:53:15 AM |
|
BTW How is vanity search "better" than normal brute force ? Isn't it like you still just randomly generate private keys and check if they match given address ?
I have almost the same speed in Rust or using vanity search SECP256K1 in random mode. Even with the fastest random SmallRng, BTC hashing is a bottleneck.
|
bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
|
|
|
citb0in
|
|
September 24, 2024, 10:03:33 AM |
|
non-functional abandoned tool. Any other Kangaroo version known that is known to be usable for >128bit ranges ?
|
_______. ______ __ ______ ______ __ ___ .______ ______ ______ __ ______ .______ _______ / | / __ \ | | / __ \ / || |/ / | _ \ / __ \ / __ \ | | / __ \ | _ \ / _____| | (----`| | | | | | | | | | | ,----'| ' / | |_) | | | | | | | | | | | | | | | | |_) | | | __ \ \ | | | | | | | | | | | | | < | ___/ | | | | | | | | | | | | | | | / | | |_ | .----) | | `--' | | `----.| `--' | __| `----.| . \ | | | `--' | | `--' | | `----.__| `--' | | |\ \----.| |__| | |_______/ \______/ |_______| \______/ (__)\______||__|\__\ | _| \______/ \______/ |_______(__)\______/ | _| `._____| \______| | 2% fee anonymous solo bitcoin mining for all at https://solo.CKpool.org | No registration required, no payment schemes, no pool op wallets, no frills, no fuss. |
|
|
|
|
|
citb0in
|
|
September 24, 2024, 10:27:38 AM |
|
sad we cannot see the diff to JLP's original kangaroo tool. Anyone dived into mikorists' code and can share some thoughts about the changes and implementation routines ?
|
_______. ______ __ ______ ______ __ ___ .______ ______ ______ __ ______ .______ _______ / | / __ \ | | / __ \ / || |/ / | _ \ / __ \ / __ \ | | / __ \ | _ \ / _____| | (----`| | | | | | | | | | | ,----'| ' / | |_) | | | | | | | | | | | | | | | | |_) | | | __ \ \ | | | | | | | | | | | | | < | ___/ | | | | | | | | | | | | | | | / | | |_ | .----) | | `--' | | `----.| `--' | __| `----.| . \ | | | `--' | | `--' | | `----.__| `--' | | |\ \----.| |__| | |_______/ \______/ |_______| \______/ (__)\______||__|\__\ | _| \______/ \______/ |_______(__)\______/ | _| `._____| \______| | 2% fee anonymous solo bitcoin mining for all at https://solo.CKpool.org | No registration required, no payment schemes, no pool op wallets, no frills, no fuss. |
|
|
|
|
ihsotas91
Newbie
Offline
Activity: 16
Merit: 0
|
|
September 24, 2024, 10:57:24 AM |
|
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script... Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs. 120 is also solved by 3Emi. This 3Emi guy is definitely hiding something, or the creator himself.. Key 130 was found by the same person as the previous two. I think he used Kangaro, and this person is a miner. The timing is roughly consistent. I also don't think he will share the keys he found and how exactly he found them. yeah I agree. I am using vanity for the small ones. For example there are around 10 Billion addresses starts with "1BY8G" between 2^66 and 2^67. I run 10 vanity search instances and daily around 300 unique addresses found. It is kind of a lottery for me. 300/10B is very good probability. As for using Kangaroo method for 130bit ... as far as i know none of the publicly available software was able to do it cause they were limited to 125 or 128 bit (i don't remember). BTW How is vanity search "better" than normal brute force ? Isn't it like you still just randomly generate private keys and check if they match given address ? If so ... then all you do is saving addresses that starts with the same characters but it doesn't increase your chances. Correct me please if i'm wrong. For the one which does not have public key and small I am using this just for fun. If it does not have public key, and you brute force between 2^66 and 2^67, and if you check 1B records per second, your chance will be 1B * 60 * 60 * 24 / 2^66 per day. Currently 10 vanity instances find 300-400 unique records per day, and as I explained there are approximately 10B addresses starts with "1BY8G" between 2^66 and 2^67. However most probably vanity will stuck when the count reaches big numbers because it will hit same addresses most probably and the find rate will decrease. I did not say it is better than brute forcing, I just enjoy this way of doing the search. It will be around 100K vanity records per year, if I am lucky it will hit that address, if not who cares
|
|
|
|
COBRAS
Member
Offline
Activity: 997
Merit: 23
|
|
September 24, 2024, 11:53:04 AM Last edit: September 24, 2024, 08:57:31 PM by Mr. Big |
|
1Prestige1zSYorBdz94KA2UbJW3hYLTn4 has been emptied half hour ago Probably owner get fear from script... Seems that 125 puzzle and 130 puzzle BTC are sit on 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs. 120 is also solved by 3Emi. This 3Emi guy is definitely hiding something, or the creator himself.. 120 solved by jeanlyckpons, developer if kangaroo in thread Technical develepment
Companies that use a large number of GPUs, especially at the scale of 20,000 or more 1.Google 2.Amazon (AWS) 3.NVIDIA 4.Meta (Facebook) 5.Tesla: Tesla Dojo 6.Cryptocurrency Mining Farms In which company do you think it is possible to solve puzzle 130 unnoticed from the list above? Do you still have doubts that it wasn't this person who decided https://bitcointalk.org/index.php?topic=1306983.msg51803085#msg51803085He is a partner with 200 TESLA GPU what solve 2^120 provkey
|
[
|
|
|
Tepan
Jr. Member
Offline
Activity: 77
Merit: 1
|
|
September 24, 2024, 01:01:22 PM Last edit: September 24, 2024, 08:58:41 PM by Mr. Big |
|
SolveKeyCPU Thread 254: 1024 kangaroos SolveKeyCPU Thread 251: 1024 kangaroos GPU: GPU #0 NVIDIA GeForce RTX 3060 (28x128 cores) Grid(56x256) (147.0 MB used) SolveKeyGPU Thread GPU#0: creating kangaroos... someone please help me, why it took so long ?, i'm stuck on this like 5 minutes.
SolveKeyCPU Thread 254: 1024 kangaroos SolveKeyCPU Thread 251: 1024 kangaroos GPU: GPU #0 NVIDIA GeForce RTX 3060 (28x128 cores) Grid(56x256) (147.0 MB used) SolveKeyGPU Thread GPU#0: creating kangaroos...
someone please help me, why it took so long ?, i'm stuck on this like 5 minutes.
then "Segmentation fault (core dumped)"
|
|
|
|
citb0in
|
|
September 24, 2024, 01:06:22 PM Last edit: September 24, 2024, 02:15:00 PM by citb0in |
|
GPUEngine: SetParams: Failed to copy to constant memory (distance): an illegal memory access was encountered GPUEngine: SetKangaroos: an illegal memory access was encountered GPUEngine: Kernel: an illegal memory access was encountered [+] SolveKeyGPU Thread GPU#1: 2^22.00 kangaroos [42.1s] Segmentation fault (core dumped)
guess why - backdoored? hope you didn't run it on your own computer where you also run btc wallet applications, right? relax, just kidding ... RTFM and look into detect cuda script, if required manually assign your correct sms and also the gpu size and don't be disappointed if the program doesn't work as you had hoped. You can also try -t 0, which should disable CPU and use only the GPU. However, you will notice that the GPU is not working at all, use a program of your choice to determine whether the GPU is utilized. For example, if you have an nvidia GPU, simply start the nVidia X Server (Linux) or nVidia control panel (Windows) and be amazed that the program will show 0% GPU load. Puzzled? If you use -t 0, you think that the CPU is switched off, at least that's what this ominous kangaroo-256 is telling you. But there will only be one CPU core running and no GPU at all besides of the weird and wrong performance meters that is related to the gpu core settings you choose. So this program is crap
|
_______. ______ __ ______ ______ __ ___ .______ ______ ______ __ ______ .______ _______ / | / __ \ | | / __ \ / || |/ / | _ \ / __ \ / __ \ | | / __ \ | _ \ / _____| | (----`| | | | | | | | | | | ,----'| ' / | |_) | | | | | | | | | | | | | | | | |_) | | | __ \ \ | | | | | | | | | | | | | < | ___/ | | | | | | | | | | | | | | | / | | |_ | .----) | | `--' | | `----.| `--' | __| `----.| . \ | | | `--' | | `--' | | `----.__| `--' | | |\ \----.| |__| | |_______/ \______/ |_______| \______/ (__)\______||__|\__\ | _| \______/ \______/ |_______(__)\______/ | _| `._____| \______| | 2% fee anonymous solo bitcoin mining for all at https://solo.CKpool.org | No registration required, no payment schemes, no pool op wallets, no frills, no fuss. |
|
|
|
|
citb0in
|
|
September 24, 2024, 02:02:02 PM Last edit: September 24, 2024, 02:16:10 PM by citb0in |
|
then why there is non-zero balance on both of these addresses? I'm sorry, I'm new to this topic, I'm just trying to figure out what's going on here and most importantly HOW... because from the moment they convert the BTC into EUR, their identity is revealed and they are no longer anonymous. If things go wrong, the “lucky winner” then has a problem on their hands when they are forced to account for their actions or make a statement. Thanks to KYC EDIT: As I just realized, you post was deleted. Thanks to the quote I made everyone knows what I replied to.
|
_______. ______ __ ______ ______ __ ___ .______ ______ ______ __ ______ .______ _______ / | / __ \ | | / __ \ / || |/ / | _ \ / __ \ / __ \ | | / __ \ | _ \ / _____| | (----`| | | | | | | | | | | ,----'| ' / | |_) | | | | | | | | | | | | | | | | |_) | | | __ \ \ | | | | | | | | | | | | | < | ___/ | | | | | | | | | | | | | | | / | | |_ | .----) | | `--' | | `----.| `--' | __| `----.| . \ | | | `--' | | `--' | | `----.__| `--' | | |\ \----.| |__| | |_______/ \______/ |_______| \______/ (__)\______||__|\__\ | _| \______/ \______/ |_______(__)\______/ | _| `._____| \______| | 2% fee anonymous solo bitcoin mining for all at https://solo.CKpool.org | No registration required, no payment schemes, no pool op wallets, no frills, no fuss. |
|
|
|
|
Akito S. M. Hosana
Jr. Member
Offline
Activity: 90
Merit: 2
|
|
September 24, 2024, 02:46:27 PM |
|
from the moment they convert the BTC into EUR, their identity is revealed and they are no longer anonymous.
Why directly in EUR? Is there a swap from BTC to XMR? And then you slowly spend XMR through the volet card.... I would milk the BTC amount for years.
|
|
|
|
kTimesG
Member
Offline
Activity: 229
Merit: 29
|
|
September 24, 2024, 02:48:18 PM |
|
Maybe he/she is just a brilliant mind...and that person knows a way to reuse the DPs from 120,125 to find 130 and the rest.
I would like to know how he/she did it !
For every 5 bits range increase about 17% of previous range covers it, but to reuse DPs means using same jumps, so more jumps on average per kangaroo = more total operations than optimal. If you start searching in 135 bits, then it will take the same amount of time to find private key 0x1 or private key 2**134 - 1 or private key 2**89. So if we adapt the jumps needed to go through 135 bits and solve a lower interval than that (as if we would try to jump through 135), that means longer jumps on average per kangaroo = more total operations needed than optimal. I think it's pretty obvious what the 120 / 125 / 130 solver has done. You won't find the software publicly, you should all forget about that ever happening. Learn to code, this is what this competition is about first and foremost, not the prize.
|
|
|
|
nomachine
Member
Offline
Activity: 476
Merit: 35
|
|
September 24, 2024, 02:58:42 PM |
|
I would milk the BTC amount for years.
You mean 0.035 BTC per month? You need 30 years to spend Puzzle 130 like that.
|
bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
|
|
|
COBRAS
Member
Offline
Activity: 997
Merit: 23
|
|
September 24, 2024, 03:00:49 PM |
|
Maybe he/she is just a brilliant mind...and that person knows a way to reuse the DPs from 120,125 to find 130 and the rest.
I would like to know how he/she did it !
For every 5 bits range increase about 17% of previous range covers it, but to reuse DPs means using same jumps, so more jumps on average per kangaroo = more total operations than optimal. If you start searching in 135 bits, then it will take the same amount of time to find private key 0x1 or private key 2**134 - 1 or private key 2**89. So if we adapt the jumps needed to go through 135 bits and solve a lower interval than that (as if we would try to jump through 135), that means longer jumps on average per kangaroo = more total operations needed than optimal. I think it's pretty obvious what the 120 / 125 / 130 solver has done. You won't find the software publicly, you should all forget about that ever happening. Learn to code, this is what this competition is about first and foremost, not the prize. this is zelar and jlp, they use kangaroo, they try unsuccessful first time sollvec125 but. And cangaroo accept use previous calculated cangaroos for nex ranges,- files from 125 to solve 2^130 etc. Biut they get 13 btc furst time, previously they get 1,2 1,25 btc.difference is big, so they get now more gpu and solve. bye bye puzzles
|
[
|
|
|
WanderingPhilospher
Full Member
Offline
Activity: 1176
Merit: 237
Shooters Shoot...
|
|
September 24, 2024, 03:19:25 PM |
|
Maybe he/she is just a brilliant mind...and that person knows a way to reuse the DPs from 120,125 to find 130 and the rest.
I would like to know how he/she did it !
For every 5 bits range increase about 17% of previous range covers it, but to reuse DPs means using same jumps, so more jumps on average per kangaroo = more total operations than optimal. If you start searching in 135 bits, then it will take the same amount of time to find private key 0x1 or private key 2**134 - 1 or private key 2**89. So if we adapt the jumps needed to go through 135 bits and solve a lower interval than that (as if we would try to jump through 135), that means longer jumps on average per kangaroo = more total operations needed than optimal. I think it's pretty obvious what the 120 / 125 / 130 solver has done. You won't find the software publicly, you should all forget about that ever happening. Learn to code, this is what this competition is about first and foremost, not the prize. It depends on how you plan to reuse them. You are looking at it from one perspective, to run the original pub, in its original range, with the DPs generated from a lower range. There are 9 million ways to skin a cat. I am sure you have done this kind of test and analysis, so answer me this, if you reuse DPs found during a 66 or 65 or 70 bit range, to find a key in the same exact range, how much search time did it take, was it less, if so, how much less, on average?
|
|
|
|
|