Topic: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED== - page 47. (Read 47899 times)

Thanks, brother!
Can you help, I get this error when triying to run after successfull complilation.

2days before i see alek76 message in post, he said soon at github, today i see, his post deleted, maybe he chnage his mind, and his new mind maybe work better then old mind

first public P-kangro were in python, useing 15k jumps/s, then upon advice by community, its updated with gmpy2 featured, and speed goes to 180k jumps/s, then more advices about thread and core, its able to uses all cores and threads, and in 2 cores processors, speed reach at 600k( 4core processors, speed 1.2m jumps/s,
lets see when u will update github for P-kangroo gpu, community experts will start giving you updates , advances, and iissues to be need resolve, after analyze in working code, every one  knows GPU kangroo already running by some dev from last 6 months, and maybe they are close to 110 puzzle, and rest community have no chance to go close, they will just use it for testing/analyzing/ for create next level idea's

you are talking about code, its P kangroo, you are right at your own way, i am talking code running at hardware structure space, as first kangroo was by pinkachunka at bitcrack, his stats was 100 bit in 3 days, and your 90 bit are shown for 8 days, he uses full power of GPU, mean full space by useing bitcrack switches, he uses 15.9gb during workout, and your ram used is 5.5gb , maybe you need expand table size or design by hardware structure switches, where maximum result for less time

in short i am guessing, your gpu engine commands inside program is default, and not useing full gpu power, as i said bitcrack used switches B T P , where you set compute thread, process, by this speed will increase more then 10x, study about bitcrack codes, hope u get success to increase more real speed

temp is not important , important is other informations about memory etc like this screenshot will help me to understand your stage
+-----------------------------------------------------------------------------+
| NVIDIA-SMI 390.116                Driver Version: 390.116                   |
|-------------------------------+----------------------+----------------------+
| GPU  Name        Persistence-M| Bus-Id        Disp.A | Volatile Uncorr. ECC |
| Fan  Temp  Perf  Pwr:Usage/Cap|         Memory-Usage | GPU-Util  Compute M. |
|===============================+======================+======================|
|   0  GeForce GTX 460     Off  | 00000000:01:00.0 N/A |                  N/A |
| 52%   71C    P0    N/A /  N/A |    472MiB /   964MiB |     N/A      Default |
+-------------------------------+----------------------+----------------------+

+-----------------------------------------------------------------------------+
| Processes:                                                       GPU Memory |
|  GPU       PID   Type   Process name                             Usage      |
|=============================================================================|
|    0                    Not Supported                                       |
+-----------------------------------------------------------------------------+

run for bit 85 and in other window make screenshot of command
nvidia-smi

I managed to find the first 8 numbers of the public key that corresponds to a private key. Is it possible to narrow the range to find the next ones?

i know about the pollards that are out,
but need to go fast and up to 110 already possible with the cpu pollard version.
only need ram, and or baby giant. for use with the pub key.
but then all whe want are those with gpu and the bitcracks so on for the ones without the pub keys.

he will never send
for 1 pubkey in bit 65, you can found it within 3 hours with powerfull gpu and bitcrack, only i need 30 min to code corresponding key, and rest if you have 2080ti or p100 and bitcrack you can find
wanna test ?

hey alek76,

i pm'ed you but you could send me the files. then i post the answer to those keys for these guys
to show wich code is faster for those 3 pk's
please do
2020
soon
21

First: you did not publish all the code.
Second: it is impossible to run your code.
Third: you don’t show the video.

The discussion is over

Быcтpo cкaтилиcь нa pyccкий.
Cкoлькo ты гoтoв зaплaтить зa aлгopитм быcтpee тoгo, кoтopый y тeбя?

Tвoй пocт я видeл, я y этoгo "пpoдaвцa" cпpaшивaл )

And how long does it take to puzzle 65 bits?

On the video there is testing the algorithm in single-threaded python execution mode. What else is needed?
I made a multi-threaded and economical memory option, and I sell it. It can still be improved, but I do not have time.