I think it is possible on this way
For example you define jumps like you have a starting point
after 5.000.000 of those iterations, I guarantee that all nearby points will go to the same point...
I already did that I mean proved that to myself (
)
But what you can do for example...
In case of puzzle 135
You can start jumping from
and put in "babystep" file every 1.000.000th iteration point and you put I do not know 200.000.000 points... and you calculate G added from starting point to 6th last point... This will be a BIG number and it will basically be you BIG GIANT JUMP
Then you start scan from
02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16
With the same rule... after 6.000.000 iteration if you did not find point from the babystep file you can jump BIG GIANT JUMP
If you find the point then
private key = 7fffffffffffffffffffffffffffffffff + Gadded in line of babystep file - G added in scan at the moment of collision
So this should be a hybrid kangaroo and bsgs
I do not know I am just a guy that is trying something
For example you define jumps like you have a starting point
Code:
300DF8475800 * G = 035e7ee2416496d46b6be9f20acd95ce922333dba658cf6d1d9da570a79b38b556
and then you have other points
300DF8475801 * G = 030264c5072d186570623d1b8346c3e1cebccbdddd1b63e6fb310d1481f060f6f8fb
300DF8475802 * G = 02239e98430c54ee569cf81d39b518ed7c321778429fde49953497285d3283711e
300DF8475803 * G = 03cda37e3633f55b043cf7d4ee148fa44baa50d8925571469d617eb72cc75b0648
300DF8475804 * G = 031b6349e3953558ed1561b69652ccce70eb92bd7c9b93f3082d0d7e563cfebdb7
.
.
.
you make a rule of jumps where you take |last 6 digits of X +1G|and then you have other points
300DF8475801 * G = 030264c5072d186570623d1b8346c3e1cebccbdddd1b63e6fb310d1481f060f6f8fb
300DF8475802 * G = 02239e98430c54ee569cf81d39b518ed7c321778429fde49953497285d3283711e
300DF8475803 * G = 03cda37e3633f55b043cf7d4ee148fa44baa50d8925571469d617eb72cc75b0648
300DF8475804 * G = 031b6349e3953558ed1561b69652ccce70eb92bd7c9b93f3082d0d7e563cfebdb7
.
.
.
after 5.000.000 of those iterations, I guarantee that all nearby points will go to the same point...
I already did that I mean proved that to myself (
)But what you can do for example...
In case of puzzle 135
You can start jumping from
Code:
7fffffffffffffffffffffffffffffffff * G = 02699adca27ea4ce71af1a9b27f767988a8a0d6af792ce33104f45de740d7d1519
|last 6 digits of X +1G|and put in "babystep" file every 1.000.000th iteration point and you put I do not know 200.000.000 points... and you calculate G added from starting point to 6th last point... This will be a BIG number and it will basically be you BIG GIANT JUMP
Then you start scan from
02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16
With the same rule... after 6.000.000 iteration if you did not find point from the babystep file you can jump BIG GIANT JUMP
If you find the point then
private key = 7fffffffffffffffffffffffffffffffff + Gadded in line of babystep file - G added in scan at the moment of collision
So this should be a hybrid kangaroo and bsgs
I do not know I am just a guy that is trying something