@Keano1981@ARCRaidersGame because they made the arcs stronger in the new game mode plus way less loot except for the assessors, thus people start giving up and choose to pvp instead cuz its the easier and least friction path
@disafffected@nxt888 okay, please enlighten me. for example, link any article published on a journal he wrote that doesn’t sound like this slop, any serious work tbh, whether theyre in academic or not.
@HSVSphere@Flinpleis i too have been thinking about this lately. does AGI require some kind of basis or sufficiently small enough subset of universal grammar or knowledge in order for it to be capable of doing any task.
This AI hype bubble (#4 in my lifetime) will burst, but when it does, it might just leave in the crater an awareness of the Curry-Howard Correspondence those of us in software have been unsuccessful in advancing for 40 years.
sent this to the team today
everything great comes from being able to delay gratification for as long as possible
and it feels like we're collectively losing our ability to do that
yea, if your system can’t recover from concurrency bugs/data inconsistency, no locks will save you.
concurrency should be used as a mechanism to speed up your system while maintaining correctness, rather than influence or even destroy correctness itself.
“Use Redis as a global lock. Done.”
This line has been responsible for races that only reproduce once a month under peak load, right when no logs are at the right level…
The magic keyword is Lease, not Lock.
In a distributed world, you must assume:
processes crash
clocks drift
network partitions happen
A “lock” you think you hold may already be considered expired by someone else.
A trap:
Service acquires a Redis lock to become “the leader” doing some periodic job.
GC pause or network blip happens.
Lock expires; another instance acquires it.
Now two leaders run the same “single” job at once.
A seasoned engineer designs for clock skew and failure modes:
Locks have short TTLs.
The holder frequently renews them.
Critical operations are designed to be idempotent or detect concurrent ownership (version checks, fencing tokens).
So, the real design question isn’t: “How do I make sure only one instance runs this code?”
It’s:
“If two instances run this code at the same time anyway, what’s the blast radius?”
If the answer is “disaster,” you need more than a naive distributed lock.
@lauriewired this has also been a thing in the HPC crowd for a long time. it’s not just tiered volatile memory, non-volatile storage gets tiered with the new memory technologies too so we have both fast access and cheap data storage.
@sciad@HSVSphere python is good only if you know what ur doing. i worked at a place where they wrap a http framework such that it blocks the whole application for the duration of a single request lmao