A novel proof of useful work for a blockchain storing transportation transactions
作者：
Highlights：
• We propose a novel Proof-of-Useful-Work (PoUW) that exploits an NP-hard optimization problem.
• We investigate a blockchain powered by a PoUW serving a clustering problem with concave costs in the context of transportation.
• The proposed PoUW is both used to validate blockchain transactions and produce blocks as well as to benefit the blockchain network users by realizing savings on operations costs.
• We show that the clustering problem is NP-hard.
• We provide an approach for splitting the cost saving between the blockchain users.
摘要
•We propose a novel Proof-of-Useful-Work (PoUW) that exploits an NP-hard optimization problem.•We investigate a blockchain powered by a PoUW serving a clustering problem with concave costs in the context of transportation.•The proposed PoUW is both used to validate blockchain transactions and produce blocks as well as to benefit the blockchain network users by realizing savings on operations costs.•We show that the clustering problem is NP-hard.•We provide an approach for splitting the cost saving between the blockchain users.
论文关键词：Blockchain,Supply chain,Proof of Useful Work,NP-hard optimization problem
论文评审过程：Received 11 November 2020, Revised 22 August 2021, Accepted 31 August 2021, Available online 14 September 2021, Version of Record 14 September 2021.
论文官网地址：https://doi.org/10.1016/j.ipm.2021.102749
