How can proof of resource reward fairly based on how much work done on each node ?
Because, as far as I understand the proof of resource doesn’t provide a clear answer to this problem.
Is the proof of resource responsible for this at all ? or a new mechanism to be made responsible ? or an upgraded version of proof of resource will ?
This hasn’t been decided for compute yet, but one way is to use a similar method as is used for storage: several nodes in a close group all do the computation, a quorum vote decides the correct result, and the fastest node gets a chance to receive the reward. So faster, reliable nodes are rewarded more than slower ones, and unreliable nodes not at all.