How to generate a public key from a private key using Elliptic Curve Digital Signature Algorithm
Yes.
Imagine that all you can see is the point at G, and the point at 8G. You're trying to determine how many times the point was added. And the number isn't 8, it's somewhere between 1 and 2^256.



  Am I missing something or does it only become irreversible in the discrete logarithmic equivalent.


I have no idea what that means; I'll leave that for someone else to answer.