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 to collect and analyze 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 increments 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 gametheoretical analysis demonstrates that a Nash equilibrium exists wherein all rational parties participate with honesty.
Authors
- Behkish Nassirzadeh (ORCID: https://orcid.org/0000-0002-3227-1409)
- Stefanos Leonardos (ORCID: https://orcid.org/0000-0002-1498-1490)
- Vijay Ganesh (ORCID: https://orcid.org/0000-0002-6029-2047)
- Albert Heinle
- Anwar Hasan
Institutions
- Georgia Institute of Technology (US)
- University of Waterloo (CA)
- King's College London (GB)
Publication Details
- Published
- 2024-08-19
- DOI
- https://doi.org/10.1109/blockchain62396.2024.00049
- Primary Topic
- Data Stream Mining Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00