The Advent Of STARKs With IOPs
STARKs revolves around the idea of computational integrity, which essentially means that the output of a specific computation is correct.
In traditional financing, where banks are involved, trusted third parties such as auditors, accountants, etc ensure their integrity. Whereas in the crypto world, the integrity of computed data is verified by reading the whole proof. This proves to be a naive action.
Furthermore, if you were to prove to someone that you are over 18, you are most likely to provide your ID card, which means sharing more information than required. This is not ideal and zero-knowledge proofs can take care of it.
Initially, Zero-knowledge system constructions were based on PCPs or probabilistically checkable proofs.
Prover: An algorithm that receives an input x and calculates pi for that x.
Verifier: A polytime deterministic algorithm that receives an input x and proof pi, then accepts or rejects that pi.
