 Show Posts
|
|
Pages: « 1 [2] 3 »
|
Hi, so i found 2 address similar 11 digits of hash160 in extraction of bit 130 that means if you scan on this range and have the private key of those one of two addresses we will split the 13 BTC  ---SNIP--- what makes you think that a partial string of one hash has a reference to another? This phase of learning, I call it kindergarten phase, I have also passed this era, I'm in preschool now. Lol. They need to learn their lessons through experience if verbal education is not effective. 😉 no one told you to give your opinion about how im searching the puzzle, old school new school and lessons, nobody told you your advise or what are you doing or you did pass this really ?? oh thats right so you are on the new school today, ok ,, you helped me thank you hhhhhhhhhhhhhhhhhhhhhhhhhh, omg, still people like you think like that nowadays  so i stop posting new things im helping the community to solve the puzzle at least im doing something and sharing something and im not like you always ask for help and how to do that and never did give us something that help solving this puzzle. so relax bro and dont even talk this or about your experiences in old school, we are here to learn everyday a new thing we always learn |
|
|
|
Hi, so i found 2 address similar 11 digits of hash160 in extraction of bit 130 that means if you scan on this range and have the private key of those one of two addresses we will split the 13 BTC , 1st 1AoNf67iZUmz1Ck9eefUfTzWQJMN5pgcPG 02113ba90a97c020ade0f3d8d0369981a723fe2bc4352815df22dd3eafae13c5a5 6b7e582a29a549cc60b591279a963f02eff02f99 pk:00000000000000000000000000000000000de4cfcadfc034c963dd053d719e88 address to search in :116 bit range 1AoNf67iZrwMSYPTDbk3Sh1yXJCARQbD7a 039d0a0241abe2411f64b4f6d29f2e1b6c837b26b6bdded577c3fc93574d3d735c 6b7e582a29a7601b79761f9f153c300c3d988231 range: 804cfcadfc034c963dd053d719e88:fffffcadfc034c963dd053d719e88 2nd 1PtStkm2bWKryHVduVjciPUxVx9UeDcCXG 02dc52ba09b16bc5cbd25aca7c82dd924f81cd31ecf29ecb264fa2cc45393728b9 fb0d9859584e68c24c1698eea4d05d2822fe4b70 pk: ad0f6ba584b355089cf6ce9cc9774 address to search in 116 bit range 1PtStkm2bLM7EK7g1rnTLBxu6aLouVuULV 03ef06cec3b3e35f68ba78618e5a5cf8663cc1a3b685dcfd197c1c0030530b1293 fb0d9859584d782df3fe652d2da5a21c30f137f9 range: 804cfcadfc034c963dd053d719e88:fffffcadfc034c963dd053d719e88 if the pk found of one of those address we will split the prize. they have the same 11 digits of hash160 that means maybe 90 pourcent is in that range up, anyone interessing its same 11 digits hash160 so who can scan this range 116 and split the 13 btc ? |
|
|
|
Alright, after numerous calculations, I've come to the point where I need someone who is interested in puzzle 66 and capable of counting 48 bits within a few minutes. I have a total of 588 ranges for them to work on, with the opportunity to claim the prize of 6.6 BTC. Alternatively, if the author of the puzzle – the one who created this challenge to test the difficulty of increasing bits – has come across my post, I challenge them to assist me in improving my counting speed. I am confident in my ability to crack puzzle 66 in a matter of days.
im ready to work with you As previously mentioned, I have a total of 588 ranges, where is a private key of puzzle 66. Each range requires a 48-bit computation (I am referring to GPU computation). and I am seeking an individual who is capable of performing these computations within few minutes or at least an hour. As for our collaboration approach, I am currently developing a script to scan all 588 ranges. Once the private key is obtained, the script will automatically perform the following actions: 2% of the amount will be deducted as fees, 59% will be sent to the individual performing the computations, and 39% will be sent to me. my bitcoin address and the computation performer's bitcoin address will be pre-entered into the script. The reason for allocating 59% to the computation performer is due to their resource usage, whether through GPU rental or electricity consumption. I intend to share the entire script with the individual to ensure transparency, while keeping the ranges known only to me. Once the script initiates, neither of us will have any access to it. But when scanning of one range completed, it will be saved along with the proof of work. Certainly, it will take me some time to perform all these processes. So why not continue searching for that person in the meantime?
(This range is an example of 588 ranges: 3b07a000000000000:3b07affffffffffff, and this address is for proof of work: 1GYpdGZBaqRDKkpFWbaRezrVeGy6g6UNfE, 1Ngdkik5LLGzmzYUWKiPYDQ6CRRGWCPo5L, 19XbiMqyqeaJLDSvHLzhJkxngDYsBPXTQo, 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so)
The person who will perform the counting of this range needs to be scanned and to post here with proof of work, or they can personally DM me as well. In this interaction, I will assess their operational speed in completing this 48-bit range. For scanning, they can use any software, but my suggestion is to use 'VanBitCrackenS v1.0' because here they can take advantage of multi-GPU. If the puzzle address falls within this range, then it will be yours. 👍 im sorry i didint see the bits, i cant cuz im using cpu but i have 1 question for you,, why your searching by address and not hash160 ? its 2 time faster than address, try it with keyhunt the last update its work faster two times than address, |
|
|
|
Hi, so i found 2 address similar 11 digits of hash160 in extraction of bit 130 that means if you scan on this range and have the private key of those one of two addresses we will split the 13 BTC , 1st 1AoNf67iZUmz1Ck9eefUfTzWQJMN5pgcPG 02113ba90a97c020ade0f3d8d0369981a723fe2bc4352815df22dd3eafae13c5a5 6b7e582a29a549cc60b591279a963f02eff02f99 pk:00000000000000000000000000000000000de4cfcadfc034c963dd053d719e88 address to search in :116 bit range 1AoNf67iZrwMSYPTDbk3Sh1yXJCARQbD7a 039d0a0241abe2411f64b4f6d29f2e1b6c837b26b6bdded577c3fc93574d3d735c 6b7e582a29a7601b79761f9f153c300c3d988231 range: 804cfcadfc034c963dd053d719e88:fffffcadfc034c963dd053d719e88 2nd 1PtStkm2bWKryHVduVjciPUxVx9UeDcCXG 02dc52ba09b16bc5cbd25aca7c82dd924f81cd31ecf29ecb264fa2cc45393728b9 fb0d9859584e68c24c1698eea4d05d2822fe4b70 pk: ad0f6ba584b355089cf6ce9cc9774 address to search in 116 bit range 1PtStkm2bLM7EK7g1rnTLBxu6aLouVuULV 03ef06cec3b3e35f68ba78618e5a5cf8663cc1a3b685dcfd197c1c0030530b1293 fb0d9859584d782df3fe652d2da5a21c30f137f9 range: 804cfcadfc034c963dd053d719e88:fffffcadfc034c963dd053d719e88 if the pk found of one of those address we will split the prize. they have the same 11 digits of hash160 that means maybe 90 pourcent is in that range |
|
|
|
Alright, after numerous calculations, I've come to the point where I need someone who is interested in puzzle 66 and capable of counting 48 bits within a few minutes. I have a total of 588 ranges for them to work on, with the opportunity to claim the prize of 6.6 BTC. Alternatively, if the author of the puzzle – the one who created this challenge to test the difficulty of increasing bits – has come across my post, I challenge them to assist me in improving my counting speed. I am confident in my ability to crack puzzle 66 in a matter of days.
im ready to work with you |
|
|
|
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Unique Randomm range: 3f3382a0000000000:3f3382a0fffffffff
Total scanned ranges: 40024
Remning keys decimal: 36,891,997,482,113,866,837
Scanned keys decimal: 1,490,665,305,236,394
Remaining percentage: 99.99595954359404%
Scanneddd percentage: 0.004040456405959958%
Lastt Found Address : 13zb1hQbZAEHh3WmZFkavbM47xrJzuf3MH 33FD61EF68878923E
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^
Charr Match Totalss : 8
Total Found Address : 2010
VanBitCrackenS v1.0
Keyspace start=3F3382A0000000000
Keyspace end=3F3382A0FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Aug 17 14:32:34 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1118.326 MK/s (GPU 1118.326 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Thu Aug 17 14:33:48 2023
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Unique Randomm range: 2028d0ed000000000:2028d0edfffffffff
Total scanned ranges: 40025
Remning keys decimal: 36,891,997,413,394,390,102
Scanned keys decimal: 1,490,734,024,713,129
Remaining percentage: 99.99595935732953%
Scanneddd percentage: 0.004040642670474881%
Lastt Found Address : 13zb1hQbZAEHh3WmZFkavbM47xrJzuf3MH 33FD61EF68878923E
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^
Charr Match Totalss : 8
Total Found Address : 2010
VanBitCrackenS v1.0
Keyspace start=2028D0ED000000000
Keyspace end=2028D0EDFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Aug 17 14:34:09 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1123.593 MK/s (GPU 1123.593 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Thu Aug 17 14:35:23 2023
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Unique Randomm range: 291cc519000000000:291cc519fffffffff
Total scanned ranges: 40026
Remning keys decimal: 36,891,997,344,674,913,367
Scanned keys decimal: 1,490,802,744,189,864
Remaining percentage: 99.99595917106501%
Scanneddd percentage: 0.004040828934989804%
Lastt Found Address : 13zb1hQbZAEHh3WmZFkavbM47xrJzuf3MH 33FD61EF68878923E
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^
Charr Match Totalss : 8
Total Found Address : 2010
VanBitCrackenS v1.0
Keyspace start=291CC519000000000
Keyspace end=291CC519FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Aug 17 14:35:44 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1117.955 MK/s (GPU 1117.955 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Thu Aug 17 14:36:58 2023
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Unique Randomm range: 2ad441a9000000000:2ad441a9fffffffff
Total scanned ranges: 40027
Remning keys decimal: 36,891,997,275,955,436,632
Scanned keys decimal: 1,490,871,463,666,599
Remaining percentage: 99.9959589848005%
Scanneddd percentage: 0.004041015199504727%
Lastt Found Address : 13zb1hQbZAEHh3WmZFkavbM47xrJzuf3MH 33FD61EF68878923E
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^
Charr Match Totalss : 8
Total Found Address : 2010
VanBitCrackenS v1.0
Keyspace start=2AD441A9000000000
Keyspace end=2AD441A9FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Aug 17 14:37:18 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1117.107 MK/s (GPU 1117.107 MK/s) (2^36.25) [00:01:13 Elapsed Time][1]
[EXIT] Reached end of keyspace.
Finish at Thu Aug 17 14:38:33 2023
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Unique Randomm range: 24bf5a43000000000:24bf5a43fffffffff
Total scanned ranges: 40028
Remning keys decimal: 36,891,997,207,235,959,897
Scanned keys decimal: 1,490,940,183,143,334
Remaining percentage: 99.99595879853598%
Scanneddd percentage: 0.00404120146401965%
Lastt Found Address : 13zb1hQbU5nSfRJRqPD4vM4rzsqNJVRkVU 2AD441A91FD312E69
Puzzl Sarch Address : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so.._________________
Prfix Match Address : ^^^^^^^^ ^ ^
Charr Match Totalss : 10
Total Found Address : 2011
VanBitCrackenS v1.0
Keyspace start=24BF5A43000000000
Keyspace end=24BF5A43FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Aug 17 14:38:53 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1124.087 MK/s (GPU 1124.087 MK/s) (2^36.25) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.
Finish at Thu Aug 17 14:40:08 2023 See the percentage of scanned keys, this is quite painful. Well, until now, I've understood that there's no effective method other than brute forcing. Would anyone be willing to share a scanned range with me, but not fake, completely genuine and clean? Because these 40,000 ranges are absolutely clean i suggest to try ranges have similar two or three exemple, 2C000,2555DB,28181...... no one will search here and random mode wonte complete this range because people choose random 1 million, 10, 100 or 1000 million like you do, it wont complete all the range, i think and my opinion, the pk of this puzzle have 3 same digits and i bet of that, and 80 pourcent of people searche in 300 range... lets search in the 20 2f bros i think its in there too , |
|
|
|
just put in your mind something, there is a lot of professional users here, we did think of all possibilities, dont you think that we already think of your idea ? of course we did think of a lot
The quote above is a golden statement, I like the way you emphasize on "we".😅 You never know if an idea is possible to execute or not until either you or someone else puts it to test. Sorry if I offended your professional spirit. The sprit of idea is how powerful it is in the bearer's minds, someone else might hear it and see it as something impossible or otherwise stupid but only until it comes to past will they now believe that there is possibility in everything. Don't be surprised that the ideas sometimes thought to be possible are actually the ones that are impossible... for example: thinking Quantum computers would be able to break the ECC SECP256K1 curve someday... these ideas are the ones that should be erase from the minds or ignorant people. but unfortunately if you stack millions of GPUs in a single machine you'd gain momentum... the point is, millions of GPUs stacked together in a single machine doesn't mean that that's a quantum computer. It means you have enough resources. So likewise, good ideas are sometimes what the fools would never see any meaningful reasoning to, whereas they'd rather buy the false imaginations. Don't stop sharing ideas brother, because sometimes, you only have the half of the full idea, someone else might have the remaining half and make it a full idea and not a "fool's idea" as Kalos had made it feel earlier. bro i said that because the newbie members always share the same idea, from years we see the same ideas and reply to it, please for newbie to read this and the other thread of the puzzle do not spam thats what i want to say |
|
|
|
Here is another idea, lets see if it can be done or has any merits to it. If we know the exact start and end range of a public key, we could divide the end range by a number to reduce it down as much as possible, maybe making it a 6 digits number, now we only have to change our 6 digit number and multiply it by the number which we first divided our end range with, we need to change the numbers in a way that it never goes beyond our end range when multiplied. Now, before doing that, we need to add and subtract 1 G to our target and divide the results by 2, e.g. if our target is 256, we add 1, 2, 3, 4 etc and divide them all by 2 also we will add n/2 to all the results just to be safe and keep all of the keys to compare with our multiplication result. Eventually if we change our nonce, ( 6 digit number ) enough times and multiply it with powers of 2, 3 etc somewhere we should see a known key. A simple example : Start range 1, end range 512, our target is 95, now we divide 512 by 32 to get 16. But first lets generate some offsets for our target. Add 1 to 95 = 96/2 = 48 Add 3 to 95 = 98/2 = 49 Add 5 to 95 = 100/2 = 50 Sub 1 from 95 = 94/2 = 47 Sub 15 from 95 = 80/2 = 40 Now we have 48, 49, 50, 47 and 40, then we multiply 16 by 2, 3, 4, 5, 6, 7, etc until we see one of the keys above. Imagine if we generate different offsets, like billions of them, then we could simply keep multiplying to find one of our targets.
This just came to my mind today, it's not cooked well , yet!😉 I already tried and test it and much more that I don't remember but when someone refer it I already know how it will slap our ass  ! The reason this and every similar approach won't work is strictly due to the modular behaviour of calculations! Which is why BSGS Kangaroo has thus far been the best approach which is increasing the chances of luck and meet at middle! However, any other way around addition and subtraction would not work trust me, BECAUSE there is no full stop, when your calculations go pass around the curve and completes a circle, it actually passes your assumed mark,, funny thing is IT WON'T RING A BELL OR SHOW ANY ALERT!!!!!!!! It would still be showing you the point and you'll be happy assuming it as per your assumption but it would change itself from being ODD to EVEN, thats where everyone go nuts when things don't work as per assumptions, elliptically speaking LOL!! [/quote] hi brother, if you are a newbie here,, and you just have that idea today come to your mind, just put in your mind something, there is a lot of professional users here, we did think of all possibilities, dont you think that we already think of your idea ? of course we did think of a lot , do you have the right materiel hardware to do that if you do than ok we are with you lmao, its impossible to do it bro, if you exctrat billions, still terramillions remains ... |
|
|
|
Let's think before do something. We need to find puzzle #130 before the rivals.
Suppose they have 512 GPUs like 3090 (what they have 256 is exactly clear) in average they need ~306 days to solve #130.
If we reduce to range 2^119 bit and rent GPU we need 16 GPUs 3090 to solve 119 bit range in 306 day for every public key.
Price for 4x3090 $0.7/h or $67.2/d * 306 = $20563 Someone willing to shell out 20K for the theoretical possibility of winning?
Don`t forget that we should search 1024 public keys. So we need 1024 participants with at least 16 GPUs 3090 cards everyone.
Using tame and wild kangaroos separately is a good idea. Because we only need to generate tame kangaroos once.
Another point is that to launch only wild kangaroos, we needed tame kangaroos in an amount of at least x2-3 from the expected.
And the supply of tame kangaroos must cover the number of wild kangaroos for the worst case.
For 119bit expected op = 2^60.55 with DP size 27(~470Gb) need at least 2^33.55 Tame Dps to run only wild kangaroos.
I'm not criticizing, but just arguing whether it's worth starting at all without having the resources.
In fact, there are not many hunters here, especially those who have several dozen video cards of the RTX 3090 level.
Just reasoning.
lets think ok, how do you think ? you yes bros i dont know how are you thinking and calculation things with no logic no ideas no clue about what are the hell you are talking about so he open 125 in 4 months? bro he maybe find it in the range of 11 or 12 )) he didint finish all the ranges so you come here and calculate us the solver of 125 he solved the puzzle in 4 months that means he finish all ranges in that time bro maybe the pk in the range of 1 fucking 0 f so please dont calculate i dont need your calculation and no one need it, we are solving a puzzle, and congrats for him he solve it,, the result of this puzzle is testing the btc network and cracking the wallets using public key, we are not here to be millionaires thank you, i wont buy 150 gpu i will create something bigger than keyhunt, thats how we go further not by byuing hardware bro, we create. I spent about $30k over a couple of years renting cloud services to attack these puzzles with no luck. I'm down to about $1k a year in electrical costs running my own equipment right now. It would be interesting to know how much others are willing to gamble on this. Given a large enough pool of money, we should set up a LLC to attempt this in a more organized and professonal manner. If 120 and 125 was cracked by the same person/group then I'm going to suggest that it was done by an investment fund.
Not only that, the person that cracked 120 and 125, are also attacking 130 now. So we need to unite. why bro we need to unit ? are you okey ?? bro anyone can crack this puzzle and the winenr got the prize congrats for him and if he solve 130 135 etc we say congrats not we must be unit or wtf you say ... you just want the money ? |
|
|
|
I have other question. I want for fun reduce puzzle key #125 to total of 100 bits. Can anyone tell me the steps? AND tell me if this is actually possible? lol..
I know i will land on tons new pub keys but is there a program that reduce bits ?
yes and with easy steps https://github.com/WanderingPhilosopher/Windows-KeySubtractor |
|
|
|
i found this address in substraction of 125 13zb1hQ664XDDhM2LkWLLa23cdbhHwya7c # 19.................... hash 160 : 20d45a6a51bc082aeb4d344be937b1bd4ea1f238 am i close if i search in the range 66 cuz the address looks like its in that range it starts with same 7 digits with 66 puzzle and same 8 first digits of hash160... 02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f who can scan in kangaroo 66 bits in 5 min or less ? if you find this address we will split the 12 btc  , of course if it is in that range im not sure im asking you guys ? └─$ ./keyhunt -m bsgs -f tests/testpubkey.txt -k 1500 -S -t 10 -b 66 - Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
- K factor 1500
- Threads : 10
- Mode BSGS sequential
- Opening file tests/testpubkey.txt
- Added 1 points from file
- Bit Range 66
- -- from : 0x20000000000000000
- -- to : 0x40000000000000000
- N = 0xfffb4000000
- Bloom filter for 6291456000 elements : 21566.38 MB
- Bloom filter for 196608000 elements : 673.95 MB
- Bloom filter for 6144000 elements : 21.06 MB
- Allocating 93.00 MB for 6144000 bP Points
- processing 6291456000/6291456000 bP points : 100%
- Making checkums .. ... done
- Sorting 6144000 elements... Done!
- Writing bloom filter to file keyhunt_bsgs_4_6291456000.blm .... Done!
- Writing bloom filter to file keyhunt_bsgs_6_196608000.blm .... Done!
- Writing bP Table to file keyhunt_bsgs_2_6144000.tbl .. Done!
- Writing bloom filter to file keyhunt_bsgs_7_6144000.blm .... Done!
- Total 36893523135430656000 keys in 720 seconds: ~51 Pkeys/s (51241004354764800 keys/s)
End Your precious key is not in this public key range. Provide some more let's scan. We will hit the key soon and share some funds too. thank you for your try bro,, if i found another anything special ill share, thanks again |
|
|
|
This part of your post "19...................." is more important, but you are hiding it, so.... And I think pretty much addresses and private key ranges have no relation, it is useless to look for addresses when you do operations on public keys. Besides, you have to tell us whether this key is -n or +n, but if you give me the key you subtracted from #125 which starts with 19, I could tell you the -n or +n of this key 02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f im sorry i just saw now -n and +n,, i thought you where saying -a , -s ... what is +n and -n bro ? |
|
|
|
This part of your post "19...................." is more important, but you are hiding it, so.... And I think pretty much addresses and private key ranges have no relation, it is useless to look for addresses when you do operations on public keys. Besides, you have to tell us whether this key is -n or +n, but if you give me the key you subtracted from #125 which starts with 19, I could tell you the -n or +n of this key 02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f so bro, because i told you 3 or 4 times how it work, i think you dont know enough how it works the substraction,, its simple if you substract 125 to lower range , its only you put -s in commande keysub line ... so you will get this pubkey # + 11000000 pubkey # + 11001000 pubkey # + 11002000 pubkey #target so, the search range here is ? you know it,, its 11001000-11000000 =1000 we do this -bsgs -m xpoint ... range 1000:1ffff or anything you are using to searche the range,,, thats how you substract the range,,, if you are using -a command that means bro,, 125 +++ ,, you are in bigger range,, maybe in 2f300000000000000000000000000000 or 3f or 4f if you want to substract you only use -s im teaching you because i know you didint get it,,, and if you did get it ,,, when i post the public key of 13zb1hq. and told you guys its 66 ,,, its obious its -s you cant ask me if its a + or - ........ bro +++++ that means lower range that means the commande is -s ,,, dont use -a ,, if you substract the puzzle 125 from fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cc1e825e6 to 1 to 125,, you only use -s,,, with this methode, you are substracting lowering the range from zero to 125,, if you do + and - ,, you wont ever be close to anything and you will pass your lifetime doing this on your txt file trying to solve the public key hexes its obious you didint figure it out how it works because you are working on public keys directly, you are seeing the hexes all around your txt file and you dont see any address and dont be angry or anything im just trying to help you here. |
|
|
|
i found this address in substraction of 125 13zb1hQ664XDDhM2LkWLLa23cdbhHwya7c # 19.................... hash 160 : 20d45a6a51bc082aeb4d344be937b1bd4ea1f238 am i close if i search in the range 66 cuz the address looks like its in that range it starts with same 7 digits with 66 puzzle and same 8 first digits of hash160... 02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f who can scan in kangaroo 66 bits in 5 min or less ? if you find this address we will split the 12 btc , of course if it is in that range im not sure im asking you guys ? |
|
|
|
Guys I need some help over here! So here is what I have so far.
I have subtracted this from #125.
0000000000000000000000000000000010******************************
The result is :
02c473281c8531d524c1a2b92b9192ffe3e8124448e47ec306f146f2f4f35269ee
Now if I add that result to this one :
0387a3951644f3bf9ee08135bcb9a00a31ed7b09e26ff7850b83713eb6f0582920
I get this key :
000000000000000000000000000000000c******************************
Ok, now I have the distance between the green key above and #125, which is :
000000000000000000000000000000000 4******************************
So why can't I figure the correct key while I have my double triangle, 3 known keys plus 3 unknown keys?
i told you multiple times, to test that on any other puzzle 100 or 115 you will figure out how it works,, get the private keys of substracted puzzle 110 and you will understand bro, then test it on 125,, when you substract told you to do this range 0:1fffffffffffffffffffffffffffffff you will have 125 substracted maybe to 100 or even 80 bit, but you need to know where exactly you can do that -f address |
|
|
|
Still no words about the system you were supposed to buy with a few grands you received as a donation a couple of months ago? Maybe you live far far away from civilization, that's why it has taken you so long!
~regards.😉
I'm going to go for the computer tomorrow, they already assembled it. I hope start the developing for GPU ASAP
Guys i release some kind of server for BSGS if some of you want to test it. I did some separate readme for it BSGSD.md I hope you like it thank you for you effort, but i didnt understand hwo the server and client work, im using keyhunt windows, and i want to try the serve, i have a question is , if i scan bsgs with the server it wont scan the same ranges again ? it means always new ranges ? and if there is a tuto on windows how to install and run the server with bsgs thank you ? |
|
|
|
@kalos, I don't know what you are doing looking for addresses in 125 bit! When you have public key.
But, here let me give you a hint
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c
0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159
Add the keys above to each other and tell me what you see.
i told you im working on 125 bit, that means, im substracting the 125 with -f address to find similar address because when you substract you will have the end space ffffffff..... to 125 bit space,,, we can get any address in bit 90 or 100 im trying to guess a smaller range to search the sub there you get it bro ?? and yes there is a diffrence, and for now im working on public keys to find their range exactly that will help scaning in smaller range instead of scaning in hole 125, im looking for address in 125 ? did i say that ?? no bro,, ill show exemple keysub -p 0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e -s -n 2147463600000 -r 0:1f245bd3efe3ab8768efc849659bef11 -o D:\test3994.txt so here , ill have the address from end range to 120, im searching for closer range by matching same address first 7 digits or hash160. |
|
|
|
guys, windows is closing. we need a new method to solve ECDLP with wallet address only.
Yeah about that, it's the other way around, we solve the address using EC only, the DLP part can be solved through public keys and not addresses.
I have an idea, why not picking a key from the middle of 66 bit range and start adding and subtracting to it using key subtract in address mode, you never know, you might get lucky and find puzzle 66, at least this way you could adjust start and end range of addition and subtraction, then you could for example, add and subtract 1 million keys to your middle of the range key with this stride "10000000000" and then add and subtract the same to another key, repeat that until you see #66 address, but we have no tool capable of doing that by itself, so you'd have to do addition and subtraction a few million times by hand, but if we could modify key subtractor to do that by itself, it would be great. I wonder who is a wondering developer around these woods? !!!😉 thats what im doing in 120 and 125 now for months , now im just searching for addresses that matches the range of 00000000000000 or end range fffffffffff to guess the range of 125 bit.. my opinion from lot of calculations, pr of 125 between 30 and 9f.. the a to f range is in the end of keyspace i guess that and i dont know for sure but im trying, now,, and ,, no digaran thats a bad idea,, you substract only from the public key and try to guess the range by similar first 7 digits of address is the same in range 100 or 80,,, but doing that to find 66,,, no men,, ill run vbcr with 10mkey per second and not substraction of 1 million per 10 minutes and searching,, bad idea, but its good on 125 onlyy ,,, thats is impossible to get lucky and have find address that you now its prvkey,, but its not impossible,, sometimes i do that for fun, but you must be very lucky men |
|
|
|
|
thats excellent but we need this to work on cpu as well .. we are waiting for the cpu v
|
|
|
|
|
