Chrisimos: A useful Proof-of-Work for finding Minimal Dominating Set of a graph

Document Type

Conference Article

Publication Title

Proceedings - 2023 IEEE 22nd International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom/BigDataSE/CSE/EUC/iSCI 2023

Abstract

Hash-based Proof-of-Work (PoW) used in the Bitcoin Blockchain leads to high energy consumption and resource wastage. In this paper, we aim to re-purpose the energy by replacing the hash function with real-life problems having commercial utility. We propose Chrisimos, a useful Proof-of-Work where miners are required to find a minimal dominating set for real-life graph instances. A miner who is able to output the smallest dominating set for the given graph within the block interval time wins the mining game. Thus our protocol also realizes a decentralized minimal dominating set solver for any graph instance.

First Page

1332

Last Page

1339

DOI

10.1109/TrustCom60117.2023.00182

Publication Date

1-1-2023

Comments

Open Access, Green

This document is currently not available here.

Share

COinS