/biz/ - Business & Finance

>>21627372
PoW chooses any node that can prove it brute-forced a P=NP problem (ie, by random choices) to generate the entropy of validator selection. Thus, all nodes can quickly verify that the solution offered by the node is correct and will accept it as truly "random" and let it add data to the database. PoW is also remarkably stateless - each moment in time for validator selection requires absolutely 0 state from the past, and there is no limit for how many validators can be participating.

first to guess the values of x & y get's a prize