Part - I : All Possible Combinations
End Result : All possible combinations are fixed to: Possible Combinations : ( 1.1579208923732𝐸+77 ) + 64 of it. why did you complicate everything with hexadecimal representation. SHA256, as the name suggests, produces a 256-bit result. each bit can have 2 values (0 or 1) so the total number of combinations are 2
256 which is equal to 1.15e+77
In the future, lets say we have Quantum Computer with 30-qubit power which would make trillions of floating-point operations per second
i am not familiar with how QC works but SHA is working with integers (unsigned int to be exact) and there is lots and lots of operations in one round of SHA, i don't think you can use the number of OPs you reported here as a calculating point for computing SHA
Teaching the QC (Quantum Computer) to know from where these Seeds generated.
you still have to store those hashes and the data that created that hash somewhere. 1.15e+77 byte memory does not exist and that doesn't even consider the size of the data.
One day they will come to an end, one day all the combinations will be used for something, from space to enter in paragraph we create a seed. May be with some brilliant theories, with some hypothetical assumptions one could just Break the code?
it is not "breaking the code" your explanation sounds like collision to me. and if we get closer to the day where it may become a possibility we switch to stronger hash algorithms just like we have before.