A. Anagnostakis, N. Giannakeas, A. Tzallas, M. Tsipouras, E. Glavas
{"title":"一个对等的,“仅限钱包”的共识模式,用于有限人群的所有权转移","authors":"A. Anagnostakis, N. Giannakeas, A. Tzallas, M. Tsipouras, E. Glavas","doi":"10.1109/SEEDA-CECNSM57760.2022.9932944","DOIUrl":null,"url":null,"abstract":"Consensus achievement is a scalable process, which relies on the mutual “Proof of something” among the consenting parties. Not every application has the same consensus needs: a classification of escalating complexity proofing cases is presented in [1], where it is proved that high complexity consensus policies can be effectively delivered on a pure P2P manner even over finite, even trivial capacity systems. The Proof of Existence (PoE) is utilized there as a minimal universal proofing case, the increased complexity of which is too high to be handled by a single atom, yet it can be delivered effectively on a collective basis. Irrespective of the undoubtable universality and soundness of PoE, it constitutes but the first and least-demanding proofing class identified. Universal consensus achievement on ownership transfer and monetary transactions requires elevated complexity proofing policies, capable of safeguarding the uniqueness of the transferred tokens as well as the finality of the transactional blockchain. In this work we present a pure P2P consensus schema for ownership transfer over finite populations. It relies on the IoT micro-Blockchain architecture which delivers a robust verifiable atomic consistency framework and facilitates the delivery of Proof of Originality-PoO and Proof of Consistency-PoC based consensus. We assert that PoO and PoC are necessary and capable to deliver robust consensus on ownership transfer transactions, and we study their traits over finite populations.","PeriodicalId":68279,"journal":{"name":"计算机工程与设计","volume":"15 1","pages":"1-10"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A peer, “wallet-only” consensus schema for ownership transfer over finite populations\",\"authors\":\"A. Anagnostakis, N. Giannakeas, A. Tzallas, M. Tsipouras, E. Glavas\",\"doi\":\"10.1109/SEEDA-CECNSM57760.2022.9932944\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consensus achievement is a scalable process, which relies on the mutual “Proof of something” among the consenting parties. Not every application has the same consensus needs: a classification of escalating complexity proofing cases is presented in [1], where it is proved that high complexity consensus policies can be effectively delivered on a pure P2P manner even over finite, even trivial capacity systems. The Proof of Existence (PoE) is utilized there as a minimal universal proofing case, the increased complexity of which is too high to be handled by a single atom, yet it can be delivered effectively on a collective basis. Irrespective of the undoubtable universality and soundness of PoE, it constitutes but the first and least-demanding proofing class identified. Universal consensus achievement on ownership transfer and monetary transactions requires elevated complexity proofing policies, capable of safeguarding the uniqueness of the transferred tokens as well as the finality of the transactional blockchain. In this work we present a pure P2P consensus schema for ownership transfer over finite populations. It relies on the IoT micro-Blockchain architecture which delivers a robust verifiable atomic consistency framework and facilitates the delivery of Proof of Originality-PoO and Proof of Consistency-PoC based consensus. We assert that PoO and PoC are necessary and capable to deliver robust consensus on ownership transfer transactions, and we study their traits over finite populations.\",\"PeriodicalId\":68279,\"journal\":{\"name\":\"计算机工程与设计\",\"volume\":\"15 1\",\"pages\":\"1-10\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"计算机工程与设计\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/SEEDA-CECNSM57760.2022.9932944\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"计算机工程与设计","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/SEEDA-CECNSM57760.2022.9932944","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A peer, “wallet-only” consensus schema for ownership transfer over finite populations
Consensus achievement is a scalable process, which relies on the mutual “Proof of something” among the consenting parties. Not every application has the same consensus needs: a classification of escalating complexity proofing cases is presented in [1], where it is proved that high complexity consensus policies can be effectively delivered on a pure P2P manner even over finite, even trivial capacity systems. The Proof of Existence (PoE) is utilized there as a minimal universal proofing case, the increased complexity of which is too high to be handled by a single atom, yet it can be delivered effectively on a collective basis. Irrespective of the undoubtable universality and soundness of PoE, it constitutes but the first and least-demanding proofing class identified. Universal consensus achievement on ownership transfer and monetary transactions requires elevated complexity proofing policies, capable of safeguarding the uniqueness of the transferred tokens as well as the finality of the transactional blockchain. In this work we present a pure P2P consensus schema for ownership transfer over finite populations. It relies on the IoT micro-Blockchain architecture which delivers a robust verifiable atomic consistency framework and facilitates the delivery of Proof of Originality-PoO and Proof of Consistency-PoC based consensus. We assert that PoO and PoC are necessary and capable to deliver robust consensus on ownership transfer transactions, and we study their traits over finite populations.
期刊介绍:
Computer Engineering and Design is supervised by China Aerospace Science and Industry Corporation and sponsored by the 706th Institute of the Second Academy of China Aerospace Science and Industry Corporation. It was founded in 1980. The purpose of the journal is to disseminate new technologies and promote academic exchanges. Since its inception, it has adhered to the principle of combining depth and breadth, theory and application, and focused on reporting cutting-edge and hot computer technologies. The journal accepts academic papers with innovative and independent academic insights, including papers on fund projects, award-winning research papers, outstanding papers at academic conferences, doctoral and master's theses, etc.