Hacker News new | ask | show | jobs
by dystopiabreaker 1619 days ago
for proof of stake, the cost is roughly:

- download a hash-sized state root every block

- download the set of validator signatures over that hash and verify each signature against the hash. if using aggregation-friendly curve, download the aggregate signature and verify it against the root.

- for each state fragment, download the merkle uncles and compute the root hash and verify that it is the same as that signed off by the validator set.

so yes, easily within resource limits for having them running all the time with near zero impact. Find My has comparable impact.

2 comments

That would be the full process but once you've done this once couldn't you just pickup where you left off and just update new entries?
fascinating thank you. The Find My analogy is thought provoking - a background service that creates a useful network. What does the light client world look like once complete, I wonder