thanks for the provocation though, i'm going to do something i meant to do for ages, which is to apply maximum possible compression to follow/mute list storage, by creating an npub index with a monotonic counter value, then i could add a profile/follow/mute list spider that just gathers as many of these as it can find during the spider runs... commonly follow lists in particular are in the hundreds of kilobytes in size, with this optimization i can squash that down like tens of kilobytes per user, and thus store ten times as much of such events
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
No replies yet.