in a situation where someone new joins the network/relay, won't they have to verify a lot of signatures of past events?
shouldnt this make it very computationally intensive to trustlessly join a relay when the network scales up?
in a situation where someone new joins the network/relay, won't they have to verify a lot of signatures of past events?
shouldnt this make it very computationally intensive to trustlessly join a relay when the network scales up?
Nostr 2.0 solves each problem. π
Content addressing solves the content duplication problem: https://proto.school/content-addressing/
While on-chain merkle roots let users verify huge collections of posts all at once, without needing to examine the signature of every single post. Both will be explained in our documentation with the Nostr GitHub code.
Imagine the compute burden for a relay tooβ¦ verifying all those posts requires a lot of processing power. In this context β Nostr 2.0 will save computational resources for both the user and the relay.