计数链:用于计数系统的去中心化 Oracle 网络

Behkish Nassirzadeh, Stefanos Leonardos, Albert Heinle, Anwar Hasan, Vijay Ganesh
{"title":"计数链:用于计数系统的去中心化 Oracle 网络","authors":"Behkish Nassirzadeh, Stefanos Leonardos, Albert Heinle, Anwar Hasan, Vijay Ganesh","doi":"arxiv-2409.11592","DOIUrl":null,"url":null,"abstract":"Blockchain integration in industries like online advertising is hindered by\nits connectivity limitations to off-chain data. These industries heavily rely\non precise counting systems for collecting and analyzing off-chain data. This\nrequires mechanisms, often called oracles, to feed off-chain data into smart\ncontracts. However, current oracle solutions are ill-suited for counting\nsystems since the oracles do not know when to expect the data, posing a\nsignificant challenge. To address this, we present CountChain, a decentralized oracle network for\ncounting systems. In CountChain, data is received by all oracle nodes, and any\nnode can submit a proposition request. Each proposition contains enough data to\nevaluate the occurrence of an event. Only randomly selected nodes participate\nin a game to evaluate the truthfulness of each proposition by providing proof\nand some stake. Finally, the propositions with the outcome of True increment\nthe counter in a smart contract. Thus, instead of a contract calling oracles\nfor data, in CountChain, the oracles call a smart contract when the data is\navailable. Furthermore, we present a formal analysis and experimental\nevaluation of the system's parameters on over half a million data points to\nobtain optimal system parameters. In such conditions, our game-theoretical\nanalysis demonstrates that a Nash equilibrium exists wherein all rational\nparties participate with honesty.","PeriodicalId":501422,"journal":{"name":"arXiv - CS - Distributed, Parallel, and Cluster Computing","volume":"93 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CountChain: A Decentralized Oracle Network for Counting Systems\",\"authors\":\"Behkish Nassirzadeh, Stefanos Leonardos, Albert Heinle, Anwar Hasan, Vijay Ganesh\",\"doi\":\"arxiv-2409.11592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Blockchain integration in industries like online advertising is hindered by\\nits connectivity limitations to off-chain data. These industries heavily rely\\non precise counting systems for collecting and analyzing off-chain data. This\\nrequires mechanisms, often called oracles, to feed off-chain data into smart\\ncontracts. However, current oracle solutions are ill-suited for counting\\nsystems since the oracles do not know when to expect the data, posing a\\nsignificant challenge. To address this, we present CountChain, a decentralized oracle network for\\ncounting systems. In CountChain, data is received by all oracle nodes, and any\\nnode can submit a proposition request. Each proposition contains enough data to\\nevaluate the occurrence of an event. Only randomly selected nodes participate\\nin a game to evaluate the truthfulness of each proposition by providing proof\\nand some stake. Finally, the propositions with the outcome of True increment\\nthe counter in a smart contract. Thus, instead of a contract calling oracles\\nfor data, in CountChain, the oracles call a smart contract when the data is\\navailable. Furthermore, we present a formal analysis and experimental\\nevaluation of the system's parameters on over half a million data points to\\nobtain optimal system parameters. In such conditions, our game-theoretical\\nanalysis demonstrates that a Nash equilibrium exists wherein all rational\\nparties participate with honesty.\",\"PeriodicalId\":501422,\"journal\":{\"name\":\"arXiv - CS - Distributed, Parallel, and Cluster Computing\",\"volume\":\"93 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Distributed, Parallel, and Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.11592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Distributed, Parallel, and Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

区块链与在线广告等行业的整合因其与链外数据的连接限制而受到阻碍。这些行业严重依赖精确的计数系统来收集和分析链外数据。这就需要通常称为oracle的机制将链外数据输入智能合约。然而,当前的神谕解决方案并不适合计数系统,因为神谕不知道何时会收到数据,这带来了巨大的挑战。为了解决这个问题,我们提出了用于计数系统的去中心化甲骨文网络 CountChain。在 CountChain 中,所有甲骨文节点都会收到数据,任何节点都可以提交命题请求。每个命题都包含足够的数据来评估事件的发生。只有随机选择的节点才能参与游戏,通过提供证明和一定的赌注来评估每个命题的真实性。最后,结果为 "真 "的命题会增加智能合约中的计数器。因此,在 CountChain 中,当数据可用时,神谕会调用智能合约,而不是合约调用神谕获取数据。此外,我们还对超过 50 万个数据点的系统参数进行了形式分析和实验评估,以获得最佳系统参数。在这样的条件下,我们的博弈理论分析表明,存在一个纳什均衡,在这个均衡中,所有理性的各方都以诚实的态度参与。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CountChain: A Decentralized Oracle Network for Counting Systems
Blockchain integration in industries like online advertising is hindered by its connectivity limitations to off-chain data. These industries heavily rely on precise counting systems for collecting and analyzing off-chain data. This requires mechanisms, often called oracles, to feed off-chain data into smart contracts. However, current oracle solutions are ill-suited for counting systems since the oracles do not know when to expect the data, posing a significant challenge. To address this, we present CountChain, a decentralized oracle network for counting systems. In CountChain, data is received by all oracle nodes, and any node can submit a proposition request. Each proposition contains enough data to evaluate the occurrence of an event. Only randomly selected nodes participate in a game to evaluate the truthfulness of each proposition by providing proof and some stake. Finally, the propositions with the outcome of True increment the counter in a smart contract. Thus, instead of a contract calling oracles for data, in CountChain, the oracles call a smart contract when the data is available. Furthermore, we present a formal analysis and experimental evaluation of the system's parameters on over half a million data points to obtain optimal system parameters. In such conditions, our game-theoretical analysis demonstrates that a Nash equilibrium exists wherein all rational parties participate with honesty.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Massively parallel CMA-ES with increasing population Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations Energy Efficiency Support for Software Defined Networks: a Serverless Computing Approach CountChain: A Decentralized Oracle Network for Counting Systems Delay Analysis of EIP-4844
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1