Why Is This One-Way Function Computationally Infeasible to Reverse?

The function is infeasible to reverse because it is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). In simple terms, while point multiplication (d G = P) is fast, finding the scalar (d) when given the two points (G and P) is computationally equivalent to guessing a needle in an enormous haystack.

The large number of possible private keys makes brute-forcing or efficient mathematical inversion impossible with current computing technology.