cadekat

joined 2 years ago
[–] [email protected] 23 points 8 months ago

Sunny with a zero percent chance of an original joke.

[–] [email protected] 7 points 8 months ago

3.5e just had some much room to explore. Yeah, some parts sucked or didn't make sense, but I think that really led to some interesting characters and fun moments in games. I haven't played 5e much precisely because it's so smooth in comparison.

[–] [email protected] 10 points 8 months ago (1 children)

Eh, it's also much easier to slap a client-side detector on because you can use generic detection methods. When you're doing it server-side, you have to rely a lot on statistical analysis and it's all game specific.

In the end you can, of course, reduce it all to not shelling out money, but there is some nuance too.

[–] [email protected] 2 points 8 months ago

It's FOSS. It's pretty normal for it to be a passion project or a community effort.

[–] [email protected] 18 points 8 months ago (1 children)

We are not on tiktok.

[–] [email protected] 1 points 8 months ago

FreeCAD is an option, but it's a bit of a mess. Does the job though!

[–] [email protected] 4 points 8 months ago (3 children)

It's almost like we need more axes to describe political views than just left and right.

[–] [email protected] 3 points 8 months ago (1 children)

Let me preface this by saying I don't see the value of 99% of NFTs either, but it is technically possible to make one that stores the image on the blockchain or on IPFS. Most don't, obviously, but it is possible.

[–] [email protected] 2 points 8 months ago* (last edited 8 months ago)

I am aware. What processing is only possible in the cloud, and not locally?

Edit: My apologies, I didn't realize you weren't the same person I originally replied to. Please disregard!

[–] [email protected] 3 points 8 months ago (3 children)

Until homeomorphic encryption becomes a thing, cloud can't be secure or private.

Why do you need homeomorphic encryption? Isn't client-side encryption good enough for most use cases?

[–] [email protected] 8 points 8 months ago* (last edited 8 months ago)

This looks like O(n), because you don't include constants when calculating Big-O. It's still ~26 times slower than the implementation without the inner loop.

~~This looks like O(n^2) because of the sub.~~

I was right the first time. sub is "substring" and not "substitute".

view more: ‹ prev next ›