I found this link aggregator that someone made for a personal project and they had an exciting idea for a sorting algorithm whose basic principle is the following:
- Upvotes show you more links from other people who have upvoted that content
- Downvotes show you fewer links from other people who have upvoted that content
I thought the idea was interesting and wondered if something similar could be implemented in the fediverse.
They currently don’t have plans of open-sourcing their work which is fine but I think it shouldn’t be too hard to try and replicate something similar here right?
They have the option to try this out in guest mode where you don’t have to sign in, but it seems to be giving me relevant content after upvoting only 3 times.
There is more information on their website if you guys are interested.
Edit: Changed title to something more informative.
Probably, we’d need to analyze the statistics for a good overview. However, just upvoting one super popular post once would cause a huge spike in graph growth across the board. Malicious users could also mass upvote to take down other servers, by generating random usernames and upvoting every post from as many accounts as possible.
Even with reduced storage requirements, the processing power required to keep this graph up to date would be quite significant. I don’t think it’s feasible for servers larger than the “private server for me and my friends” type that usually have some leftover CPU resources.