It seems to be plain standard point addition between a point and the base point (basically the same as doing +1 to the private key):
https://en.wikipedia.org/wiki/Elliptic_curve_point_multiplication#Point_additionAnd most vanity generators do work in the same way as this - they take a random private key, generate the public key (a costly operation), then continuously add the base point to the public key (a cheap operation) and hash the result.
Thank you!
Is generating public key x point from private key more costly than the euclidean inversion used in this type of point addition ? It seems
to take absolutely forever compare to the multiplication.
There don't seems to be a way to pipeline the operation as is more or less serial state machine(need next inversion for new point). With
private key to x and lots of logic at least high throughput could be achieved.