<transcript><audio_28>so uh if the number of the update record list reaches square eleven uh in this way uh in general we want to use the unlocking</transcript><transcript><audio_29>time to open or proof but we don't do it right now to finish the whole algorithm we want to do it in the next segment of updates so we leave those update records in the</transcript><transcript><audio_30>list we cannot clear them since we haven't updated the single proofs yet and when we then get any update request we put it in the record list we update</transcript><transcript><audio_31>the commitment we updated the vector and we do the first of the first part of the opening all proofs which is this algorithm and when we reach receive</transcript><transcript><audio_32>other requests we keep doing the other parts of the unlock and opening all proofs algorithm and when the recollector which is 2 square root of n actually we have already finished the hope</transcript><transcript><audio_33>we have actually finished the algorithm here and now we can clear the first square root of an update in the record list and then and at is</transcript><transcript><audio_34>at this time we we are now we should prepare for the opening or prove the algorithm for the next square root of parts and now the single proof is actually updated for the first square relevant parts and</transcript> so uh if the number of the update record list reaches square eleven uh in this way uh in general we want to use the unlocking time to open or proof but we don't do it right now to finish the whole algorithm we want to do it in the next segment of updates so we leave those update records in the list we cannot clear them since we haven't updated the single proofs yet and when we then get any update request we put it in the record list we update the commitment we updated the vector and we do the first of the first part of the opening all proofs which is this algorithm and when we reach receive other requests we keep doing the other parts of the unlock and opening all proofs algorithm and when the recollector which is 2 square root of n actually we have already finished the hope we have actually finished the algorithm here and now we can clear the first square root of an update in the record list and then and at is at this time we we are now we should prepare for the opening or prove the algorithm for the next square root of parts and now the single proof is actually updated for the first square relevant parts and
{"source": "grass-yt-cc-by.-rZTckp-Urw|shard_10005_10|create_multimodal_data.extract_yt_and_generate_transcripts.28|shard_10005|create_multimodal_data.generate_captions.28|shard_10005|create_multimodal_data.generate_captions.28", "params": {"id": "-rZTckp-Urw", "channel_id": "UCJvMzILpV3b4AWXTEeQjcng", "duration": 780, "view_count": 103, "age_limit": 0, "like_count": 1, "channel_follower_count": 8710, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@ProtocolLabs", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10005/-rZTckp-Urw.tar.gz"}}