๐ zkSNARKs & zkSTARKs offer a Constant Verifiable Computational Model (CVCM) โก Verification time is CONSTANT - O(1), regardless of computation complexity ๐ก Contrast this with the EVM's Linear VCM (LVCM), where verification grows LINEARLY with instructions - O(n)
๐ค What makes a computation VERIFIABLE? โ In zkSNARKs & zkSTARKs, provers generate proofs of computations, while verifiers check their correctness ๐ This model supports PRIVATE inputs, unlike the EVM ๐ It's not limited to blockchain - zkLocus showcases off-chain use cases