{"version":"1.0","type":"link","title":"Interactive proof system - Newikis","description":"In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/b/b0/Interactive_proof_%28complexity%29.svg/1280px-Interactive_proof_%28complexity%29.svg.png","thumbnail_width":1280,"thumbnail_height":846}