What is the performance of the Pouw consensus?
In this paper, we are the first to investigate the performance of the PoUW consensus, namely the fork probability and the system throughput. In PoUW, each miner first processes tasks and then competes for the winner in little time. The task-processing time of PoUW is a salient feature that affects the system performance.
How does POW work?
With PoW, each miner (i.e., the node maintaining the blockchain) competes to solve a cryptographic puzzle (i.e., to find a partial preimage of a hash mapping) subject to certain constraints. The winner, who is the node that first finds the solution, will acquire the privilege of generating a new block and get a reward.
What is proof of useful work (Pouw)?
Recently, proof of useful work (PoUW) has been proposed to overcome the drawback of PoW. With PoUW, each miner spends almost all the time in doing useful work (e.g., data classification), and then competes for the winner by the number of its consumed CPU instructions.
What is the Pouw simulator?
Our PoUW simulator is developed using Python 3.7. This simulator takes into account various parameters, namely, the mining difficulty D, the computing power {C_i}, the average TP time {lambda_i} for a task, the average number {m_i} = {C_i} imes {lambda_i} of the consumed CPU instructions for a task, and the network delay au .
EXECUTIF DE LA REGION DE BRUXELLES-CAPITALE F. 91