Pages:
Author

Topic: Pubkey scaling/subtracting/other tips for reducing search time - page 2. (Read 2075 times)

copper member
Activity: 75
Merit: 11
So it works in the full range of 2^256 so what would be the expected operations?

  • 1 point addition to have Point (x1, y1)
  • 1 subtraction to get y2
  • 2 multiplications to get x2 and x3
  • comparisions to get lowest x and lowest y

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.
full member
Activity: 706
Merit: 111
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

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)
x1 = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8
y1 = 0xeb3c392e5ac716a0cb40fa08e2616f47459e6a1cc0f2922836896a1ce5f631cc

Point 2 (x2, y2)
x2 = 0xa673e97568057fb5f41c35d6ed6c88ef97510d71222b3686ef892f4ccc2af536
y2 = 0xeb3c392e5ac716a0cb40fa08e2616f47459e6a1cc0f2922836896a1ce5f631cc

Point 3 (x3, y3)
x3 = 0xc06d5d9f69b4cb8d6f720d8f106b442956061673b01e9da1cb0886fe59dd2860
y3 = 0xeb3c392e5ac716a0cb40fa08e2616f47459e6a1cc0f2922836896a1ce5f631cc


Point 4 (x4, y4)
x4 = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8
y4 = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63

Point 5 (x5, y5)
x5 = 0xa673e97568057fb5f41c35d6ed6c88ef97510d71222b3686ef892f4ccc2af536
y5 = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63

Point 6 (x6, y6)
x6 = 0xc06d5d9f69b4cb8d6f720d8f106b442956061673b01e9da1cb0886fe59dd2860
y6 = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63

(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://bitcointalksearch.org/topic/calculating-satoshis-coins-5347791 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?
copper member
Activity: 75
Merit: 11
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

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)
x1 = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8
y1 = 0xeb3c392e5ac716a0cb40fa08e2616f47459e6a1cc0f2922836896a1ce5f631cc

Point 2 (x2, y2)
x2 = 0xa673e97568057fb5f41c35d6ed6c88ef97510d71222b3686ef892f4ccc2af536
y2 = 0xeb3c392e5ac716a0cb40fa08e2616f47459e6a1cc0f2922836896a1ce5f631cc

Point 3 (x3, y3)
x3 = 0xc06d5d9f69b4cb8d6f720d8f106b442956061673b01e9da1cb0886fe59dd2860
y3 = 0xeb3c392e5ac716a0cb40fa08e2616f47459e6a1cc0f2922836896a1ce5f631cc


Point 4 (x4, y4)
x4 = 0x991eb8eb2e45b4bc9c71bc9a022832e712a8dc1b2db62bd7456e49b2d9f7dac8
y4 = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63

Point 5 (x5, y5)
x5 = 0xa673e97568057fb5f41c35d6ed6c88ef97510d71222b3686ef892f4ccc2af536
y5 = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63

Point 6 (x6, y6)
x6 = 0xc06d5d9f69b4cb8d6f720d8f106b442956061673b01e9da1cb0886fe59dd2860
y6 = 0x14c3c6d1a538e95f34bf05f71d9e90b8ba6195e33f0d6dd7c97695e21a09ca63

(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://bitcointalksearch.org/topic/calculating-satoshis-coins-5347791 and not in a range like the puzzle #120 (2^119 ... 2^120 - 1).
member
Activity: 785
Merit: 20
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
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.

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
member
Activity: 296
Merit: 34
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
copper member
Activity: 75
Merit: 11
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.
full member
Activity: 706
Merit: 111
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?
member
Activity: 785
Merit: 20
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
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 ?  Roll Eyes



dec = 104856515000339101452906010972016177983340459646873053037069757574992766929113

hex = E7D2AF2FC9FF9CAF795D2EED256567679873FC547A513AA85A8A2E2776AB88D9

pubkey = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918

Bro !!!


It worked  Smiley Smiley Smiley Smiley Smiley Smiley Smiley !!!!!

E7D2AF2FC9FF9CAF795D2EED256567679873FC547A513AA85A8A2E2776AB88D9

*

db09b0615ad40a0

babahtBamBamBamtratTatatattaTam ))) - fc07a1825367bbe


p.s. I was send you 1 merit for "proof of work"  Wink


Big thank you Brainless !!!

copper member
Activity: 75
Merit: 11
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.
member
Activity: 296
Merit: 34
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 ?  Roll Eyes



dec = 104856515000339101452906010972016177983340459646873053037069757574992766929113

hex = E7D2AF2FC9FF9CAF795D2EED256567679873FC547A513AA85A8A2E2776AB88D9

pubkey = 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918
full member
Activity: 1022
Merit: 217
Shooters Shoot...
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 !!!
Still doesn't make sense COBRAS


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.
member
Activity: 785
Merit: 20
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
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 !!!
full member
Activity: 1022
Merit: 217
Shooters Shoot...
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?
member
Activity: 785
Merit: 20
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
0XFC07A1825367BBE * inv(0xdb09b0615ad40a0)

Interesting constraction ! I now will try to understand why is worked  )))

Respect. Wink


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.




He was telling you that your formula is incorrect. See man, you can't keep posting and asking people to help find x y and z when you really do not understand the math and formulas behind the curve...
Finding something with known privkey is easy...you already know the privkey!

Quote
you already know the privkey!
What are you talk about ?
full member
Activity: 1022
Merit: 217
Shooters Shoot...
0XFC07A1825367BBE * inv(0xdb09b0615ad40a0)

Interesting constraction ! I now will try to understand why is worked  )))

Respect. Wink


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.




He was telling you that your formula is incorrect. See man, you can't keep posting and asking people to help find x y and z when you really do not understand the math and formulas behind the curve...
Finding something with known privkey is easy...you already know the privkey!
member
Activity: 785
Merit: 20
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
0XFC07A1825367BBE * inv(0xdb09b0615ad40a0)

Interesting constraction ! I now will try to understand why is worked  )))

Respect. Wink


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.



jr. member
Activity: 48
Merit: 11
0XFC07A1825367BBE * inv(0xdb09b0615ad40a0)

Interesting constraction ! I now will try to understand why is worked  )))

Respect. Wink


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
member
Activity: 785
Merit: 20
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

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 ?  Roll Eyes

0x db09b0615ad40a0 * 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 * 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918
= 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. Wink


jr. member
Activity: 48
Merit: 11

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 ?  Roll Eyes

0x db09b0615ad40a0 * 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
legendary
Activity: 1526
Merit: 6442
bitcoincleanup.com / bitmixlist.org
This is a part of privkey - 986458768829923488 in hex db09b0615ad40a0.

No one can't find a privkey of 038141a3381c97660163ce69acf22d5a0cc8c09fcbb624fa556ff17629b4b31918 ?  Roll Eyes

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.
Pages:
Jump to: