So with ZK-proofs we may never be 100% sure something is true or not? Is it possible that this may be too computational expensive to have certainty at given (or above) level?
Thus you can get very fast to a probability smaller than you quantum tunnelling through a wall
You can also use multiple different types of ZK proofs for the same data, same as using multiple hashing algorithms, for more certainty.
Right, but we may be 99.9999999999% sure.