Your guides helped a lot, after doing some calculations I have to admit it's really hard when you reach the point of hash function, sadly I thought this could be done to extract each output value of each step, but the nature of one direction hash function does not allow that.
That's not true, though. You can absolutely 'extract' (debug print / log) every step of a hash function / one-way function. Just not after the fact, but you can do it while calculating the hash. That's also not the issue at hand here, though. The issue is not that it's a one-way-function but that generating a Bitcoin address has so many steps that you can't realistically do it using pen / paper.
And even if you logged every step and intermediary result with a computer program, it wouldn't help the understanding whatsoever and take ages to go through. You'll also just be looking at numbers without obvious correlations to each other.
You could show figures of
some steps of
some functions used in address generation, like here on
Wikipedia's SHA256 page.
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Fi.postimg.cc%2FdtzSqj6S%2Fimage.png&t=665&c=ZxICKK1-eOqXMw)
I could only compare it to a black hole [...] speed could be achieved by a massive super computer, e.g. A quantum computer
If you prefer just not explaining one-way functions or address generation in detail (it is possible - just not by going through it step-by-step), I prefer BlackHatCoiner's description as a blender.
Also do note that quantum =/= fast. They can only speed up certain specific computations and are as such not really comparable to a traditional supercomputer.