Viewing profile — vitus
vitus
HN member- Joined
- Thu, Jun 23, 2011, 9:15 PM UTC
- HN karma
- 2,580
- Public activity
- 913 items
- HN profile
- View on Hacker News ↗
About vitus
No profile information was provided.
Recent public activity
-
comment
Comment #48707242
IIRC the block was on archive.today's side as a protest against 1.1.1.1 intentionally not supporting ECS. https://news.ycombinator.com/item?id=36971650 https://news.ycombinator.com…
-
comment
Comment #48506540
Best I can tell, it's originally from Heguanzi: https://ctext.org/he-guan-zi/shi-xian
-
comment
Comment #48420340
I have evidence that it's not AI. It's just a regex. https://github.com/elijah-potter/blog/blob/master/pages/hnsa...
-
comment
Comment #48217411
Shockley? The guy whose employees hated him so much they went and founded a rival company which then gave rise to Silicon Valley? https://en.wikipedia.org/wiki/Traitorous_eight
-
comment
Comment #47954816
Hilariously, "os as g" adds one more byte than it saves, since os is only used 4 times but the alias takes 5 extra bytes to save 4. And "socket as s" comes out even. If you wanted …
-
comment
Comment #47906738
Agreed. That said, FDIC would have not been able to cover all $150 billion or so of uninsured SVB deposits directly from the insurance fund, so had that been the only available opt…
-
comment
Comment #47906615
Indeed; most personal banking customers can fall back on FDIC insurance ($250k should be more than enough to cover your emergency fund). This isn't the 1920s.
-
comment
Comment #47723831
> I didn’t know about the term happy eyeball to signify that all requests fire at the same time. It's not quite the same. Usually with Happy Eyeballs, you want to try multiple prot…
-
comment
Comment #47716090
> magic eyeballs https://en.wikipedia.org/wiki/Happy_Eyeballs is the usual name. It's not quite identical, since you often want to give your preferred transport a nominal headstart…
-
comment
Comment #47716030
This is approximately the section in the video titled "Memory controllers hate you" ( https://www.youtube.com/watch?v=KKbgulTp3FE&t=1399s ), combined with the following section. Th…
-
comment
Comment #47501367
Eh. It depends what your bottleneck is. If the bottleneck is now, say, CPU cache contention because you've doubled your thread count, it's entirely possible that FL1 running on the…
-
comment
Comment #47476506
It depends what dates you're looking at, but energy (gas prices and more) and food (including eggs) are generally recognized as way more volatile than the rest of the CPI. Eggs wer…
-
comment
Comment #47460960
> Kaeshibashi The preference is to use a separate pair of communal chopsticks that is not used directly for eating. > Kosuribashi I have heard that this one is because it's conside…
-
comment
Comment #47389842
Agreed on all those fronts. I'm just dismayed by all the comments suggesting that maintainers just merged PRs with this trojan, when the attack vector implies a more mundane form o…
-
comment
Comment #47389296
Looks like the repo owner force-pushed a bad commit to replace an existing one. But then, why not forge it to maintain the existing timestamp + author, e.g. via `git commit --amend…
-
comment
Comment #47300638
> if indeed he went all-in on AI in 2015, that seems to me like a damn near prophetic vision. Also note that 7 years later, when ChatGPT came out, built on top of Google Brain rese…
-
comment
Comment #47198707
> That’s PCIe 3.0 x4 or PCIe 4.0 x2, which a decent commodity M.2 NVMe SSD can use and can possibly saturate, at least for reads. Given that there's a separate item for sequential …
-
comment
Comment #47196505
Well, it shouldn't be slower than "Read 1,000,000 bytes sequentially from memory" (741ns) which in turn shouldn't be slower than "Read 1,000,000 bytes sequentially from disk" (359 …
-
comment
Comment #46837588
You probably meant to say oversubscribing, not overprovisioning. Oversubscription is expected to a certain degree (this is fundamentally the same concept as "statistical multiplexi…
-
comment
Comment #46410456
We do; most people don't just write eBPF by hand. https://github.com/llvm/llvm-project/tree/main/llvm/lib/Targ...
- comment
-
comment
Comment #46377546
std::ignore's behavior outside of use with std::tie is not specified in any finalized standard. https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2023/p29... aims to address that…
-
comment
Comment #46296706
> This is incorrect, the correct strategy is mostly to check the most probable match (the exception being if the people in that match has less possible pairings remaining than the …
-
comment
Comment #46287824
So, for 10 pairs, 45 guesses (9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1) in the worst case, and roughly half that on average? It's interesting how close 22.5 is to the 21.8 bits of entropy…
-
comment
Comment #46287409
It should be easier to understand the optimal truth booth strategy. Since this is a yes/no type of question, the maximum entropy is 1 bit, as noted by yourself and others. As such,…