Sorry, it is inconvenient to share information in public. But I can tell you that this paper wallet lacks the first 8 characters and the 5 characters in the middle and cannot be recognized. If you know of such software, can you recommend it?
Assuming you are talking about a WIF it is impossible to construct to a valid WIF when missing 13 characters and live to see the result. 
Topic: Pollard's kangaroo ECDLP solver - page 83. (Read 58567 times)
I have a question for you. I have a paper wallet but it was damaged by accident. Now I can recognize part of the private key information. Is there any kind of software that can be repaired? Please tell me if you have any, thank you!
It depends on how much of the private key you can recognize. Can you share how many of the private key characters you can read? Is it a hex private key, WIF?
It depends on how much of the private key you can recognize. Can you share how many of the private key characters you can read? Is it a hex private key, WIF?
can anyone make a compiled version for 1070 win10? thk
https://github.com/JeanLucPons/Kangaroo/releases/download/2.1/Kangaroo.exe
can anyone make a compiled version for 1070 win10? thk
Hello everyone! From which year the compressed pubkey become? 2015?
Bitcoin client 0.6.0 introduced compressed public keys and was released in March 2012.This is from the release notes:
New wallets created with this version will use 33-byte ‘compressed’ public keys instead of 65-byte public keys, resulting in smaller transactions and less traffic on the bitcoin network. The shorter keys are already supported by the network but wallet.dat files containing short keys are not compatible with earlier versions of Bitcoin-Qt/bitcoind
Hello everyone! From which year the compressed pubkey become? 2015?
Bitcoin client 0.6.0 introduced compressed public keys and was released in March 2012.This is from the release notes:
New wallets created with this version will use 33-byte ‘compressed’ public keys instead of 65-byte public keys, resulting in smaller transactions and less traffic on the bitcoin network. The shorter keys are already supported by the network but wallet.dat files containing short keys are not compatible with earlier versions of Bitcoin-Qt/bitcoind
Hello everyone! From which year the compressed pubkey become? 2015?
Searching on range larger than 126 bits will decrease performance a lot.
If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.
There you have it...the man, the myth, the coding legend has spoken.If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.
If it takes 256 V100 Teslas roughly 45-60 days for 120 bit range search, I can't imagine how long it would take to search a 256 bit range.
I would recommend adjusting ranges or search the bottom 124 bit range of larger range. But that's just me.
If Jean Luc tells me what to adjust in the code, I will make the changes and post a 256 bit range Kangaroo program...for those who wish to have it.
Searching on range larger than 126 bits will decrease performance a lot.
If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.
If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.
Quote
Do you know the mod to increase the program to search up to 256 bit range?
negative...but Jean Luc says it has to do with the distance being stored on 126 bit so the starting position of each kangaroo must be in a 126 bit range MAX.I imagine he could share what to tweak in the code to be able to search for larger bit range. I haven't asked or tried because it's such a large range. Maybe if multi pubkey capability comes, I would venture out into larger ranges, but for now, just sticking to puzzle ranges.
edit: but you can shift range, if you have a specific range in mind, to use the current Kangaroo program
it would be great to check all the public keys at once over a given range
will it be so?
will it be so?
Unfortunately, Jean_Luc is silent.
Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!
p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!
It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help.
Do you know the mod to increase the program to search up to 256 bit range?
Quote
Hi. Yes from 1 to 128 bytes. But you don know 128 bytes start from 1 or from F, this understand ? And I ask Jean_Luc, making code for resolve this problem for find "BIG" range - START(FIRST) BYTES for 128 bytes, need find first NN bytes. BrainFlare generate 128-256 bytes privkeys !!! So with 80 bytes only is impossible to find privkey from not puzzle adresses.
Understand now ?
This is a example privkey
0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
How you get this privkey with search in range 80 without this "0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3" part of the range ?
But if you know something lile
0x88888888888888888888888888888888888888888888887..............................
0x6...
0x77777777777777777778888888888888888888888888888..............................
the problem moves to a known solution area
Understand now ?
This is a example privkey
0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
How you get this privkey with search in range 80 without this "0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3" part of the range ?
But if you know something lile
0x88888888888888888888888888888888888888888888887..............................
0x6...
0x77777777777777777778888888888888888888888888888..............................
the problem moves to a known solution area
If you want to search range:
74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
to
74189E6AC701E155D43F55A38B5D25129BE4D9481F0Cxxxxxxxxxxxxxxxxxxxx
(80 bit range)
send me pubkey and I will make you an input file to search that range with pubkey.
or another range and pubkey.
it would be great to check all the public keys at once over a given range
will it be so?
will it be so?
Unfortunately, Jean_Luc is silent.
Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!
p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!
It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help.
Hi. Yes from 1 to 128 bytes. But you don know 128 bytes start from 1 or from F, this understand ? And I ask Jean_Luc, making code for resolve this problem for find "BIG" range - START(FIRST) BYTES for 128 bytes, need find first NN bytes. BrainFlare generate 128-256 bytes privkeys !!! So with 80 bytes only is impossible to find privkey from not puzzle adresses.
Understand now ?
This is a example privkey
0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
How you get this privkey with search in range 80 without this "0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3" part of the range ?
But if you know something lile
0x88888888888888888888888888888888888888888888887..............................
0x6...
0x77777777777777777778888888888888888888888888888..............................
the problem moves to a known solution area
it would be great to check all the public keys at once over a given range
will it be so?
will it be so?
Unfortunately, Jean_Luc is silent.
Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!
p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!
It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help.
it would be great to check all the public keys at once over a given range
will it be so?
will it be so?
Unfortunately, Jean_Luc is silent.
Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!
p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!
it would be great to check all the public keys at once over a given range
(interested in multi public checker)
will it be possible to do so?
(interested in multi public checker)
will it be possible to do so?
yes buddy please make that one thanks ahead.
Hello,
I would like to present an interval ECDLP solver based on the Pollard's kangaroo method.
This program is fully open source and available on GitHub: https://github.com/JeanLucPons/Kangaroo
It has GPU support (CUDA Only) and works on both Linux and Windows.
This program is currently under development.
Thanks to test it and to share ideas of improvements here
I would like to present an interval ECDLP solver based on the Pollard's kangaroo method.
This program is fully open source and available on GitHub: https://github.com/JeanLucPons/Kangaroo
It has GPU support (CUDA Only) and works on both Linux and Windows.
This program is currently under development.
Thanks to test it and to share ideas of improvements here
Buddy, Can you make something like brainflare for search start range of private keys ? Brainflare operate word, so brainflare operate 128-256 bytes privkeys. Can you made soft for addition to Kangaroo - firs search start big range(or not 1 Big range for 1 pubkey, 1-5 potential big ranges for ex.), second search exact range with kangaroo
PEASE PLEASE PLEASE !!!Jean_Luc ? ? ?
Big Thank You.
Jump to: