# POW with Linear time to solve it?

Any suggestions for A Proof-of-Work algorithm in literature so that the time required for solving it is linear with the puzzle difficulty ??

• Could you not answer "yes" by taking any existing PoW algorithm with a time required for solving that is exponential with puzzle difficulty, and relabeling puzzle difficulty with $\text{difficulty}^\prime=\exp(\text{difficulty})$? – Cort Ammon Jun 24 '18 at 21:34
• Instead of using eg leading zeroes you could also use "hash output must be smaller than x" which scales linearly in difficulty with $2^h-x$ with $h$ being the hash output size. – SEJPM Jun 25 '18 at 17:09
• could you explain more, or give me an example for a such a POW algorithm ?? to give you an example of problme I am working on: I am building an application that require the difficulty (the number of leading zeros) to be directly proptional in some way to the Time of solving the puzzle. For example if it takes to get d=0 , Time may be 10 second. But to get d=00 , time will be 20 seconds. I wanna a POW that is used as a time meter – Mohamed Ismail Jun 27 '18 at 2:09