You could fork the cryptocurrency and let miners decide their reward.
Then you're limited to "What's the biggest number that a miner can name in the finite amount of memory available?", which has the ultimate limit of a Busy Beaver function.
BB(n) for n > 1500 behaves like an infinity in many important ways.
Then you're limited to "What's the biggest number that a miner can name in the finite amount of memory available?"
Then just apply my original argument. It's not zero cost to mine. It's not zero cost to fork. The supply of cryptocurrency will be very large, but it will be so many x orders of magnitude smaller than BB(kerjillion), that x itself might be larger than the number of every cryptocoin ever made and every cryptocoin that ever will be made.
The useful thinking is about the computational limits of our current civilization, not infinities or redonkulous numbers.
Then you're limited to "What's the biggest number that a miner can name in the finite amount of memory available?", which has the ultimate limit of a Busy Beaver function.
BB(n) for n > 1500 behaves like an infinity in many important ways.