Pith. sign in

REVIEW

Challenges of Proof-of-Useful-Work (PoUW)

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.03865 v1 pith:XFFQNNAK submitted 2022-09-08 cs.CR cs.GT

classification cs.CRcs.GT
keywords pouwblockchainpropertiesapproachconsensusenergyfirsthash
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Proof-of-Work (PoW) is a popular blockchain consensus algorithm that is used in cryptocurrencies like Bitcoin in which hashing operations are repeated until the resulting hash has certain properties. This approach uses lots of computational power and energy for the sole purpose of securing the blockchain. In order to not waste energy on hashing operations that do not have any other purpose than enabling consensus between nodes and therefore securing the blockchain, Proof-of-Useful-Work (PoUW) is an alternative approach which aims to replace excessive usage of hash functions with tasks that bring additional real-world benefit, e.g. supporting scientific experiments that rely on computationally heavy simulations. This publication consists of two parts: In the first part, important properties of conventional hash-based PoW are described. In the second part, theoretical PoUW concepts such as Coinami, CoinAI and the first successful PoUW cryptocurrency Primecoin are analyzed with respects to how PoW properties can be retained while doing useful work.

Discussion (0). Continue with ORCID to comment.

Pith tools