If you could build a (quantum or classical) computer that takes years of computation to solve a single elliptic curve discrete log, then there's a neat way to p

If you could build a (quantum or classical) computer that takes years of computation to solve a single elliptic curve discrete log, then there's a neat way to profit. Compute d = log_G(H), where G and H are the generators used in Pedersen commitments. Then you can undetectably print infinite amounts of money in coins based on Confidential Transactions (such as most privacy coins), by writing 0*H + r*G as v*H + (r-v*d)*G, where the former represents a coin of value 0 and the latter a coin of value v.