So it works in the full range of 2^256 so what would be the expected operations?
- 1 point addition to have Point (x1, y1)
- 1 subtraction to get y2
- 2 multiplications to get x2 and x3
- comparision to get lowest x and lowest y
Then you have all x and y coordinates for all 6 points with the effort of less than 2 point additions, what will increase the speed enormous.