{"title":"具有确定性终局性的共识协议","authors":"Yahya Hassanzadeh-Nazarabadi, Sanaz Taheri Boshrooyeh","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484527","DOIUrl":null,"url":null,"abstract":"Proof-of-Validation (PoV) is a fair, immutable, and fully decentralized blockchain consensus protocol with an O(1) asymptotic message complexity. The original PoV proposal lacks deterministic finality, which guarantees that a valid block will not be revoked once it is committed to the blockchain. Supporting deterministic finality yields a fork-resistant blockchain. In this extended abstract, we pitch the architectural outline of our proposed Finalita, which is the extension of PoV that enables deterministic finality. Blockchains running with Finalita feature deterministic finality, in addition to all qualities supported by the original PoV.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Consensus Protocol With Deterministic Finality\",\"authors\":\"Yahya Hassanzadeh-Nazarabadi, Sanaz Taheri Boshrooyeh\",\"doi\":\"10.1109/INFOCOMWKSHPS51825.2021.9484527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proof-of-Validation (PoV) is a fair, immutable, and fully decentralized blockchain consensus protocol with an O(1) asymptotic message complexity. The original PoV proposal lacks deterministic finality, which guarantees that a valid block will not be revoked once it is committed to the blockchain. Supporting deterministic finality yields a fork-resistant blockchain. In this extended abstract, we pitch the architectural outline of our proposed Finalita, which is the extension of PoV that enables deterministic finality. Blockchains running with Finalita feature deterministic finality, in addition to all qualities supported by the original PoV.\",\"PeriodicalId\":109588,\"journal\":{\"name\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proof-of-Validation (PoV) is a fair, immutable, and fully decentralized blockchain consensus protocol with an O(1) asymptotic message complexity. The original PoV proposal lacks deterministic finality, which guarantees that a valid block will not be revoked once it is committed to the blockchain. Supporting deterministic finality yields a fork-resistant blockchain. In this extended abstract, we pitch the architectural outline of our proposed Finalita, which is the extension of PoV that enables deterministic finality. Blockchains running with Finalita feature deterministic finality, in addition to all qualities supported by the original PoV.