yeah, that would be cool to have a specialised relay that just spiders the network constantly and only stores some small set of event kinds like this (wolud make sense to put profiles, follows and mutes, at least in one bundle) - then you literally can just have high confidence just from one query on it and done
I understand. Maybe it would make sense to build a DVM for this that charges for said query, and potentially caches some of the stuff? Or a DVM for arbitrary queries of one's social graph? Do we have a query language for this?
CC nostr:nprofile1qqsfnw64j8y3zesqlpz3qlf3lx6eutmu0cy6rluq96z0r4pa54tu5eqpz9mhxue69uhkummnw3ezuamfdejj7q6hdgd nostr:nprofile1qqszv6q4uryjzr06xfxxew34wwc5hmjfmfpqn229d72gfegsdn2q3fgprdmhxue69uhhxct5v4kxc6t5v5hxs7njvscngwfwvdhk6qgkwaehxw309a5kucn00qhxummnw3ezuamfdejsz9nhwden5te0wfjkccte9cc8scmgv96zucm0d57awgv0
Discussion
and yeah, such a relay you probably would want to devise an npub compression scheme where it flattens the lists down by using a monotonic index number for each pubkey instead of storing them over and over and over again, and uses a variable length encoding so the actual size of follow events it stores is tiny
sounds like a fun project but it would take me a week or two to do it in parallel with my main paid gig