Re:Understanding Zero-knowledge proofs through illustrated e...
by SilasX on Thursday December 02, 2021 @09:33PM
(#29425983)
Yes, these proof protocols allow you to get arbitrary certainty very quickly, so there’s little practical difference.
Scott Aaronson (of quantum computing and P=NP blogging fame) likes to joke that, “okay, fine fine, so these statistical proofs are good enough for the launch codes, military encryption, and multi-billion dollar financial transactions… but what about theorem proving, where you just can’t take any chances?”
Scott Aaronson (of quantum computing and P=NP blogging fame) likes to joke that, “okay, fine fine, so these statistical proofs are good enough for the launch codes, military encryption, and multi-billion dollar financial transactions… but what about theorem proving, where you just can’t take any chances?”