Was literally needing this earlier today for White Noise. Can wait to have a look tomorrow!!
Login to reply
Replies (3)
If anything let us know!
For WN specifically you could do a number of cool things without having to reinvent the wheel or having to manage graph databases.
Whenever a user receives a message request, you can call Verify Reputation with "source" the user key, and "target" the requester key.
This will return a rank of the requester as well as the top followers of the requester (similar to primal top followers on profiles).
You can then present the information to the user, and if certain criteria are met you can automatically hide the request (e.g. the rank of the target is very low).
Also, when a user is searching another one to send a DM, you could improve the search by name by using SortAuthors.
Imagine you are searching "Fiatjaf", and your DB returns 420 profiles. You can then sort these very effectively using their reputations, and then paginate the results.
What would be the most convenient way to deliver WoT scores for your purposes? There are two proposals I know of: NIP-85 Trusted Assertions and WoT related DVMs. Right now Trusted Assertion data is available from two sources that I know of, me and @brugeman. Would be great to get your feedback at the relevant PR discussions linked below.
Trusted Assertions:
WoT DVMs:

GitHub
nips/85.md at user-summaries · vitorpamplona/nips
Nostr Implementation Possibilities. Contribute to vitorpamplona/nips development by creating an account on GitHub.
GitHub
Trusted Assertions by vitorpamplona · Pull Request #1534 · nostr-protocol/nips
Certain calculations in Nostr require access to the entire dataset of events and are impossible to do directly by Clients. This PR offers a simple ...
GitHub
Web of trust related DVMs by franzaps · Pull Request #38 · nostr-protocol/data-vending-machines
We have been working on a few different web of trust services that, as of now, are fully operational.
We are starting with this draft spec and woul...