Live data from Hacker News

Viewing profile — _urga

_urga

HN member
Joined
Fri, Dec 26, 2025, 11:21 AM UTC
HN karma
1
Public activity
1,106 items

About _urga

No profile information was provided.

Recent public activity

  1. story
  2. comment
    Comment #25572498

    "How can we be sure that our radar sensor does not trigger an unintentional break due to a plastic bag blowing in the wind? We collect 10000h of real world driving evidence." 10,00…

  3. comment
    Comment #25468919

    A few ideas: 1. Add "abstract" to your search query to surface papers. 2. Search for "... reading list". For example, Heidi Howard maintains https://github.com/heidihoward/distribu…

  4. comment
    Comment #25468642

    Here are some ways to learn deeply and be relevant: 1. Pick a data structure (such as a hash table or LSM-Tree) then read all the literature there is to read, every single paper th…

  5. comment
    Comment #25468392

    Thanks for the pointer to “A Rose for Ecclesiastes”.

  6. comment
    Comment #25465222

    I think this comes down to realizing that everything in life is eventually hard. Provided you're doing something worthwhile [1], when the going gets hard, don't look for easier pas…

  7. comment
    Comment #25443547

    "just cranking out variations of that formula as papers." You'd be surprised how often variations on a formula are all it takes to destroy security. Security is enumeration at the …

  8. comment
    Comment #25418990

    And above all, simplify, even the charts. Make the big idea clear.

  9. comment
    Comment #25416186

    As someone who loves C, Zig has replaced C for me and I don't plan to go back. There are just too many benefits, not least developer velocity and readability. Zig is also very appr…

  10. comment
    Comment #25415991

    In the general sense, no, not yet, of course, but in one sense, Zig is probably more production ready than Rust, for example on embedded systems with obscure architectures where OO…

  11. comment
    Comment #25360365

    No worries, I've made the same mistake and everyone in software security probably makes that mistake at some point.

  12. comment
    Comment #25357152

    The malicious actor would simply edit the install script to comment out the checksum verification step, since they already own the script.

  13. comment
    Comment #25342640

    Yes, just to add: Raft is essentially Multi-Paxos under the hood, with some overstrict invariants that can impact availability and latency. If you need a consensus algorithm, then …

  14. comment
    Comment #25325754

    I would say quality is undervalued when it comes to technology. Technology suffers from a plague of bloat, and it's getting worse as high level languages pile on the dependencies a…

  15. comment
    Comment #25324671

    I don't think it's a question of "boring" or "proven" vs "latest" or "newer". It's not even an 80/20 split between "use proven technology" and "explore new tools". What it all come…

  16. comment
    Comment #25245723

    Is there any syscall to do the equivalent but from C? e.g. If you were pre-allocating hash tables for a caching service, it would be convenient if the config could stipulate 80% of…

  17. comment
    Comment #25226352

    Another example, Zig landed io_uring in the std lib a month ago: https://github.com/ziglang/zig/pull/6356 I'm also really excited by how you can use io_uring to power everything (f…

  18. story
  19. comment
    Comment #25222584

    Beats me!

  20. comment
    Comment #25222562

    Cool! I had a similar empirical experience working on a Cauchy Reed-Solomon encoder awhile back, which is essentially measuring xor speed, but I just couldn't get it past 6 GiB/s p…

  21. comment
    Comment #25222516

    The page cache is not reliable, and actually does more bad than good, especially in the case of PostgreSQL: https://www.usenix.org/conference/atc20/presentation/rebello

  22. comment
    Comment #25222481

    Sure, I'm still pretty fuzzy on these things, but queueing delay is Little's law: https://en.wikipedia.org/wiki/Little's_law It means if a system can only do X of something per sec…

  23. comment
    Comment #25221968

    The advertised bandwidth for RAM is not actually what you get per-core, which is what you care about in practice. If you want to know the upper bound on your per-core RAM bandwidth…

  24. comment
    Comment #25170940

    "Are sector writes atomic? And if so, for what size sectors?" For a database, this is not the question you want to be asking. It's a rabbit hole. The right answer (which is not alw…

  25. story