<transcript><audio_66>zero knowledge was like when we had zero knowledge it was mostly interactive zero knowledge right so it is interact acve protocol so essentially what this means is if you were to go back and think about our room protocol that's an interactive protocol so me and the</transcript><transcript><audio_67>verifier have to do multiple rounds imagine in some sense if there was a way I could guess something right that would be like one by two raised to n kind of two rais to minus n possibility that I could actually guess it right so this is how you actually put a bound on you know</transcript><transcript><audio_68>how much of security would you actually get so uh in 2013 there was this paper that actually came out first to the non interative Zer schemes came out right and the thing was it was the possibility</transcript><transcript><audio_69>that you can actually have like a interactive protocol and then you you could use a f sham transform to actually convert that into a non- interactive one and that also helps that you actually have a Merkel tree that's out there right so Merkel tree is as you could see</transcript><transcript><audio_70>is part and parsel of all blockchain so this implied that the first first time there was this protocol that could actually use zon proofs to actually prove transfer value right or</transcript> zero knowledge was like when we had zero knowledge it was mostly interactive zero knowledge right so it is interact acve protocol so essentially what this means is if you were to go back and think about our room protocol that's an interactive protocol so me and the verifier have to do multiple rounds imagine in some sense if there was a way I could guess something right that would be like one by two raised to n kind of two rais to minus n possibility that I could actually guess it right so this is how you actually put a bound on you know how much of security would you actually get so uh in 2013 there was this paper that actually came out first to the non interative Zer schemes came out right and the thing was it was the possibility that you can actually have like a interactive protocol and then you you could use a f sham transform to actually convert that into a non- interactive one and that also helps that you actually have a Merkel tree that's out there right so Merkel tree is as you could see is part and parsel of all blockchain so this implied that the first first time there was this protocol that could actually use zon proofs to actually prove transfer value right or
{"source": "grass-yt-cc-by.1_MfAqJZYyM|shard_10001_6|create_multimodal_data.extract_yt_and_generate_transcripts.58|shard_10001|create_multimodal_data.generate_captions.58|shard_10001|create_multimodal_data.generate_captions.58", "params": {"id": "1_MfAqJZYyM", "channel_id": "UCJN6GSN2VR5BCJMeSwf2rPw", "duration": 1901, "view_count": 41, "age_limit": 0, "like_count": 1, "channel_follower_count": 391, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@TheJBBA", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10001/1_MfAqJZYyM.tar.gz"}}