서브메뉴
검색
Safe Permissionless Consensus
Safe Permissionless Consensus
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211152642
- ISBN
- 9798384051015
- DDC
- 004
- 저자명
- Pu, Youer.
- 서명/저자
- Safe Permissionless Consensus
- 발행사항
- [Sl] : Cornell University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 196 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
- 주기사항
- Advisor: Alvisi, Lorenzo.
- 학위논문주기
- Thesis (Ph.D.)--Cornell University, 2024.
- 초록/해제
- 요약Nakamoto's consensus protocol, known for operating in a permissionless model where nodes can join and leave without notice. However, it guarantees agreement only probabilistically. Is this weaker guarantee a necessary concession to the severe demands of supporting a permissionless model? This thesis shows that it is not with the Sandglass and Gorilla Sandglass protocols.Sandglass emerges as the first permissionless consensus algorithm that transcends Nakamoto's probabilistic limitations by guaranteeing deterministic agreement and termination with probability 1, under general omission failures. It operates under a hybrid synchronous communication model, where, despite the unknown number and dynamic participation of nodes, a majority are consistently correct and synchronously connected.Further building on the framework of Sandglass, Gorilla Sandglass is the first Byzantine fault-tolerant consensus protocol that preserves deterministic agreement and termination with probability 1 within the same synchronous model adopted by Nakamoto. Gorilla addresses the limitations of Sandglass, which only tolerates benign failures, by extending its robustness to include Byzantine failures. We prove the correctness of Gorilla by mapping executions that would violate agreement or termination in Gorilla to executions in Sandglass, where we know such violations are impossible. Establishing termination proves particularly interesting, as the mapping requires reasoning about infinite executions and their probabilities.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 일반주제명
- Electrical engineering
- 기타저자
- Cornell University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 86-03B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017163233
■00520250211152642
■006m o d
■007cr#unu||||||||
■020 ▼a9798384051015
■035 ▼a(MiAaPQ)AAI31485267
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aPu, Youer.▼0(orcid)0009-0003-9079-363X
■24510▼aSafe Permissionless Consensus
■260 ▼a[Sl]▼bCornell University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a196 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-03, Section: B.
■500 ▼aAdvisor: Alvisi, Lorenzo.
■5021 ▼aThesis (Ph.D.)--Cornell University, 2024.
■520 ▼aNakamoto's consensus protocol, known for operating in a permissionless model where nodes can join and leave without notice. However, it guarantees agreement only probabilistically. Is this weaker guarantee a necessary concession to the severe demands of supporting a permissionless model? This thesis shows that it is not with the Sandglass and Gorilla Sandglass protocols.Sandglass emerges as the first permissionless consensus algorithm that transcends Nakamoto's probabilistic limitations by guaranteeing deterministic agreement and termination with probability 1, under general omission failures. It operates under a hybrid synchronous communication model, where, despite the unknown number and dynamic participation of nodes, a majority are consistently correct and synchronously connected.Further building on the framework of Sandglass, Gorilla Sandglass is the first Byzantine fault-tolerant consensus protocol that preserves deterministic agreement and termination with probability 1 within the same synchronous model adopted by Nakamoto. Gorilla addresses the limitations of Sandglass, which only tolerates benign failures, by extending its robustness to include Byzantine failures. We prove the correctness of Gorilla by mapping executions that would violate agreement or termination in Gorilla to executions in Sandglass, where we know such violations are impossible. Establishing termination proves particularly interesting, as the mapping requires reasoning about infinite executions and their probabilities.
■590 ▼aSchool code: 0058.
■650 4▼aComputer science
■650 4▼aComputer engineering
■650 4▼aElectrical engineering
■653 ▼aGorilla Sandglass protocols
■653 ▼aPermissionless consensus algorithm
■690 ▼a0984
■690 ▼a0544
■690 ▼a0464
■71020▼aCornell University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g86-03B.
■790 ▼a0058
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17163233▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
