Скачать с ютуб Tim Roughgarden — How Secure Is Your Restaking Network? в хорошем качестве

Tim Roughgarden — How Secure Is Your Restaking Network?

Tim Roughgarden --- Columbia University and a16z crypto How Secure Is Your Restaking Network? We study the risks of validator reuse across multiple services in a restaking protocol. We characterize the robust security of a restaking network as a function of the buffer between the costs and profits from attacks. For example, our results imply that if attack costs always exceed attack profits by 10%, then a sudden loss of .1% of the overall stake (e.g., due to a software error) cannot result in the ultimate loss of more than 1.1% of the overall stake. We also provide "local" analogs of these overcollaterization conditions and robust security guarantees that apply specifically for a target service or coalition of services. All of our bounds on worst-case stake loss are the best possible. Finally, we bound the maximum-possible length of a cascade of attacks. Our results suggest measures of risk that could be exposed to the participants in a restaking protocol. We also suggest polynomial-time computable sufficient conditions that can proxy for these measures. Joint work with Naveen Durvasula. --- Science and Engineering of Consensus Workshop https://tselab.stanford.edu/workshop-... An affiliated workshop of The Science of Blockchain Conference 2024 https://www.sbc-conference.com/