Is it possible to consider a chain of blocks as an acyclic graph, where to add the next block (or node, if we are thinking about the blockchain as a graph), it is necessary to solve a computationally difficult problem, such as:
x, such that:
H(x) ≤ y, where
y is a dynamically calculated target.
For Bitcoin, there seems to be such a formula that is suitable:
SHA256(SHA256(Н(block contents || nonce)) < targethash,
with various values of
nonce chosen until one is found that satisfies the above condition.
and what about other algorithms of PoW? Can they also be classified under such a description?
Sorry for my English. I hope my question will be clear. It will be great if you correct my mistakes