== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[brainless]

================================================================
when i try 65 bits, i get segmention error. But if i drop the bits to 60 it works fine. I am using Geforce GTX 2070 with ccap 75. Any thoughts please?

https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html#features-and-technical-specifications__technical-specifications-per-compute-capability
Try replacing
#define NB_TRHEAD_PER_GROUP 128
at
#define NB_TRHEAD_PER_GROUP 64

you should go back in earlier post to you, where i said you need to correct define, block, thread and process, and you will get 10x faster speed
hope you soon you will able to assign this in user level with switches -b -t -p , as per bitcracked assign for manage load of full GPU power

[akk123]

================================================================
when i try 65 bits, i get segmention error. But if i drop the bits to 60 it works fine. I am using Geforce GTX 2070 with ccap 75. Any thoughts please?

https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html#features-and-technical-specifications__technical-specifications-per-compute-capability
Try replacing
#define NB_TRHEAD_PER_GROUP 128
at
#define NB_TRHEAD_PER_GROUP 64

...
[meanjumpsize#64] 3FFFFFFFFFFFFFF(now) <= 40A3D5640000000(optimal) <= 7E07E07E07E07E0(next)
[meanjumpsize#64] 3FFFFFFFFFFFFFF(now) <= 40A3D5640000000(optimal) <= 7E07E07E07E07E0(next)
Sp[64]|J-----------------------------------------------------------|Sp[65]
this Sp set has low efficiency (over -25%) for this mean jumpsize
[JmaxofSp] Sp[64]=3FFFFFFFFFFFFFF nearer to optimal mean jumpsize of Sp set
Old DPmodule: 2^30
New DPmodule: 2^24
[DPmodule] 2^24 = 16777216 (0x0000000001000000)
 dT[0] 0x                                               1C1D549AF46361B4B
 dT[1] 0x-6F51C29AFFFFFFFFEF66E09BFFFFFFFF6F33A29CFFFFFFFFEF48C09DFFFFFFFDAD4038EFB9C9E4B5
 dT[2] 0x215C7ACA0000000021323EC8000000012198BAC600000000216E7EC400000002E3AA447146361 B4B
 dT[3] 0x-4DF547D0FFFFFFFFCE34A1D3FFFFFFFE4D9AE7D6FFFFFFFFCDDA41D9FFFFFFFC8B6B3E2DB9C9E4B5
 dT[4] 0x42B8F5940000000042647D90000000024331758C0000000042DCFD8800000004057F3F3346361 B4B
 dT[5] 0x-2C98CD06FFFFFFFFAD02630BFFFFFFFD2C022D10FFFFFFFFAC6BC315FFFFFFFB6996436BB9C9E4B5
...

Hi thanks for the reply. I tried your suggestion but result is the same. When I increase verbose output though, numbers where the jumpsizes calculated goes drasticly high.

[akk123]

used cpu
Set -t 0 -gpu -bits

No I don't use cpu. It works with uncompressed keys though. I guess it is todo with "searchMode".

[dextronomous]

hi alek76, man was wondering if this one can do uncompressed pk's.
thanks for this release bro. and thanks a lot for helping out.

[HardFacts]

Which means that value the total prize ( 100 BitCoins ) will be about 10 USD soon enough   

Hard Facts

[aaduo01]

Hi! How to check how much bit long keyspace?

[spider703]

hi all
I have a question - how do you get Biginteger PVK? Of what? what you need to take to get Biginteger PVK
example:


Address 6:

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU7Tmu6qHxS
1PitScNLyp2HCygzadCh7FveTnfmpPbfp8
Biginteger PVK value: 49 - where did this number come from?
Hex PVK value: 31

[bithisach]

Hi! How to check how much bit long keyspace?

It's all on the main post my friend! Double check it if you have any doubts!!!

[aaduo01]

Hi! How to check how much bit long keyspace?

It's all on the main post my friend! Double check it if you have any doubts!!!

Sorry i can't find any information on how to calculate the private key bit range space from any bitcoin address.

[dejarumlights]

Hi! How to check how much bit long keyspace?

It's all on the main post my friend! Double check it if you have any doubts!!!

Sorry i can't find any information on how to calculate the private key bit range space from any bitcoin address.

That's pretty unknowable, far as I'm aware. Just gotta try and try again. Pick an number and let it run. Wait til it either fails or you run out of patience. Rinse. Repeat. (that is if you're looking to recover your old wallet, doncha know).

---

On another note, I think I figured out how to set a range instead of just using a number for -bits. Haven't let an extensive test run yet but worth an experiment. Say you want to use the privkeys from 63 and 65 as your U and L instead of -bits 64.

./vs-kangaroo-hybrid -v 1 -gpu -p 8 -bits 0000000000000000000000000000000000000000000000007CCE5EFDACCF6808:000000000000000000000000000000000000000000000001A838B13505B26867 02pubkeygoeshere000

I'm not at all sure if it will work with a wider range (say for instance 000000000000000000000000000000000000000000000001A838B13505B26867:0000000000000000000000000000000000000000000000349B84B6431A6C4EF1 which is 65 and 70). Might be able to test this using some of the already solved values (like plug in L of 48 and U of 53 and look for 51's key). If I'm wrong and this is silly, please let me know, sir Alek. I'm by no means a math or programming guy, just a tinkerer.

Also, using rekey DOES seem to work based on an overnight test. Changes T and W start points after whatever you set the interval to. -r=5000 rolls em after 5Gj.

[dejarumlights]

I'm not at all sure if it will work with a wider range (say for instance 000000000000000000000000000000000000000000000001A838B13505B26867:0000000000000000000000000000000000000000000000349B84B6431A6C4EF1 which is 65 and 70). Might be able to test this using some of the already solved values (like plug in L of 48 and U of 53 and look for 51's key). If I'm wrong and this is silly, please let me know, sir Alek. I'm by no means a math or programming guy, just a tinkerer.

-bits 1A838B13505B26867:349B84B6431A6C4EF1
Will work, a wider range will require more time.

Oh of course it will! Thanks for the feedback.

[aaduo01]

I'm not at all sure if it will work with a wider range (say for instance 000000000000000000000000000000000000000000000001A838B13505B26867:0000000000000000000000000000000000000000000000349B84B6431A6C4EF1 which is 65 and 70). Might be able to test this using some of the already solved values (like plug in L of 48 and U of 53 and look for 51's key). If I'm wrong and this is silly, please let me know, sir Alek. I'm by no means a math or programming guy, just a tinkerer.

-bits 1A838B13505B26867:349B84B6431A6C4EF1
Will work, a wider range will require more time.

Hi. Maybe share compiled cpu version? Or how to make program on windows?

[brainless]

today jeanluc post Kangaroo for cpu
its much fast and better then alek76 gpu version check his link and results
BSGS (baby step)
https://github.com/JeanLucPons/BSGS/issues
Kangaroo
https://github.com/JeanLucPons/Kangaroo

test 65 bit at i3-6100 2 core 4thread processor


:~/jean/Kangaroo$ ./kangaroo in.txt
Kangaroo v1.0
Start:10000000000000001
Stop :1FFFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 4
Range width: 2^64
Number of random walk: 2^12.00 (Max DP=18)
DP size: 18 [0xffffc00000000000]
Solvekey Thread 0: 1024 TAME kangaroos
Solvekey Thread 1: 1024 TAME kangaroos
Solvekey Thread 2: 1024 WILD kangaroos
Solvekey Thread 3: 1024 WILD kangaroos
[11.56 MKey/s][Count 2^33.15][14:29][Dead 1][6.9MB]
Key# 0 Pub:  0x023115A92D2D604381E154EDAC700D4D99AC44F8E2B1274E16524583D1D52DDDC0
       Priv: 0x150E316D058E7AFF8

Done: Total time 14:30

[spider703]

0459A3BFDAD718C9D3FAC7C187F1139F0815AC5D923910D516E186AFDA28B221DC994327554CED8 87AAE5D211A2407CDD025CFC3779ECB9C9D7F2F1A1DDF3E9FF8


where he take this? this third line in in.txt

[aaduo01]

Possible download balanced list public key?

[sssergy2705]

Possible download balanced list public key?

I don’t know whether it is actual or not. I found it on the Internet myself.
https://drive.google.com/open?id=1z9yRjA3FMng3DJ2dIIu5OY0kKCevH0BP

[aaduo01]

today jeanluc post Kangaroo for cpu
its much fast and better then alek76 gpu version check his link and results
BSGS (baby step)
https://github.com/JeanLucPons/BSGS/issues
Kangaroo
https://github.com/JeanLucPons/Kangaroo

test 65 bit at i3-6100 2 core 4thread processor


:~/jean/Kangaroo$ ./kangaroo in.txt
Kangaroo v1.0
Start:10000000000000001
Stop :1FFFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 4
Range width: 2^64
Number of random walk: 2^12.00 (Max DP=18)
DP size: 18 [0xffffc00000000000]
Solvekey Thread 0: 1024 TAME kangaroos
Solvekey Thread 1: 1024 TAME kangaroos
Solvekey Thread 2: 1024 WILD kangaroos
Solvekey Thread 3: 1024 WILD kangaroos
[11.56 MKey/s][Count 2^33.15][14:29][Dead 1][6.9MB]
Key# 0 Pub:  0x023115A92D2D604381E154EDAC700D4D99AC44F8E2B1274E16524583D1D52DDDC0
       Priv: 0x150E316D058E7AFF8

Done: Total time 14:30

what is dead1 word?

[aaduo01]

Maybe tool convert pubkey txt to address?

[MrFreeDragon]

-snip-
  Please do not make laugh ...
Done: Total time 14:30 for bits 65 - you might think this is a great achievement?

This was the result on CPU, not GPU :-)

Moreover, do not forget than JeanLuc is the author of VanitySearch which code was used as the base for your hybrid.

[aaduo01]

How to add write to txt resoult option tihs code?

from bitcoin import *

with open("pubkey.txt") as f:
   for line in f:
      print(pubtoaddr(line.strip()))