Pollard's kangaroo ECDLP solver - page 87.

racminer

member

Activity: 245

Merit: 17

Quote from: dextronomous on July 04, 2020, 04:23:45 AM

Quote from: racminer on July 03, 2020, 03:46:28 PM

Quote from: filo1992 on 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.

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

ashraful1980

newbie

Activity: 24

Merit: 0

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]

dextronomous

full member

Activity: 431

Merit: 105

Quote from: racminer on July 03, 2020, 03:46:28 PM

Quote from: filo1992 on 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.

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.

racminer

member

Activity: 245

Merit: 17

Quote from: filo1992 on 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.

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

RXUser

newbie

Activity: 7

Merit: 5

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.

Etar

sr. member

Activity: 617

Merit: 312

Quote from: RBan on July 03, 2020, 12:45:58 PM

Quote from: filo1992 on 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.

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.

RBan

newbie

Activity: 12

Merit: 10

Quote from: filo1992 on 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.

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.

filo1992

newbie

Activity: 32

Merit: 0

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

MrFreeDragon

sr. member

Activity: 443

Merit: 350

Quote from: Radiant311 on June 30, 2020, 11:53:00 AM

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

Radiant311

newbie

Activity: 33

Merit: 0

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

MrFreeDragon

sr. member

Activity: 443

Merit: 350

Quote from: MrFreeDragon on June 16, 2020, 10:15:12 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?

patatasfritas

newbie

Activity: 17

Merit: 0

Quote from: COBRAS on June 28, 2020, 12:39:38 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

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: COBRAS on June 28, 2020, 12:39:38 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.

COBRAS

member

Activity: 873

Merit: 22

$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Please, someone, share link for unpack kangaroo work saved files for human readable format Huh

?

COBRAS

member

Activity: 873

Merit: 22

$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Quote from: Kpot87 on 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

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. ))

Kpot87

jr. member

Activity: 43

Merit: 1

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

dextronomous

full member

Activity: 431

Merit: 105

Quote from: BitCrack on June 23, 2020, 03:13:33 PM

Quote from: racminer on June 23, 2020, 11:31:26 AM

hi @BitCrack
Will you consider releasing a server-client version of bitcrack ?

Yes, I have been working on it for a little while.

brichard you'r app speaks for itself, no talks just run,

any news under the sun about updates or anything like that, server thing.
thanks

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: WhyMe on June 26, 2020, 02:32:03 PM

Quote from: Shadow86 on June 22, 2020, 02:50:52 AM

Quote from: WanderingPhilospher on June 22, 2020, 12:37:00 AM

@JeanLuc @Zielar

If you fellas haven't started searching the 120 range for the #120 puzzle, don't start now. It's too late, me and my MOAP...the Mother of All Processors are running things and will find it.

Mind as well tweak VanitySearch and try for #64 Cool

My MOAP is dropping bombs like a rolling thunder...

I wish you a luck

Tell me is there any option to use multiply GPU on BitCrack or Vanity because i have 1k Gpu idle

Interesting.
I'm working on a tool able to process one bitcrack instance per gpu. And multi hosts.
And I'm thinking about a pool system ...
But it's not the place for that here

Yeah I've been thinking their should be a topic of tweaks and tactics via the different tools available/used to attack puzzle challenge

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: brainless on June 26, 2020, 01:57:12 PM

Quote from: WanderingPhilospher on June 26, 2020, 11:41:03 AM

Quote from: brainless on June 26, 2020, 08:26:04 AM

Quote from: racminer on June 23, 2020, 03:25:01 PM

Quote from: BitCrack on June 23, 2020, 03:13:33 PM

Quote from: racminer on June 23, 2020, 11:31:26 AM

hi @BitCrack
Will you consider releasing a server-client version of bitcrack ?

Yes, I have been working on it for a little while.

Great news Roll Eyes

don't forget to merge this https://github.com/brichard19/BitCrack/issues/256 if it is not already done.
And thanks a lot.

anyone have study bitcrack codes, and have commands in hand to modifiy/add/update some features
if yes, then these feature, work fast then kangaroo for find 120 puzzle, pls check and update us all community

--stride 1000:52000
where 1000 key check, and 52000 key bypass(no check)
--loop 500
count total keys of --keyspace * 500 = total keys
example 1 to 100 + 1 to 100 + 1 to 100
cuurent stride work only fixed like --stride 1:52000 or 1:123456

Brichard19 refuse to further work at bitcrack

I'm trying to follow what you are saying/wanting the program to do.

It checks 1000 keys, and then skips 52000 keys?
I didn't know the current stride function could be used as --stride1:52000; I only used --stride and a single number. But I do know the stride function is broken when you try to use it with the continue function. If you use a number higher than 9, say --stride 11 with --continue, it works first time around but changes the stride second time around. It doesn't parse/calculate numbers above 10(A) correctly.

actual func is --stride 52000, 52000 define by user, its skip 52000 and check 1 key, as i think its fixed inside first key and next key,
in program by default only 1 is fixed for check, should be create func for check keys define by user
and loop function

i design reverse kangaroo inside bitcrack, mean i created pubkeys inside bit range, as per kangaroo jump
and checking and skips calculation will find solution in loop, in this senerio, no need highest rams, and hdd spaces, and no dead kangaroo, and by default save/continuous func save your work just 1 click

Sounds interesting...PM this info, may be able to implement in a psuedo way via python.

WhyMe

sr. member

Activity: 661

Merit: 250

Quote from: Shadow86 on June 22, 2020, 02:50:52 AM

Quote from: WanderingPhilospher on June 22, 2020, 12:37:00 AM

@JeanLuc @Zielar

If you fellas haven't started searching the 120 range for the #120 puzzle, don't start now. It's too late, me and my MOAP...the Mother of All Processors are running things and will find it.

Mind as well tweak VanitySearch and try for #64 Cool

My MOAP is dropping bombs like a rolling thunder...

I wish you a luck

Tell me is there any option to use multiply GPU on BitCrack or Vanity because i have 1k Gpu idle

Interesting.
I'm working on a tool able to process one bitcrack instance per gpu. And multi hosts.
And I'm thinking about a pool system ...
But it's not the place for that here

Topic: Pollard's kangaroo ECDLP solver - page 87. (Read 58567 times)