Title: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 06, 2021, 10:32:19 AM 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. 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. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: brainless on July 06, 2021, 10:57:31 AM This discussion was forked from the various Bitcrack, VanitySearch, and Kangaroo threads about public key scaling. Here i mention what is div numbers work in ecc 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. 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. https://bitcointalk.org/index.php?topic=5244940.msg57373246#msg57373246 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: WanderingPhilospher on July 06, 2021, 05:44:11 PM This discussion was forked from the various Bitcrack, VanitySearch, and Kangaroo threads about public key scaling. Yeah that has nothing to do with what I was really saying. When you divide, you create double the pubkeys versus other methods, to get down to the same bit range.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. 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. Brainless is his own person, he will give you tips but not the whole formula :) Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: Stroncow on July 06, 2021, 09:29:58 PM I did a test run here: https://pastebin.com/raw/QZj7VSa3
I tried scrolling down from different spots. And I tried these different points with Puzzle 120. The result is negative. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 08, 2021, 08:20:22 AM I did a test run here: https://pastebin.com/raw/QZj7VSa3 I tried scrolling down from different spots. And I tried these different points with Puzzle 120. The result is negative. I'm assuming that this is output from https://github.com/albertobsd/keysubtracter , which can only subtract keys but not divide them? Also, what exactly do you mean by "the result is negative", since it's obviously infeasible to test these keys by attacking #120? I wonder what would happen if we first divided by one of @brainless magic ecc numbers (https://bitcointalk.org/index.php?topic=5244940.msg57373246#msg57373246) followed by adding subtracting the pubkey to get one of these numbers of public keys? 2 447 7572 564114 3 596 9536 752152 4 631 10096 1128228 6 894 14304 1504304 8 1192 15144 2256456 12 1262 20192 3008608 16 1788 28608 4512912 24 1893 30288 6017216 32 2384 40384 9025824 48 2524 60576 18051648 64 3576 94019 96 3786 121152 149 4768 188038 192 5048 282057 298 7152 376076 I'm not sure of the significance of these numbers so maybe a backstory on how you came about these numbers could be useful. Does it make the overall search time faster? ??? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: _Counselor on July 08, 2021, 10:47:22 AM I'm not sure of the significance of these numbers so maybe a backstory on how you came about these numbers could be useful. Does it make the overall search time faster? ??? Those numbers are factors of secp256k1 modified order n = 115792089237316195423570985008687907852837564279074904382605163141518161494337 (prime number) n-1 = 115792089237316195423570985008687907852837564279074904382605163141518161494336 (composite number) factorisation of n-1 into primes: 2*2*2*2*2*2 * 3 * 149 * 631 * 107361793816595537 * 174723607534414371449 * 341948486974166000522343609283189 18051648 = 2*2*2*2*2*2 * 3 * 149 * 631 9025824 = 2*2*2*2*2 * 3 * 149 * 631 6017216 = 2*2*2*2*2*2 * 149 * 631 and so on I don't see any special magic here. In fact, BTC's real private key can be divisible by any prime number and also can be prime by itself. Due to the fact that secp256k1 is a cyclic group, we cannot check whether the result of dividing an unknown number (public key) is an integer or a fraction (in real math, outside of cyclic group), so we cannot make any meaningful conclusions from the results obtained. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 16, 2021, 12:58:48 AM TELL ME PLEASE SOMEONE, HOW TO SUBSTRACT OR DIVIDE PUBKEY FROM for. ex. 120 TO 60 BITS WITHOUT GENERATING PUBLIC KEY IN AMOUNT 2^60 OR IN AMOUNT (2^120 - 2^60) ?
80 GIGABYTES OF PUBLIC KEY'S IS DRAMATICALLY UNUSABLE !!! :'( REGARDS !!! Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 16, 2021, 02:06:28 AM TELL ME PLEASE SOMEONE, HOW TO SUBSTRACT OR DIVIDE PUBKEY FROM for. ex. 120 TO 60 BITS WITHOUT GENERATING PUBLIC KEY IN AMOUNT 2^60 OR IN AMOUNT (2^120 - 2^60) ? 80 GIGABYTES OF PUBLIC KEY'S IS DRAMATICALLY UNUSABLE !!! :'( REGARDS !!! You can't. Also as WanderingPhilosipher mentioned in a linked thread, you have to be careful not to divide by too much, or you will actually increase the number of group operations that you have to do and increase the runtime. 2^60 is way too much, even 2^20 makes the number of group ops bigger than a single 2^120 key. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 16, 2021, 02:24:37 AM TELL ME PLEASE SOMEONE, HOW TO SUBSTRACT OR DIVIDE PUBKEY FROM for. ex. 120 TO 60 BITS WITHOUT GENERATING PUBLIC KEY IN AMOUNT 2^60 OR IN AMOUNT (2^120 - 2^60) ? 80 GIGABYTES OF PUBLIC KEY'S IS DRAMATICALLY UNUSABLE !!! :'( REGARDS !!! You can't. Also as WanderingPhilosipher mentioned in a linked thread, you have to be careful not to divide by too much, or you will actually increase the number of group operations that you have to do and increase the runtime. 2^60 is way too much, even 2^20 makes the number of group ops bigger than a single 2^120 key. Thank you for the answer. I was look at my bookmarks and get link about cracking secp256k1, I the link infromation about group operations too, like in this thread https://github.com/christianlundkvist/blog/blob/master/2020_05_26_secp256k1_twist_attacks/secp256k1_twist_attacks.md Regars. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: abrahamtownsend on July 21, 2021, 08:15:06 AM By dividing, you can increase the number of public keys in comparison to other methods. I don’t think anyone would ever give you the whole formula to do it correctly.
Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 21, 2021, 09:16:36 PM By dividing, you can increase the number of public keys in comparison to other methods. I don’t think anyone would ever give you the whole formula to do it correctly. Definitely Yes ! No on not know exact. This is some my trying's: Quote https://bitcointalk.org/index.php?topic=5244940.msg57402519#msg57402519 it was just an example (random k generated) from 120 puzzle we substract the starting range 800000000000000000000000000000 and we obtain the following K 03D943C68C5F958B14524CDBEF68168D6C018E101F4F7074E0C31686384A82F52F N/2 - above K = 026C25951D1BB97C7DE3020DF0F725487FC33CC1210A155755514B7BF384AACFAD From this K which is basically N/2 - Puz120 K + START-RANGE we add random K in the interval (0x1 - 7FFFFFFFFFFFFFFFFFFFFFFFFFFFFF) We compute 10kk points in the range (N/2 - 10kk, N/2), points which cover the following range if we exclude parity (N/2 - 10kk, N/2 + 10kk) Maybe i will draw something tomorrow for better understanding. PS: I'm not saying this method will be exponentially "better" but it will double the chances to find k this is not work ! Quote https://bitcointalk.org/index.php?topic=5244940.msg57386530#msg57386530 Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better. Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is: C23BD97E765A75F0D6D4A6C6B67221. So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key. Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of: 0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key. Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range. So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF Correct. ------ i was thinking last night that we treat each keyspace as if they were separated by a wall but they are not so i measured the distance between 115 and the center of 60 then reduced the public key of 115 by that amount. i hit the 115 public key ( i scanned a thru f on 60 and about one hour later I got a hit. Key found privkey fc07a1825367bbc Publickey 0242257a130fe109c25c2ca6c60af60e5849305f77370401299b63da2094ec0297 and the addition + 31464123230573851029232324144930570 . Trying it on 120 but so far no luck. i wish I had this kind of luck on 120 or the powerball lol. I have a image of the hit but don't think I can post it. The addition goes to the private key found Awesome! Quote i was thinking last night that we treat each keyspace as if they were separated by a wall but they are not so i measured the distance between 115 and the center of 60 then reduced the public key of 115 by that amount. i hit the 115 public key ( i scanned a thru f on 60 and about one hour later I got a hit. Key found privkey fc07a1825367bbc Publickey 0242257a130fe109c25c2ca6c60af60e5849305f77370401299b63da2094ec0297 and the addition + 31464123230573851029232324144930570 . ... So the center of 60, which was what, in your calculation? so you took 115 - minus middle of 60 = x and subtracted x from original 115 pubkey, right? And then you did a search in the 2^60 range? I cant copy what he was do it. I was try and unsuccessful ((((((((9999. Not known start range he was reduced or end of 115 range.... Another look to dived pubkey to 2: https://ask.sagemath.org/question/50288/multiply-the-point-by-2-1-mod-n/?answer=50743#post-id-50743 https://ask.sagemath.org/answers/50743/revisions/ Any worked I ideas ? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 22, 2021, 02:51:36 PM By dividing, you can increase the number of public keys in comparison to other methods. I don’t think anyone would ever give you the whole formula to do it correctly. I finally got around to testing my hacked-up script which you can copy here (https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca) to check that it produces the correct results when you divide public keys by numbers. I was pleasantly surprised to find out that they in fact matched the list of pubkeys that @WanderingPhilosipher gave me a while back (for #120's pubkey divided by 30, including the division by zero). That means we got at least one working method to do the division. Quote Wait I think you actually are right, given my example was done with 48 as the divisor which is not a power of two, and to generate the 2^110 shrunk pubkeys I called it with 2**10. It's a simple test. I will run my script to generate 30 pubkeys (of #120s pubkey, mine will actually kick out 31 because I also print out the 0 fraction), not a power of 2. They are listed below: ~ Now you run your script/the script you posted and see if the lists match. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: bigvito19 on July 22, 2021, 03:12:41 PM By dividing, you can increase the number of public keys in comparison to other methods. I don’t think anyone would ever give you the whole formula to do it correctly. I finally got around to testing my hacked-up script which you can copy here (https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca) to check that it produces the correct results when you divide public keys by numbers. I was pleasantly surprised to find out that they in fact matched the list of pubkeys that @WanderingPhilosipher gave me a while back (for #120's pubkey divided by 30, including the division by zero). That means we got at least one working method to do the division. Quote Wait I think you actually are right, given my example was done with 48 as the divisor which is not a power of two, and to generate the 2^110 shrunk pubkeys I called it with 2**10. It's a simple test. I will run my script to generate 30 pubkeys (of #120s pubkey, mine will actually kick out 31 because I also print out the 0 fraction), not a power of 2. They are listed below: ~ Now you run your script/the script you posted and see if the lists match. What all I have to install to compile the hacked-up script because I keep getting errors when I'm trying to compile it? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 22, 2021, 05:50:07 PM What all I have to install to compile the hacked-up script because I keep getting errors when I'm trying to compile it? You just need fastecdsa PyPI package. But to compile that you need gcc and the other build tools (on Ubuntu you can run "apt install build-essential" to get them all) you might also need something called libgmp-dev , -devel or similarly named. That'll give you the header files for arbitrary-precision math, required to implement ECC apparently. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 22, 2021, 06:37:43 PM Try someone find a privkey for this https://bitcointalk.org/index.php?topic=5350551.msg57521232#msg57521232
Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: dextronomous on July 22, 2021, 07:16:25 PM 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
Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 22, 2021, 07:29:00 PM 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 ? ::) Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 23, 2021, 11:06:52 AM This is a part of privkey - 986458768829923488 in hex db09b0615ad40a0. No one can't find a privkey of 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 ? ::) Then the problem just became easier, all you have to do is start from that hex number, add an appropriate amount of zeroes at the end, and search only that range until those zeroes become "f"'s. BTW. The range is actually 256-(15 hex chars in prefix * 4 = 60) = 196 bits of keyspace, so still far to high to find. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: wedom on July 23, 2021, 11:36:31 AM 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 ? ::) = 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d formula is incorrect 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d - is puzzle 60 with private key = 0XFC07A1825367BBE 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) = 0xb839c25f765a0167754204e7c60b26866dbc64e7f596f7a924f697475c50b51c (private key) pubkey = 0247c5b786a019f5575605c6c02b3e3e6c298d2b564d2e205313fac01a07557cb2 correct formula: 0xdb09b0615ad40a0 * 0247c5b786a019f5575605c6c02b3e3e6c298d2b564d2e205313fac01a07557cb2 = 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 23, 2021, 03:06:34 PM 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 ? ::) = 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d formula is incorrect 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d - is puzzle 60 with private key = 0XFC07A1825367BBE 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) = 0xb839c25f765a0167754204e7c60b26866dbc64e7f596f7a924f697475c50b51c (private key) pubkey = 0247c5b786a019f5575605c6c02b3e3e6c298d2b564d2e205313fac01a07557cb2 correct formula: 0xdb09b0615ad40a0 * 0247c5b786a019f5575605c6c02b3e3e6c298d2b564d2e205313fac01a07557cb2 = 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d Hello Man ! Glad to see there some who thant think ))) Quote 0x db09b0615ad40a0 * = 0348e843dc5b1bd246e6309b4924b81543d02b16c8083df973a89ce2c7eb89a10d formula is incorrect This is correct, but this 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 not privkey, this is publick key.Look: https://ibb.co/58B7ccr have you any ideas how to find a privkey for pubkey 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 ? because if this will be known this, not need to use a 0XFC07A1825367BBE. And you use a known privkey 0XFC07A1825367BBE, but then we not know privkey what to do ? I think need find a privkey for 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918. Quote 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) Interesting constraction ! I now will try to understand why is worked ))) Respect. ;) Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: wedom on July 23, 2021, 03:25:02 PM 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) Interesting constraction ! I now will try to understand why is worked ))) Respect. ;) if a*b=p, then b = p/a = p * a^-1 Quote This is correct, but this 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 not privkey, this is publick key.Look: https://ibb.co/58B7ccr I did not write that this is a private key. In the formula, you can see that this is exactly the public key. I just pointed out that for this formula the equality A*B <> C, if B = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 23, 2021, 03:40:00 PM 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) Interesting constraction ! I now will try to understand why is worked ))) Respect. ;) if a*b=p, then b = p/a = p * a^-1 BIG thank you !!! Quote This is correct, but this 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 not privkey, this is publick key.Look: https://ibb.co/58B7ccr I did not write that this is a private key. In the formula, you can see that this is exactly the public key. I just pointed out that for this formula the equality A*B <> C, if B = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 How to find something with known privkey for G(base point of secp256k1) for adding after to our calculus (somethin like KNOWNx64bytePrivkey*G(originalBP)+x1*G2(not originalBP)+x2*G4(not originalBP)=OURTARGET)? Regard. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: WanderingPhilospher on July 23, 2021, 03:47:49 PM 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) Interesting constraction ! I now will try to understand why is worked ))) Respect. ;) if a*b=p, then b = p/a = p * a^-1 BIG thank you !!! Quote This is correct, but this 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 not privkey, this is publick key.Look: https://ibb.co/58B7ccr I did not write that this is a private key. In the formula, you can see that this is exactly the public key. I just pointed out that for this formula the equality A*B <> C, if B = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 How to find something with known privkey for G(base point of secp256k1) for adding after to our calculus ? Regard. Finding something with known privkey is easy...you already know the privkey! Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 23, 2021, 03:56:46 PM 0XFC07A1825367BBE * inv(0xdb09b0615ad40a0) Interesting constraction ! I now will try to understand why is worked ))) Respect. ;) if a*b=p, then b = p/a = p * a^-1 BIG thank you !!! Quote This is correct, but this 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 not privkey, this is publick key.Look: https://ibb.co/58B7ccr I did not write that this is a private key. In the formula, you can see that this is exactly the public key. I just pointed out that for this formula the equality A*B <> C, if B = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 How to find something with known privkey for G(base point of secp256k1) for adding after to our calculus ? Regard. Finding something with known privkey is easy...you already know the privkey! Quote you already know the privkey! What are you talk about ?Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: WanderingPhilospher on July 23, 2021, 04:03:17 PM Quote How to find something with known privkey for G(base point of secp256k1) for adding after to our calculus ? What are you talking about?Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 23, 2021, 04:04:05 PM Wedom, How to find something with known privkey for G(original base point of secp256k1) for adding after to our calculus (for exaple, something like KNOWNx64bytePrivkey*G(originalBP)+x1*G2(not originalBP)+x2*G4(not originalBP)=OURTARGET)?
What you think about this ? Regard !!! Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: WanderingPhilospher on July 23, 2021, 04:46:14 PM Wedom, How to find something with known privkey for G(original base point of secp256k1) for adding after to our calculus (for exaple, something like KNOWNx64bytePrivkey*G(originalBP)+x1*G2(not originalBP)+x2*G4(not originalBP)=OURTARGET)? Still doesn't make sense COBRASWhat you think about this ? Regard !!! so you can take any 64BIT (not byte) known private key and add or multiply G to it and you are only adding 1s. G = 0x1 Known 64bit privkey = 0x8234567890abcdf0 0x8234567890abcdf0 + G = 0x8234567890abcdf1 0x8234567890abcdf0 + G + G = 0x8234567890abcdf2 0x8234567890abcdf0 + G + G + G + G = 0x8234567890abcdf4 Now imagine if you are trying to find YOURTARGET that is in a 2^120 range...how many additions (multiplications) do you have to do?! So again, what are you trying to do? You always want to be shady/sneaky without telling people what you are really trying to do. You give zero examples at lower bit ranges so people can follow what the heck you are talking about. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: brainless on July 26, 2021, 03:21:36 PM 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 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: BitcoinADAB on July 26, 2021, 08:28:29 PM Pollard's kangaroo / lambda / rho accelerator
https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 It will lead to inner loops, but all solvable. Profit: with one point addition, one will cover 6 points. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 26, 2021, 08:31:25 PM 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 Bro !!! It worked :) :) :) :) :) :) :) !!!!! E7D2AF2FC9FF9CAF795D2EED256567679873FC547A513AA85A8A2E2776AB88D9 * db09b0615ad40a0 babahtBamBamBamtratTatatattaTam ))) - fc07a1825367bbe p.s. I was send you 1 merit for "proof of work" ;) Big thank you Brainless !!! Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: bigvito19 on July 27, 2021, 12:07:44 PM Pollard's kangaroo / lambda / rho accelerator https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 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? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: BitcoinADAB on July 27, 2021, 05:32:30 PM When will you be done with that project? It depends on the people who will join the project. First they have to understand it and think that it is possible.Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: brainless on July 27, 2021, 06:41:18 PM Pollard's kangaroo / lambda / rho accelerator https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 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? 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 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 27, 2021, 07:12:37 PM Pollard's kangaroo / lambda / rho accelerator https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 It will lead to inner loops, but all solvable. Profit: with one point addition, one will cover 6 points. I think this method in Jacobian coordinates and endomorphism will be more good. https://paulmillr.com/posts/noble-secp256k1-fast-ecc/#unsafe-multiplication-for-key-recovery Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: BitcoinADAB on July 27, 2021, 09:17:24 PM Pollard's kangaroo / lambda / rho accelerator https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 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? 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 Example: pubkey = 02991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 This point becomes Point (x1, y1), but we don't know if it is Point 1, 2, 3, 4, 5 or 6. from our offline server: Code: Point 1 (x1, y1) (Now we can say that the example point was Point 1, but that is not important.) Remember: x1 = x4 and x2 = x5 and x3 = x6 y1 = y2 = y3 and y4 = y5 = y6 Lowest x = x1 or x = x4 x = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 Lowest y = y4 or y = y5 or y = y6 y = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63 That Point (x, y) would be the reference point to go on with. From that point you jump to another Point (x1, y1) according to your kangaroo / rho. It doesn't matter if you jumped to Point 1 or 2 or 3 or 4 or 5 or 6, your reference point would be that Point (x, y) in all cases. That makes kangaroo / rho faster. For example: A 'tame' that jumps to Point 2 will go on with Point 4. A 'wild' that jumps to Point 5 will also go on with Point 4 and we would have a solution. But this only works if you have the full Bitcoin range (1 ... n) like in our project https://bitcointalk.org/index.php?topic=5347791.0 (https://bitcointalk.org/index.php?topic=5347791.0) and not in a range like the puzzle #120 (2^119 ... 2^120 - 1). Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: bigvito19 on July 27, 2021, 11:00:10 PM 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? 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 Example: pubkey = 02991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 This point becomes Point (x1, y1), but we don't know if it is Point 1, 2, 3, 4, 5 or 6. from our offline server: Code: Point 1 (x1, y1) (Now we can say that the example point was Point 1, but that is not important.) Remember: x1 = x4 and x2 = x5 and x3 = x6 y1 = y2 = y3 and y4 = y5 = y6 Lowest x = x1 or x = x4 x = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 Lowest y = y4 or y = y5 or y = y6 y = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63 That Point (x, y) would be the reference point to go on with. From that point you jump to another Point (x1, y1) according to your kangaroo / rho. It doesn't matter if you jumped to Point 1 or 2 or 3 or 4 or 5 or 6, your reference point would be that Point (x, y) in all cases. That makes kangaroo / rho faster. For example: A 'tame' that jumps to Point 2 will go on with Point 4. A 'wild' that jumps to Point 5 will also go on with Point 4 and we would have a solution. But this only works if you have the full Bitcoin range (1 ... n) like in our project https://bitcointalk.org/index.php?topic=5347791.0 (https://bitcointalk.org/index.php?topic=5347791.0) and not in a range like the puzzle #120 (2^119 ... 2^120 - 1). So it works in the full range of 2^256 so what would be the expected operations? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: BitcoinADAB on July 28, 2021, 12:21:46 AM So it works in the full range of 2^256 so what would be the expected operations?
Then you will have all x and y coordinates for all 6 points with the effort of less than 2 point additions, what will increase the speed enormously. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: bigvito19 on July 28, 2021, 01:45:41 AM So it works in the full range of 2^256 so what would be the expected operations?
Then you will have all x and y coordinates for all 6 points with the effort of less than 2 point additions, what will increase the speed enormously. Expected operations in time as in how long would it take to solve a key? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: j2002ba2 on July 28, 2021, 02:04:53 AM So it works in the full range of 2^256 so what would be the expected operations?
Then you will have all x and y coordinates for all 6 points with the effort of less than 2 point additions, what will increase the speed enormously.
The speedup works only on Pollard Rho, at most sqrt(6) = 2.44 times. For Kangaroo only the negation (y) is applicable, with speedup at most 1.41 times (and bigger variance?) - AFAIK Jean-Luc uses it already. All this is well known: if we have a point (x,y) = k*G, the 6 points are (aix, bjy) = cidj*(k*G) with a3 = 1 mod p (matching the chosen value of c) b2 = 1 mod p c3 = 1 mod n (matching the chosen value of a) d2 = 1 mod n i∈{0,1,2} j∈{0,1}. One can calculate the numbers by finding the primitive roots mod p and n I.E. rp = 77643668876891235360856744073230947502707792537156648322526682022085734511405 rn = 106331823171076060141872636901030920105366729272408102113527681246281393517969 a = (rp(p-1)/3)2 = 55594575648329892869085402983802832744385952214688224221778511981742606582254 b = rp(p-1)/2 = 115792089237316195423570985008687907853269984665640564039457584007908834671662 = -1 c = rn(n-1)/3 = 37718080363155996902926221483475020450927657555482586988616620542887997980018 d = rn(n-1)/2 = 115792089237316195423570985008687907852837564279074904382605163141518161494336 = -1 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: brainless on July 28, 2021, 04:06:33 AM 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 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 28, 2021, 05:45:10 AM 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 Bro, what exact you mean ? Quote Compressed Address 15wJjXvfQzo3SXqoWGbWZmNYND1Si4siqV Public Key (hex) 020000000000000000000000000000000000000000000000000000000000000000 P 040000000000000000000000000000000000000000000000000000000000000000218f8534c5bf3 c23b4c1c32b6295484c1473ce4bd628ae258acbb955a0fcb75e 1FPjjJiE8XN6uG2NUmkWK4Au3uSnyKGr5p If for example any public P(x,Y) key without transaction and without balance, but another point P1(0(zero),Y with ballance and transaction it miant what P(x,Y) on the curve ? and any other P what have no transactions and no ballance not on the curve and if use this points success will be zero ? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: BitcoinADAB on July 28, 2021, 10:42:21 AM https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0
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 It doesn't matter what your x1 is or x2. Someone will jump from a different point to eg. Point 2 in that example and in this case that point will be Point 1 with (x1, y1) and someone else will jump to eg. Point 6 in that example and in that case that point will be Point 1 with (x1, y1). But both will have as result the point x = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 y = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63 as their reference point (the lowest values for x and y in the 6-Point-Group) and will go on with that point. Thereafter they will always have the same reference point and in the case of 'tame' and 'wild' it would lead to a solution. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: COBRAS on July 28, 2021, 12:00:15 PM https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 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 It doesn't matter what your x1 is or x2. Someone will jump from a different point to eg. Point 2 in that example and in this case that point will be Point 1 with (x1, y1) and someone else will jump to eg. Point 6 in that example and in that case that point will be Point 1 with (x1, y1). But both will have as result the point x = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 y = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63 as their reference point (the lowest values for x and y in the 6-Point-Group) and will go on with that point. Thereafter they will always have the same reference point and in the case of 'tame' and 'wild' it would lead to a solution. Hello. Maybe is more simple get lovest or highest point from yours screen, and substract her from pubkey and brute after ? Regard. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: fxsniper on November 20, 2021, 02:12:13 AM This thread subtracting stop to talk meaning it is not works right?
if it is possible work can possible explain to new arrival to know again thread is continue from talk on kangaroo thread page 8x -9x seem need to understand knowledge about bit and ECDLP to understand right? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: bigvito19 on November 20, 2021, 12:59:06 PM https://lh3.googleusercontent.com/wNM-L8bDMPQZvgYpIG6TRDp_Vjn3oxMEuH3vQ_3QzTHC_ZnT1GwWgkBKLSWYuSc4RW1gqDkz3NhVbqc55YYp_AsAbTFSheOxLr_3=s0 Whatever happened to this?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 It doesn't matter what your x1 is or x2. Someone will jump from a different point to eg. Point 2 in that example and in this case that point will be Point 1 with (x1, y1) and someone else will jump to eg. Point 6 in that example and in that case that point will be Point 1 with (x1, y1). But both will have as result the point x = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8 y = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63 as their reference point (the lowest values for x and y in the 6-Point-Group) and will go on with that point. Thereafter they will always have the same reference point and in the case of 'tame' and 'wild' it would lead to a solution. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: mausuv on November 20, 2021, 03:45:28 PM this tool write subtract in c language https://github.com/WanderingPhilosopher/Windows-KeySubtractor/releases/tag/v1.0
yes i know this git code i am not understand c language so, input two point privatekey 3 - 2 = 1 point1 - point2 = point3 X Y point1 f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9 388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672 point2 c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5 1ae168fea63dc339a3c58419466ceaeef7f632653266d0e1236431a950cfe52a i need 3rd point subtract value please write easy understand make python or explain mathematicaly Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: ajeev on July 28, 2022, 04:36:09 AM 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 can any one know how he found this. thanks Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: NotATether on July 28, 2022, 07:03:19 AM dec = 104856515000339101452906010972016177983340459646873053037069757574992766929113 hex = E7D2AF2FC9FF9CAF795D2EED256567679873FC547A513AA85A8A2E2776AB88D9 pubkey = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 can any one know how he found this. thanks Well seeing I'm the one who made this thread, they appear to be multiplying the privkey with the pubkey to get a different pubkey/address: G*p*p = (G*p)*p = P*p, not that this helps with computing any private key. I imagine it would be more useful in generating vanity addresses , provided that two different values are used, not just two p's. Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: fxsniper on July 29, 2022, 10:19:29 AM I just follow this topic about subtracting
how can I use subtracting to find some point that adds a point then the result is pubkey 120? subtracting is not real subtracting like 9-1=8 and I can add 8+1=9 like this right this subtracting will be subtracted to another point right So, pubkey can not do reverse roll back one step before right? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: ajeev on July 29, 2022, 01:21:07 PM from fastecdsa import curve
from fastecdsa.point import Point import bit G = curve.secp256k1.G N = curve.secp256k1.q DIV = '02AE3482B19E840288CC9B302AD9F5DC017AB796D3690CC8029017A8AF3503BE8E' pubkey = '03ec0f4d728d248698a59d3a50a0469da06fdb8019700dfc5de9eae2dd93fc2bc8' def pub2point(pub_hex): x = int(pub_hex[2:66], 16) if len(pub_hex) < 70: y = bit.format.x_to_y(x, int(pub_hex[:2], 16) % 2) else: y = int(pub_hex[66:], 16) return Point(x, y, curve=curve.secp256k1) Q = pub2point(pubkey) R = pub2point(DIV) z= Q / R print(z) ----------------------------------------- >>> z= Q / R TypeError: unsupported operand type(s) for /: 'Point' and 'Point' CAN ANYONE HELP,HOW TO CORRECT THIS THANKS Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: PowerGlove on July 30, 2022, 01:29:25 AM TypeError: unsupported operand type(s) for /: 'Point' and 'Point' CAN ANYONE HELP,HOW TO CORRECT THIS THANKS You cannot divide a 'Point' by another 'Point' for the same reason that you cannot multiply a 'Point' by another 'Point'. See here: https://crypto.stackexchange.com/questions/88214/how-do-i-multiply-two-points-on-an-elliptic-curve Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: fxsniper on July 30, 2022, 05:49:07 AM z= Q / R I think the operation is z = Q * modInv(R, N) % N 1. Modular Inverse R 2. Q multiply Modular Inverse R 3. Total Modular N 4. the result is z My understanding divided in the Elliptic Curve is not mean 10/2=5 is not divided by normal math divided in Elliptic Curve = multiply the value with Inverse value and the result is Modular with N It is correct or not? Did I understand wrong? Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: wedom on July 30, 2022, 06:59:32 AM z= Q / R I think the operation is z = Q * modInv(R, N) % N 1. Modular Inverse R 2. Q multiply Modular Inverse R 3. Total Modular N 4. the result is z My understanding divided in the Elliptic Curve is not mean 10/2=5 is not divided by normal math divided in Elliptic Curve = multiply the value with Inverse value and the result is Modular with N It is correct or not? Did I understand wrong? z = Q * modInv(R, N) 1. Modular Inverse R 2. Q multiply Modular Inverse R 4. the result is z Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: wedom on July 30, 2022, 07:02:11 AM from fastecdsa import curve I answer here from fastecdsa.point import Point import bit G = curve.secp256k1.G N = curve.secp256k1.q DIV = '02AE3482B19E840288CC9B302AD9F5DC017AB796D3690CC8029017A8AF3503BE8E' pubkey = '03ec0f4d728d248698a59d3a50a0469da06fdb8019700dfc5de9eae2dd93fc2bc8' def pub2point(pub_hex): x = int(pub_hex[2:66], 16) if len(pub_hex) < 70: y = bit.format.x_to_y(x, int(pub_hex[:2], 16) % 2) else: y = int(pub_hex[66:], 16) return Point(x, y, curve=curve.secp256k1) Q = pub2point(pubkey) R = pub2point(DIV) z= Q / R print(z) ----------------------------------------- >>> z= Q / R TypeError: unsupported operand type(s) for /: 'Point' and 'Point' CAN ANYONE HELP,HOW TO CORRECT THIS THANKS https://bitcointalk.org/index.php?topic=5244940.msg60649916#msg60649916 Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: ajeev on August 03, 2022, 05:34:38 AM I'm not sure of the significance of these numbers so maybe a backstory on how you came about these numbers could be useful. Does it make the overall search time faster? ??? Those numbers are factors of secp256k1 modified order n = 115792089237316195423570985008687907852837564279074904382605163141518161494337 (prime number) n-1 = 115792089237316195423570985008687907852837564279074904382605163141518161494336 (composite number) factorisation of n-1 into primes: 2*2*2*2*2*2 * 3 * 149 * 631 * 107361793816595537 * 174723607534414371449 * 341948486974166000522343609283189 18051648 = 2*2*2*2*2*2 * 3 * 149 * 631 9025824 = 2*2*2*2*2 * 3 * 149 * 631 6017216 = 2*2*2*2*2*2 * 149 * 631 and so on I don't see any special magic here. In fact, BTC's real private key can be divisible by any prime number and also can be prime by itself. Due to the fact that secp256k1 is a cyclic group, we cannot check whether the result of dividing an unknown number (public key) is an integer or a fraction (in real math, outside of cyclic group), so we cannot make any meaningful conclusions from the results obtained. CAN YOU PLEASE TELL ME HOW YOU ARE SELECTING THOSE PRIME NUMBERS CORRECTLY. CAN YOU PROVIDE ME SOME EXAMPLE 447,596 THANKS Title: Re: Pubkey scaling/subtracting/other tips for reducing search time Post by: wedom on August 03, 2022, 12:26:56 PM I'm not sure of the significance of these numbers so maybe a backstory on how you came about these numbers could be useful. Does it make the overall search time faster? ??? Those numbers are factors of secp256k1 modified order n = 115792089237316195423570985008687907852837564279074904382605163141518161494337 (prime number) n-1 = 115792089237316195423570985008687907852837564279074904382605163141518161494336 (composite number) factorisation of n-1 into primes: 2*2*2*2*2*2 * 3 * 149 * 631 * 107361793816595537 * 174723607534414371449 * 341948486974166000522343609283189 18051648 = 2*2*2*2*2*2 * 3 * 149 * 631 9025824 = 2*2*2*2*2 * 3 * 149 * 631 6017216 = 2*2*2*2*2*2 * 149 * 631 and so on I don't see any special magic here. In fact, BTC's real private key can be divisible by any prime number and also can be prime by itself. Due to the fact that secp256k1 is a cyclic group, we cannot check whether the result of dividing an unknown number (public key) is an integer or a fraction (in real math, outside of cyclic group), so we cannot make any meaningful conclusions from the results obtained. CAN YOU PLEASE TELL ME HOW YOU ARE SELECTING THOSE PRIME NUMBERS CORRECTLY. CAN YOU PROVIDE ME SOME EXAMPLE 447,596 THANKS n-1 = 115792089237316195423570985008687907852837564279074904382605163141518161494336 447 = 3 * 149 596 = 4 * 149 the number n-1 contains 448 divisors: Code: 1 |