grogers

5 ms·

1.
by grogers 9d ago
I was always confused about why charities did this type of matching gifts, it always seemed a bit odd just to trick people to giving right now and not whenever. Interesting that there's a structural reason for it, TIL, thank you
2.
by grogers 2mo ago
The budget is just another constraint that helps define the perfect solution. Sometimes quick and dirty is the perfect solution.
3.
by grogers 3mo ago
My read is that xAI built a lot of compute for their own use, but they didn't get any adoption so they are reselling the unused capacity to recoup at least some of the costs. So calling it a good bet is kind of misleading
4.
by grogers 3mo ago
It may not be slow, but this crazy complexity is probably a hint at why it can't even scroll up without jumping to the beginning of time.
5.
by grogers 4mo ago
Today is my last day at my current employer. After some time off, I'm considering several different options. I have enough saved that retirement is probably doable, although last time I took extended time off I got bored much quicker t
6.
by grogers 5mo ago
Have you tried dafny, which seems roughly comparable for your purposes? I heard some buzz about it a little while ago but I haven't been following this space closely.
7.
by grogers 5mo ago
If you are ten nested functions deep in sync code and want to call an async function you could always choose to block the thread to do it, which stops the async color from propagating up the stack. That's kind of a terrible way to do i
8.
by grogers 5mo ago
It's interesting that you mention Facebook. They have a ton of their own data centers and yet they are now also spending tens of billions on cloud. It's not that easy to build hundreds of data centers on short notice.
9.
by grogers 6mo ago
They all smear the purchases and sales from index changes, but I don't think they publish on what timescale. Most funds try to minimize tracking error. There are funds that take this to a different level. When a stock is added to the b
10.
by grogers 6mo ago
Well they also shadowed production traffic and fixed some bugs that were causing mismatching results. Not saying that stuff can't still slip through, but it's a good way to evaluate it against real data in a way you can't fro
11.
by grogers 6mo ago
In this incarnation, the only one who "wants" red to win is the first column. Every other column will choose whatever color it wants to win, subject to the rules of the game. It's a 2 step process: 1. Prepare - Collect a ma
12.
by grogers 6mo ago
The final diagram is a bit confusing, so it's worth pointing out one additional thing. It appears that R5 could vote green in column 2 and have green be agreed by a majority, even though in column 4, we are committing to blue as the va
13.
by grogers 6mo ago
Well it is hedged with the word "fancy". I think a charitable reading is to understand the problem domain. If N is always small then trying to minimize the big-O is just showing off and likely counterproductive in many ways. If N
14.
by grogers 6mo ago
Even treating the process as read only after forking is potentially fraught. What if a background thread is mutating some data structure? When it forks the data structure might be internally inconsistent because the work to finish the mutat
15.
by grogers 7mo ago
It's not your main point, but I can't help but point out that artificial diamonds ARE diamonds. Cubic zirconia is a different mineral. Usually the distinction is "natural" vs "lab grown" diamonds. When computer
16.
by grogers 7mo ago
Take a homily written by someone 2000 miles away and it will likely feel just as relevant to me. Most humans deal with similar issues.
17.
by grogers 8mo ago
If I'm not mistaken, all the pitfalls in the article have clang-tidy lints to catch
18.
by grogers 8mo ago
> You must implement a move constructor or a move assignment operator in order for std::move to do anything Bit of a nitpick, but there are sometimes other functions with overloads for rvalue references to move the contents out - think s
19.
by grogers 9mo ago
> so clearly an LLM that does math well only does so by ignoring the majority of the space it is trained on There are probably good reasons why LLMs are not the "ultimate solution", but this argument seems wrong. Humans have to
20.
by grogers 9mo ago
An often underlooked aspect of SSDs for databases is write endurance. With the wrong workload random writes can burn through your drive in months instead of years. This is the hidden gem of LSM over b-tree - low write amplification, not jus
21.
by grogers 9mo ago
LLM only fairly recently underwent a step change from "maybe someday" to actually useful now. That opened many new doors that people didn't even think were possible. Getting incrementally better at something they are already
22.
by grogers 10mo ago
Yeah, -O3 generally performs well in small benchmarks because of aggressive loop unrolling and inlining. But in large programs that face icache pressure, it can end up being slower. Sometimes -Os is even better for the same reason, but -O2
23.
by grogers 10mo ago
It'd be very hard for the compiler to enforce constant-time execution for generic code. As an example, if you wrote the naive password checking where the first byte that doesn't match returns false, is that a compiler error if it
24.
by grogers 10mo ago
Of course it depends on the situation. But I don't see how you could think that in this case, crashing is better than stale config. Crashing on a config update is usually only done if it could cause data corruption if the configs aren&
25.
by grogers 10mo ago
Instead of crashing when applying the new config, it's more common to simply ignore the new config if it cannot be applied. You keep running in the last known good state. Operators then get alerts about the failures and can diagnose an
26.
by grogers 10mo ago
It sounds like part of the problem was how the application reacted to the reverted fail over. They had to restart their service to get writes to be accepted, implying some sort of broken caching behavior where it kept trying to send queries
27.
by grogers 10mo ago
Autocommit mode is pretty handy for ad-hoc queries at least. You wouldn't want to have to remember to close the transaction since keeping a transaction open is often really bad for the DB
28.
by grogers 10mo ago
Use after free is number 8 and 9 on the lists respectively... Not like it's way down the list. And most of the things the things above it (other than out of bounds writes/reads which you addressed in another comment) are not somet
29.
by grogers 10mo ago
If a node thinks it's better suited as leader, it can always force an election immediately for the next term. Things could go badly if you're wrong though
30.
by grogers 11mo ago
Real world systems often have to deviate from the "pure" version used to run formal methods on. This could be how long you keep transaction logs for, or how long rows are tombstoned for, etc. The longer the time period, the costli

More ›