±¨ ¸æ ÈË£º²Üͨ Ôº³¤£¬ÉϺ£ŸjÒ«×êÑÐÔº

»ã±¨¹¦·ò£º09ÔÂ26ÈÕ£¨ÖÜÒ»£©13:00¡«17:00

»ã±¨µØÖ·£ºÌÚѶ»áÒ飨485-745-522£©

Ñû Çë ÈË£ºÓຽ ½²Ê¦

»ã±¨ÌáÒª£º

To avoid single point of failure and enhance system¡¯s dependability, some mission-critical computer systems (e.g., Google¡¯s Chubby lock service, Boeing¡¯s ARINC 659 SAFEbus) deploy multiple core components (replicas) in the network and implement Byzantine fault tolerant protocols. In case of f arbitrary faults, such BFT protocols guarantee that the system can persistently execute correct orders via a number of replicas (from f+1 to 3f+1 depending on different settings). In general, classic BFT protocols are designed to tolerate faults in a small-scale network, for instance, Google¡¯s Chubby lock service only consists of 5 nodes. In the past decade, many efforts have been made to explore the possibilities of BFT protocols in a large-scale computing network for different purposes, such as, Hyperledger fabric, Facebook¡¯s DiemBFT. Despite some improvements, it remains an open challenge to tolerate Byzantine faults in a large-scale computing network, in particular, the network that requests high throughput and low latency. In this talk, several BFT protocols are introduced along with some applications.

»ã±¨È˼ò½é:

²Üͨ£¬ÉϺ£ŸjÒ«×êÑÐÔº£¬¿ÆÑÐÕƹÜÈË¡£Â¬É­±¤´óѧ²©Ê¿£¬²©Ê¿ÂÛÎı»ÌáÃûΪ¬ɭ±¤´óѧÄê¶È׿Խ²©Ê¿ÂÛÎÄ¡£ÖØÒª×êÑз½ÏòΪɢ²¼Ê½ÏµÍ³ÈÝ´íÐÔ£¬ÍÆËã»úÍøÂ繲ʶ»úÔ죬ÍøÂ簲ȫ¡£2022ÄêºÍ̸³¢ÊÔÊÒ£¨Protocol Labs£©RFP-X ¿ÆÑлù½ð»ñµÃÕß¡£³Ö¾Ã×êÑлùÓÚIPFS´«ÊäºÍ̸µÄFilecoinÇø¿éÁ´É¢²¼Ê½´æ´¢ÍøÂçµÄ¼¼Êõ·þÎñƽ̨£¬¼¯Èº¼Ü¹¹ÓëËã·¨Ïà½áºÏ£¬ÓµÓзá˶µÄʵս¾­Ñé¡£