Pages:
Author

Topic: Pollard's kangaroo ECDLP solver - page 88. (Read 60189 times)

member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
July 05, 2020, 06:08:11 AM

Please, someone make a scrypt for automatic shifting pubkey to "zero" ? I was try many times and not found any keys I think because of this. Manualy shift all pubkeys to "zero" is f**ing work, trust me please.

i don`t know for what you need shift pub key but any way here is python code and you can launch this code online https://repl.it/languages/python3

Code:


def inverse(x, p):
    """
    Calculate the modular inverse of x ( mod p )    
    """
    inv1 = 1
    inv2 = 0
    n=1
    while p != 1 and p!=0:        
        quotient = x // p
        
        inv1, inv2 = inv2, inv1 - inv2 * quotient
        x, p = p, x % p        
        n = n+1
    
    return inv2

def dblpt(pt, p):
    """
    Calculate pt+pt = 2*pt
    """
    if pt is None:
        return None
    (x,y)= pt
    if y==0:
        return None
    
    slope= 3*pow(x,2,p)*pow(2*y,p-2,p)
    
    
    xsum= pow(slope,2,p)-2*x
    
    ysum= slope*(x-xsum)-y  
    
    return (xsum%p, ysum%p)

def addpt(p1,p2, p):
    """
    Calculate p1+p2
    """
    if p1 is None or p2 is None:
        return None
    (x1,y1)= p1
    (x2,y2)= p2
    if x1==x2:
        return dblpt(p1, p)
        
    # calculate (y1-y2)/(x1-x2)  modulus p
    
    slope=(y1-y2)*pow(x1-x2,p-2,p)
    
    
    xsum= pow(slope,2,p)-(x1+x2)
  
    ysum= slope*(x1-xsum)-y1
    
    
    return (xsum%p, ysum%p)

def ptmul(pt,a, p):
    """
    Calculate pt*a
    """
    scale= pt    
    acc=None
  
    
    while a:
        
        if a&1:
            if acc is None:
                acc= scale
                
            else:    
                acc= addpt(acc,scale, p)                
              
        scale= dblpt(scale, p)
        a >>= 1
        
            
  
    return acc

def ptdiv(pt,a,p,n):  
    """
    Calculate pt/a
    """
    divpt=inverse(a, n)%n
    return ptmul(pt, divpt, p)


def isoncurve(pt,p):
    """
    returns True when pt is on the secp256k1 curve
    """
    (x,y)= pt
    return (y**2 - x**3 - 7)%p == 0


def getuncompressedpub(compressed_key):
    """
    returns uncompressed public key
    """
    y_parity = int(compressed_key[:2]) - 2    
    x = int(compressed_key[2:], 16)
    a = (pow(x, 3, p) + 7) % p
    y = pow(a, (p+1)//4, p)    
    if y % 2 != y_parity:
        y = -y % p        
    return (x,y)



#secp256k1 constants
Gx=0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798
Gy=0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8
n=0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
p = 2**256 - 2**32 - 977
g= (Gx,Gy)

#CHANGE HERE beginrange and pointstr
beginrange=0x80000000000000000000
pointstr = '037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc'

pt= getuncompressedpub(pointstr)
(subptx,subpty) = ptmul(g, beginrange, p)
result=addpt(pt, (subptx,p-subpty), p)
print("shifted result> 04%064x%064x"%result)

Code have all functions that you need to work with points.
P.S. Kangaroo app automaticly shift range and pubkey if begin range is not zero.


Good day Etar !

Help me please. Then I make revers operation -  (subptx,p+subpty), I not get starting pubkey !!!

So I cant go back to 037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc if I add starting range.

So 037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc - 80000000000000000000 = 043aeb4f818ca91912a3e50d1b3db196696f82713bae00ba2b53c09a23f1d284a085b2197137256 def6c05a0f105e1b1eee9c10d23b7a4911040a23e891ebb3dc9

---

043aeb4f818ca91912a3e50d1b3db196696f82713bae00ba2b53c09a23f1d284a085b2197137256 def6c05a0f105e1b1eee9c10d23b7a4911040a23e891ebb3dc9 + 80000000000000000000 =  041e8e77439c921a460ce4185b864329dcba5960646e93c59d5e7bbbea8dd913fcd83777dec0468 c76fdc5b0a4ce879086e66766f520386f9db6e1999d8b0e1ad0

Huh?

What I do wrong ?

sr. member
Activity: 652
Merit: 316
July 05, 2020, 02:27:51 AM
-snip-
I was trying to compile your "pure basic" server/client script but I don't seem to find this file: Curve64.pb 
-snip-
Here is link to archive https://drive.google.com/file/d/1XMxvxB1FGxfAi7hFMitiQpENUqvabiQ6
it is new version server/client for bitcrack with POW . Archive contain all source files, libs and precompiled applications.
Before use in a big range try in a small.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
July 04, 2020, 07:00:21 PM
Jean_Luc !!! Make please endomorphism for Kangraroo ?

You need only 8 byte additiona for your 120 bytes for mega rich bro (I think you know what I talk  Wink) and me need only substract only 40 bytes from pubkey , and with endomorphisfm we all maybe get some $$$

Please, Bro Huh?
member
Activity: 245
Merit: 17
July 04, 2020, 06:05:45 PM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.



You can't scan the 64 bit range with Pollard's kangaroo since the public key is unknown, we know only the address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN. Only keys in the 5 multiples (65, 70, 75, 80, 85,... 160) have spent values and therefore have their public keys published.

The only way to scan for address 64 is Brute force/Vanity search and plenty of luck.  
Vanity search does not allow you to set the starting and ending search ranges. I redid Vanity search on the CPU and used the public key as the initial range
But I could not remake it under GPU, because it uses a predefined file.
In general it is better to use Bitcrack for these purposes.
Especially when there is a server / client application for working with Bitcrack.
I redid my application that I posted here a while ago. Now i can use the connection from any client, not even trusted, because proof of work is used.

But here is another problem when the key will found and someone sends the transaction to their address. That transaction naturally will not be immediately confirmed, but the public lens will be visible. It costs nothing to intercept a public key. Solve it with a kangaroo and kill the transaction with a larger commission.

I was trying to compile your "pure basic" server/client script but I don't seem to find this file: Curve64.pb 
I found the crackhelperClient.pb and crackhelperServer.pd files  here: https://drive.google.com/file/d/1pFTvBLwTDF4GZCyDpJHwnWqfuNeOT6Ik/edit
member
Activity: 245
Merit: 17
July 04, 2020, 05:55:49 PM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.



assuming that your  8 rx570 can do 1Gkeys/s.  (10^9 keys/s)
puzzle 64 requires cheking 2^63 keys which is around 10^19 keys. So you need to wait 10^10 seconds to claim spanning the whole range.
10^10 seconds is over 300 years.
As I have been saying many times before, there is a bug in clBitCrack :

see this https://github.com/brichard19/BitCrack/issues/256
this mentioned issue did you fix it with RB61's commit.
thanks a lot again. many bitcrack versions around all aimed his fork i pressume.


I  ( = RB61 )  would prefer to let bitcrack  ( = Brichard19) fix the bug I mentioned here:   https://github.com/brichard19/BitCrack/issues/256

newbie
Activity: 24
Merit: 0
July 04, 2020, 09:05:59 AM
Dear File Owner,
It is unable to download from google drive; please see the bellow massage:
Sorry, this file is infected with a virus

Only the owner is allowed to download infected files.

Please send fresh link as following email id: [email protected]
full member
Activity: 431
Merit: 105
July 04, 2020, 04:23:45 AM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.



assuming that your  8 rx570 can do 1Gkeys/s.  (10^9 keys/s)
puzzle 64 requires cheking 2^63 keys which is around 10^19 keys. So you need to wait 10^10 seconds to claim spanning the whole range.
10^10 seconds is over 300 years.
As I have been saying many times before, there is a bug in clBitCrack :

see this https://github.com/brichard19/BitCrack/issues/256
this mentioned issue did you fix it with RB61's commit.
thanks a lot again. many bitcrack versions around all aimed his fork i pressume.
member
Activity: 245
Merit: 17
July 03, 2020, 03:46:28 PM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.



assuming that your  8 rx570 can do 1Gkeys/s.  (10^9 keys/s)
puzzle 64 requires cheking 2^63 keys which is around 10^19 keys. So you need to wait 10^10 seconds to claim spanning the whole range.
10^10 seconds is over 300 years.
As I have been saying many times before, there is a bug in clBitCrack :

see this https://github.com/brichard19/BitCrack/issues/256
newbie
Activity: 7
Merit: 5
July 03, 2020, 03:29:23 PM
It's better to find a collision than the right private key in this range, if it happens all the coins will go to the miner.
sr. member
Activity: 652
Merit: 316
July 03, 2020, 02:33:58 PM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.



You can't scan the 64 bit range with Pollard's kangaroo since the public key is unknown, we know only the address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN. Only keys in the 5 multiples (65, 70, 75, 80, 85,... 160) have spent values and therefore have their public keys published.

The only way to scan for address 64 is Brute force/Vanity search and plenty of luck.  
Vanity search does not allow you to set the starting and ending search ranges. I redid Vanity search on the CPU and used the public key as the initial range
But I could not remake it under GPU, because it uses a predefined file.
In general it is better to use Bitcrack for these purposes.
Especially when there is a server / client application for working with Bitcrack.
I redid my application that I posted here a while ago. Now i can use the connection from any client, not even trusted, because proof of work is used.

But here is another problem when the key will found and someone sends the transaction to their address. That transaction naturally will not be immediately confirmed, but the public lens will be visible. It costs nothing to intercept a public key. Solve it with a kangaroo and kill the transaction with a larger commission.
newbie
Activity: 12
Merit: 10
July 03, 2020, 12:45:58 PM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.



You can't scan the 64 bit range with Pollard's kangaroo since the public key is unknown, we know only the address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN. Only keys in the 5 multiples (65, 70, 75, 80, 85,... 160) have spent values and therefore have their public keys published.

The only way to scan for address 64 is Brute force/Vanity search and plenty of luck. 
newbie
Activity: 32
Merit: 0
July 02, 2020, 02:47:51 AM

Hi, I have finished the 64 bit range, but I have not found any key with 8 rx 570 8gb.

sr. member
Activity: 443
Merit: 350
June 30, 2020, 02:05:13 PM
Can someone please tell me what format this private key is in?
-snip-
Key# 0 [1S]Pub:  0x0329C4574A4FD8C810B7E42A4B398882B381BCD85E40C6883712912D167C83E73A
       Priv: 0x11720C4F018D51B8CEBBA8

It is in HEX.

Full hex value: 00000000000000000000000000000000000000000011720c4f018d51b8cebba8
WIF compres.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZkCnRjpBspr8M5K8YnUtDNa
newbie
Activity: 33
Merit: 0
June 30, 2020, 11:53:00 AM
Can someone please tell me what format this private key is in?

Kangaroo v2.1
Start:1000000000000000000000
Stop :1FFFFFFFFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 0
Range width: 2^84
Jump Avg distance: 2^42.03
Number of kangaroos: 2^23.32
Suggested DP: 16
Expected operations: 2^43.12
Expected RAM: 6347.6MB
DP size: 16 [0xFFFF000000000000]
GPU: GPU #1 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#1: creating kangaroos...
GPU: GPU #2 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#2: creating kangaroos...
GPU: GPU #0 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
GPU: GPU #3 Tesla V100-PCIE-16GB (80x64 cores) Grid(160x128) (207.0 MB used)
SolveKeyGPU Thread GPU#3: creating kangaroos...
SolveKeyGPU Thread GPU#1: 2^21.32 kangaroos [12.3s]
SolveKeyGPU Thread GPU#2: 2^21.32 kangaroos [12.3s]
SolveKeyGPU Thread GPU#3: 2^21.32 kangaroos [12.3s]
SolveKeyGPU Thread GPU#0: 2^21.32 kangaroos [12.4s]
[7828.45 MK/s][GPU 7828.45 MK/s][Count 2^43.22][Dead 2][24:56 (Avg 20:24)][4.8/6.9GB]
Key# 0 [1S]Pub:  0x0329C4574A4FD8C810B7E42A4B398882B381BCD85E40C6883712912D167C83E73A
       Priv: 0x11720C4F018D51B8CEBBA8
sr. member
Activity: 443
Merit: 350
June 30, 2020, 06:09:14 AM
Congratulations to Jean_Luc and zielar!
Very nice job!

Is it possible you share your combined DPs database for #115? (300Gb file as you said)

So, can you share your work files for #115?
newbie
Activity: 17
Merit: 0
June 29, 2020, 12:11:37 PM
Please, someone, share link for unpack kangaroo work saved files for human readable format Huh?

Work export in python script
https://gist.github.com/PatatasFritas/a0409df4306fb1bb81f9a53e70151ddc
full member
Activity: 1232
Merit: 242
Shooters Shoot...
June 28, 2020, 02:37:25 PM
Please, someone, share link for unpack kangaroo work saved files for human readable format Huh?

https://github.com/PatatasFritas/FriedKangaroo/commit/1669df5f91ef2cc8a7619b21f66883fa164ab602

Or open with something like Sublime Text.  Just a bunch of hex numbers, x coord and distances.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
June 28, 2020, 12:39:38 PM
Please, someone, share link for unpack kangaroo work saved files for human readable format Huh?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
June 28, 2020, 12:05:58 PM
Hi all! Can anybody explain which different in range search between (ex 2^66) 20000000000000000...3ffffffffffffffff    and 20000000000000000...40000000000000000, in dec 3ffffffffffffffff it is 40000000000000000. Thx

You foget firs argument - 200...4000... is from 20...to 40... and 3ff is from 3fff to 4000... start pont of range different 2... vs 3fff...

Think you think in right direction... this direction is bytes before start of a range. ))
jr. member
Activity: 43
Merit: 1
June 28, 2020, 11:30:33 AM
Hi all! Can anybody explain which different in range search between (ex 2^66) 20000000000000000...3ffffffffffffffff    and 20000000000000000...40000000000000000, in dec 3ffffffffffffffff it is 40000000000000000. Thx
Pages:
Jump to: