 Show Posts
|
|
Pages: « 1 [2] 3 »
|
I run customise python code on M2, work as like vanity gen, but speed is okay.
i run the 34 Bit Puzzle.
and the result is mostly satisfying, it almost hit 50-70% from target.
Searching for addresses starting with 1pwa and matching 1pwabe7ouahg2affqhhvviqovncr4rev7q with partial length 6 in the range 8589934592 to 17179869183
Searched 27902 keys in 6.61 seconds | Private key: 000000000000000000000000000000000000000000000000000000029281670d | Address (Compressed): 1PWaaEg8tHYzVZRoXia4YjkMci2Bq8s5Xd
Searched 38419 keys in 9.03 seconds | Private key: 000000000000000000000000000000000000000000000000000000037439dffc | Address (Compressed): 1PWAt7AjKjCHp4NhheRc3cR2YRwwrkbRNj
Searched 39670 keys in 9.31 seconds | Private key: 00000000000000000000000000000000000000000000000000000003c0460191 | Address (Compressed): 1PWa47ZVP1pzgySaPtn9pMvCSdxNkjCCfM
Searched 44105 keys in 10.34 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ea112d43 | Address (Compressed): 1PwAGySRoG8XCn5EwHszxEG5Q4oMikeUgC
Searched 86491 keys in 20.33 seconds | Private key: 00000000000000000000000000000000000000000000000000000002b55bda6d | Address (Compressed): 1PwaXp8YZUFk5hP7YivAieG7zEnaKVhwA6
Searched 102573 keys in 24.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002db48641a | Address (Compressed): 1Pwau8X2xjKieab9Xj6C7NjpMRQtZ5HhAz
Searched 116748 keys in 27.40 seconds | Private key: 0000000000000000000000000000000000000000000000000000000316d12e4d | Address (Compressed): 1PwAPdUUayDEqaxDP3q9VJDWiAq7CHfQFJ
Searched 123543 keys in 28.99 seconds | Private key: 00000000000000000000000000000000000000000000000000000003bf357910 | Address (Compressed): 1PwAUFihpnUudcAL5iioXPbUESMvYadCFW
Searched 124873 keys in 29.28 seconds | Private key: 0000000000000000000000000000000000000000000000000000000288ac21dd | Address (Compressed): 1PWa4zB1YrjobsHM2K3PzugeXJdBUqQrdt
Searched 154049 keys in 36.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002178fd357 | Address (Compressed): 1PwAk5hxgBBp79y9NP1Xv9Ez2tYcR5aiBJ
Searched 159895 keys in 37.45 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ff515a66 | Address (Compressed): 1PWAngTsfo7VfiJf5LtmWM66cvUhURg6uo
Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn
the search is using secret formula to make the rate of search not far away from actual range.
the real private key is 000000000000000000000000000000000000000000000000000000034a65911d
btw anyone have configuration code to make speed faster enough with cpu ?
Searched 1414289 keys in 307.98 seconds | Private key: 000000000000000000000000000000000000000000000000000000034710b2da | Address (Compressed): 1PwATmTLCtGLVwbqVx4dcyDHbvTVdyuQQX Searched 1435507 keys in 312.59 seconds | Private key: 0000000000000000000000000000000000000000000000000000000345a8b581 | Address (Compressed): 1PWaFgHSEdGvnSmrfYC2DsWTxq7sMpPLkV Searched 1477916 keys in 321.80 seconds | Private key: 00000000000000000000000000000000000000000000000000000003b7c88e5b | Address (Compressed): 1PwAgRhPYNPQvXJdP9dEr7dzmT8LLwQswM Searched 1479675 keys in 322.19 seconds | Private key: 00000000000000000000000000000000000000000000000000000003b88983dc | Address (Compressed): 1PWAXkdsfoLdbWyu8HoUyJy1Lc5EAz33ze Searched 1511866 keys in 329.17 seconds | Private key: 000000000000000000000000000000000000000000000000000000029a297ba1 | Address (Compressed): 1PwA47SjPnFrz2AQZ6wm2v3Tm7e7A8byXi Searched 1514627 keys in 329.78 seconds | Private key: 00000000000000000000000000000000000000000000000000000003ed2d3c81 | Address (Compressed): 1PwAaexSpxH8PNxNUwfueV7Nn7QFt31LBu Searched 1529648 keys in 333.06 seconds | Private key: 0000000000000000000000000000000000000000000000000000000342f74068 | Address (Compressed): 1PWAvwUScR41KWnG7r8gzkKr9FhWGjG6ht Searched 1563424 keys in 340.40 seconds | Private key: 00000000000000000000000000000000000000000000000000000003e6aa1312 | Address (Compressed): 1PwAvEjNNZhiCNJ2yst8w8SzdG6iUowEvG Searched 1575709 keys in 343.08 seconds | Private key: 00000000000000000000000000000000000000000000000000000003f6a32b74 | Address (Compressed): 1PWavPMfHdYfb7vPYypKxkoVczmwmndtQi Searched 1576434 keys in 343.24 seconds | Private key: 00000000000000000000000000000000000000000000000000000003e0bf05e1 | Address (Compressed): 1PWAAsuv2CfHs63zVixBxb39dYoMj7bR5G i use range threshold by filtering public key hash + downscale range multiplication. can someone rate this ?
I run customise python code on M2, work as like vanity gen, but speed is okay.
i run the 34 Bit Puzzle.
and the result is mostly satisfying, it almost hit 50-70% from target.
Searching for addresses starting with 1pwa and matching 1pwabe7ouahg2affqhhvviqovncr4rev7q with partial length 6 in the range 8589934592 to 17179869183
Searched 27902 keys in 6.61 seconds | Private key: 000000000000000000000000000000000000000000000000000000029281670d | Address (Compressed): 1PWaaEg8tHYzVZRoXia4YjkMci2Bq8s5Xd
Searched 38419 keys in 9.03 seconds | Private key: 000000000000000000000000000000000000000000000000000000037439dffc | Address (Compressed): 1PWAt7AjKjCHp4NhheRc3cR2YRwwrkbRNj
Searched 39670 keys in 9.31 seconds | Private key: 00000000000000000000000000000000000000000000000000000003c0460191 | Address (Compressed): 1PWa47ZVP1pzgySaPtn9pMvCSdxNkjCCfM
Searched 44105 keys in 10.34 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ea112d43 | Address (Compressed): 1PwAGySRoG8XCn5EwHszxEG5Q4oMikeUgC
Searched 86491 keys in 20.33 seconds | Private key: 00000000000000000000000000000000000000000000000000000002b55bda6d | Address (Compressed): 1PwaXp8YZUFk5hP7YivAieG7zEnaKVhwA6
Searched 102573 keys in 24.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002db48641a | Address (Compressed): 1Pwau8X2xjKieab9Xj6C7NjpMRQtZ5HhAz
Searched 116748 keys in 27.40 seconds | Private key: 0000000000000000000000000000000000000000000000000000000316d12e4d | Address (Compressed): 1PwAPdUUayDEqaxDP3q9VJDWiAq7CHfQFJ
Searched 123543 keys in 28.99 seconds | Private key: 00000000000000000000000000000000000000000000000000000003bf357910 | Address (Compressed): 1PwAUFihpnUudcAL5iioXPbUESMvYadCFW
Searched 124873 keys in 29.28 seconds | Private key: 0000000000000000000000000000000000000000000000000000000288ac21dd | Address (Compressed): 1PWa4zB1YrjobsHM2K3PzugeXJdBUqQrdt
Searched 154049 keys in 36.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002178fd357 | Address (Compressed): 1PwAk5hxgBBp79y9NP1Xv9Ez2tYcR5aiBJ
Searched 159895 keys in 37.45 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ff515a66 | Address (Compressed): 1PWAngTsfo7VfiJf5LtmWM66cvUhURg6uo
Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn
the search is using secret formula to make the rate of search not far away from actual range.
the real private key is 000000000000000000000000000000000000000000000000000000034a65911d
btw anyone have configuration code to make speed faster enough with cpu ?
Bitcoin address and hash160, has no meaning when searching for a private key. You can select absolutely any search range and get the same results. i run this on 23 bit, only takes 6 sec, i still have hope can improvises the code sir.. |
|
|
|
|
is worth it to search the address by this method?
[2024-01-27 14:30:18] : Found address 13zCn8PenSN9QLGdeyccJv7kb8m8RnkDGY
[2024-01-27 14:30:18] : Private key HEX 0000000000000000000000000000000000000000000000030011c37937e0887a
[2024-01-27 14:30:18] : Found address 13zoZpGGwVs6ysE9wJbxWvyrWg5CLkVifw
[2024-01-27 14:30:18] : Private key HEX 0000000000000000000000000000000000000000000000030011c37937e0890d
[2024-01-27 14:30:19] Thread: Searched 3000 keys in 9.97 seconds
[2024-01-27 14:30:20] Thread: Searched 2000 keys in 11.07 seconds
[2024-01-27 14:30:20] Thread: Searched 3000 keys in 11.07 seconds
[2024-01-27 14:30:20] : Found address 13zb2pSKyRk7vbagvGvueczkrJ1aKJYpmR
[2024-01-27 14:30:20] : Private key HEX 0000000000000000000000000000000000000000000000030011c37937e08ad8
i only use Thread, any code to use with GPU or something else ? like pool scanning for faster ?
|
|
|
|
did you really understand what this RBF-challenge is all about?
i know what you mean bro, i already told to everyone about attack the addresses with some TX like RBF method, but noones care 
Take your chances by deploying a bot to compete with the looter, otherwise you can kiss your coins good bye. Or just talk with a large pool beforehand, you could offer them $10,000 bonus and if they include the tx in their block, other pools won't dare to mine that block again just to take those extra coins.
So you are claiming that any Bitcoin transaction could be double-spended and therefore all Bitcoin transactions are insecure. Makes sense ? What do you think of a challenge? I transfer an amount of x coins, you only know the source address, which I will publish here. Its private key will be in the range of 66bit just like the mentioned puzzle. Then you siphon off the coins and transfer them to another address before I receive them just like you described the looter would. If the coins end up at your freely chosen address, you can keep them. If they end up with me, you have lost and made a fool of yourself. Deal ? @Legends_Never_Die So what's about the RBF-challenge, deal or no deal?I generate an address with a 66bit private key and send a few coins to it. Then I create a transaction to send the entire contents of this wallet address to any other address. I will explicitly set 1 sat/vB as the fee so that the transaction can stay in the blockchain forever. Now you (or someone else if you like) try to cancel this outgoing transaction and thus simulate a mallory sucker that wants to withdraw the coins. As the transaction has the minimum fee you have all the time that you need. As the fees are currently very high, I am unfortunately unable to send coins to the RBF-challenge address. If anyone is interested in this RBF-challenge and would like to sponsor some minimum amount of satoshis, here is the wallet address: 1C8uD9G4AGQas5sG15869p5B1mrF3RELY3I own the private key of this address, here's the signature: Message: This address was exclusively generated for the RBF-challenge <https://bitcointalk.org/index.php?topic=1306983.msg63398077#msg63398077> and I have the private key of this address. citb0in, 2023-12-27
Address: 1C8uD9G4AGQas5sG15869p5B1mrF3RELY3
Signature: IAMmKuX5C2Z97eCSjYjfAN49hApXTk2LcMLzHWUp/vYYTxmKsHGaUdc7KQRFilTHUyqiEGt0B3NFqanjcgWl/Fg=The sha256 of the privkey is: 6297b7a9a38985d967e9d5603ba5e4f133b0e8a998219f29c4029aa03601110b As soon as this address has been funded with a few satoshis by a generous supporter, I could prepare the outgoing transaction as explained. Any funder appreciated Let me know if anyone's interested in that challenge. i already send messages about this topic, i have some information about RBF attack, i learn this method from 2021. |
|
|
|
Hi Guys, I'm back, and i found the "p2sh-segwit" of 130 # puzzle address "1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua"
"p2sh-segwit": "3J9ANKe3NQgDvtS33JX1v4CB1tyDZAYgrS"
maybe there's some clue or something to work with p2sh ?
because i see the pattern of the puzzle, if someone not spend the fund, the P2SH not generated on privatekeys.pw
(p2wsh) =bc1qjtgt74dxanh4pcmwnfs9usskcg8n33cxxhp0kcnaa82qg6ye26eqrjqvzm p2wpkh) = bc1q5fyj9pfq2x5sqt4lfjry54dvkadmfnm4sdlecz ETH= 0x10E2d3289af14a510c88e5107B11d69c47Dd5683 Tron = TBWVYCE2x7fsszXZ16iXDEmfr8QvrAEuU2 Knowing the public key is enough to generate addresses. It's not a rule either to look for the address of a known public key, haha. I can search for anything, and I don't necessarily have to use a public key. For example, I can find the P2SH for puzzle number 66. THIS13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so # P2PKH " bc1qyr2956nky56hqr8fuzepdccejse4mw994lyftn" BECH32 " 3PdQoXyQwWmerpt3SbF7Hbh3aukXXXXXXX" P2SH ( sorry if i do "X" end address, it might be easier to cashout when you can do something with this main/test net addresses. WHO KNOWS THE PUBLIC KEY 66? I CAN EVEN FIND THE P2SH ADDRESS, HAHA! |
|
|
|
|
Hi Guys, I'm back, and i found the "p2sh-segwit" of 130 # puzzle address "1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua"
"p2sh-segwit": "3J9ANKe3NQgDvtS33JX1v4CB1tyDZAYgrS"
maybe there's some clue or something to work with p2sh ?
because i see the pattern of the puzzle, if someone not spend the fund, the P2SH not generated on privatekeys.pw
|
|
|
|
Hey guys, I just think to learn the script how this address are calculated. because bitcoin has its own native scripting language, While funds are usually locked to a public key alone, they can also be secured with a script. we just need to know how the address calculated, no reverse math in here. soon i'll update what i learn about the pubkey and the address. because this puzzle was working on single signature (P2PKH). Peace.  Awesome bro... We'd be waiting for the updates from you. share let us all learn. thanks Because i read more and figure the ways. bitcoin is never moved, is just locked and unlocked. The only change is who can spend that amount. |
|
|
|
Hey guys, I just think to learn the script how this address are calculated. because bitcoin has its own native scripting language, While funds are usually locked to a public key alone, they can also be secured with a script. we just need to know how the address calculated, no reverse math in here. soon i'll update what i learn about the pubkey and the address. because this puzzle was working on single signature (P2PKH). Peace. eg. i need to learn.  |
|
|
|
Warning: Please stay On-Topic, otherwise you will be getting banned
I still on the topic, others use some math with computating ideas, i just use basic bruteforce idea and powered base by proof of wallet import format. just clarification, the puzzle it's owned by native script and secured by public key and hidden private key. we need just to know what the singularity the solved problem the puzzle upper from 60. |
|
|
|
just ensure the progress and don't be a jerk about someone idea.
Sorry but I'm not really being a jerk when I say what you are doing is waste of time, I wasted 2 month on WIFs, then I found out there is no shortcut unless we know the checksum which is 6 base58 characters even though the checksum is not part of the hex private key but knowing it could change everything. Apology for calling you a spammer, you could post a one line example instead of 20 lines. Btw, if I wanted to spend time on learning how to code, I couldn't learn the little I know about ECC. Imagine I spent 1 hour to download and install packages and then copy them one by one to the directory of my script just to realize I am not built for such things, every person has his own sets of skills, learning how to code is not mine to master. that's the point of the puzzle, makes you work, it's not a newborn puzzle everyday like on X, it's found and launch from 2015, someone do BSGS like month and year, 2 month trying is nothing. |
|
|
|
Hey guys, instead of wasting your eye sight on long and useless base58 WIFs which literally represent 0s in hexadecimal, let me share a little secret regarding public keys. Here is how you can find half of your public key, it's not straight forward method but I bet many of you didn't know about it. First we need to extract 1 and half of our public key then we can subtract our p which is 1 from it's 1.5 to get it's 0.5 half. Though we could just divide it by 2 without all this trouble, this is a hint to make you dive deeper in to this vast ocean of numbers and equations. Target pub: 03219b4f9cef6c60007659c79c45b0533b3cc9d916ce29dbff133b40caa2e96db8 Target priv: Our multiplier inverse or not doesn't matter, +n will give you +n result and vice versa. Scalar : aka n/2+1 half n +1 or 1 and half of n. 7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a2 If you multiply our target pub with scalar above, you will get this : Pub2 : 02161c6cbee1483deaf6f9b395c817eb019228cda5afac5857295ba10959dffc96 Priv : Now if we subtract target from pub2, we will get : Pub3, half of target : 0313d1ffc481509beee68f17d8ff41c2590f4c85f15268605087eda8bab4e218da Priv : We didn't even use division, *chop chop and good luck diving.😅 * = hurry! Get to work. Now, if it were possible to calculate an even target pub or an odd one, then 130 puzzle could be solved in a few hours. Yeah absolutely 1 hours 4 minutes, but he's doin nothing with random speculation ahaha, see. just computing use 50% brain and computing power, not 100% brain enough.
To install the `sympy` module on Windows, type CMD in the search bar and open Command Prompt and type
pip install mpmath, first and then pip install sympy.
put ice dll and secp256k1.py in the same folder where you have the script.
Thanks, I did what you said and learned a few things about python commands, after a few errors now it says module secp256k1 has no attribute 'pub2upub' even though I correctly pasted the upub in it's place. I went to secp256k1.py and there was no mention of pub2upub. Lol this thing burned more energy than a week of dealing with EC math.
Now, if it were possible to calculate an even target pub or an odd one, then 130 puzzle could be solved in a few hours.
You can't figure out if a key is odd or even, that would make it easy to find every other digits to see if they are also odd or even. But there is a way to make sure that the correct results are in your files and your tool had all the incorrect and correct keys. Here is how, you know some keys can be divided by 2 a few times in a row, so when you divide a key you need to divide it by 2 at least 4 times, subtract 1 from all and do the same with all the keys. This should occupy less than 1 GB of storage/ RAM, and it should solve the low bit range keys in minutes, but I don't know why nobody is trying it.🤔 just remember bro, what are you doing in right now it's already done with someone who was not in this forum, believe me or not, u just need develop it no being amateur with code flying inside. just ensure the progress and don't be a jerk about someone idea. |
|
|
|
Just info.
Think in your own way and your own point of view about this WIF range
Do we have GPU crackers for WIF Private Keys? or do we have someone that can build 1? these have more potentials for brute forcing puzzle 66 from the Random Point of view for probably the last 16 - 18 characters ranges scanned sequentially, compared to the hexadecimal private keys because of the checksum involved in the WIF Private keys... this might be it, every hexadecimal key is valid but not all WIFs are which brings us to the point where scanning might be fun to play with What is the point of this if what you see in every row is just representation of padded zeros? That is the point right there "padded zeros" as explained earlier, the hexadecimal is just from 0 to F base16 whereas the WIF is a base58 equivalent of that base 16 hexadecimal representation... so what point does this make? Well, I can have 3.625 of the hexadecimal character represented as just 1 character of the WIF... this in otherwords simply means if you are able to hit the correct first 3 WIF characters, then you probably don't have too much range to scan compared to hitting the correct first 3 characters of the hexadecimal representation of the same key... you've got a long way to go bro... So i See some potentials in this WIF bruteforcing for the puzzle 66 Key search range 66 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q ZVfMsBQggk69993Lj3p KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q aCtgAeZDbST4e5pMroG We can't do anything with this information. In fact, it will be the same brute force of keys. There is no difference in what format to sort through the keys, even in binary, even in hex, even in base58. How you can explain this ? Puzzle 118 address is 1PJZPzvGX19a7twf5HyD2VvNiPdHLzm9F6this is the 0000000000000000000000000000000000af0f4d11574f5deee49961d9609ac6 address 1PEuXxTXfc3qJM4H7EKRbSb8TSPFtds9A5Public key 02bc5f15678ceb70dad97a6b695b9e0df7c405142586931801c2df664563042fe7 I just random search WIF range on that, and i have lock the range area by Hex padded. yeah it's suck it's like 0.0000001% chance hit the 4 same HEX value / WIF. [EDIT 10:41 Indonesia Time] Target 1PJZPzvGX19a7twf5HyD2VvNiPdHLzm9F6 # 118 this, i found 3 word same address range, from range padded hex. 031e841aa39d5d92ae850400a2d8be24a245d53e9ba29dc86b86696e65290c32d7 = 1PJgNwNbpr1KRxdmPxPXMCWqdBT1bwgDEe The public address has no binding either to the public key or to the private key. You need to carefully study the process of obtaining bitcoin addresses. Might be you need double the reading of my progress, it's not binding to pub or priv, just calculated the random and padded HEX on the same range, it's like HEX range -> check 1 by 1 hex to WIF -> Segwit Base 58 (If the address have the same targeted addresses, keep the range, if not skip the hex range *not saved for the next batch*). This is the demo for 130 Puzzle Puzzle 130 addresses 1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua 2baf7cf4d51574f5deee49961d9609ac6 # 1FHMVBF6Z5ebm5LJKRpkZs8RjNJXUMyUVV # KwDiBf89QgGbjEhKnhXJuH85q VZKQivFjnRMPNnqDyFoSqrSaKfd 2baf78fec51be4f59eaf6966bd9709ac6 # 1FXUvZnrcqRnJV1Cvre2ribDz6yKqQugjR # KwDiBf89QgGbjEhKnhXJuH85q VMiSmxd4F8urBwimS72wrJD2XYS 2baf78fac5b3e4f6feaf6962bd9709ac6 # 1FqZVS2u9iqcycye9BmtVEcCGM6wCYXHM2 # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvjexRvRbBdvgeEZd 2baf78fac5b3e4f6feaf6942bd9709ac6 # 1Fe7X3dKymfuae7xLDZ9Hk5dn9W5pf4SE8 # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvjAC4AFCc3v8Pooi 2baf78fac5b3e4f6feaf69c2bf1709ac6 # 1FnUH4z8cgLuWBLFFWvXBDdQ1VfFc4SM1k # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvm9FrvdFhuoEb9k1 2baf78fac5b3e4f6feaf69f2bf9a8a46c # 1FfUFwHRS4cEESP3JDBMQMaZxLCZTN8tY # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvmtQXdpe3Zfy6UtD 2baf78fac5b3e4d018100000000000000 # 1F2nhqcHQRKwjjokgkKkcSpLH4uucuQZSV # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPuxaPiBGv4PL2aFAnuFR8 3baf70fac037e51011500040000000000 # 1FpLqZyycLiaLWQ6Lbe5zcXuypbX6F7q4C # KwDiBf89QgGbjEhKnhXJuH8Ma WVpmffaLXxzgafdFBXKhAAvtpYn 3baf7efac999e3c95c4ea7660b9946c94 # 1Fcmac1xrLNMMr286BsFnWN35pFNgZeWWb # KwDiBf89QgGbjEhKnhXJuH8Ma XCqFfLS8nKhgd7RpHR2XZB5AKhx 3baf7efac999e3cddc6ba764fb9b66cb4 # 1FqfgJmp8AKvDkAKbUcncgMA7kmDn9dJ2v # KwDiBf89QgGbjEhKnhXJuH8Ma XCqFfLS9Eo6LP4p7NDXN5sx82Js 3bbff6cba4bd242d6ceb2777fb9866ca4 # 1FfPWje1WcZ47fAKuGBijKsqhvF8bHzf3f # KwDiBf89QgGbjEhKnhXJuH8Me C7XhwLTtDcX5XKNNEHm7o8DUj98 3bbff6cb95bca56cdee22756fb970bcaa # 1F2UYUqkShEp8aa9CCE6mKN3yLHbKpEPud # KwDiBf89QgGbjEhKnhXJuH8Me C7XfgWcWBrqsVyALfRFgYf7PCe9 it's BSGS and manually count by my magic math.  |
|
|
|
Hey guys, instead of wasting your eye sight on long and useless base58 WIFs which literally represent 0s in hexadecimal, let me share a little secret regarding public keys. Here is how you can find half of your public key, it's not straight forward method but I bet many of you didn't know about it. First we need to extract 1 and half of our public key then we can subtract our p which is 1 from it's 1.5 to get it's 0.5 half. Though we could just divide it by 2 without all this trouble, this is a hint to make you dive deeper in to this vast ocean of numbers and equations. Target pub: 03219b4f9cef6c60007659c79c45b0533b3cc9d916ce29dbff133b40caa2e96db8 Target priv: Our multiplier inverse or not doesn't matter, +n will give you +n result and vice versa. Scalar : aka n/2+1 half n +1 or 1 and half of n. 7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a2 If you multiply our target pub with scalar above, you will get this : Pub2 : 02161c6cbee1483deaf6f9b395c817eb019228cda5afac5857295ba10959dffc96 Priv : Now if we subtract target from pub2, we will get : Pub3, half of target : 0313d1ffc481509beee68f17d8ff41c2590f4c85f15268605087eda8bab4e218da Priv : We didn't even use division, *chop chop and good luck diving.😅 * = hurry! Get to work. I rather be use the target public key is then (using ecdsa arithmetic) reduced subseqentially until hitting one of the rendezvous point. Given G is the generator point, and R=x*G the rendezvous point (which private key is known). and BSGS. u just like a teacher on class math in 4th grade lmao. ---------- There's i got brute the WIF and it's manually not any application or program i use. I just use called MATH. i just make key range more better for fast scan at the lower and upper range. Puzzle 130 addresses 1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua 2baf7cf4d51574f5deee49961d9609ac6 # 1FHMVBF6Z5ebm5LJKRpkZs8RjNJXUMyUVV # KwDiBf89QgGbjEhKnhXJuH85q VZKQivFjnRMPNnqDyFoSqrSaKfd 2baf78fec51be4f59eaf6966bd9709ac6 # 1FXUvZnrcqRnJV1Cvre2ribDz6yKqQugjR # KwDiBf89QgGbjEhKnhXJuH85q VMiSmxd4F8urBwimS72wrJD2XYS 2baf78fac5b3e4f6feaf6962bd9709ac6 # 1FqZVS2u9iqcycye9BmtVEcCGM6wCYXHM2 # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvjexRvRbBdvgeEZd 2baf78fac5b3e4f6feaf6942bd9709ac6 # 1Fe7X3dKymfuae7xLDZ9Hk5dn9W5pf4SE8 # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvjAC4AFCc3v8Pooi 2baf78fac5b3e4f6feaf69c2bf1709ac6 # 1FnUH4z8cgLuWBLFFWvXBDdQ1VfFc4SM1k # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvm9FrvdFhuoEb9k1 2baf78fac5b3e4f6feaf69f2bf9a8a46c # 1FfUFwHRS4cEESP3JDBMQMaZxLCZTN8tY # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPyuPyvmtQXdpe3Zfy6UtD 2baf78fac5b3e4d018100000000000000 # 1F2nhqcHQRKwjjokgkKkcSpLH4uucuQZSV # KwDiBf89QgGbjEhKnhXJuH85q VMfnuJPuxaPiBGv4PL2aFAnuFR8 3baf70fac037e51011500040000000000 # 1FpLqZyycLiaLWQ6Lbe5zcXuypbX6F7q4C # KwDiBf89QgGbjEhKnhXJuH8Ma WVpmffaLXxzgafdFBXKhAAvtpYn 3baf7efac999e3c95c4ea7660b9946c94 # 1Fcmac1xrLNMMr286BsFnWN35pFNgZeWWb # KwDiBf89QgGbjEhKnhXJuH8Ma XCqFfLS8nKhgd7RpHR2XZB5AKhx 3baf7efac999e3cddc6ba764fb9b66cb4 # 1FqfgJmp8AKvDkAKbUcncgMA7kmDn9dJ2v # KwDiBf89QgGbjEhKnhXJuH8Ma XCqFfLS9Eo6LP4p7NDXN5sx82Js 3bbff6cba4bd242d6ceb2777fb9866ca4 # 1FfPWje1WcZ47fAKuGBijKsqhvF8bHzf3f # KwDiBf89QgGbjEhKnhXJuH8Me C7XhwLTtDcX5XKNNEHm7o8DUj98 3bbff6cb95bca56cdee22756fb970bcaa # 1F2UYUqkShEp8aa9CCE6mKN3yLHbKpEPud # KwDiBf89QgGbjEhKnhXJuH8Me C7XfgWcWBrqsVyALfRFgYf7PCe9 i just hunt the pub and address by privK variation with 16 bit per each line of HEX. just reminder, if you BSGS the full range this 130 Puzzle, it takes 13.8 billion years lmao. |
|
|
|
Just info.
Think in your own way and your own point of view about this WIF range
Do we have GPU crackers for WIF Private Keys? or do we have someone that can build 1? these have more potentials for brute forcing puzzle 66 from the Random Point of view for probably the last 16 - 18 characters ranges scanned sequentially, compared to the hexadecimal private keys because of the checksum involved in the WIF Private keys... this might be it, every hexadecimal key is valid but not all WIFs are which brings us to the point where scanning might be fun to play with What is the point of this if what you see in every row is just representation of padded zeros? That is the point right there "padded zeros" as explained earlier, the hexadecimal is just from 0 to F base16 whereas the WIF is a base58 equivalent of that base 16 hexadecimal representation... so what point does this make? Well, I can have 3.625 of the hexadecimal character represented as just 1 character of the WIF... this in otherwords simply means if you are able to hit the correct first 3 WIF characters, then you probably don't have too much range to scan compared to hitting the correct first 3 characters of the hexadecimal representation of the same key... you've got a long way to go bro... So i See some potentials in this WIF bruteforcing for the puzzle 66 Key search range 66 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q ZVfMsBQggk69993Lj3p KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q aCtgAeZDbST4e5pMroG We can't do anything with this information. In fact, it will be the same brute force of keys. There is no difference in what format to sort through the keys, even in binary, even in hex, even in base58. How you can explain this ? Puzzle 118 address is 1PJZPzvGX19a7twf5HyD2VvNiPdHLzm9F6this is the 0000000000000000000000000000000000af0f4d11574f5deee49961d9609ac6 address 1PEuXxTXfc3qJM4H7EKRbSb8TSPFtds9A5Public key 02bc5f15678ceb70dad97a6b695b9e0df7c405142586931801c2df664563042fe7 I just random search WIF range on that, and i have lock the range area by Hex padded. yeah it's suck it's like 0.0000001% chance hit the 4 same HEX value / WIF. [EDIT 10:41 Indonesia Time] Target 1PJZPzvGX19a7twf5HyD2VvNiPdHLzm9F6 # 118 this, i found 3 word same address range, from range padded hex. 031e841aa39d5d92ae850400a2d8be24a245d53e9ba29dc86b86696e65290c32d7 = 1PJgNwNbpr1KRxdmPxPXMCWqdBT1bwgDEe |
|
|
|
If by any chance anyone here has the WIF checksum for #66, post it here so we could find the key in a few hours.
The only advantage if WIF is when you know the checksum, the checksum changes in different bit ranges, I mean the base58 representation of keys with the same last 8 characters is different, so we could use wifsolver to search for the key if we had the checksum.
The world of base58 and WIF checksum is an entirely different world but it is amazing once you get to know it's secrets.😉
Speaking of spamming this thread with useless content, please, you should consider the size of the post you are quoting!
Nah u just need the public key of 66, not the checksum. How you know the checksum if you cannot reverse the math. just using the publick key + the lost password padded. |
|
|
|
Just info. KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgd9aFJuCJDo5F6Jm7 # 40
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgd9gCD9CBomewdcUD # 41
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgd9zzYEemjCVJ3vo9 # 42
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdB23bP5LsYN8Krv7 # 43
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdCpdGyxm7PWoNQdr # 44
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdDrgx63tbte4scLA # 45
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdLwb42sQhwTBJDnG # 46
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdcLTenJYVVVTRzxN # 47
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdtUGWxHzvDi28MfR # 48
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgejcjwprJ4MAYLw8e # 49
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgfXBMYdNVA4EjUMzg # 50
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgm9fa43QnU2CpULaK # 51
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjguYJTZsntce5oQQrh # 52
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjh5SmqrUoK2mhwSYFV # 53
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjhHvuTMSDchRp5hktc # 54
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjidyYKE5NcJQZYvknA # 55
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjjb65nDHeqyjiBaJXv # 56
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjqtiAvYTJzYEmqup7b # 57
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjv2kTamEYQT9BNC7o1 # 58
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YkHpsTBP19HvTFqiU6i # 59
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YkzijLsc5qE43yZ5eLV # 60
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YmLDHsih379uP9zbHSD # 61
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YpCemuaUp7NigjvtJug # 62
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yv5Z9J7hv7VYYN3XL3Y # 63
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Z6FxoaD5r1kYegmtbaT # 64
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q ZM21gaY8WN2CdwnTG57 # 65
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 66
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 67
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 68
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 69
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q t5RQNhFCn1r58in2E78 # 70
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 71
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 72
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 73
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 74
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3y HuxB7NfERRuDTNy2kbr # 75
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 76
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 77
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 78
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 79
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi APRB6KvN7FnKsw69PP7vW # 80
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 81
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 82
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 83
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 84
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ kCnRjpBspr8M5K8YnUtDNa # 85
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 86
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 87
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 88
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 89
KwDiBf89QgGbjEhKnhXJuH7LrciVr bEiEhLWVU4Yn1RCfnX51KrT # 90
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 91
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 92
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 93
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 94
KwDiBf89QgGbjEhKnhXJuH7LrciV sLfMYB8ydZ3QXMqEra1sapfT # 95
KwDiBf89QgGbjEhKnhXJuH7LrciV # 96
KwDiBf89QgGbjEhKnhXJuH7LrciV # 97
KwDiBf89QgGbjEhKnhXJuH7LrciV # 98
KwDiBf89QgGbjEhKnhXJuH7LrciV # 99
KwDiBf89QgGbjEhKnhXJuH7Lrci WJvjTPYdp4sSLwstc63avmfRA # 100
KwDiBf89QgGbjEhKnhXJuH7Lrci # 101
KwDiBf89QgGbjEhKnhXJuH7Lrci # 102
KwDiBf89QgGbjEhKnhXJuH7Lrci # 103
KwDiBf89QgGbjEhKnhXJuH7Lrci # 104
KwDiBf89QgGbjEhKnhXJuH7Lrci m5eBMkFQwQtRbW6wxT1ajoNqE # 105
KwDiBf89QgGbjEhKnhXJuH7Lrci # 106
KwDiBf89QgGbjEhKnhXJuH7Lrci # 107
KwDiBf89QgGbjEhKnhXJuH7Lrci # 108
KwDiBf89QgGbjEhKnhXJuH7Lrci # 109
KwDiBf89QgGbjEhKnhXJuH7Lrc tLcZtumiizzSmSckgpxQu6ieu6 # 110
KwDiBf89QgGbjEhKnhXJuH7Lrc # 111
KwDiBf89QgGbjEhKnhXJuH7Lrc # 112
KwDiBf89QgGbjEhKnhXJuH7Lrc # 113
KwDiBf89QgGbjEhKnhXJuH7Lrc # 114
KwDiBf89QgGbjEhKnhXJuH7Lr hcVkatbczm7Y9ZaB56U1jLNU2Xh # 115
KwDiBf89QgGbjEhKnhXJuH7Lr # 116
KwDiBf89QgGbjEhKnhXJuH7Lr # 117
KwDiBf89QgGbjEhKnhXJuH7Lr # 118
KwDiBf89QgGbjEhKnhXJuH7Lr # 119 Think in your own way and your own point of view about this WIF rangeWhat is this, @Tepan? it's just bunch the WIF puzzle already cracked, seems odd and we just need to search the range from WIF (possible ?). |
|
|
|
Just info. KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgd9aFJuCJDo5F6Jm7 # 40
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgd9gCD9CBomewdcUD # 41
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgd9zzYEemjCVJ3vo9 # 42
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdB23bP5LsYN8Krv7 # 43
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdCpdGyxm7PWoNQdr # 44
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdDrgx63tbte4scLA # 45
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdLwb42sQhwTBJDnG # 46
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdcLTenJYVVVTRzxN # 47
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgdtUGWxHzvDi28MfR # 48
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgejcjwprJ4MAYLw8e # 49
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjgfXBMYdNVA4EjUMzg # 50
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjgm9fa43QnU2CpULaK # 51
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjguYJTZsntce5oQQrh # 52
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjh5SmqrUoK2mhwSYFV # 53
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjhHvuTMSDchRp5hktc # 54
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjidyYKE5NcJQZYvknA # 55
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjjb65nDHeqyjiBaJXv # 56
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YjqtiAvYTJzYEmqup7b # 57
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yjv2kTamEYQT9BNC7o1 # 58
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YkHpsTBP19HvTFqiU6i # 59
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YkzijLsc5qE43yZ5eLV # 60
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YmLDHsih379uP9zbHSD # 61
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q YpCemuaUp7NigjvtJug # 62
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Yv5Z9J7hv7VYYN3XL3Y # 63
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q Z6FxoaD5r1kYegmtbaT # 64
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q ZM21gaY8WN2CdwnTG57 # 65
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 66
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 67
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 68
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 69
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q t5RQNhFCn1r58in2E78 # 70
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 71
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 72
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 73
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 74
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3y HuxB7NfERRuDTNy2kbr # 75
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 76
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 77
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 78
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q # 79
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi APRB6KvN7FnKsw69PP7vW # 80
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 81
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 82
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 83
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi # 84
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ kCnRjpBspr8M5K8YnUtDNa # 85
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 86
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 87
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 88
KwDiBf89QgGbjEhKnhXJuH7LrciVrZ # 89
KwDiBf89QgGbjEhKnhXJuH7LrciVr bEiEhLWVU4Yn1RCfnX51KrT # 90
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 91
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 92
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 93
KwDiBf89QgGbjEhKnhXJuH7LrciVr # 94
KwDiBf89QgGbjEhKnhXJuH7LrciV sLfMYB8ydZ3QXMqEra1sapfT # 95
KwDiBf89QgGbjEhKnhXJuH7LrciV # 96
KwDiBf89QgGbjEhKnhXJuH7LrciV # 97
KwDiBf89QgGbjEhKnhXJuH7LrciV # 98
KwDiBf89QgGbjEhKnhXJuH7LrciV # 99
KwDiBf89QgGbjEhKnhXJuH7Lrci WJvjTPYdp4sSLwstc63avmfRA # 100
KwDiBf89QgGbjEhKnhXJuH7Lrci # 101
KwDiBf89QgGbjEhKnhXJuH7Lrci # 102
KwDiBf89QgGbjEhKnhXJuH7Lrci # 103
KwDiBf89QgGbjEhKnhXJuH7Lrci # 104
KwDiBf89QgGbjEhKnhXJuH7Lrci m5eBMkFQwQtRbW6wxT1ajoNqE # 105
KwDiBf89QgGbjEhKnhXJuH7Lrci # 106
KwDiBf89QgGbjEhKnhXJuH7Lrci # 107
KwDiBf89QgGbjEhKnhXJuH7Lrci # 108
KwDiBf89QgGbjEhKnhXJuH7Lrci # 109
KwDiBf89QgGbjEhKnhXJuH7Lrc tLcZtumiizzSmSckgpxQu6ieu6 # 110
KwDiBf89QgGbjEhKnhXJuH7Lrc # 111
KwDiBf89QgGbjEhKnhXJuH7Lrc # 112
KwDiBf89QgGbjEhKnhXJuH7Lrc # 113
KwDiBf89QgGbjEhKnhXJuH7Lrc # 114
KwDiBf89QgGbjEhKnhXJuH7Lr hcVkatbczm7Y9ZaB56U1jLNU2Xh # 115
KwDiBf89QgGbjEhKnhXJuH7Lr # 116
KwDiBf89QgGbjEhKnhXJuH7Lr # 117
KwDiBf89QgGbjEhKnhXJuH7Lr # 118
KwDiBf89QgGbjEhKnhXJuH7Lr # 119 Think in your own way and your own point of view about this WIF range |
|
|
|
02c584e2cb49a5aabd9ceb1e5128cecd0a7ca96628e76b1491950f021a4852d8ec ? figure this out guys  What seems to be the problem? The pubkey i found it's used to trans the Bitcoin to all puzzle with huge bitcoin last time, maybe we can search from that pubkey ? it's possible ? just ask, because i need to figure out and learn, thx. |
|
|
|
02c584e2cb49a5aabd9ceb1e5128cecd0a7ca96628e76b1491950f021a4852d8ec ? figure this out guys |
|
|
|
There's the math comes again, 66 Bit puzzle  the total number of keys in this range can be calculated by taking 16 to the power of 17 (i.e., 16^17), which is equal to 295,147,905,179,352,825,856. So, there are a total of 295,147,905,179,352,825,856 keys in the given range. If you have a speed of 343 million keys per second (Mkeys/s), the result's, Total number of keys = 295,147,905,179,352,825,856 Time = Total number of keys / Speed Substituting the values, we get: Time = 295,147,905,179,352,825,856 / 343,000,000 Time = 859,488,566,568 seconds Therefore, it would take approximately 859,488,566,568 seconds (or about 27,247 years) to generate all the possible keys in the given range at a speed of 343 million keys per second. This is a very long time and may not be practically feasible. what if i have 5000 mkeys to scan those number of key ? it would take approximately 59,029,581,036 seconds (or about 1,872 years) to generate all the possible keys in the given range at a speed of 5000 million keys per second, still lame haha
and there's other scenario to win the ticket haha For a 66-bit puzzle, the key range would be from 0 to 2^66 - 1, which is: 0 to 7,922,816,251,426,433 The number of keys in this range is: 2^66 = 73,786,976,294,838,206,464 At a scanning speed of 343 Mkey/s, the time it would take to scan this entire range would be: Time = Number of Keys / Keys per Second Time = (2^66) / 343000000 = 215625224 seconds = 3593754 minutes = 59896 hours = 2495 days ≈ 6.84 years So, it would take approximately 6.84 years to scan the entire key range of a 66-bit puzzle at the given scanning speed. If we were to randomly hit the private key in the middle of the range, then we would only need to scan half of the key range, which is: 2^65 = 36,893,488,147,419,103,232 Using the same formula as above, the time it would take to scan half of the key range would be: Time = (2^65) / 343000000 = 107812612 seconds = 1796877 minutes = 29948 hours = 1248 days ≈ 3.42 years So, if we randomly hit the private key in the middle of the key range, it would take approximately 3.42 years to scan half of the key range at the given speed of 343 Mkey/s. btw, my close friend is neat, he's building something on ASICs L3+ to give a proof to scan the puzzle for mean time haha. let's see.. |
|
|
|
I just do some math with #66 Puzzle. You just need bigA$$ Mkeys. (e.g 5000 Mkeys) time = (range size) / (speed * 10^6) Where range size is the number of keys in the range ( 3ffffffffffffffff - 20000000000000000 + 1 = 3ffffffffffffffe1), speed is the speed of the search in millions of keys per second, and 10^6 is used to convert from millions to individual keys per second. Time = (3ffffffffffffffe1) / (5000 * 10^6) = 7671.29 seconds Therefore, it would take approximately 7671.29 seconds (or about 2.13 hours) to search the given range at a speed of 5000 Mkeys per second. Device i use was 1650Ti and give 343 Mkeys speed with Keyhunt Albertobsd, 15X GPUs needed.. Time to win the lottery haha  this method only Kangaroo and hash160. sorry for not mention about the 66 bit range haha, i already double check on reply below but i feelin weird about the keybit range about 66 itself. its maybe arround 20000000000000000:4ffffffffffffffff not 3. this just IMO , consider to bullyin my opinion you better skip to read this. #CMIIW |
|
|
|
|
