guys lets say 32 divisors will return 32 keys , one of will be guaranteed for lower range but what about other all keys , i guess they all are also valid ~~ so my question is all other keys are random in 256 range or what?
No random Pure calculated area in n order Let me give you examples in details Yes, Brainless provide examples pls ? Brainless, can you find a private key for one of "second"basepoint https://bitcointalk.org/index.php?topic=5357248.0 ? What you thin about a rage of "second basepoins" privateeys ? Thx. if you divide 1 by 32, you will get 0.3125 first zone is 0000000000000000000000000000000000000000000000000000000000000001 2nd zone is for 0.03125 F7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFEC4D965FF79CE5B39E1D3CB9869B48F37 (bitcrack start range) pubkey 03bb2228d3ea32cb3c1eb160cc824a4ba8115f9a7f415d18ddcaac8193defc2c47 same each step add into 0.03125 to 0.0625, till 31th key you will back to first zone if you take pubkey and multiply by 32 you will get 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 with this basic calc you can create all 32 zone for your each key to find in that range hope these will help you to start little bit more example dec 33 hex 21 pubkey 021697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5 use your program to get 32 keys of above pubkey you will see 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 in your list one step ahead pubkey is 1.03125 ( 03bb2228d3ea32cb3c1eb160cc824a4ba8115f9a7f415d18ddcaac8193defc2c47 + 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 ) and in private key F7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFEC4D965FF79CE5B39E1D3CB9869B48F38 029eda0cebe3c594b59add6dccbff3347f06ad09e83e0b9279dd821cc94284c5d0 hope you will test each zone for your understand |
|
|
|
guys lets say 32 divisors will return 32 keys , one of will be guaranteed for lower range but what about other all keys , i guess they all are also valid ~~ so my question is all other keys are random in 256 range or what?
No random Pure calculated area in n order Let me give you examples in details Yes, Brainless provide examples pls ? Brainless, can you find a private key for one of "second"basepoint https://bitcointalk.org/index.php?topic=5357248.0 ? What you thin about a rage of "second basepoins" privateeys ? Thx. if you divide 1 by 32, you will get 0.3125 first zone is 0000000000000000000000000000000000000000000000000000000000000001 2nd zone is for 0.03125 F7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFEC4D965FF79CE5B39E1D3CB9869B48F37 (bitcrack start range) pubkey 03bb2228d3ea32cb3c1eb160cc824a4ba8115f9a7f415d18ddcaac8193defc2c47 same each step add into 0.03125 to 0.0625, till 31th key you will back to first zone if you take pubkey and multiply by 32 you will get 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 with this basic calc you can create all 32 zone for your each key to find in that range hope these will help you to start |
|
|
|
guys lets say 32 divisors will return 32 keys , one of will be guaranteed for lower range but what about other all keys , i guess they all are also valid ~~ so my question is all other keys are random in 256 range or what?
No random Pure calculated area in n order Let me give you examples in details |
|
|
|
compress to uncompress import binascii
p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
def decompress_pubkey(pk):
x = int.from_bytes(pk[1:33], byteorder='big')
y_sq = (pow(x, 3, p) + 7) % p
y = pow(y_sq, (p + 1) // 4, p)
if y % 2 != pk[0] % 2:
y = p - y
y = y.to_bytes(32, byteorder='big')
return b'\x04' + pk[1:33] + y
with open('add.txt') as f:
for line in f:
line=line.strip()
print(binascii.hexlify(decompress_pubkey(binascii.unhexlify(line))).decode(),file=open("uncomp.txt", "a")) uncompress to compress def cpub(x,y):
prefix = '02' if y % 2 == 0 else '03'
c = prefix+ hex(x)[2:].zfill(64)
return c
with open('add.txt') as f:
for line in f:
line=line.strip()
x = int(line[2:66], 16)
y = int(line[66:], 16)
pub04=cpub(x,y)
print(pub04,file=open("comp.txt", "a"))
|
|
|
|
|
maybe your all calc wrong, giving you example
generate 70 bit random key, and use kanagroo to find it, note the time
then split 70 bit 65 bit with 32 keys and try to find one by one in 65 bit and note time,
then split 70 bit 65 bit with 32 keys and try to find 32 keys parallel in 65 bit and note time,
you will have time calc result
|
|
|
|
|
in short
when you create x1, x2, x3
pubkey will be break in raw, and back to reconstruct, and you will get proper series of x1, x2, x3
above my pubkey proper x1, x2, x3 is here
x1 = a673e97568057fb5f41c35d6ed6c88ef97510d71222b3686ef892f4ccc2af536
x2 = 991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8
x3 = c06d5d9f69b4cb8d6f720d8f106b442956061673b01e9da1cb0886fe59dd2860
mean that is x2
what you want is important what is correct location of x1, x2, x3
if you calc wrong, you will never reach at your target
|
|
|
|
Pollard's kangaroo / lambda / rho accelerator  It will lead to inner loops, but all solvable. Profit: with one point addition, one will cover 6 points. When will you be done with that project? here is pubkey 02991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 could you tell me first example if its x1 ? x2 ? x3 ? if its x1 then whats x2 and x3 print pubkeys , it will help to vistors for understand about x1 x2 x3 thankx |
|
|
|
Hi 1) Suppose I find pvk for puzzle #64 2) I import the bitcoin address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN 3) I start a full fund transfer to another wallet 4) My transaction shows up in the blockchain (showing number of confirmations) 5) Once my transaction has been launched, the publickey is then visible. My question is as follow: Is it possible for someone using "Pollard's kangaroo ECDLP solver" to find the private key fast enough to be able to import the same address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN and then launch a fund transfer to a different wallet ? (before enough confirmation on my transaction and of course pay more gas fees than me)  Theoretically, it is possible. Since, if the public key 64 is known, then it will take several seconds to solve the problem. Practically unlikely. No one will sit and wait for this key to appear. And it is not known if there will be a second blockchain Upd. Only if you set a very low commission and the transaction freezes for a long time, then yes. This scenario is possible. Hmm, we need to write a script that will track the mempool and immediately launch the kangaroo, search and immediately create a transaction with a higher commission. Joke ))) It is not a joke, such scripts exist ... It is not actually hard to do, just install a full node and the rest follows. It is easy to check that such watchdog-scripts are out there. use electrum in Tools >> transaction >> Use Replace-By-Fee by default its checked un check it before create your transaction, you will be safe |
|
|
|
you just explained that it has already been spend found. whe testing that key or what, what addition to add if found to get the right pvk. address. thanks
This is another good example with privrange ( ((2^60) - 986458768829923488 ) pubkey: 0x db09b0615ad40a0 * 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918
=
0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d(this is has a range 2^60 (address - 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su))This is a part of privkey - 986458768829923488 in hex db09b0615ad40a0.No one can't find a privkey of 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 ?  dec = 104856515000339101452906010972016177983340459646873053037069757574992766929113 hex = E7D2AF2FC9FF9CAF795D2EED256567679873FC547A513AA85A8A2E2776AB88D9 pubkey = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 |
|
|
|
This discussion was forked from the various Bitcrack, VanitySearch, and Kangaroo threads about public key scaling. for 20 bit down = 1024*1024 = 1048576 pubkeys
~
1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
I don't get this tip. When I tried to shift down #120 by 20 bit I was looking at 2^20 total pubkeys generated from this. How do you manage to make do with only 260 or 720 of them? That's even less than the 1024 pubkeys I obtained from shifting 10 bits down. Here is one tip, division equals twice as many pubkeys. Look at my post above, I can shift 16 bits down with the expense of only 2^15 keys, cutting the fat by half. With brainless, who knows, he is a wizard at pubkey/range reduction. Yeah that part was obvious to me, since in order to shift down by a bit you have to multiply the total number of result pubkeys by 2, effectively increasing the power. The thing is that 260 and 720 are not powers of two so it would be helpful if brainless could explain what he's doing here to get this result. Here i mention what is div numbers work in ecc https://bitcointalk.org/index.php?topic=5244940.msg57373246#msg57373246 |
|
|
|
in my view , we are talking off topic here , as my posts were deleted in past at this forum, and admin/mod and creator of this thread, reported, offtopic discus not allowed, maybe we get this warning again, till that some one wakeup, seems at all thread , bitcrack, 100 btc puzzle, 32 btc puzzle, all people sleeping, not fruit full posts, rear time post only left with newbie for just asking, how to install bitcrack, whats speed getting , Q etc
love to stay silent, before some one again report and post delete Start a new thread...or I can no need new thread, basically we are talking inside topic, and head topic is bitcrack, kanagroo ecdlp solver etc, but mod/creator thread, only want listen what they want, they dont want listen in depth, so in respect to there wishes, we work at our end, and no discussion, above i post tip, in depth every one can try at their own level |
|
|
|
btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it. Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range. And couldn't do it for less than .50 btc I guess we could see a mini-business appearing in the future of people selling reduced puzzle transaction keys, but this is obviously a very risky business too in the same way that bought wallet.dat brute-forcing is also high risk (and usually downright scam). for 20 bit down = 1024*1024 = 1048576 pubkeys
~
1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
I don't get this tip. When I tried to shift down #120 by 20 bit I was looking at 2^20 total pubkeys generated from this. How do you manage to make do with only 260 or 720 of them? That's even less than the 1024 pubkeys I obtained from shifting 10 bits down. Here is one tip, division equals twice as many pubkeys. Look at my post above, I can shift 16 bits down with the expense of only 2^15 keys, cutting the fat by half. With brainless, who knows, he is a wizard at pubkey/range reduction. in my view , we are talking off topic here , as my posts were deleted in past at this forum, and admin/mod and creator of this thread, reported, offtopic discus not allowed, maybe we get this warning again, till that some one wakeup, seems at all thread , bitcrack, 100 btc puzzle, 32 btc puzzle, all people sleeping, not fruit full posts, rear time post only left with newbie for just asking, how to install bitcrack, whats speed getting , Q etc love to stay silent, before some one again report and post delete |
|
|
|
btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it. Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range. And couldn't do it for less than .50 btc if 115 could be only 1 key, then is there any delay for 40bit for 1 key ?  and do you think july 2021 status at blockchain for 120 puzzle is solved and transfered Yeah I don't know riddler. I know you think outside the box, and I like that. I was messing with division and addition today and there were some keys that I could not find after reducing. Kinda scary. I was using BSGS to search for them (all were 52 bit and less.) If you can get it down to one key, down to a 40 bit, then the btc will be yours soon! I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... EDIT: I know how to get it down to a 40 bit range with 1 key, it would just take a very long time... btw last year i claim, i can find easily pubkey bitrange, check my past posts, btw puzzle 120 prvkey i found a year ago, but no interest, for cashout it, i am currently research on addresses, where no pubkey, like puzzle 64, for that, i request on forums, for modification at bitcrack, and some modification at gpu level pubkey addition and multiplications, unfortunately no developer have time to do it, end of this year , maybe at happy new year i announce first address of blockchain, belong to me So you found the private key and want cash in return for the key? No |
|
|
|
|
" I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... "
for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys
1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
now you can start to find with above tip
|
|
|
|
btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it. Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range. And couldn't do it for less than .50 btc if 115 could be only 1 key, then is there any delay for 40bit for 1 key ? and do you think july 2021 status at blockchain for 120 puzzle is solved and transfered Yeah I don't know riddler. I know you think outside the box, and I like that. I was messing with division and addition today and there were some keys that I could not find after reducing. Kinda scary. I was using BSGS to search for them (all were 52 bit and less.) If you can get it down to one key, down to a 40 bit, then the btc will be yours soon! I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... EDIT: I know how to get it down to a 40 bit range with 1 key, it would just take a very long time... btw last year i claim, i can find easily pubkey bitrange, check my past posts, btw puzzle 120 prvkey i found a year ago, but no interest, for cashout it, i am currently research on addresses, where no pubkey, like puzzle 64, for that, i request on forums, for modification at bitcrack, and some modification at gpu level pubkey addition and multiplications, unfortunately no developer have time to do it, end of this year , maybe at happy new year i announce first address of blockchain, belong to me |
|
|
|
btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it. Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range. And couldn't do it for less than .50 btc if 115 could be only 1 key, then is there any delay for 40bit for 1 key ? and do you think july 2021 status at blockchain for 120 puzzle is solved and transfered |
|
|
|
Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago Haha! Got it! Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found? If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year. If i print 720 pubkeys in 90 bitrange. How much days need to find ? Probably 1.5 to 2 hours per pubkey; but all Tames would be players, which may speed it up, especially the latter pubkeys. Would probably go with a little higher DP to try and cut down on tame and wild file size. How many pubs would be in the 2^90 range? 1/720. 90bit 16/260 110bit btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days , but here no one have this for work of months to days |
|
|
|
Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago Haha! Got it! Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found? If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year. If i print 720 pubkeys in 90 bitrange. How much days need to find ? Probably 1.5 to 2 hours per pubkey; but all Tames would be players, which may speed it up, especially the latter pubkeys. Would probably go with a little higher DP to try and cut down on tame and wild file size. How many pubs would be in the 2^90 range? 1/720. 90bit 16/260 110bit |
|
|
|
Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago Haha! Got it! Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found? If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year. If i print 720 pubkeys in 90 bitrange. How much days need to find ? |
|
|
|
Also, I have accomplished what brainless has done now/in the past, but with a twist.
I created 57 million pubkeys that all link to #120's pubkey but they all lie within the 2^120 range (the original search range 80000...FFFFF) They are all proportionately spaced out. I basically created a certain length "jump" if you will.
I first started the process to see how long it would take to create that many pubkeys, and after 20 million I just let it keep going and finally stopped it around 57 million.
I have the pubkeys and the applicable compressed addresses to each pubkey. I secondly was going to run a test and search for all 57 million addresses with my modified VanBitcracken (one could do it with bitcrack as well, I think. When I once tried loading an input file of over 25 million addresses, bitcrack wouldn't start/run) and see how much of an impact it had on GPU speed. I have yet to run that test. Funny thing is, I can run python on 1 CPU thread and check 2,000 keys per second no matter how many addresses I search, 1 or 57 million. Your only limitation is the amount of RAM you have.
Good job just correct one line Also, I have accomplished what brainless has done now/in the past, but with a twist. now/in the past >> in the past remove "now", as no one know whats NOW and in the past aprox a year ago |
|
|
|
|
Show Posts
