Question:
Proof-of-work is more easily scalable than proof-of-stake
Author: timothy NtambalaAnswer:
False. Proof-of-stake is more easy scalable because for each new block to be validated, a validator is chosen randomly and eventually by after sharding the items need to be validated. This requires less computational power as is needed by proof-of-work.
0 / 5 Â (0 ratings)
1 answer(s) in total