||3 years ago|
|server||3 years ago|
|.dockerignore||3 years ago|
|.travis.yml||3 years ago|
|API.md||3 years ago|
|Dockerfile||3 years ago|
|LICENSE||3 years ago|
|README.md||3 years ago|
|docker-compose.yml||3 years ago|
We have a twitter alternative (mastodon), a facebook alternative (friendica), so let's build a reddit alternative in the fediverse.
- Come up with a name / codename.
- Must have communities.
- Must have threaded comments.
- Must be federated: liking and following communities across instances.
- Be live-updating: have a right pane for new comments, and a main pain for the full threaded view.
- Use websockets for post / gets to your own instance.
- How does voting work? Should we go back to the old way of showing up and downvote counts? Or just a score?
- Decide on tech to be used
- Backend: Actix, Diesel.
- Frontend: inferno, typescript and bootstrap for now.
- Should it allow bots?
- Should the comments / votes be static, or feel like a chat, like flowchat?.
- Two pane model - Right pane is live comments, left pane is live tree view.
- On mobile, allow you to switch between them. Default?
Resources / Potential Libraries
- Use the activitypub crate.
- Activitypub vocab.
- Activitypub main
- Diesel to Postgres data types
- helpful diesel examples
- Mastodan public key server example
- Recursive query for adjacency list for nested comments
- Sticky Sidebar
- RXJS websocket
- Rust JWT
- Hot sorting discussion 2
- Classification types.
- Followers / following
Trending / Hot / Best Sorting algorithm
- During the day, new posts and comments should be near the top, so they can be voted on.
- After a day or so, the time factor should go away.
- Use a log scale, since votes tend to snowball, and so the first 10 votes are just as important as the next hundred.
Reddit's comment sorting algorithm, the wilson confidence sort, is inadequate, because it completely ignores time. What ends up happening, especially in smaller subreddits, is that the early comments end up getting upvoted, and newer comments stay at the bottom, never to be seen.
Hacker News Sorting
The Hacker New's ranking algorithm is great, but it doesn't use a log scale for the scores.
Rank = ScaleFactor * sign(Score) * log(1 + abs(Score)) / (Time + 2)^Gravity Score = Upvotes - Downvotes Time = time since submission (in hours) Gravity = Decay gravity, 1.8 is default
- Add 1 to the score, so that the standard new comment score of +1 will be affected by time decay. Otherwise all new comments would stay at zero, near the bottom.
- The sign and abs of the score are necessary for dealing with the log of negative scores.
- A scale factor of 10k gets the rank in integer form.
A plot of rank over 24 hours, of scores of 1, 5, 10, 100, 1000, with a scale factor of 10k.