Okay, we've all seen decentralized social media sites that suffer from a common problem: rapid elevation of a few posts due to a phenomenon caused by ordering content deterministically by highest rank (forming a positive feedback loop where the most popular items keep getting visibility and voted-on more than others) or due to screen size and "first post" phenomenon.
The solution is to use a non-arbitrary probabilistic ordering algorithm. This algorithm is shown on WardsWiki at ProbabilisticChooser for anyone who wants to use it for non-commercial applications.
Let me know if you use it! Cheers,
(Also, please vote me up and get me out of this [Observer] hell!)