nostr:npub1kpt95rv4q3mcz8e4lamwtxq7men6jprf49l7asfac9lnv2gda0lqdknhmz would you be interested in providing an http endpoint that can query the entire social graph as related to an 'observer'? IE a list of keys that have a certain rank. It's usually a very large list (100,000 pubkeys) is why DVM cannot fit it into an event... Or do you have some kind of DVM pagination that could do it with many DVM requests?
sorry I missed this message.
At the moment we don't offer this functionality, but we have RankProfiles, where you can request the rank of up to 1000 pubkeys in a single call.
https://vertexlab.io/docs/services/rank-profiles/
A similar idea would be to return a bitset containing all pubkeys whose rank is higher than a threshold according to an observer/source (for example using sort=personalizedPagerank and source=your npub).
What is the usecase that u have in mind?
My usecase is to prevent spam on relays. The relay would query for a large set of pubkeys and use it for whitelisting. I've been finding that any keys above a (usually low score threshold) helps deter spam and scams. 1000 isn't enough.. I've been using lists of ~100,000.
Are you using something like? https://github.com/mmalmi/nostr-social-graph
Using https://github.com/Pretty-Good-Freedom-Tech/brainstorm. It's a bit better than the follows of follows methods.
