Yes, but they may not be singling out Bitwarden as not being open source. It’s likely just that they use Vaultwarden as it’s more lightweight. Also Vaultwarden is only self-hosted, so you can be sure what code is running on the server, whereas Bitwarden has a hosted option. I’d imagine there’s a way to tell but from my understanding, you just have to trust that they run the code they say they are running.
I use the names of chemical elements, but with two twists: I assign them in the order in which they appear in the song “The Elements” by Tom Lehrer, and I use the German names. So I have (or had), among others, Wasserstoff, Sauerstoff, Stickstoff, etc …
I have disliked the direction of reddit ever since they made the new interface and removed css rules from subs. It was the first time, of many, that I saw reddit take something from the community and screw it up, all just to make the website more boring. It was especially annoying in that it removed text flairs from support and marketplace subs and forced people to come up with external systems.
They did it more often. Things like Reddit Gold were not first made by reddit, did you know? The whole API thing is just the concrete slab that pulverized the camel all the way to hell. Of all the things they took or took away, taking away the app I was using since years before they even made one was just too much. I can go from passively disliking them to actively hating them.
Plus, what ideas did they actually have that was original or good? “Hey guys, we stole Facebook’s chat”. “Hey guys, we added crypto”. The community makes bots that mediate debates, convert video format or do reminders, meanwhile reddit busies itself by ruining the Relevant option on its already bad search and then fucks off while stating “eh, you fucking degenerate nerds use site:reddit.com anyways”
No, they would not have driver issues “for sure”. It will work just fine most of the time and you can prepare the ssd for hardware that has problens withnlinux in general like some wireless chipsets.
Well that’s my point. Like if you take a completely unprepared desktop install you’ll likely run into issues with things like wireless chipsets, Nvidia graphics, etc. I think using UUIDs in /etc/fstab is the default nearly universally now, but if not or if OP changes it manually they could run into boot issues with that. Also grub.cfg for similar reasons.
Also have to consider EFI vs Legacy, secure boot, etc.
Yes, using uuid is mandatory for that setup. Nvidia driver is only necessary if you want to use the hardware acceleration features, the basic display functions will work. And nothing forces you to not install intel, nvidia and amd drivers. You could also install the most common wireless drivers, if you know that you will use computers which rely on wifi for network connectivity and want to use the internet, which you don’t want in general.
Efi vs mbr and secure boot are also issues for persistent live sticks.
My experience with reddit is that users have always hated reddit, 13 years ago it was the same thing. We all bashed reddit constantly. My experience was that we only used reddit because there was nothing better.
The SNES FF games (FFs 4, 5, and 6) are all great, and the recent “Pixel Remaster” releases have brought them to current systems. If you can appreciate old school sprite graphics, start here!
To summarize it for people that don’t feel like clicking the link, it essentially takes the log of the post score and then divides it by an exponential function of the time since the post was published.
After a day or so, the curve flattens out. This probably explains why we keep seeing posts that are months old in “hot” - if not enough new material is being posted, after the first few pages of “hot”, posts that are 5 days old and 5 months old are essentially the same due to the exponential decay function that was chosen.
That page gives this equation:
<pre style="background-color:#ffffff;">
<span style="color:#323232;">Rank = ScaleFactor * log(Max(1, 3 + Score)) / (Time + 2)^Gravity
</span><span style="color:#323232;">
</span><span style="color:#323232;">Score = Upvotes - Downvotes
</span><span style="color:#323232;">Time = time since submission (in hours)
</span><span style="color:#323232;">Gravity = Decay gravity, 1.8 is default
</span>
My guess is that the “gravity” parameter is the issue at the moment. Something is needed to make the decay less steep, so that really old posts aren’t making it up to the top of the feed.
There might be some way of tuning the gravity parameter dynamically based on how much content is being submitted, perhaps aiming for something like “the average age of the first 200 posts should be 10 days” (I made those numbers up, but the basic idea would be that the time decay should be steeper when lots of content is submitted and less steep when content is infrequent?)
thanks for the explanation! I wonder whether it is possible, or rather scalable, if users can pick their own parameters, even define their own functions. Is this calculated and cached at the server side or user side?
So who can change the algorithm? Is it up to the admins of each instance (lemmy.world in my case) to change the numbers? There’s not a centralized formula that each instance refers to is there?
Technically every admin could change it by making the change to the code and recompiling it. Practically it's just code contributors to lemmy development.
Maybe you want a more neutral and stable metrics for a dynamic measure of the gravity? Otherwise you can flood Lemmy with new posts to bury something.
Maybe something related to the average number of active users over the past 30 days over the topics you are looking at, which is harder to alter. But regardless, the steepness is definitely an issue as it should change with the number of posts.
Yeah - agreed. I don’t know the best solution. The other issue is whether the algorithm is being applied to all feeds and communities in the same way. The experience will be quite different if browsing all on a highly federated, high activity instance, compared to just looking at your subscriptions or browsing a lower-activity single community. Maybe the answer is just in general to decrease the steepness of the curve.
After all of this, I will amend my response to say that I think that there must be something going wrong with the algorithm. Consider these two consecutive posts on my “hot” feed:
The anti-vax nonsense from two years ago was appropriately downvoted to hell. The post right underneath it is one year old and has a post score of +13. Based on the equation above, the lower post must have a higher rank than the anti-vax post, as it should have both a higher numerator and a lower denominator.
Time for a review of the source code? Or am I missing something? Do other people see this phenomenon? No older, lower-scored post should be above a newer and higher-scored post in your feed, I think.
Yeah - though I had thought that still the one should be higher than the other, even if the numbers are small. In the actual equation, this would be multiplied by a scaling factor of 10000, though. (See the code discussion in the other comments). Though, in this case, the rank would still be very close to zero.
What I had missed is that, in the actual code, the equation is wrapped in floor() and returns an integer. So both are treated as rank = 0 and maybe randomly sorted.
The question is why are rank 0 posts showing up at all? In my other comment, if you do the math, I think that it should take quite a bit of time for any post with an appreciable score to decay to a rank of zero. Yet we see that these sorts of old posts are appearing relatively high in the hot feed.
One possible answer was suggested in another comment – it may have to do with how often the scores are recalculated for older posts, and if some have not decayed to zero by the time that the score recalculation stops, they might persist with a non zero score until the instance is restarted. I’m still not sure that that is the right answer, however, because I am guessing that instances like lemmy.world (which I am using) have been restarted recently with the various hacking attempts?
Didn’t knew the value of the scaling factor, but supposed it didn’t mattered a lot when the denominator of the division is in the 10^(-8) range.
Another problem in my opinion is in the log(max(1,3+score)), anything with a score of -2 or less send the max function to 1, the log(1) to 0 and the whole score to 0, so the distributions of post with score 0 should be gigantic without discrimination of a controversial - something score post against something with a score of - thousands. Also, some malicious agent can just use 3 bots to totally fuck all the post on new.
And this is a great thing about open source software
Want to know how something works? Want to know the implications of something, or whether it is artificially manipulated? You can go directly to the code.
How does the algorithm work for other software, and is it authentic and not manipulated for other gains? Nobody knows except them, and bad stuff can be hidden away.
It seems to me that the issue might be that the function returns an integer. If the scaling factor is inadequately large, then floor() would return zero for tons of posts (any post where the equation inside floor() evaluates to less than one). All of those posts would have equivalent ranks. This could explain why we start seeing randomly sorted old posts after a certain score threshold. Maybe better not to round here or dramatically increase the scaling factor?
I’m not sure what the units of the post age would be in here, though. Probably hours based on the division by 3600? And is log() the natural log or base 10 by default?
In any case, something still must be going wrong. If I’m doing the math correctly, a post with a score of +25 should take approximately 203 hours (assuming log base 10) before it reaches a raw rank score of < 1 and gets floored to zero, joining all of the really old posts. So we should be seeing all posts from the last 8.5 days that had +25 scores before we see any of these really old posts… But that isn’t what’s happening.
Just curious, is this something that admins of individual instances could adjust for themselves? I could see some specialized instances being able to make use of a customized sorting algorithm for this.
If this is something that admins can adjust, does that impact anything with that content shared to or accessed from any federated instances?
I don’t think any of the algorithm is expose to other instances so that wouldn’t impact the communication between instances. At the end of the day this is open source so admins can freely build a forked version of Lemmy with a slightly different algorithm.
Start with XVI. There’s a lot of buzz/conversation around it. I find that it’s such a great collective experience for movies and games when everyone is talking about it.
Then check out a game that interests you. All of the numbered games will be all inclusive. X and XII are my top suggestions, and very different from one another.
Some of the others are mildly related like Stranger of Paradise.
Classic arch Linux is the way to go imo. If you need something a little more turn key, I would go with linux mint Debian edition! Debian was the first distro I ever used, an I think if you feel at home there, linux mint Debian edition might be what you’re looking for.
I used 1Pass and really enjoyed the native app for a while until they forced everyone to a monthly subscription. Then they moved to electron for the MacOS app and I dropped them. Bitwarden has everything that 1Pass did for me and it’s free. The only thing that Bitwarden lacks is CoreUI animations and fluid transitions (everything is instant when you click it).
kbin.life
Active