<aside> 👲🏿 https://zkp.science/ ****https://github.com/matter-labs/awesome-zero-knowledge-proofs
</aside>
<aside> 💡 So, in essence, the backends of SNARK and STARK systems generate proofs by encoding the computation into polynomials, committing to these polynomials as oracles, and then interacting with the verifier to convince them that these oracles correctly represent a valid execution of the computation. This proof system is efficient because it uses IOPs and PCPs to allow the verifier to check the proof by querying a small number of random locations, instead of needing to check the entire proof.
</aside>