Fiat-Shamir Heuristic

Technique for converting interactive zero-knowledge proofs into non-interactive ones by replacing the verifier's random challenges with hash function outputs derived from the proof transcript. This transformation enables ZK proofs to be verified without real-time interaction, making them suitable for blockchain verification where provers and verifiers operate asynchronously.