VanBitCracken - a program to use for 32 BTC challenge (supports RTX 30xx cards)

[Fibonacci_Dev]

Hi your program is phenomenal and works really well.

I have a question: If it is already a pure random search by default inside a specific range, what is the point of using -rKey in this case inside a range?

The normal RotorCuda, KeyHuntCuda are sequential and when -rKey was used and triggered the starting base key changed and restarted the sequential.

I ask this question because when approaching the -Rkey there is the usual drop in performance that recovers after about 20-30 seconds as also happens with KeyHunt, RotorCuda ectect...

so if it's already random I wanted to avoid using it (-rKey).

But I'm waiting for your explanatory answer since it's not possible to view the source code.

Thanks in advance.

Code:

./VBCrLinux -t 0 -gpu -gpuId 0,1,2,3,4,5,6,7,8,9 -g 2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128 -o Lucky.txt -dis 1 -r 100000 --range 40000000000000000:80000000000000000 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9

[WanderingPhilospher]

Hi your program is phenomenal and works really well.

I have a question: If it is already a pure random search by default inside a specific range, what is the point of using -rKey in this case inside a range?

The normal RotorCuda, KeyHuntCuda are sequential and when -rKey was used and triggered the starting base key changed and restarted the sequential.

I ask this question because when approaching the -Rkey there is the usual drop in performance that recovers after about 20-30 seconds as also happens with KeyHunt, RotorCuda ectect...

so if it's already random I wanted to avoid using it (-rKey).

But I'm waiting for your explanatory answer since it's not possible to view the source code.

Thanks in advance.

Code:

./VBCrLinux -t 0 -gpu -gpuId 0,1,2,3,4,5,6,7,8,9 -g 2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128 -o Lucky.txt -dis 1 -r 100000 --range 40000000000000000:80000000000000000 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9

The program will generate random starting points within the supplied range, and then works sequentially, from each random starting point. By using the -r (rekey) flag, the program rekeys new random starting points, every x amount of keys checked. If you do not use the -r flag, then the program will just search from the initial random starting points, forever / until you restart the program.
So random just generates random starting points for each CPU/GPU thread, the -r tells it to generate new random starting points every x amount of keys.

[dude0000]

If I understand you correctly, VBCr will almost never generate keys in the first part of the range that is given. It will always start at a random interior key and go sequentially from there. Of course the random key could be very close to the start of the range, but is probably not. Is there a way to close that gap using the existing parameters?

[karrask]

Hi your program is phenomenal and works really well.

I have a question: If it is already a pure random search by default inside a specific range, what is the point of using -rKey in this case inside a range?

The normal RotorCuda, KeyHuntCuda are sequential and when -rKey was used and triggered the starting base key changed and restarted the sequential.

I ask this question because when approaching the -Rkey there is the usual drop in performance that recovers after about 20-30 seconds as also happens with KeyHunt, RotorCuda ectect...

so if it's already random I wanted to avoid using it (-rKey).

But I'm waiting for your explanatory answer since it's not possible to view the source code.

Thanks in advance.

Code:

./VBCrLinux -t 0 -gpu -gpuId 0,1,2,3,4,5,6,7,8,9 -g 2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128,2048,128 -o Lucky.txt -dis 1 -r 100000 --range 40000000000000000:80000000000000000 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9

The program will generate random starting points within the supplied range, and then works sequentially, from each random starting point. By using the -r (rekey) flag, the program rekeys new random starting points, every x amount of keys checked. If you do not use the -r flag, then the program will just search from the initial random starting points, forever / until you restart the program.
So random just generates random starting points for each CPU/GPU thread, the -r tells it to generate new random starting points every x amount of keys.

hello. would you like to share the source code?

[dibzzy]

anyone tested this in a isolated environment ? see if it sends something to the internet or check the .exe with resmon for malicious code ??
sry but i dont trust it if its not open source .. why would i trust the OP that he doesnt have a backdoor that gives him the key also when someone finds it with his tool