kangaroo work with only one key.
You can run on a large list of public keys.
Telariust answered this question
https://github.com/Telariust/pollard-kangaroo/issues/3#issuecomment-530904845
@Echo Off
COLOR 0A
SET file=PublicKey0001.txt
setlocal enabledelayedexpansion
SET sessFile=_session.txt
SET Npubkey=0
echo [~] calc total Npubkey in file "!file!" ..
For /F %%a In (%file%) Do (
SET /a Npubkey+=1
)
SET lastN=0
IF EXIST !sessFile! (
SET /P lastN=)
SET n=0
For /F %%a In (%file%) Do (
echo =================================================
REM date /T && time /T
powershell Get-Date
echo [!n!/!Npubkey!] %%a
IF !lastN! == !n! (
echo !n!>!sessFile!
C:\Python37\python.exe pollard-kangaroo.py 32 %%a
REM timeout /T 1
SET /a lastN+=1
)
SET /a n+=1
)
1.And so Telariust answered>>>>>
Simultaneous pubkeys calculation will overly complicate the program.
And important: for N keys, performance will drop N times.
Sry, but i dont do it.<<<<
2.With this list of keys, the speed of the kangaroo will drop by 99,9%. I think so.
3.Let's hypothetically imagine that you found 1 key and received 1 bitcoin (and the address was 150 bitcoins. For an example). And the creator of this entire list took the remaining 149 bitcoins.
4.You dont know the key space. Do you want to check the entire 256-bit range? You will not have enough remaining time until the end of the universe.